Fetching the paper…
Reading the bibliography…
Community detection is one of the fundamental problems of network analysis, for which a number of methods have been proposed.
Spectral clustering and the high-dimensional stochastic block model
Rohe, K., Chatterjee, S., and Yu, B. (2011) · 1915
Earlier work this paper cites.
On random graphs. I
Erdős, P. and Rényi, A. (1959) · 1959
Earlier work this paper cites.
Stochastic blockmodels: first steps
Holland, P. W., Laskey, K. B., and Leinhardt, S. (1983) · 1983
Earlier work this paper cites.
Minkowski addition of polytopes: computational complexity and applications to Grobner bases
Gritzmann, P. and Sturmfels, B. (1993) · 1993
Earlier work this paper cites.
Matrix Analysis
Bhatia, R. (1996) · 1996
Earlier work this paper cites.
Tabu search
Glover, F. W. and Lagunas, M. (1997) · 1997
Earlier work this paper cites.
Estimation and prediction for stochastic block-structures for graphs with latent block structure
Snijders, T. and Nowicki, K. (1997) · 1997
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Ng, A., Jordan, M., and Weiss, Y. (2001) · 2001
Earlier work this paper cites.
Estimation and prediction for stochastic blockstructures
Nowicki, K. and Snijders, T. A. B. (2001) · 2001
Earlier work this paper cites.
Connected components in random graphs with given degree sequences
Chung, F. and Lu, L. (2002) · 2002
Earlier work this paper cites.
Latent space approaches to social network analysis
Hoff, P. D., Raftery, A. E., and Handcock, M. S. (2002) · 2002
Earlier work this paper cites.
On the eigenvalue power law
Mihail, M. and Papadimitriou, C. H. (2002) · 2002
Earlier work this paper cites.
The bottlenose dolphin community of doubtful sound features a large propor- tion of long-lasting associations. can geographic isola- tion explain this unique trait?
Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., and Dawson, S. M. (2003) · 2003
Earlier work this paper cites.
Information-theoretic measures for knowledge discovery and data mining
Yao, Y. Y. (2003) · 2003
Earlier work this paper cites.
From the zonotope construction to the minkowski addition of convex polytopes
Fukuda, K. (2004) · 2004
Earlier work this paper cites.
Identifying the role that animals play in their social networks
Lusseau, D. and Newman, M. E. J. (2004) · 2004
Cited alongside, same era.
Finding and evaluating community structure in networks
Newman, M. E. J. and Girvan, M. (2004) · 2004
Cited alongside, same era.
The political blogosphere and the 2004 US election
Adamic, L. A. and Glance, N. (2005) · 2005
Cited alongside, same era.
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · 2006
Cited alongside, same era.
Model-based clustering for social networks
Handcock, M. D., Raftery, A. E., and Tantrum, J. M. (2007) · 2007
Cited alongside, same era.
A nonparametric view of network models and Newman-Girvan and other modularities
Bickel, P. J. and Chen, A. (2009) · 2009
Cited alongside, same era.
First-principles multiway spectral partitioning of graphs
Riolo, M. and Newman, M. E. J. (2012) · 2012
Later among the works it cites.
Consistency of community detection in networks under degree-corrected stochastic block models
Zhao, Y., Levina, E., and Zhu, J. (2012) · 2012
Later among the works it cites.
Impact of regularization on spectral clustering
Joseph, A. and Yu, B. (2013) · 2013
Later among the works it cites.
Spectral methods for network community detection and graph partitioning
Newman, M. E. J. (2013) · 2013
Later among the works it cites.
Random perturbation of low rank matrices: Improving classical bounds
O’Rourke, S., Vu, V., and Wang, K. (2013) · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A survey of statistical network models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., and Airoldi, E. M. (2010) · 2010
Cited alongside, same era.
Uncovering latent structure in valued graphs: A variational approach
Mariadassou, M., Robin, S., and Vacher, C. (2010) · 2010
Cited alongside, same era.
Implementation and parallelization of a reverse-search algorithm for Minkowski sums
Weibel, C. (2010) · 2010
Cited alongside, same era.
An efficient and principled method for detecting communities in networks
Ball, B., Karrer, B., and Newman, M. E. J. (2011) · 2011
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
Karrer, B. and Newman, M. E. J. (2011) · 2011
Cited alongside, same era.
Community extraction for social networks
Zhao, Y., Levina, E., and Zhu, J. (2011) · 2011
Cited alongside, same era.
Later among the works it cites.
Regularized spectral clustering under the degree-corrected stochastic blockmodel
Qin, T. and Rohe, K. (2013) · 2013
Later among the works it cites.
Role of normalization in spectral clustering for stochastic blockmodels
Sarkar, P. and Bickel, P. (2013) · 2013
Later among the works it cites.
Mixed membership stochastic blockmodels
Airoldi, E. M., Blei, D. M., Fienberg, S. E., and Xing, E. P. (2008) · 2014
Closest in time.
Community detection thresholds and the weak Ramanujan property
Massoulié, L. (2014) · 2014
Closest in time.
Detecting overlapping communities in networks using spectral methods
Zhang, Y., Levina, E., and Zhu, J. (2014) · 2014
Closest in time.
Fast network community detection by score
Jin, J. (2015) · 2015
Closest in time.
Sparse random graphs: regularization and concentration of the Laplacian
Le, C. M., Levina, E., and Vershynin, R. (2015) · 2015
Closest in time.
Consistency of spectral clustering in sparse stochastic block models
Lei, J. and Rinaldo, A. (2015) · 2015
Closest in time.
Fitting community models to large sparse networks
Amini, A., Chen, A., Bickel, P., and Levina, E. (2013) · 2097
Closest in time.