Community detection by \(L_{0}\)-penalized graph Laplacian
DOI10.1214/18-EJS1445zbMath1404.62067arXiv1706.10273MaRDI QIDQ1639201
Ruibin Xi, Chong Chen, Nan Lin
Publication date: 12 June 2018
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.10273
consistencysocial networkoutlierspectral clusteringgene regulatory networkdegree corrected stochastic block modelmissclassification
Multivariate analysis (62H99) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (2)
Cites Work
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Likelihood-based model selection for stochastic block models
- Fast community detection by SCORE
- Impact of regularization on spectral clustering
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Spectral clustering and the high-dimensional stochastic blockmodel
- Uncovering latent structure in valued graphs: a variational approach
- The eigenvalues of random symmetric matrices
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering in stochastic block models
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Estimation and Prediction for Stochastic Blockstructures
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Community detection by \(L_{0}\)-penalized graph Laplacian
