Fetching the paper…
Reading the bibliography…
Community detection is a fundamental statistical problem in network data analysis.
On measures of entropy and information
Alfred Rényi · 1961
Earlier work this paper cites.
Evaluation of the maximum-likelihood estimator where the likelihood equation has multiple roots
VD Barnett · 1966
Earlier work this paper cites.
Théorie asymptotique de la décision statistique , volume 33
Lucien Marie Le Cam · 1969
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation. III
Chandler Davis and William Morton Kahan · 1970
Earlier work this paper cites.
One-step Huber estimates in the linear model
Peter J Bickel · 1975
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
On the second eigenvalue of random regular graphs
Joel Friedman, Jeff Kahn, and Endre Szemeredi · 1989
Earlier work this paper cites.
New spectral methods for ratio cut partitioning and clustering
Lars Hagen and Andrew B Kahng · 1992
Earlier work this paper cites.
Social Network Analysis: Methods and Applications , volume 8
Stanley Wasserman · 1994
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Community structure in social and biological networks
Michelle Girvan and Mark EJ Newman · 2002
Earlier work this paper cites.
The Probabilistic Method
Noga Alon and Joel H Spencer · 2004
Earlier work this paper cites.
A simple linear time (1+
Amit Kumar, Yogish Sabharwal, and Sandeep Sen · 2004
Earlier work this paper cites.
The political blogosphere and the 2004 US election: Divided they blog
Lada A Adamic and Natalie Glance · 2005
Earlier work this paper cites.
Spectral techniques applied to sparse random graphs
Uriel Feige and Eran Ofek · 2005
Earlier work this paper cites.
Model-based clustering for social networks
Mark S Handcock, Adrian E Raftery, and Jeremy M Tantrum · 2007
Earlier work this paper cites.
Mixture models and exploratory analysis in networks
Mark EJ Newman and Elizabeth A Leicht · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike von Luxburg · 2007
Earlier work this paper cites.
Consistency of spectral clustering
Ulrike von Luxburg, Mikhail Belkin, and Olivier Bousquet · 2008
Earlier work this paper cites.
NP-hardness of Euclidean sum-of-squares clustering
Daniel Aloise, Amit Deshpande, Pierre Hansen, and Preyas Popat · 2009
Earlier work this paper cites.
A nonparametric view of network models and Newman–Girvan and other modularities
Peter J Bickel and Aiyou Chen · 2009
Earlier work this paper cites.
Simultaneous analysis of lasso and dantzig selector
Peter J Bickel, Ya’acov Ritov, and Alexandre B Tsybakov · 2009
Earlier work this paper cites.
The planar k-means problem is NP-hard
Meena Mahajan, Prajakta Nimbhorkar, and Kasturi Varadarajan · 2009
Earlier work this paper cites.
Introduction to Nonparametric Estimation
Alexandre B Tsybakov · 2009
Earlier work this paper cites.
Optimal rates of convergence for covariance matrix estimation
T Tony Cai, Cun-Hui Zhang, and Harrison H Zhou · 2010
Cited alongside, same era.
Graph partitioning via adaptive spectral techniques
Amin Coja-Oghlan · 2010
Cited alongside, same era.
A survey of statistical network models
Anna Goldenberg, Alice X Zheng, Stephen E Fienberg, and Edoardo M Airoldi · 2010
Cited alongside, same era.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Cited alongside, same era.
Gaussian Estimation: Sequence and Wavelet Models
Iain M Johnstone · 2011
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
Brian Karrer and Mark EJ Newman · 2011
Cited alongside, same era.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T Tony Cai and Xiaodong Li · 2014
Later among the works it cites.
Phase retrieval via Wirtinger flow: Theory and algorithms
Emmanuel Candes, Xiaodong Li, and Mahdi Soltanolkotabi · 2014
Later among the works it cites.
Network cross-validation for determining the number of communities in network data
Kehui Chen and Jing Lei · 2014
Later among the works it cites.
Yudong Chen and Jiaming Xu · 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…
Spectral clustering and the high-dimensional stochastic blockmodel
Karl Rohe, Sourav Chatterjee, and Bin Yu · 2011
Cited alongside, same era.
Stochastic blockmodels with a growing number of classes
David S Choi, Patrick J Wolfe, and Edoardo M Airoldi · 2012
Cited alongside, same era.
Matrix Analysis
Roger A Horn and Charles R Johnson · 2012
Cited alongside, same era.
Stochastic block models and reconstruction
Elchanan Mossel, Joe Neeman, and Allan Sly · 2012
Cited alongside, same era.
Augmented sparse principal component analysis for high dimensional data
Debashis Paul and Iain M Johnstone · 2012
Cited alongside, same era.
A consistent adjacency spectral embedding for stochastic blockmodel graphs
Daniel L Sussman, Minh Tang, Donniell E Fishkind, and Carey E Priebe · 2012
Cited alongside, same era.
Chao Gao, Zongming Ma, and Harrison H Zhou · 2014
Later among the works it cites.
Achieving exact cluster recovery threshold via semidefinite programming
Bruce Hajek, Yihong Wu, and Jiaming Xu · 2014
Later among the works it cites.
Confidence intervals and hypothesis testing for high-dimensional regression
Adel Javanmard and Andrea Montanari · 2014
Later among the works it cites.
A goodness-of-fit test for stochastic block models
Jing Lei · 2014
Later among the works it cites.
Consistency of spectral clustering in stochastic block models
Jing Lei and Alessandro Rinaldo · 2014
Later among the works it cites.
A generic sample splitting approach for refined community recovery in stochastic block models
Jing Lei and Lingxue Zhu · 2014
Later among the works it cites.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Later among the works it cites.
Consistency thresholds for binary symmetric block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Later among the works it cites.
How many communities are there?
Diego Franco Saldana, Yi Yu, and Yang Feng · 2014
Later among the works it cites.
On asymptotically optimal confidence regions and tests for high-dimensional models
Sara van de Geer, Peter Bühlmann, Ya’acov Ritov, and Ruben Dezeure · 2014
Later among the works it cites.
A simple SVD algorithm for finding hidden partitions
Van Vu · 2014
Later among the works it cites.
Confidence intervals for low dimensional parameters in high dimensional linear models
Cun-Hui Zhang and Stephanie S Zhang · 2014
Later among the works it cites.
Emmanuel Abbe and Colin Sandon · 2015
Closest in time.
Peter Chin, Anup Rao, and Van Vu · 2015
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming: Extensions
Bruce Hajek, Yihong Wu, and Jiaming Xu · 2015
Closest in time.
Fast community detection by score
Jiashun Jin · 2015
Closest in time.
Sparse random graphs: Regularization and concentration of the Laplacian
Can M Le, Elizaveta Levina, and Roman Vershynin · 2015
Closest in time.
Likelihood-based model selection for stochastic block models
YX Wang and Peter J Bickel · 2015
Closest in time.
Minimax rates of community detection in stochastic block model
Anderson Y Zhang and Harrison H Zhou · 2015
Closest in time.