Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information
From MaRDI portal
Publication:4969043
zbMath1497.68413arXiv1709.03907MaRDI QIDQ4969043
T. Tony Cai, Alexander Rakhlin, Tengyuan Liang
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1709.03907
statistical inferencesemi-supervised learningmisclassificationgeneral stochastic block modelsminimum energy flowweighted message passing
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Fast community detection by SCORE
- Geometric inference for general high-dimensional linear inverse problems
- Belief propagation, robust reconstruction and optimal recovery of block models
- Community detection in sparse networks via Grothendieck's inequality
- Finding one community in a sparse graph
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
- Information flow on trees
- A proof of the block model threshold conjecture
- Robust phase transitions for Heisenberg and other models on general trees
- Reconstruction on trees: Beating the second eigenvalue
- Broadcasting on trees and the Ising model.
- Robust reconstruction on trees is determined by the second eigenvalue.
- Group synchronization on grids
- Universality in polytope phase transitions and message passing algorithms
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Convexified modularity maximization for degree-corrected stochastic block models
- Probability on Trees and Networks
- Spectral redemption in clustering sparse networks
- Global and Local Information in Clustering Labeled Block Models.
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Exact Recovery in the Stochastic Block Model
- Mixed membership stochastic blockmodels
- The small-world phenomenon
- Graph Partitioning via Adaptive Spectral Techniques
- Locality in Distributed Graph Algorithms
- Proof of the Achievability Conjectures for the General Stochastic Block Model
- Asymptotic mutual information for the balanced binary stochastic block model
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Community detection thresholds and the weak Ramanujan property
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- A Limit Theorem for Multidimensional Galton-Watson Processes
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- Limits of local algorithms over sparse random graphs
- Introduction to nonparametric estimation
