Community detection in sparse networks via Grothendieck’s inequality
Authors:
Top Cited Papers
Open Access
- 3 September 2015
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 165 (3-4) , 1025-1049
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ANR GeMeCoD (ANR 2011 BS01 007 01)
- National Science Foundation (1265782)
- U.S. Air Force (FA9550-14-1-0009)
This publication has 41 references indexed in Scilit:
- Grothendieck‐Type Inequalities in Combinatorial OptimizationCommunications on Pure and Applied Mathematics, 2012
- Consistency of maximum-likelihood and variational estimators in the stochastic block modelElectronic Journal of Statistics, 2012
- Nuclear norm minimization for the planted clique and biclique problemsMathematical Programming, 2011
- A nonparametric view of network models and Newman–Girvan and other modularitiesProceedings of the National Academy of Sciences, 2009
- The phase transition in inhomogeneous random graphsRandom Structures & Algorithms, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Spectral techniques applied to sparse random graphsRandom Structures & Algorithms, 2005
- Semidefinite relaxation and nonconvex quadratic optimizationOptimization Methods and Software, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989