A survey on theoretical advances of community detection in networks
From MaRDI portal
Publication:6607057
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- A goodness-of-fit test for stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- A survey of statistical network models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Community detection in networks with node features
- Community detection in sparse networks via Grothendieck's inequality
- Community detection thresholds and the weak Ramanujan property
- Concentration and regularization of random graphs
- 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
- Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
- Emergence of Scaling in Random Networks
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Exact Recovery in the Stochastic Block Model
- Fast community detection by SCORE
- Hypothesis testing for automated community detection in networks
- Latent Space Approaches to Social Network Analysis
- Likelihood-based model selection for stochastic block models
- Local network community detection with continuous optimization of conductance and weighted kernel k-means
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Markov Graphs
- Minimax rates of community detection in stochastic block models
- Mixed membership stochastic blockmodels
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Networks. An introduction.
- Pseudo-likelihood methods for community detection in large sparse networks
- Reconstruction and estimation in the planted partition model
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Role of normalization in spectral clustering for stochastic blockmodels
- Social and economic networks.
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral redemption in clustering sparse networks
- Statistical analysis of network data. Methods and models
- Statistical mechanics of complex networks
- 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
- The Structure and Function of Complex Networks
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(2)
This page was built for publication: A survey on theoretical advances of community detection in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607057)
