A survey on theoretical advances of community detection in networks
From MaRDI portal
Publication:6607057
DOI10.1002/wics.1403zbMath1545.62162MaRDI QIDQ6607057
Publication date: 17 September 2024
Published in: Wiley Interdisciplinary Reviews. WIREs Computational Statistics (Search for Journal in Brave)
Related Items (2)
Network Inference Using the Hub Model and Variants ⋮ Community detection in complex networks: from statistical foundations to data science applications
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Minimax rates of community detection in stochastic block models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Reconstruction and estimation in the planted partition model
- Community detection in networks with node features
- Spectral clustering and the high-dimensional stochastic blockmodel
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Community detection in sparse networks via Grothendieck's inequality
- Statistical analysis of network data. Methods and models
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistency of spectral clustering in stochastic block models
- Role of normalization in spectral clustering for stochastic blockmodels
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- Exact Recovery in the Stochastic Block Model
- Statistical mechanics of complex networks
- Mixed membership stochastic blockmodels
- Emergence of Scaling in Random Networks
- Markov Graphs
- The Structure and Function of Complex Networks
- Estimation and Prediction for Stochastic Blockstructures
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Latent Space Approaches to Social Network Analysis
- A Survey of Statistical Network Models
- Community detection thresholds and the weak Ramanujan property
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Concentration and regularization of random graphs
- Hypothesis Testing for Automated Community Detection in Networks
- Networks
- The elements of statistical learning. Data mining, inference, and prediction
- A goodness-of-fit test for stochastic block models
This page was built for publication: A survey on theoretical advances of community detection in networks