Community detection in degree-corrected block models
From MaRDI portal
Publication:1800797
DOI10.1214/17-AOS1615zbMath1408.62116arXiv1607.06993WikidataQ129368226 ScholiaQ129368226MaRDI QIDQ1800797
Anderson Y. Zhang, Chao Gao, Harrison H. Zhou, Zongming Ma
Publication date: 24 October 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06993
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Minimax procedures in statistical decision theory (62C20) Neural nets and related approaches to inference from stochastic processes (62M45)
Related Items
Testing community structure for hypergraphs, The hierarchy of block models, Bayesian testing for exogenous partition structures in stochastic block models, Edgeworth expansions for network moments, Iterative algorithm for discrete structure recovery, Optimal Bipartite Network Clustering, Unnamed Item, Rate optimal Chernoff bound and application to community detection in the stochastic block models, Network structure optimization for social networks by minimizing the average path length, Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models, Subsampling spectral clustering for stochastic block models in large-scale networks, Fast Network Community Detection With Profile-Pseudo Likelihood Methods, Community detection for multilayer weighted networks, Community Detection in Censored Hypergraph, Corrected Bayesian Information Criterion for Stochastic Block Models, Unnamed Item, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Network representation using graph root distributions, Detecting a planted community in an inhomogeneous random graph, Improvements on SCORE, Especially for Weak Signals, Mixed Membership Estimation for Social Networks, Optimality of spectral clustering in the Gaussian mixture model, Exact recovery in the Ising blockmodel, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, Testing degree corrections in stochastic block models, Sharp optimal recovery in the two component Gaussian mixture model, Unnamed Item, Unnamed Item, Unnamed Item, Global and individualized community detection in inhomogeneous multilayer networks, Detecting Overlapping Communities in Networks Using Spectral Methods
Cites Work
- Pseudo-likelihood methods for community detection in large sparse networks
- Fast community detection by SCORE
- Consistency thresholds for the planted bisection model
- Belief propagation, robust reconstruction and optimal recovery of block models
- Minimax rates of community detection in stochastic block models
- Spectral clustering and the high-dimensional stochastic blockmodel
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering in stochastic block models
- Convexified modularity maximization for degree-corrected stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- Community detection thresholds and the weak Ramanujan property
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
