Fetching the paper…
Reading the bibliography…
We study the problem of recovering a hidden community of cardinality $K$ from an $n \times n$ symmetric data matrix $A$, where for distinct indices $i,j$, $A_{ij} \sim P$ if $i, j$ both belong to the community and $A_{ij} \sim Q$ otherwise, for two known probability distributions $P$ and $Q$ depending on $n$.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
H. Chernoff · 1952
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Reducibility among combinatorial problems
R. Karp · 1972
Earlier work this paper cites.
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszár and J. Körner · 1982
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Large cliques elude the Metropolis process
M. Jerrum · 1992
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.
Large deviations techniques and applications
A. Dembo and O. Zeitouni · 1998
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.
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.
Introduction to Nonparametric Estimation
A. B. Tsybakov · 2009
Earlier work this paper cites.
Finding hidden cliques in linear time
U. Feige and D. Ron · 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
Cited alongside, same era.
Statistical and computational tradeoffs in biclustering
S. Balakrishnan, M. Kolar, A. Rinaldo, A. Singh, and L. Wasserman · 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.
Guaranteed clustering and biclustering via semidefinite programming
B. P. W. Ames · 2013
Cited alongside, same era.
Robust convex relaxation for the planted clique and densest k-subgraph problems
B. P. W. Ames · 2013
Cited alongside, same era.
Detection of a sparse submatrix of a high-dimensional noisy matrix
C. Butucea and Y. I. Ingster · 2013
Cited alongside, same era.
Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
C. Butucea, Y. Ingster, and I. Suslina · 2015
Closest in time.
Computational and statistical boundaries for submatrix localization in a large noisy matrix
T. T. Cai, T. Liang, and A. Rakhlin · 2015
Closest in time.
Finding hidden cliques of size N / e \sqrt{N/e} in nearly linear time
Y. Deshpande and A. Montanari · 2015
Closest in time.
Computational lower bounds for community detection on random graphs
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Recovering a hidden community beyond the spectral limit in O ( | E | log ∗ | V | ) O(|E|\log^{*}|V|) time
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Semidefinite programs for exact recovery of a hidden community
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Exact recovery in the stochastic block model
E. Abbe, A. S. Bandeira, and G. Hall · 2014
Cited alongside, same era.
Community detection in dense random networks
E. Arias-Castro and N. Verzelen · 2014
Cited alongside, same era.
Y. Chen and J. Xu · 2014
Cited alongside, same era.
Finding hidden cliques in linear time with high probability
Y. Dekel, O. Gurel-Gurevich, and Y. Peres · 2014
Cited alongside, same era.
Achieving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. Xu · 2014
Cited alongside, same era.
Belief propagation, robust reconstruction, and optimal recovery of block models (extended abstract)
E. Mossel, J. Neeman, and S. Sly · 2014
Cited alongside, same era.
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Submatrix localization via message passing
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Information-theoretic bounds for exact recovery in weighted stochastic block models using the renyi divergence
V. Jog and P.-L. Loh · 2015
Closest in time.
Computational barriers in minimax submatrix detection
Z. Ma and Y. Wu · 2015
Closest in time.
Finding one community in a sparse random graph
A. Montanari · 2015
Closest in time.
Consistency thresholds for the planted bisection model
E. Mossel, J. Neeman, and A. Sly · 2015
Closest in time.
Lecture Notes on Information Theory
Y. Polyanskiy and Y. Wu · 2015
Closest in time.