Fetching the paper…
Reading the bibliography…
We present a simple and flexible method to prove consistency of semidefinite optimization problems on random graphs.
K. Rohe, S. Chatterjee, B. Yu, Spectral clustering and the high-dimensional stochastic block model
1915
Earlier work this paper cites.
P. Bickel, D. Choi, X. Chang, H. Zhang, Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
1943
Earlier work this paper cites.
A. Grothendieck, Résumé de la théorie métrique des produits tensoriels topologiques
1953
Earlier work this paper cites.
J. Lindenstrauss, A. Pelczyński, Absolutely summing operators in L p L_{p} -spaces and their applications
1968
Earlier work this paper cites.
C. Davis, W. M. Kahan. The rotation of eigenvectors by a perturbation. III
1970
Earlier work this paper cites.
P. W. Holland, K. B. Laskey, S. Leinhardt, Stochastic blockmodels: first steps
1983
Earlier work this paper cites.
R. Boppana, Eigenvalues and graph bisection: an average-case analysis
1987
Earlier work this paper cites.
T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior
1987
Earlier work this paper cites.
M. E. Dyer and A. M. Frieze, The solution of some random NP-hard problems in polynomial expected time
1989
Earlier work this paper cites.
J. Friedman, J. Kahn, E. Szemeredi, On the second eigenvalue in random regular graphs
1989
Earlier work this paper cites.
L. Lovász, A. Schrijver, Cones of matrices and set-functions and 0 0 - 1 1 optimization
1991
Earlier work this paper cites.
L. Hagen, A. Kahng, New spectral methods for ratio cut partitioning and clustering
1992
Earlier work this paper cites.
M. Goemans, D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
1995
Earlier work this paper cites.
N. Alon, N. Kahale, A spectral technique for coloring random 3-colorable graphs
1997
Earlier work this paper cites.
R. Bhatia. Matrix analysis
1997
Earlier work this paper cites.
T. Snijders, K. Nowicki, Estimation and prediction for stochastic block-structures for graphs with latent block structure
1997
Earlier work this paper cites.
N. Alon, Spectral techniques in graph algorithms
1998
Earlier work this paper cites.
Y. Nesterov, Semidefinite relaxation and nonconvex quadratic optimization
1998
Earlier work this paper cites.
B. Bollobas, Random graphs
2001
Earlier work this paper cites.
F. McSherry, Spectral partitioning of random graphs
2001
Earlier work this paper cites.
K. Nowicki, T. Snijders, Estimation and prediction for stochastic blockstructures
2001
Cited alongside, same era.
S. Strogatz, Exploring complex networks
2001
Cited alongside, same era.
U. Feige, E. Ofek, Spectral techniques applied to sparse random graphs
2005
Cited alongside, same era.
N. Alon, A. Naor, Approximating the cut-norm via Grothendieck’s inequality
2006
Cited alongside, same era.
M. Newman, Modularity and community structure in networks
2006
Cited alongside, same era.
B. Bollobas, S. Janson, O. Riordan, The phase transition in inhomogeneous random graphs
2007
Cited alongside, same era.
S. Khot, A. Naor, Grothendieck-type inequalities in combinatorial optimization
2012
Later among the works it cites.
R. Nadakuditi, M. Newman, Graph spectra and the detectability of community structure in networks
2012
Later among the works it cites.
G. Pisier. Grothendieck’s theorem, past and present
2012
Later among the works it cites.
C. Bordenave, A. Guionnet, Localization and delocalization of eigenvectors for heavy-tailed random matrices
2013
Later among the works it cites.
M. Lelarge, L. Massoulié, J. Xu, Reconstruction in the labeled stochastic block model
2013
Later among the works it cites.
L. Massoulié, Community detection thresholds and the weak Ramanujan property
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney, Statistical properties of community structure in large social and information networks
2008
Cited alongside, same era.
P. Bickel, A. Chen, A nonparametric view of network models and Newman-Girvan and other modularities
2009
Cited alongside, same era.
A. Coja-Oghlan, Graph partitioning via adaptive spectral techniques
2010
Cited alongside, same era.
B. Ames, S. Vavasis, Nuclear norm minimization for the planted clique and biclique problems
2011
Cited alongside, same era.
M. Braverman, K. Makarychev, Y. Makarychev, A. Naor, The Grothendieck constant is strictly smaller than Krivine’s bound
2011
Cited alongside, same era.
A. Jalali, Y. Chen, S. Sanghavi, H. Xu, Clustering partially observed graphs via convex optimization
2011
Cited alongside, same era.
2013
Later among the works it cites.
2013
Later among the works it cites.
N. Ailon, Y. Chen, H. Xu, Breaking the small cluster barrier of graph clustering
2014
Closest in time.
E. Airoldi, D. Blei, S. Fienberg, E. Xing, Mixed membership stochastic blockmodels
2014
Closest in time.
A. Amini, E. Levina, On semidefinite relaxations of the block model
2014
Closest in time.
2014
Closest in time.
Y. Chen, A. Jalali, S. Sanghavi, H. Xu, Clustering partially observed graphs via convex optimization
2014
Closest in time.
2014
Closest in time.
A. Joseph, B. Yu, Impact of regularization on spectral clustering
2014
Closest in time.
E. Mossel, J. Neeman, A. Sly, Stochastic Block Models and Reconstruction
2014
Closest in time.
E. Mossel, J. Neeman, A. Sly, A proof of the block model threshold conjecture
2014
Closest in time.
E. Mossel, J. Neeman, A. Sly, Consistency Thresholds for the Planted Bisection Model
2014
Closest in time.
2015
Closest in time.
J. Lei, A. Rinaldo, Consistency of spectral clustering in sparse stochastic block models
2050
Closest in time.
A. Amini, A. Chen, P. Bickel, E. Levina, Pseudo-likelihood methods for community detection in large sparse networks
2097
Closest in time.