Concentration of Markov chains indexed by trees
From MaRDI portal
Publication:2157456
DOI10.1214/21-AIHP1224zbMath1492.60290OpenAlexW4287921378WikidataQ113240926 ScholiaQ113240926MaRDI QIDQ2157456
Publication date: 22 July 2022
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/21-aihp1224
Related Items (1)
Cites Work
- Gibbs measures and phase transitions.
- Ricci curvature of Markov chains on metric spaces
- Large deviations techniques and applications.
- Probabilistic methods for algorithmic discrete mathematics
- Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
- Markov chains indexed by trees
- Information flow on trees
- Broadcasting on trees and the Ising model.
- Concentration inequalities for polynomials of contracting Ising models
- Transportation and concentration inequalities for bifurcating Markov chains
- Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration
- Obtaining Measure Concentration from Markov Contraction
- Real Analysis and Probability
- Probability Inequalities for Sums of Bounded Random Variables
- Elements of Information Theory
This page was built for publication: Concentration of Markov chains indexed by trees
