Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems
DOI10.1007/s00220-023-04851-1zbMath1526.05102arXiv2005.05444MaRDI QIDQ6067735
Publication date: 17 November 2023
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05444
Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An order-preserving linear map from matrices to Banach \(\ast\)-algebras and applications
- Reconstruction and estimation in the planted partition model
- Reconstruction for the Potts model
- Random walks and percolation on trees
- On the purity of the free boundary condition Potts measure on random trees
- Reconstruction of random colourings
- Reconstruction on trees and spin glass transition
- Modified logarithmic Sobolev inequalities in discrete settings
- A symmetric entropy bound on the non-reconstruction regime of Markov chains on Galton-Watson trees
- Spreading of sets in product spaces and hypercontraction of the Markov operator
- A note on the edges of the n-cube
- Equivalence of certain entropy contraction coefficients
- Information flow on trees
- On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
- Information-theoretic thresholds from the cavity method
- A proof of the block model threshold conjecture
- Broadcasting on trees and the Ising model.
- Application of the information-percolation method to reconstruction problems on graphs
- Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels
- Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
- On reverse hypercontractivity
- Strong data-processing inequalities for channels and Bayesian networks
- Modified logarithmic Sobolev inequalities for some models of random walk
- Logarithmic Sobolev inequalities for finite Markov chains
- Strong Data Processing Inequalities and <inline-formula> <tex-math notation="LaTeX">$\Phi $ </tex-math> </inline-formula>-Sobolev Inequalities for Discrete Channels
- Reconstruction for Colorings on Trees
- On measures of dependence
- Reconstruction Threshold for the Hardcore Model
- Logarithmic Sobolev Inequalities
- Assignment of Numbers to Vertices
- Signal propagation and noisy circuits
- Comparison of Channels: Criteria for Domination by a Symmetric Channel
- A theorem on the entropy of certain binary sequences and applications--I
- Strong Data Processing Constant Is Achieved by Binary Inputs
- Communication complexity of estimating correlations
- Community detection thresholds and the weak Ramanujan property
- Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
- Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees
- Communication lower bounds for statistical estimation problems via a distributed data processing inequality
- Fast mixing for independent sets, colorings, and other models on trees
- Maximally Connected Arrays on the n-Cube
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- Optimal Assignments of Numbers to Vertices
- Community detection and percolation of information in a geometric setting
This page was built for publication: Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems
