Displacement convexity of entropy and related inequalities on graphs

@article{Gozlan2012DisplacementCO,
  title={Displacement convexity of entropy and related inequalities on graphs},
  author={Nathael Gozlan and Cyril Roberto and Paul-Marie Samson and Prasad Tetali},
  journal={Probability Theory and Related Fields},
  year={2012},
  volume={160},
  pages={47-94}
}
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 Prékopa-Leindler type inequalities, a Talagrand transport-entropy inequality, certain HWI type as well as log-Sobolev type inequalities in discrete settings. To illustrate through examples, we apply our results to the complete graph and to the hypercube for which our results are optimal… 

On the convexity of the entropy along entropic interpolations

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

Contraction of Measures on Graphs

Given a finitely supported probability measure μ on a connected graph G, we construct a family of probability measures interpolating the Dirac measure at some given point o ∈ G and μ. Inspired by

Contraction of Measures on Graphs

Given a finitely supported probability measure μ on a connected graph G, we construct a family of probability measures interpolating the Dirac measure at some given point o ∈ G and μ. Inspired by

A Remark on discrete Brunn-Minkowski type inequalities via transportation of measure

We give an alternative proof for discrete Brunn-Minkowski type inequalities, recently obtained by Halikias, Klartag and the author. This proof also implies stronger weighted versions of these

Weak transport inequalities and applications to exponential and oracle inequalities

We extend the dimension free Talagrand inequalities for convex distance using an extension of Marton’s weak transport to other metrics than the Hamming distance. We study the dual form of these weak

Transport inequalities for random point measures

Transport Proofs of some discrete variants of the Prékopa-Leindler inequality

We give a transport proof of a discrete version of the displacement convexity of entropy on integers (Z), and get, as a consequence, two discrete forms of the Prekopa-Leindler Inequality : the Four

The heat flow on metric random walk spaces

Hamilton-Jacobi Equations on Graph and Applications

This paper introduces a notion of gradient and an infimal-convolution operator that extend properties of solutions of Hamilton Jacobi equations to more general spaces, in particular to graphs. As a

References

SHOWING 1-10 OF 65 REFERENCES

Ricci Curvature of Finite Markov Chains via Convexity of the Entropy

We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott,

Generalization of an Inequality by Talagrand and Links with the Logarithmic Sobolev Inequality

Abstract We show that transport inequalities, similar to the one derived by M. Talagrand (1996, Geom. Funct. Anal. 6 , 587–600) for the Gaussian measure, are implied by logarithmic Sobolev

Contraction of Measures on Graphs

Given a finitely supported probability measure μ on a connected graph G, we construct a family of probability measures interpolating the Dirac measure at some given point o ∈ G and μ. Inspired by

On Modified Logarithmic Sobolev Inequalities for Bernoulli and Poisson Measures

We show that for any positive functionfon the discrete cube {0, 1}n,Entμnp(f)⩽pqEμnp1f|Df|2whereμnpis the product measure of the Bernoulli measure with probability of successp, as well as related

Gradient flows of the entropy for jump processes

A new transportation distance between probability measures that is built from a Levy jump kernel is introduced via a non-local variant of the Benamou-Brenier formula and it is shown that the entropy is convex along geodesics.

Concentration on the Discrete Torus Using Transportation

The sub-Gaussian constant of a graph arises naturally in bounding the moment-generating function of Lipschitz functions on the graph, with a given probability measure on the set of vertices, and an equivalent formulation using a transportation inequality, introduced by Bobkov and Götze is investigated here in depth, leading to a new way of bounding it.

Transport inequalities, gradient estimates, entropy and Ricci curvature

We present various characterizations of uniform lower bounds for the Ricci curvature of a smooth Riemannian manifold M in terms of convexity properties of the entropy (considered as a function on the

A Riemannian interpolation inequality à la Borell, Brascamp and Lieb

Abstract.A concavity estimate is derived for interpolations between L1(M) mass densities on a Riemannian manifold. The inequality sheds new light on the theorems of Prékopa, Leindler, Borell,
...