The Annals of Applied Probability

An impossibility result for reconstruction in the degree-corrected stochastic block model

Lennart Gulikers, Marc Lelarge, and Laurent Massoulié

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We consider the Degree-Corrected Stochastic Block Model (DC-SBM): a random graph on $n$ nodes, having i.i.d. weights $(\phi_{u})_{u=1}^{n}$ (possibly heavy-tailed), partitioned into $q\geq2$ asymptotically equal-sized clusters. The model parameters are two constants $a,b>0$ and the finite second moment of the weights $\Phi^{(2)}$. Vertices $u$ and $v$ are connected by an edge with probability $\frac{\phi_{u}\phi_{v}}{n}a$ when they are in the same class and with probability $\frac{\phi_{u}\phi_{v}}{n}b$ otherwise.

We prove that it is information-theoretically impossible to estimate the clusters in a way positively correlated with the true community structure when $(a-b)^{2}\Phi^{(2)}\leq q(a+b)$.

As by-products of our proof we obtain $(1)$ a precise coupling result for local neighbourhoods in DC-SBMs, that we use in Gulikers, Lelarge and Massoulié (2016) to establish a law of large numbers for local-functionals and $(2)$ that long-range interactions are weak in (power-law) DC-SBMs.

Article information

Source
Ann. Appl. Probab., Volume 28, Number 5 (2018), 3002-3027.

Dates
Received: September 2017
First available in Project Euclid: 28 August 2018

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1535443240

Digital Object Identifier
doi:10.1214/18-AAP1381

Mathematical Reviews number (MathSciNet)
MR3847979

Zentralblatt MATH identifier
06974771

Subjects
Primary: 91D30: Social networks 05C80: Random graphs [See also 60B20]
Secondary: 68W40: Analysis of algorithms [See also 68Q25] 91C20: Clustering [See also 62H30]

Keywords
Social and information networks random graphs degree-corrected stochastic block model spectral algorithm machine learning

Citation

Gulikers, Lennart; Lelarge, Marc; Massoulié, Laurent. An impossibility result for reconstruction in the degree-corrected stochastic block model. Ann. Appl. Probab. 28 (2018), no. 5, 3002--3027. doi:10.1214/18-AAP1381. https://projecteuclid.org/euclid.aoap/1535443240


Export citation

References

  • [1] Abbe, E. and Sandon, C. (2016). Detection in the stochastic block model with multiple clusters: Proof of the achievability conjectures, acyclic BP, and the information-computation gap. ArXiv Preprint ArXiv:1512.09080.
  • [2] Aiello, W., Chung, F. and Lu, L. (2001). A random graph model for power law graphs. Exp. Math. 10 53–66.
  • [3] Bollobás, B., Janson, S. and Riordan, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3–122.
  • [4] Bordenave, C., Lelarge, M. and Massoulié, L. (2015). Non-backtracking spectrum of random graphs: Community detection and non-regular Ramanujan graphs. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science—FOCS 2015 1347–1357. IEEE Computer Soc., Los Alamitos, CA.
  • [5] Chung, F., Lu, L. and Vu, V. (2004). The spectra of random graphs with given expected degrees. Internet Math. 1 257–275.
  • [6] Coja-Oghlan, A. and Lanka, A. (2008). Partitioning random graphs with general degree distributions. In Fifth IFIP International Conference on Theoretical Computer Science—TCS 2008. IFIP Int. Fed. Inf. Process. 273 127–141. Springer, New York.
  • [7] Dasgupta, A., Hopcroft, J. E. and McSherry, F. (2004). Spectral analysis of random graphs with skewed degree distributions. In Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on 602–610.
  • [8] Decelle, A., Krzakala, F., Moore, C. and Zdeborová, L. (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys. Rev. E (3) 84 066106.
  • [9] Evans, W., Kenyon, C., Peres, Y. and Schulman, L. J. (2000). Broadcasting on trees and the Ising model. Ann. Appl. Probab. 10 410–433.
  • [10] Gulikers, L., Lelarge, M. and Massoulié, L. (2016). Non-backtracking spectrum of degree-corrected stochastic block models. ArXiv Preprint ArXiv:1609.02487.
  • [11] Gulikers, L., Lelarge, M. and Massoulié, L. (2017). A spectral method for community detection in moderately sparse degree-corrected stochastic block models. Adv. in Appl. Probab. 49 686–721.
  • [12] Holland, P. W., Laskey, K. B. and Leinhardt, S. (1983). Stochastic blockmodels: First steps. Soc. Netw. 5 109–137.
  • [13] Karrer, B. and Newman, M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E (3) 83 016107, 10.
  • [14] Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L. and Zhang, P. (2013). Spectral redemption in clustering sparse networks. Proc. Natl. Acad. Sci. USA 110 20935–20940.
  • [15] Lei, J. and Rinaldo, A. (2015). Consistency of spectral clustering in stochastic block models. Ann. Statist. 43 215–237.
  • [16] Lyons, R. (1990). Random walks and percolation on trees. Ann. Probab. 18 931–958.
  • [17] Massoulié, L. (2014). Community detection thresholds and the weak Ramanujan property. In STOC’14—Proceedings of the 2014 ACM Symposium on Theory of Computing 694–703. ACM, New York.
  • [18] Mossel, E. (2004). Survey: Information flow on trees. In Graphs, Morphisms and Statistical Physics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 63 155–170. Amer. Math. Soc., Providence, RI.
  • [19] Mossel, E., Neeman, J. and Sly, A. (2013). A proof of the block model threshold conjecture. ArXiv Preprint ArXiv:1311.4115.
  • [20] Mossel, E., Neeman, J. and Sly, A. (2015). Reconstruction and estimation in the planted partition model. Probab. Theory Related Fields 162 431–461.
  • [21] Mossel, E. and Peres, Y. (2003). Information flow on trees. Ann. Appl. Probab. 13 817–844.