Displacement convexity of entropy and related inequalities on graphs

Abstract : 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 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 -- by passing to the limit, we recover the classical log-Sobolev inequality for the standard Gaussian measure with the optimal constant.
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download

Contributor : Cyril Roberto <>
Submitted on : Saturday, July 21, 2012 - 9:34:23 AM
Last modification on : Wednesday, September 4, 2019 - 1:52:04 PM
Long-term archiving on : Monday, October 22, 2012 - 2:20:23 AM


Files produced by the author(s)



Nathaël Gozlan, Cyril Roberto, Paul-Marie Samson, Prasad Tetali. Displacement convexity of entropy and related inequalities on graphs. Probability Theory and Related Fields, Springer Verlag, 2014, Probability Theory and Related Fields, 160 (1), pp.47--94. ⟨10.1007/s00440-013-0523-y⟩. ⟨hal-00719848⟩



Record views


Files downloads