Fetching the paper…
Reading the bibliography…
We consider two closely related problems: planted clustering and submatrix localization.
On colouring random graphs
G. R. Grimmett and C. J. H. McDiarmid · 1975
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
The solution of some random NP-hard problems in polynomial expected time
M. E. Dyer and A. M. Frieze · 1989
Earlier work this paper cites.
Expected complexity of graph partitioning problems
L. Kučera · 1995
Earlier work this paper cites.
A spectral technique for coloring random 3-colorable graphs
N. Alon and N. Kahale · 1997
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
Hiding cliques for cryptographic security
A. Juels and M. Peinado · 2000
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and R. M. Karp · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
Correlation clustering
N. Bansal, A. Blum, and S. Chawla · 2004
Earlier work this paper cites.
Max cut for random graphs with a planted partition
B. Bollobás and A. Scott · 2004
Earlier work this paper cites.
Coloring semirandom graphs optimally
A. Coja-Oghlan · 2004
Earlier work this paper cites.
Finding and evaluating community structure in networks
M. E. J. Newman and M. Girvan · 2004
Earlier work this paper cites.
Testing k-wise and almost k-wise independence
N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, and N. Xie · 2007
Earlier work this paper cites.
Random Graph Dynamics
R. Durrett · 2007
Earlier work this paper cites.
Statistical properties of community structure in large social and information networks
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney · 2008
Earlier work this paper cites.
The probabilistic method, lecture notes
J. Matoušek and J. Vondrák · 2008
Earlier work this paper cites.
High-dimensional analysis of semidefinite relaxations for sparse principal components
A. A. Amini and M. J. Wainwright · 2009
Earlier work this paper cites.
A nonparametric view of network models and Newman–Girvan and other modularities
P. J. Bickel and A. Chen · 2009
Earlier work this paper cites.
Finding large average submatrices in high dimensional data
A. A. Shabalin, V. J. Weigman, C. M. Perou, and A. B. Nobel · 2009
Earlier work this paper cites.
Community detection in graphs
S. Fortunato · 2010
Earlier work this paper cites.
Correlation clustering with noisy input
C. Mathieu and W. Schudy · 2010
Earlier work this paper cites.
Average-case complexity of detecting cliques
B. Rossman · 2010
Earlier work this paper cites.
Nuclear norm minimization for the planted clique and biclique problems
B. P. W. Ames and S. A. Vavasis · 2011
Earlier work this paper cites.
Detection of an anomalous cluster in a network
E. Arias-Castro, E. J. Candès, and A. Durand · 2011
Earlier work this paper cites.
Statistical and computational tradeoffs in biclustering
S. Balakrishnan, M. Kolar, A. Rinaldo, A. Singh, and L. Wasserman · 2011
Earlier work this paper cites.
Noise thresholds for spectral clustering
S. Balakrishnan, M. Xu, A. Krishnamurthy, and A. Singh · 2011
Cited alongside, same era.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborova · 2011
Cited alongside, same era.
How hard is it to approximate the best nash equilibrium?
E. Hazan and R. Krauthgamer · 2011
Cited alongside, same era.
Minimax localization of structural information in large noisy matrices
M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh · 2011
Cited alongside, same era.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Cited alongside, same era.
Energy landscape for large average submatrix detection problems in gaussian random matrices
A proof of the block model threshold conjecture
E. Mossel, J. Neeman, and A. Sly · 2013
Later among the works it cites.
On the maximal size of large-average and ANOVA-fit submatrices in a gaussian random matrix
X. Sun and A. B. Nobel · 2013
Later among the works it cites.
Community detection in sparse random networks
N. Verzelen and E. Arias-Castro · 2013
Later among the works it cites.
Fantope projection and selection: A near-optimal convex relaxation of sparse pca
V. Q. Vu, J. Cho, J. Lei, and K. Rohe · 2013
Later among the works it cites.
Exact recovery in the stochastic block model
E. Abbe, A. S. Bandeira, and G. Hall · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Bhamidi, P. S. Dey, and A. B. Nobel · 2012
Cited alongside, same era.
Spectral clustering of graphs with general degrees in the extended planted partition model
K. Chaudhuri, F. Chung, and A. Tsiatas · 2012
Cited alongside, same era.
Clustering sparse graphs
Y. Chen, S. Sanghavi, and H. Xu · 2012
Cited alongside, same era.
Statistical Algorithms and a Lower Bound for Planted Clique
V. Feldman, E. Grigorescu, L. Reyzin, S. Vempala, and Y. Xiao · 2012
Cited alongside, same era.
Clustering using max-norm constrained optimization
A. Jalali and N. Srebro · 2012
Cited alongside, same era.
Stochastic block models and reconstruction
E. Mossel, J. Neeman, and A. Sly · 2012
Cited alongside, same era.
Graph spectra and the detectability of community structure in networks
R. R. Nadakuditi and M. E. J. Newman · 2012
Cited alongside, same era.
Convex optimization for the planted k-disjoint-clique problem
B. P. W. Ames and S. Vavasis · 2014
Closest in time.
A tensor spectral approach to learning mixed membership community models
A. Anandkumar, R. Ge, D. Hsu, and S. M. Kakade · 2014
Closest in time.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T. Cai and X. Li · 2014
Closest in time.
Matrix estimation by universal singular value thresholding
S. Chatterjee · 2014
Closest in time.
Clustering partially observed graphs via convex optimization
Y. Chen, A. Jalali, S. Sanghavi, and H. Xu · 2014
Closest in time.
Improved graph clustering
Y. Chen, S. Sanghavi, and H. Xu · 2014
Closest in time.
Y. Chen and J. Xu · 2014
Closest in time.
Finding hidden cliques in linear time with high probability
Y. Dekel, O. Gurel-Gurevich, and Y. Peres · 2014
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. Xu · 2014
Closest in time.
Computational lower bounds for community detection on random graphs
B. Hajek, Y. Wu, and J. Xu · 2014
Closest in time.
Hidden cliques and the certification of the restricted isometry property
P. Koiran and A. Zouzias · 2014
Closest in time.
Community detection thresholds and the weak Ramanujan property
L. Massoulié · 2014
Closest in time.
Distributed user profiling via spectral methods
L. Massoulié and D. Tomozei · 2014
Closest in time.
Consistency thresholds for binary symmetric block models
E. Mossel, J. Neeman, and A. Sly · 2014
Closest in time.
Sharp performance bounds for graph clustering via convex optimization
R. K. Vinayak, S. Oymak, and B. Hassibi · 2014
Closest in time.
A simple SVD algorithm for finding hidden partitions
V. Vu · 2014
Closest in time.
Jointly clustering rows and columns of binary matrices: Algorithms and trade-offs
J. Xu, R. Wu, K. Zhu, B. Hajek, R. Srikant, and L. Ying · 2014
Closest in time.
Community detection via random and adaptive sampling
S. Yun and A. Proutiere · 2014
Closest in time.
E. Abbe and C. Sandon · 2015
Closest in time.
Incoherence-optimal matrix completion
Y. Chen · 2015
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming: Extensions
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.