Fetching the paper…
Reading the bibliography…
We develop an information-theoretic view of the stochastic block model, a popular statistical model for the large-scale structure of complex networks.
K. Rohe, S. Chatterjee, and B. Yu, Spectral clustering and the high-dimensional stochastic blockmodel , The Annals of Statistics 39
1915
Earlier work this paper cites.
P. W. Holland, K. Laskey, and S. Leinhardt, Stochastic blockmodels: First steps , Social Networks 5
1983
Earlier work this paper cites.
T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior , Combinatorica 7
1987
Earlier work this paper cites.
R.B. Boppana, Eigenvalues and graph bisection: An average-case analysis , In 28th Annual Symposium on Foundations of Computer Science (1987), 280–285
1987
Earlier work this paper cites.
M.E. Dyer and A.M. Frieze, The solution of some random NP-hard problems in polynomial expected time , Journal of Algorithms 10
1989
Earlier work this paper cites.
T. A. B. Snijders and K. Nowicki, Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure , Journal of Classification 14
1997
Earlier work this paper cites.
Mark Jerrum and Gregory B. Sorkin, The metropolis algorithm for graph bisection , Discrete Applied Mathematics 82
1998
Earlier work this paper cites.
A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model , Lecture Notes in Computer Science 1671
1999
Earlier work this paper cites.
W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, Broadcasting on trees and the Ising model , Ann. Appl. Probab. 10
2000
Earlier work this paper cites.
T. Carson and R. Impagliazzo, Hill-climbing finds random planted bisections , Proc. 12th Symposium on Discrete Algorithms (SODA 01), ACM press, 2001, 2001, pp. 903–909
2001
Earlier work this paper cites.
F. McSherry, Spectral partitioning of random graphs , Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, 2001, pp. 529–537
2001
Earlier work this paper cites.
Cyril Méasson, Andrea Montanari, Tom Richardson, and Rudiger Urbanke, Life above threshold: From list decoding to area theorem and mse , arXiv cs/0410028
2004
Earlier work this paper cites.
Dongning Guo, Shlomo Shamai, and Sergio Verdú, Mutual information and minimum mean-square error in gaussian channels , Information Theory, IEEE Transactions on 51
2005
Earlier work this paper cites.
Andrea Montanari and David Tse, Analysis of belief propagation for non-linear problems: The example of cdma (or: How to prove tanaka’s formula) , Information Theory Workshop, 2006. ITW’06 Punta del Este. IEEE, IEEE, 2006, pp. 160–164
2006
Earlier work this paper cites.
G. W. Anderson, A. Guionnet, and O. Zeitouni, An introduction to random matrices , Cambridge University Press, 2009
2009
Earlier work this paper cites.
P. J. Bickel and A. Chen, A nonparametric view of network models and newmanÐgirvan and other modularities , Proceedings of the National Academy of Sciences (2009)
2009
Earlier work this paper cites.
Mireille Capitaine, Catherine Donati-Martin, and Delphine Féral, The largest eigenvalues of finite rank deformation of large wigner matrices: convergence and nonuniversality of the fluctuations , The Annals of Probability 37
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, Message Passing Algorithms for Compressed Sensing , Proceedings of the National Academy of Sciences 106
2009
Earlier work this paper cites.
Cyril Méasson, Andrea Montanari, Thomas J Richardson, and Rüdiger Urbanke, The generalized area theorem and some of its consequences , Information Theory, IEEE Transactions on 55
2009
Earlier work this paper cites.
A. Coja-oghlan, Graph partitioning via adaptive spectral techniques , Comb. Probab. Comput. 19
2010
Cited alongside, same era.
Florent Benaych-Georges and Raj Rao Nadakuditi, The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices , Advances in Mathematics 227
2011
Cited alongside, same era.
M. Bayati and A. Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Trans. on Inform. Theory 57
2011
Cited alongside, same era.
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , Phys. Rev. E 84
2011
Cited alongside, same era.
Satish Babu Korada and Andrea Montanari, Applications of the lindeberg principle in communications and statistical learning , Information Theory, IEEE Transactions on 57
2014
Later among the works it cites.
Yash Deshpande and Andrea Montanari, Information-theoretically optimal sparse pca , Information Theory (ISIT), 2014 IEEE International Symposium on, IEEE, 2014, pp. 2197–2201
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Y. Chen, S. Sanghavi, and H. Xu, Clustering Sparse Graphs , arXiv:1210.3335 (2012)
2012
Cited alongside, same era.
D. S. Choi, P. J. Wolfe, and E. M. Airoldi, Stochastic blockmodels with a growing number of classes , Biometrika (2012), 1–12
2012
Cited alongside, same era.
2012
Cited alongside, same era.
E. Abbe and A. Montanari, Conditional random fields, planted constraint satisfaction and entropy concentration , Proc. of RANDOM (Berkeley), August 2013, pp. 332–346
2013
Cited alongside, same era.
Q.-X. Huang and L. Guibas, Consistent shape maps via semidefinite programming , Computer Graphics Forum 32
2013
Cited alongside, same era.
Adel Javanmard and Andrea Montanari, State evolution for general approximate message passing algorithms, with applications to spatial coupling , Information and Inference (2013), iat004
2013
Cited alongside, same era.
2013
Cited alongside, same era.
L. Massoulié, Community detection thresholds and the weak Ramanujan property , STOC 2014: 46th Annual Symposium on the Theory of Computing (New York, United States), June 2014, pp. 1–10
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
J. Xu, M. Lelarge, and L. Massoulie, Edge label inference in generalized stochastic block models: from spectral theory to impossibility results , Proceedings of COLT 2014 (2014)
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Closest in time.
A. S. Bandeira, Random laplacian matrices and convex relaxations , arXiv:1504.03987 (2015)
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
A. Montanari, Finding one community in a sparse graph , arXiv:1502.05680 (2015)
2015
Closest in time.
2015
Closest in time.
Sourav Chatterjee, A generalization of the lindeberg principle , The Annals of Probability 34
2076
Closest in time.