摘要: … Since the margin of Pn is somewhat complicated to work with, the first step is to … Computing EYn1H is the main task of this section; we will do it in three steps. First, we will get a general …
harvard.edu
berkeley.edu
arxiv.org参考文章(37)
N. C. Wormald, Surveys in Combinatorics, 1999: Models of Random Regular Graphs pp. 239- 298 ,(1999) , 10.1017/CBO9780511721335.010
F. McSherry, Spectral partitioning of random graphs international conference on cluster computing. pp. 529- 537 ,(2001) , 10.1109/SFCS.2001.959929
Joel Friedman, A Proof of Alon's Second Eigenvalue Conjecture and Related Problems ,(2008)
Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová, Inference and phase transitions in the detection of modules in sparse networks. Physical Review Letters. ,vol. 107, pp. 065701- 065701 ,(2011) , 10.1103/PHYSREVLETT.107.065701
Russell Impagliazzo, Ted Carson, Hill-climbing finds random planted bisections symposium on discrete algorithms. pp. 903- 909 ,(2001) , 10.5555/365411.365805
Ravi B. Boppana, Eigenvalues and graph bisection: An average-case analysis 28th Annual Symposium on Foundations of Computer Science (sfcs 1987). pp. 280- 285 ,(1987) , 10.1109/SFCS.1987.22
Andrea Lancichinetti, Santo Fortunato, Community detection algorithms: a comparative analysis. Physical Review E. ,vol. 80, pp. 056117- ,(2009) , 10.1103/PHYSREVE.80.056117
William Evans, Claire Kenyon, Yuval Peres, Leonard J. Schulman, Broadcasting on trees and the Ising model Annals of Applied Probability. ,vol. 10, pp. 410- 433 ,(2000) , 10.1214/AOAP/1019487349
Stephen C. Johnson, Hierarchical clustering schemes Psychometrika. ,vol. 32, pp. 241- 254 ,(1967) , 10.1007/BF02289588
Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Physical Review E. ,vol. 84, pp. 066106- ,(2011) , 10.1103/PHYSREVE.84.066106