Related papers: Transport-entropy inequalities and curvature in di…

We study Markov chains with non-negative sectional curvature on finite metric spaces. Neither reversibility, nor the restriction to a particular combinatorial distance are imposed. In this level of generality, we prove that a 1-step…

We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…

Various properties of isoperimetric, functional, Transport-Entropy and concentration inequalities are studied on a Riemannian manifold equipped with a measure, whose generalized Ricci curvature is bounded from below. First, stability of…

The scope of this note is to make a self-contained survey of the recent developments and achievements of the theory of L1-Optimal Transportation on metric measure spaces. Among the results proved in the recent papers [20, 21] where the…

We study the exponential dissipation of entropic functionals for continuous time Markov chains and the associated convex Sobolev inequalities, including MLSI and Beckner inequalities. We propose a method that combines the Bakry \'Emery…

We define the Ricci curvature of Markov chains on metric spaces as a local contraction coefficient of the random walk acting on the space of probability measures equipped with a Wasserstein transportation distance. For Brownian motion on a…

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

We consider a new functional inequality controlling the rate of relative entropy decay for random walks, the interchange process and more general block-type dynamics for permutations. The inequality lies between the classical logarithmic…

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Following Talagrand's concentration results for permutations picked uniformly at random from a symmetric group [Tal95], Luczak and McDiarmid have generalized it to more general groups G of permutations which act suitably 'locally'. Here we…

Convexity properties of the entropy along displacement interpolations are crucial in the Lott-Sturm-Villani theory of lower bounded curvature of geodesic measure spaces. As discrete spaces fail to be geodesic, an alternate analogous theory…

We develop a theory of optimal transport for stationary random measures with a focus on stationary point processes and construct a family of distances on the set of stationary random measures. These induce a natural notion of interpolation…

We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…

This is the lecture notes on the interplay between optimal transport and Riemannian geometry. On a Riemannian manifold, the convexity of entropy along optimal transport in the space of probability measures characterizes lower bounds of the…

We relate transport-entropy inequalities to the study of critical points of functionals defined on the space of probability measures. This approach leads in particular to a new proof of a result by Otto and Villani [43] showing that the…

We develop transportation-entropy inequalities which are saturated for measures such that their log-density with respect to the background measure is an affine function, in the setting of the uniform measure on the discrete hypercube and…

We study functional inequalities for Markov chains on discrete spaces with entropic Ricci curvature bounded from below. Our main results are that when curvature is non-negative, but not necessarily positive, the spectral gap, the Cheeger…

We introduce a Laplacian separation principle for the the eikonal equation on Markov chains. As application, we prove an isoperimetric concentration inequality for Markov chains with non-negative Ollivier curvature. That is, every single…

We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and…

We continue our investigation on the transportation-information inequalities $W_pI$ for a symmetric markov process, introduced and studied in \cite{GLWY}. We prove that $W_pI$ implies the usual transportation inequalities $W_pH$, then the…