Fetching the paper…
Reading the bibliography…
We study the problem of learning communities in the presence of modeling errors and give robust recovery algorithms for the Stochastic Block Model (SBM).
Résumé de la théorie métrique des produits tensoriels topologiques
A. Grothendieck · 1953
Earlier work this paper cites.
Social structure from multiple networks. i. blockmodels of roles and positions
Harrison C. White, Scott A. Boorman, and Ronald L. Breiger · 1976
Earlier work this paper cites.
Sur la constante de Grothendieck
Jean-Louis Krivine · 1977
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W. Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Fast solution of some random NP-hard problems
M. E. Dyer and A. M. Frieze · 1986
Earlier work this paper cites.
Eigenvalues and graph bisection: An average-case analysis
Ravi B. Boppana · 1987
Earlier work this paper cites.
Graph bisection algorithms with good average case behavior
Thang Nguyen Bui, F. Thomson Leighton, Soma Chaudhuri, and Michael Sipser · 1987
Earlier work this paper cites.
Simulated annealing for graph bisection
Mark Jerrum and Gregory Sorkin · 1993
Earlier work this paper cites.
Coloring random and semi-random k k -colorable graphs
Avrim Blum and Joel Spencer · 1995
Earlier work this paper cites.
Go with the winners for graph bisection
Tassos Dimitriou and Russell Impagliazzo · 1998
Earlier work this paper cites.
Heuristics for finding large independent sets, with applications to coloring semi-random graphs
Uriel Feige and Joe Kilian · 1998
Earlier work this paper cites.
Concentration
Colin McDiarmid · 1998
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
Anne Condon and Richard Karp · 1999
Earlier work this paper cites.
Algorithms for facility location problems with outliers
Moses Charikar, Samir Khuller, David M. Mount, and Giri Narasimhan · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
On spectral learning of mixtures of distributions
Dimitris Achlioptas and Frank McSherry · 2005
Earlier work this paper cites.
The spectral method for general mixture models
Ravindran Kannan, Hadi Salmasian, and Santosh Vempala · 2005
Earlier work this paper cites.
A spectral heuristic for bisecting random graphs
Amin Coja-Oghlan · 2006
Cited alongside, same era.
Robust PCA and clustering in noisy mixtures
S. Charles Brubaker · 2009
Cited alongside, same era.
Partitioning graphs into balanced components
Robert Krauthgamer, Joseph Seffi Naor, and Roy Schwartz · 2009
Cited alongside, same era.
Graph partitioning via adaptive spectral techniques
Amin Coja-Oghlan · 2010
Cited alongside, same era.
Community detection in graphs
Santo Fortunato · 2010
Cited alongside, same era.
Clustering with spectral norm and the k k -means algorithm
Amit Kumar and Ravindran Kannan · 2010
Cited alongside, same era.
The Grothendieck constant is strictly smaller than Krivine’s bound
Community detection in sparse networks via Grothendieck’s inequality
Olivier Guédon and Roman Vershynin · 2014
Later among the works it cites.
Constant factor approximation for balanced cut in the random PIE model
Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan · 2014
Later among the works it cites.
Community detection thresholds and the weak Ramanujan property
Laurent Massoulié · 2014
Later among the works it cites.
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Later among the works it cites.
A simple svd algorithm for finding hidden partitions
Van Vu · 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…
M. Braverman, K. Makarychev, Y. Makarychev, and A. Naor · 2011
Cited alongside, same era.
Information theory: coding theorems for discrete memoryless systems
Imre Csiszar and János Körner · 2011
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.
Improved spectral-norm bounds for clustering
Pranjal Awasthi and Or Sheffet · 2012
Cited alongside, same era.
Clustering sparse graphs
Yudong Chen, Sujay Sanghavi, and Huan Xu · 2012
Cited alongside, same era.
Approximation algorithms for semi-random partitioning problems
Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan · 2012
Cited alongside, same era.
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms
Emmanuel Abbe and Colin Sandon · 2015
Closest in time.
Multisection in the stochastic block model using semidefinite programming
Naman Agarwal, Afonso S. Bandeira, Konstantinos Koiliaris, and Alexandra Kolla · 2015
Closest in time.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T. Tony Cai and Xiaodong Li · 2015
Closest in time.
Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery
Peter Chin, Anup Rao, and Van Vu · 2015
Closest in time.
Correlation clustering with noisy partial information
Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan · 2015
Closest in time.
How robust are reconstruction thresholds for community detection
Ankur Moitra, William Perry, and Alexander S. Wein · 2015
Closest in time.
Semidefinite programs on sparse random graphs
Andrea Montanari and Subhabrata Sen · 2015
Closest in time.
Consistency thresholds for the planted bisection model
Elchanan Mossel, Joe Neeman, and Allan Sly · 2015
Closest in time.
A semidefinite program for unbalanced multisection in the stochastic block model
William Perry and Alexander S. Wein · 2015
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model
Y. Wu, J. Xu, and B. Hajek · 2015
Closest in time.
Minimax rates of community detection in stochastic block models
Anderson Y. Zhang and Harrison H. Zhou · 2015
Closest in time.