Fetching the paper…
Reading the bibliography…
Spectral clustering is a fast and popular algorithm for finding clusters in networks.
A generalized solution of the orthogonal procrustes problem
Peter H Schönemann · 1966
Earlier work this paper cites.
Stochastic blockmodels: First steps
P.W. Holland and S. Leinhardt · 1983
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Y Ng, Michael I Jordan, Yair Weiss, et al · 2002
Earlier work this paper cites.
Spectral analysis of random graphs with skewed degree distributions
Anirban Dasgupta, John E Hopcroft, and Frank McSherry · 2004
Earlier work this paper cites.
The political blogosphere and the 2004 us election: divided they blog
Lada A Adamic and Natalie Glance · 2005
Earlier work this paper cites.
Fan Rong K Chung and Linyuan Lu · 2006
Cited alongside, same era.
Finding planted partitions in random graphs with general degree distributions
Amin Coja-Oghlan and André Lanka · 2009
Cited alongside, same era.
Convex optimization for the planted k-disjoint-clique problem
Brendan PW Ames and Stephen A Vavasis · 2010
Cited alongside, same era.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
Brian Karrer and Mark EJ Newman · 2011
Cited alongside, same era.
On the spectra of general random graphs
Spectral clustering of graphs with general degrees in the extended planted partition model
K. Chaudhuri, F. Chung, and A. Tsiatas · 2012
Later among the works it cites.
Pseudo-likelihood methods for community detection in large sparse networks
Arash A Amini, Aiyou Chen, Peter J Bickel, and Elizaveta Levina · 2012
Later among the works it cites.
A consistent adjacency spectral embedding for stochastic blockmodel graphs
D.L. Sussman, M. Tang, D.E. Fishkind, and C.E. Priebe · 2012
Later among the works it cites.
Randomized algorithms for matrices and data
Michael W Mahoney · 2012
Later among the works it cites.
Fast network community detection by score
Jiashun Jin · 2012
Later among the works it cites.
Stochastic blockmodels with a growing number of classes
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fan Chung and Mary Radcliffe · 2011
Cited alongside, same era.
D.S. Choi, P.J. Wolfe, and E.M. Airoldi · 2012
Later among the works it cites.