Fetching the paper…
Reading the bibliography…
Spectral algorithms are classic approaches to clustering and community detection in networks.
Wigner E P (1958). On the distribution of the roots of certain symmetric matrices. Ann. Math, 67(2), 325-327
1958
Earlier work this paper cites.
Kesten H and Stigum B P (1966). Additional limit theorems for indecomposable multidimensional Galton-Watson processes. Ann. Math. Statist. 37:1463–1481
1966
Earlier work this paper cites.
Zachary W W (1977). An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33:4520-473
1977
Earlier work this paper cites.
McKay, B D (1981). The expected eigenvalue distribution of a large regular graph. Linear Algebra and its Applications 40, 203-216
1981
Earlier work this paper cites.
Holland P W, Laskey K B, Leinhardt S (1983). Stochastic blockmodels: First steps. Social Networks 5:109–137
1983
Earlier work this paper cites.
Wang Y J, Wong G Y (1987). Stochastic Blockmodels for Directed Graphs. Journal of the American Statistical Association 82(397):8–19
1987
Earlier work this paper cites.
Hashimoto, Ki-ichiro (1989). Zeta functions of finite graphs and representations of p-adic groups. Automorphic forms and geometry of arithmetic varieties, 211-280
1989
Earlier work this paper cites.
Bass, H (1992). The Ihara-Selberg zeta function of a tree lattice. International Journal of Mathematics, 3(06), 717-797
1992
Earlier work this paper cites.
McSherry F (2001). Spectral partitioning of random graphs. Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, 529–537
2001
Earlier work this paper cites.
Girvan M, and Newman M E (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 7821-7826
2002
Earlier work this paper cites.
Krivelevich M and Sudakov B (2003). The largest eigenvalue of sparse random graphs. Combinatorics, Probability and Computing 12(01), 61-72
2003
Earlier work this paper cites.
Mossel E and Peres Y (2003). Information flow on trees. The Annals of Applied Probability 13:817–844
2003
Earlier work this paper cites.
Lusseau D, Schneider K, Boisseau O J, Haase, P, Slooten, E, and Dawson S M. (2003). The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology, 54(4), 396-405
2003
Cited alongside, same era.
Adamic L, Glance N (2005). The political blogosphere and the 2004 US Election: Divided They Blog. In Proc 3rd Intl Workshop on Link Discovery
2004
Cited alongside, same era.
Newman M E (2006). Finding community structure in networks using the eigenvectors of matrices. Physical review E, 74(3), 036104
2006
Cited alongside, same era.
Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and computing, 17(4), 395-416
2007
Cited alongside, same era.
Sasha S (2007). Random matrices, nonbacktracking walks, and orthogonal polynomials. Journal of Mathematical Physics, 48
Coja-Oghlan A (2010). Graph partitioning via adaptive spectral techniques. Combinatorics, Probability and Computing , 19(02):227–284
2010
Later among the works it cites.
2010
Later among the works it cites.
Vontobel, P. O. (2010). Connecting the Bethe entropy and the edge zeta function of a cycle code. In IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 704-708
2010
Later among the works it cites.
Decelle A, Krzakala F, Moore C, and Zdeborova L (2011). Phase transition in the detection of modules in sparse networks. Physical Review Letters 107
2011
Later among the works it cites.
Decelle A, Krzakala F, Moore C, and Zdeborova L (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Physical Review E 84
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
Alon N, Benjamini I, Lubetzky E and Sasha S (2007). Non-backtracking random walks mix faster. Communications in Contemporary Mathematics 9(4), 585–603
2007
Cited alongside, same era.
Bollobas B, Svante J and Oliver R (2007). The phase transition in inhomogeneous random graphs. Random Structures & Algorithms 31.1: 3–122
2007
Cited alongside, same era.
2007
Cited alongside, same era.
Friedman J (2008). A proof of Alon’s second eigenvalue conjecture and related problems. Memoirs of the American Mathematical Society, no. 910
2008
Cited alongside, same era.
Richardson T and Urbanke R (2008). Modern coding theory. Cambridge University Press
2008
Cited alongside, same era.
Bickel P J, Chen A (2009). A nonparametric view of network models and Newman-Girvan and other modularities. PNAS 106:21068–21073
2009
Cited alongside, same era.
Coja-Oghlan A, Mossel E and Vilenchik D (2009). A Spectral Approach to Analyzing Belief Propagation for 3-Coloring. Combinatorics, Probability and Computing 18: 881–912
2009
Cited alongside, same era.
2011
Later among the works it cites.
Ren, P., Wilson, R. C., Hancock, E. R. (2011). Graph characterization via Ihara coefficients. IEEE Transactions on Neural Networks, 22(2), 233-245
2011
Later among the works it cites.
Ball, B, Karrer, B, and Newman, M E J (2011). Efficient and principled method for detecting communities in networks. Physical Review E, 84(3), 036103
2011
Later among the works it cites.
Nadakuditi R R and Newman M E J (2012). Graph spectra and the detectability of community structure in networks. Phys. Rev. Lett. 108:188701
2012
Later among the works it cites.
2012
Later among the works it cites.
Zhang P, Krzakala F, Reichardt J, and Zdeborová L (2012). Comparative study for inference of hidden classes in stochastic block models. Journal of Statistical Mechanics: Theory and Experiment, 2012(12), P12021
2012
Later among the works it cites.
2012
Later among the works it cites.
Gopalan P, Mimno D, Gerrish S, Freedman M and Blei D (2012). Scalable inference of overlapping communities. In Advances in Neural Information Processing Systems 25 (pp. 2258-2266)
2012
Later among the works it cites.