Application of the information-percolation method to reconstruction problems on graphs

DOI10.4171/MSL/10zbMath1439.05205arXiv1806.04195OpenAlexW3008067046MaRDI QIDQ2176072

Yanyan Li

Publication date: 4 May 2020

Published in: Mathematical Statistics and Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.04195

zbMATH Keywords

community detectiongroup synchronizationstrong data processing inequalitycorrelated recoveryinformation-percolation methodspiked Wigner model

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Information theory (general) (94A15) Communication theory (94A05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

An information-percolation bound for spin synchronization on general graphs ⋮ On the benefits of representation regularization in invariance based domain generalization ⋮ Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems ⋮ Combinatorial statistics and the sciences ⋮ On a nonhierarchical generalization of the perceptron GREM ⋮ On the computational tractability of statistical estimation on amenable graphs ⋮ Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstruction and estimation in the planted partition model
• The critical probability of bond percolation on the square lattice equals 1/2
• A proof of the block model threshold conjecture
• Broadcasting on trees and the Ising model.
• Group synchronization on grids
• Strong data-processing inequalities for channels and Bayesian networks
• Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
• An information-percolation bound for spin synchronization on general graphs
• Dissipation of Information in Channels With Input Constraints
• Modern Coding Theory
• Component behavior near the critical point of the random graph process
• Signal propagation and noisy circuits
• Asymptotic mutual information for the balanced binary stochastic block model
• Comparison of Channels: Criteria for Domination by a Symmetric Channel
• Elements of Information Theory

This page was built for publication: Application of the information-percolation method to reconstruction problems on graphs