Convexified modularity maximization for degree-corrected stochastic block models
From MaRDI portal
Publication:2413602
DOI10.1214/17-AOS1595zbMath1410.62105arXiv1512.08425OpenAlexW2963246299WikidataQ129616394 ScholiaQ129616394MaRDI QIDQ2413602
Publication date: 14 September 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08425
social networkconvex relaxationcommunity detectionmodularity maximizationdegree-corrected stochastic block model\(k\)-medians
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Statistical block designs (62K10)
Related Items (22)
Community detection via an efficient nonconvex optimization approach based on modularity ⋮ Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Estimating mixed-memberships using the symmetric Laplacian inverse matrix ⋮ Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems ⋮ Clustering heterogeneous financial networks ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ Unnamed Item ⋮ Adjusted chi-square test for degree-corrected block models ⋮ A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection ⋮ Simplified Energy Landscape for Modularity Using Total Variation ⋮ Convex relaxation methods for community detection ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees ⋮ Community detection in degree-corrected block models ⋮ Improvements on SCORE, Especially for Weak Signals ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Testing degree corrections in stochastic block models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Detecting Overlapping Communities in Networks Using Spectral Methods
Cites Work
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Fast community detection by SCORE
- Minimax rates of community detection in stochastic block models
- Spectral clustering and the high-dimensional stochastic blockmodel
- Community detection in sparse networks via Grothendieck's inequality
- Random Laplacian matrices and convex relaxations
- 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
- Convex optimization for the planted \(k\)-disjoint-clique problem
- A constant-factor approximation algorithm for the k -median problem (extended abstract)
- Spectral redemption in clustering sparse networks
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- Finding Planted Partitions in Random Graphs with General Degree Distributions
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Semidefinite programs on sparse random graphs and their application to community detection
- Concentration and regularization of random graphs
- Absolutely summing operators in $ℒ_{p}$-spaces and their applications
- Optimization via low-rank approximation for community detection in networks
This page was built for publication: Convexified modularity maximization for degree-corrected stochastic block models
