• Bernoulli
  • Volume 24, Number 1 (2018), 672-698.

Curvature and transport inequalities for Markov chains in discrete spaces

Max Fathi and Yan Shu

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We study various transport-information inequalities under three different notions of Ricci curvature in the discrete setting: the curvature-dimension condition of Bakry and Émery (In Séminaire de Probabilités, XIX, 1983/84 (1985) 177–206 Springer), the exponential curvature-dimension condition of Bauer et al. (Li-Yau Inequality on Graphs (2013)) and the coarse Ricci curvature of Ollivier (J. Funct. Anal. 256 (2009) 810–864). We prove that under a curvature-dimension condition or coarse Ricci curvature condition, an $L_{1}$ transport-information inequality holds; while under an exponential curvature-dimension condition, some weak-transport information inequalities hold. As an application, we establish a Bonnet–Myers theorem under the curvature-dimension condition $\operatorname{CD}(\kappa,\infty)$ of Bakry and Émery (In Séminaire de Probabilités, XIX, 1983/84 (1985) 177–206 Springer).

Article information

Bernoulli, Volume 24, Number 1 (2018), 672-698.

Received: October 2015
Revised: July 2016
First available in Project Euclid: 27 July 2017

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

curvature discrete spaces functional inequalities Markov chains optimal transport


Fathi, Max; Shu, Yan. Curvature and transport inequalities for Markov chains in discrete spaces. Bernoulli 24 (2018), no. 1, 672--698. doi:10.3150/16-BEJ892.

Export citation


  • [1] Ambrosio, L., Gigli, N. and Savaré, G. (2015). Bakry–Émery curvature-dimension condition and Riemannian Ricci curvature bounds. Ann. Probab. 43 339–404.
  • [2] Ané, C., Blachère, S., Chafaï, D., Fougères, P., Gentil, I., Malrieu, F., Roberto, C. and Scheffer, G. (2000). Sur les Inégalités de Sobolev Logarithmiques. Panoramas et Synthèses [Panoramas and Syntheses] 10. Paris: Société Mathématique de France.
  • [3] Bakry, D. and Émery, M. (1985). Diffusions hypercontractives. In Séminaire de Probabilités, XIX, 1983/84. Lecture Notes in Math. 1123 177–206. Berlin: Springer.
  • [4] Bakry, D., Gentil, I. and Ledoux, M. (2014). Analysis and Geometry of Markov Diffusion Operators. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 348. Cham: Springer.
  • [5] Bauer, F., Horn, P., Lin, Y., Lippner, G., Mangoubi, D. and Yau, S.-T. (2013). Li-Yau inequality on graphs. J. Differential Geom. 99 359–405.
  • [6] Bauer, F., Lin, Y., Liu, S. and Yau, S.-T. (2014). Volume doubling, Poincaré inequality and Gaussian heat kernel estimate for nonnegative curvature graphs.
  • [7] Bobkov, S.G. and Tetali, P. (2006). Modified logarithmic Sobolev inequalities in discrete settings. J. Theoret. Probab. 19 289–336.
  • [8] Bonciocat, A.-I. and Sturm, K.-T. (2009). Mass transportation and rough curvature bounds for discrete spaces. J. Funct. Anal. 256 2944–2966.
  • [9] Bubley, R. and Dyer, M.E. (1997). Path coupling: A technique for proving rapid mixing in Markov chains. In 38th Annual Symposium on Foundations of Computer Science, FOCS97 223–231. Florida, USA: Miami Beach.
  • [10] Chung, F., Lin, Y. and Yau, S.-T. (2014). Harnack inequalities for graphs with non-negative Ricci curvature. J. Math. Anal. Appl. 415 25–32.
  • [11] Costello, K., Gozlan, N., Melbourne, J., Perkins, W., Roberto, C., Samson, P.-M., Shu, Y. and Tetali, P. Discrete Ricci curvature and functional inequalities, on graphs. In preparation.
  • [12] Dobrušin, R.L. (1970). Definition of a system of random variables by means of conditional distributions. Teor. Verojatnost. i Primenen. 15 469–497.
  • [13] Eldan, R., Lee, J. and Lehec, J. (2016). Transport-entropy inequalities and curvature in discrete-space Markov chains. Preprint. Available at arXiv:1604.06859.
  • [14] Erbar, M. and Maas, J. (2012). Ricci curvature of finite Markov chains via convexity of the entropy. Arch. Ration. Mech. Anal. 206 997–1038.
  • [15] Gozlan, N. (2009). A characterization of dimension free concentration in terms of transportation inequalities. Ann. Probab. 37 2480–2498.
  • [16] Gozlan, N., Roberto, C. and Samson, P.-M. (2014). Hamilton–Jacobi equations on metric spaces and transport entropy inequalities. Rev. Mat. Iberoam. 30 133–163.
  • [17] Gozlan, N., Roberto, C., Samson, P.-M. and Tetali, P. (2014). Displacement convexity of entropy and related inequalities on graphs. Probab. Theory Related Fields 160 47–94.
  • [18] Gozlan, N., Roberto, C., Samson, P.-M. and Tetali, P. (2015). Kantorovich duality for general costs and applications. Preprint. Available at arXiv:1412.7480.
  • [19] Guillin, A. and Joulin, A. (2013). Measure concentration through non-Lipschitz observables and functional inequalities. Electron. J. Probab. 18 no. 65, 26.
  • [20] Guillin, A., Léonard, C., Wang, F.-Y. and Wu, L. (2009). Transportation-information inequalities for Markov processes (II): Relations with other functional inequalities. Unpublished note.
  • [21] Guillin, A., Léonard, C., Wu, L. and Yao, N. (2009). Transportation-information inequalities for Markov processes. Probab. Theory Related Fields 144 669–695.
  • [22] Johnson, O. (2015). A discrete log-Sobolev inequality under a Bakry–Émery type condition. Ann. I.H.P. Probab. Stat. To appear.
  • [23] Jost, J. and Liu, S. (2014). Ollivier’s Ricci curvature, local clustering and curvature-dimension inequalities on graphs. Discrete Comput. Geom. 51 300–322.
  • [24] Joulin, A. (2007). Poisson-type deviation inequalities for curved continuous-time Markov chains. Bernoulli 13 782–798.
  • [25] Joulin, A. and Ollivier, Y. (2010). Curvature, concentration and error estimates for Markov chain Monte Carlo. Ann. Probab. 38 2418–2442.
  • [26] Klartag, B., Kozma, G., Ralli, P. and Tetali, P. (2016). Discrete curvature and Abelian groups. Canad. J. Math. 68 655–674.
  • [27] Ledoux, M. (2001). The Concentration of Measure Phenomenon. Mathematical Surveys and Monographs 89. Providence, RI: Amer. Math. Soc.
  • [28] Léonard, C. (2013). On the convexity of the entropy along entropic interpolations. Preprint.
  • [29] Lin, Y. and Yau, S.-T. (2010). Ricci curvature and eigenvalue estimate on locally finite graphs. Math. Res. Lett. 17 343–356.
  • [30] Lott, J. and Villani, C. (2009). Ricci curvature for metric-measure spaces via optimal transport. Ann. of Math. (2) 169 903–991.
  • [31] Luczak, M.J. (2008). Concentration of measure and mixing for Markov chains. In Fifth Colloquium on Mathematics and Computer Science. Discrete Math. Theor. Comput. Sci. Proc., AI 95–120. Nancy: Assoc. Discrete Math. Theor. Comput. Sci.
  • [32] Maas, J. (2011). Gradient flows of the entropy for finite Markov chains. J. Funct. Anal. 261 2250–2292.
  • [33] Marton, K. (1996). Bounding $\overline{d}$-distance by informational divergence: A method to prove measure concentration. Ann. Probab. 24 857–866.
  • [34] Mielke, A. (2013). Geodesic convexity of the relative entropy in reversible Markov chains. Calc. Var. Partial Differential Equations 48 1–31.
  • [35] Munch, F. (2015). Remarks on curvature dimension conditions on graphs. Preprint.
  • [36] Oliveira, R.I. (2009). On the convergence to equilibrium of Kac’s random walk on matrices. Ann. Appl. Probab. 19 1200–1231.
  • [37] Ollivier, Y. (2009). Ricci curvature of Markov chains on metric spaces. J. Funct. Anal. 256 810–864.
  • [38] Ollivier, Y. (2010). A survey of Ricci curvature for metric spaces and Markov chains. In Probabilistic Approach to Geometry. Adv. Stud. Pure Math. 57 343–381. Tokyo: Math. Soc. Japan.
  • [39] Otto, F. and Villani, C. (2000). Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality. J. Funct. Anal. 173 361–400.
  • [40] Sammer, M.D. (2005). Aspects of mass transportation in discrete concentration inequalities. Ph.D. thesis, Georgia Institute of Technology.
  • [41] Schmuckenschläger, M. (1999). Curvature of nonlocal Markov generators. In Convex Geometric Analysis (Berkeley, CA, 1996). Math. Sci. Res. Inst. Publ. 34 189–197. Cambridge: Cambridge Univ. Press.
  • [42] Shu, Y. (2014). Hamilton–Jacobi equations on graphs and applications. Preprint hal-01097744.
  • [43] Sturm, K.-T. (2006). On the geometry of metric measure spaces. I. Acta Math. 196 65–131.
  • [44] Talagrand, M. (1996). Transportation cost for Gaussian and other product measures. Geom. Funct. Anal. 6 587–600.
  • [45] Villani, C. (2009). Optimal Transport, Old and New. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 338. Berlin: Springer.