An information-percolation bound for spin synchronization on general graphs
DOI10.1214/19-AAP1523zbMath1461.62025arXiv1806.03227MaRDI QIDQ2657904
Enric Boix-Adserà, Emmanuel Abbe
Publication date: 18 March 2021
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.03227
synchronizationbond percolationinformation theorycommunity detectionstochastic block modelsspiked Wigner models
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Statistical aspects of information-theoretic topics (62B10)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Belief propagation, robust reconstruction and optimal recovery of block models
- Information-theoretic thresholds from the cavity method
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Broadcasting on trees and the Ising model.
- Application of the information-percolation method to reconstruction problems on graphs
- Statistical limits of spiked tensor models
- Group synchronization on grids
- Strong data-processing inequalities for channels and Bayesian networks
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
- Phase transitions in semidefinite relaxations
- Some inequalities satisfied by the quantities of information of Fisher and Shannon
- Mutual Information and Minimum Mean-Square Error in Gaussian Channels
- Percolation
- Community Detection and Stochastic Block Models
- Asymptotic mutual information for the balanced binary stochastic block model
- Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization
- A Limit Theorem for Multidimensional Galton-Watson Processes
This page was built for publication: An information-percolation bound for spin synchronization on general graphs
