Transport-Entropy Inequalities and Curvature in Discrete-Space Markov Chains
From MaRDI portal
Publication:4604383
DOI10.1007/978-3-319-44479-6_16zbMath1391.60173arXiv1604.06859MaRDI QIDQ4604383
Joseph Lehec, Ronen Eldan, James R. Lee
Publication date: 26 February 2018
Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06859
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C12: Distance in graphs
Related Items
Coverings and the heat equation on graphs: Stochastic incompleteness, the Feller property, and uniform transience, Heat flow and concentration of measure on directed graphs with a lower Ricci curvature bound, Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations, On mixing of Markov chains: coupling, spectral independence, and entropy factorization, Quantum concentration inequalities, Sparse expanders have negative curvature
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation formula for the entropy and functional inequalities
- A survey of the Schrödinger problem and some of its connections with optimal transport
- Ricci curvature of Markov chains on metric spaces
- Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
- Transportation cost-information inequalities and applications to random dynamical systems and diffusions.
- Curvature and transport inequalities for Markov chains in discrete spaces
- Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration
- Mathematical Aspects of Mixing Times in Markov Chains
- Analysis and Geometry of Markov Diffusion Operators
- Optimal Transport
