Fetching the paper…
Reading the bibliography…
In this paper we consider the cluster estimation problem under the Stochastic Block Model.
Résumé de la théorie métrique des produits tensoriels topologiques
Alexander Grothendieck · 1953
Earlier work this paper cites.
Absolutely summing operators in L p L_{p} -spaces and their applications
Joram Lindenstrauss and Aleksander Pełczyński · 1968
Earlier work this paper cites.
Stochastic blockmodels: Some first steps
Paul W. Holland, Kathryn B. Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Algorithmic theory of random graphs
Alan Frieze and Colin McDiarmid · 1997
Earlier work this paper cites.
A constant-factor approximation algorithm for the k-median problem
Moses Charikar, Sudipto Guha, Éva Tardos, and David B. Shmoys · 1999
Earlier work this paper cites.
Heuristics for semirandom graph problems
Uriel Feige and Joe Kilian · 2001
Earlier work this paper cites.
Max cut for random graphs with a planted partition
Béla Bollobás and Alex D. Scott · 2004
Earlier work this paper cites.
Coloring semirandom graphs optimally
Amin Coja-Oghlan · 2004
Earlier work this paper cites.
Semirandom models as benchmarks for coloring algorithms
Michael Krivelevich and Dan Vilenchik · 2006
Earlier work this paper cites.
Matrix completion from a few entries
Raghunandan H. Keshavan, Sewoong Oh, and Andrea Montanari · 2009
Earlier work this paper cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Earlier work this paper cites.
Finding dense clusters via "low rank+ sparse" decomposition
Samet Oymak and Babak Hassibi · 2011
Earlier work this paper cites.
Clustering sparse graphs
Yudong Chen, Sujay Sanghavi, and Huan Xu · 2012
Earlier work this paper cites.
Community detection in the labelled stochastic block model
Simon Heimlicher, Marc Lelarge, and Laurent Massoulié · 2012
Earlier work this paper cites.
Stochastic block models and reconstruction
Elchanan Mossel, Joe Neeman, and Allan Sly · 2012
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Earlier work this paper cites.
Concentration inequalities: A nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Earlier work this paper cites.
A proof of the block model threshold conjecture
Elchanan Mossel, Joe Neeman, and Allan Sly · 2013
Earlier work this paper cites.
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery
Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, and Amit Singer · 2014
Earlier work this paper cites.
Guaranteed clustering and biclustering via semidefinite programming
Brendan P. W. Ames · 2014
Cited alongside, same era.
Convex optimization for the planted k-disjoint-clique problem
Brendan P. W. Ames and Stephen A. Vavasis · 2014
Cited alongside, same era.
On semidefinite relaxations for the block model
Arash A. Amini and Elizaveta Levina · 2014
Cited alongside, same era.
Improved graph clustering
Yudong Chen, Sujay Sanghavi, and Huan Xu · 2014
Cited alongside, same era.
Community detection thresholds and the weak Ramanujan property
Laurent Massoulié · 2014
Cited alongside, same era.
Accurate community detection in the stochastic block model via spectral algorithms
18.s997: High dimensional statistics
Philippe Rigollet · 2015
Later among the works it cites.
Spectral detection in the censored block model
Alaa Saade, Marc Lelarge, Florent Krzakala, and Lenka Zdeborová · 2015
Later among the works it cites.
Exact recovery in the stochastic block model
Emmanuel Abbe, Afonso S. Bandeira, and Georgina Hall · 2016
Later among the works it cites.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
Afonso S. Bandeira and Ramon van Handel · 2016
Later among the works it cites.
Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
Yudong Chen and Jiaming Xu · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Se-Young Yun and Alexandre Proutiere · 2014
Cited alongside, same era.
Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
Recovering communities in the general stochastic block model without knowing the parameters
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
Multisection in the stochastic block model using semidefinite programming
Naman Agarwal, Afonso S. Bandeira, Konstantinos Koiliaris, and Alexandra Kolla · 2015
Cited alongside, same era.
Random Laplacian matrices and convex relaxations
Afonso S. Bandeira · 2015
Cited alongside, same era.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T. Tony Cai and Xiaodong Li · 2015
Cited alongside, same era.
Chao Gao, Zongming Ma, Anderson Y. Zhang, and Harrison H. Zhou · 2016
Later among the works it cites.
Community detection in sparse networks via Grothendieck’s inequality
Olivier Guédon and Roman Vershynin · 2016
Later among the works it cites.
Achieving exact cluster recovery threshold via semidefinite programming
Bruce Hajek, Yihong Wu, and Jiaming Xu · 2016
Later among the works it cites.
Phase transitions in semidefinite relaxations
Adel Javanmard, Andrea Montanari, and Federico Ricci-Tersenghi · 2016
Later among the works it cites.
Statistical and computational guarantees of Lloyd’s algorithm and its variants
Yu Lu and Harrison H. Zhou · 2016
Later among the works it cites.
Learning communities in the presence of errors
Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan · 2016
Later among the works it cites.
How robust are reconstruction thresholds for community detection?
Ankur Moitra, William Perry, and Alexander S. Wein · 2016
Later among the works it cites.
Semidefinite programs on sparse random graphs and their application to community detection
Andrea Montanari and Subhabrata Sen · 2016
Later among the works it cites.
Consistency thresholds for the planted bisection model
Elchanan Mossel, Joe Neeman, and Allan Sly · 2016
Later among the works it cites.
Performance of a community detection algorithm based on semidefinite programming
Federico Ricci-Tersenghi, Adel Javanmard, and Andrea Montanari · 2016
Later among the works it cites.
Optimal cluster recovery in the labeled stochastic block model
Se-Young Yun and Alexandre Proutiere · 2016
Later among the works it cites.
Community detection and the stochastic block model: recent developments
Emmanuel Abbe · 2017
Closest in time.
The computer science and physics of community detection: Landscapes, phase transitions, and hardness
Cristopher Moore · 2017
Closest in time.