Fetching the paper…
Reading the bibliography…
We consider the problem of estimating community memberships of nodes in a network, where every node is associated with a vector determining its degree of membership in each community.
Banach Lattices and Positive Operators
H.H. Schaefer · 1974
Earlier work this paper cites.
Multidimensional binary search trees used for associative searching
Jon Louis Bentley · 1975
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Cover trees for nearest neighbor
Alina Beygelzimer, Sham Kakade, and John Langford · 2006
Earlier work this paper cites.
Numerical recipes 3rd edition: The art of scientific computing
William H Press, Saul A Teukolsky, William T Vetterling, and Brian P Flannery · 2007
Earlier work this paper cites.
Mixed membership stochastic blockmodels
Edoardo M Airoldi, David M Blei, Stephen E Fienberg, and Eric P Xing · 2008
Earlier work this paper cites.
Concentration of the adjacency matrix and of the laplacian in random graphs with independent edges
Roberto Imbuzeiro Oliveira · 2009
Earlier work this paper cites.
Noise thresholds for spectral clustering
Sivaraman Balakrishnan, Min Xu, Akshay Krishnamurthy, and Aarti Singh · 2011
Earlier work this paper cites.
Efficient and principled method for detecting communities in networks
Brian Ball, Brian Karrer, and Mark EJ Newman · 2011
Earlier work this paper cites.
Overlapping community detection using bayesian non-negative matrix factorization
Ioannis Psorakis, Stephen Roberts, Mark Ebden, and Ben Sheldon · 2011
Earlier work this paper cites.
Spectral clustering and the high-dimensional stochastic blockmodel
Karl Rohe, Sourav Chatterjee, and Bin Yu · 2011
Earlier work this paper cites.
Community discovery using nonnegative matrix factorization
F. Wang, T. Li, X. Wang, S. Zhu, and C. Ding · 2011
Earlier work this paper cites.
Computing a nonnegative matrix factorization–provably
Sanjeev Arora, Rong Ge, Ravindran Kannan, and Ankur Moitra · 2012
Cited alongside, same era.
Matrix analysis
Roger A Horn and Charles R Johnson · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Cited alongside, same era.
Spectral statistics of erdős–rényi graphs i: local semicircle law
László Erdős, Antti Knowles, Horng-Tzer Yau, Jun Yin, et al · 2013
Cited alongside, same era.
Efficient discovery of overlapping communities in massive networks
Prem K Gopalan and David M Blei · 2013
Cited alongside, same era.
A tensor approach to learning mixed membership community models
Animashree Anandkumar, Rong Ge, Daniel Hsu, and Sham M. Kakade · 2014
Cited alongside, same era.
Exact recovery in the stochastic block model
Emmanuel Abbe, Afonso S Bandeira, and Georgina Hall · 2016
Later among the works it cites.
A limit theorem for scaled eigenvectors of random dot product graphs
Avanti Athreya, Carey E Priebe, Minh Tang, Vince Lyzinski, David J Marchette, and Daniel L Sussman · 2016
Later among the works it cites.
A spectral algorithm with additive clustering for the recovery of overlapping communities in networks
Emilie Kaufmann, Thomas Bonald, and Marc Lelarge · 2016
Later among the works it cites.
The (un) supervised nmf methods for discovering overlapping communities as well as hubs and outliers in networks
Xiao Wang, Xiaochun Cao, Di Jin, Yixin Cao, and Dongxiao He · 2016
Later among the works it cites.
Entrywise eigenvector analysis of random matrices with low expected rank
Emmanuel Abbe, Jianqing Fan, Kaizheng Wang, and Yiqiao Zhong · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Improved graph clustering
Yudong Chen, Sujay Sanghavi, and Huan Xu · 2014
Cited alongside, same era.
Fast and robust recursive algorithmsfor separable nonnegative matrix factorization
Nicolas Gillis and Stephen A Vavasis · 2014
Cited alongside, same era.
Overlap graph clustering via successive removal
Avik Ray, Javad Ghaderi, Sujay Sanghavi, and Sanjay Shakkottai · 2014
Cited alongside, same era.
Detecting overlapping communities in networks using spectral methods
Yuan Zhang, Elizaveta Levina, and Ji Zhu · 2014
Cited alongside, same era.
Consistency of spectral clustering in stochastic block models
Jing Lei, Alessandro Rinaldo, et al · 2015
Cited alongside, same era.
A useful variant of the davis–kahan theorem for statisticians
Yi Yu, Tengyao Wang, and Richard J Samworth · 2015
Cited alongside, same era.
Bayesian estimation from few samples: community detection and related problems
Samuel B Hopkins and David Steurer · 2017
Closest in time.
Estimating network memberships by simplex vertex hunting
Jiashun Jin, Zheng Tracy Ke, and Shengming Luo · 2017
Closest in time.
On mixed memberships and symmetric nonnegative matrix factorizations
Xueyu Mao, Purnamrita Sarkar, and Deepayan Chakrabarti · 2017
Closest in time.
Consistent estimation of mixed memberships with successive projections
Maxim Panov, Konstantin Slavnov, and Roman Ushakov · 2017
Closest in time.
Signal-plus-noise matrix models: eigenvector deviations and fluctuations
Joshua Cape, Minh Tang, and Carey E Priebe · 2018
Closest in time.
Unperturbed: spectral analysis beyond davis-kahan
Justin Eldridge, Mikhail Belkin, and Yusu Wang · 2018
Closest in time.
The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
Joshua Cape, Minh Tang, Carey E Priebe, et al · 2019
Closest in time.