Fetching the paper…
Reading the bibliography…
The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry.
On the distribution of the roots of certain symmetric matrices
E. P. Wigner · 1958
Earlier work this paper cites.
On random graphs, I
P. Erdős and A. Rényi · 1959
Earlier work this paper cites.
P-complete approximation problems
S. Sahni and T. Gonzalez · 1976
Earlier work this paper cites.
On the shannon capacity of a graph
L. Lovasz · 1979
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1981
Earlier work this paper cites.
Eigenvalues and graph bisection: An average-case analysis
R. B. Boppana · 1987
Earlier work this paper cites.
Probability in Banach spaces
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
F. Alizadeh · 1993
Earlier work this paper cites.
Interior-Point Polynomial Algorithms in Convex Programming
Y. Nesterov and A. Nemirovskii · 1994
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefine programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Semidefinite programming
L. Vanderberghe and S. Boyd · 1996
Earlier work this paper cites.
Spectral Graph Theory
F. R. K. Chung · 1997
Earlier work this paper cites.
About the constants in Talagrand’s concentration inequalities for empirical processes
P. Massart · 2000
Earlier work this paper cites.
Local operator theory, random matrices and Banach spaces
K. Davidson and S. Szarek · 2001
Earlier work this paper cites.
Heuristics for semirandom graph problems
U. Feige and J. Kilian · 2001
Earlier work this paper cites.
On the power of unique 2-prover 1-round games
S. Khot · 2002
Earlier work this paper cites.
Correlation clustering
N. Bansal, A. Blum, and S. Chawla · 2004
Cited alongside, same era.
Moment inequalities for functions of independent random variables
S. Boucheron, O. Bousquet, G. Lugosi, and P. Massart · 2005
Cited alongside, same era.
Spectral measure of large random Hankel, Markov and Toeplitz matrices
W. Bryc, A. Dembo, and T. Jiang · 2006
Cited alongside, same era.
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
F. Chung and L. Lu · 2006
Cited alongside, same era.
Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)
R. Durrett · 2006
Cited alongside, same era.
Optimal algorithms and inapproximability results for every CSP?
P. Raghavendra · 2008
Cited alongside, same era.
Exact recovery in the stochastic block model
E. Abbe, A. S. Bandeira, and G. Hall · 2014
Later among the works it cites.
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
A. S. Bandeira, N. Boumal, and A. Singer · 2014
Later among the works it cites.
Open problem: Tightness of maximum likelihood semidefinite relaxations
A. S. Bandeira, Y. Khoo, and A. Singer · 2014
Later among the works it cites.
Information recovery from pairwise measurements
Y. Chen and A. J. Goldsmith · 2014
Later among the works it cites.
Achieving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. 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…
An introduction to random matrices
G. W. Anderson, A. Guionnet, and O. Zeitouni · 2010
Cited alongside, same era.
Spectral distribution of adjacency and Laplacian matrices of random graphs
X. Ding and T. Jiang · 2010
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. Zdeborová · 2011
Cited alongside, same era.
Angular synchronization by eigenvectors and semidefinite programming
A. Singer · 2011
Cited alongside, same era.
Topics in Random Matrix Theory
T. Tao · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
L. Massoulié · 2014
Later among the works it cites.
Consistency thresholds for the planted bisection model
E. Mossel, J. Neeman, and A. Sly · 2014
Later among the works it cites.
A proof of the block model threshold conjecture
E. Mossel, J. Neeman, and A. Sly · 2014
Later among the works it cites.
Stochastic block models and reconstruction
E. Mossel, J. Neeman, and A. Sly · 2014
Later among the works it cites.
Multisection in the stochastic block model using semidefinite programming
N. Agarwal, A. S. Bandeira, K. Koiliaris, and A. Kolla · 2015
Closest in time.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
A. S. Bandeira and R. v. Handel · 2015
Closest in time.
Information recovery from pairwise measurements: A shannon-theoretic approach
Y. Chen, C. Suh, and A. J. Goldsmith · 2015
Closest in time.
Synchronization over Z2 and community detection in signed multiplex networks with constraints
M. Cucuringu · 2015
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming: Extensions
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
An introduction to matrix concentration inequalities
J. A. Tropp · 2015
Closest in time.