Abstract
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 Sturm-Lott-Villani theory of Ricci curvature bounds on measured length spaces, we then study the convexity of the entropy functional along such interpolations. Explicit results are given in three canonical cases, when the graph G is either ℤn, a cube or a tree.
Similar content being viewed by others
References
Gozlan, N., Roberto, C., Samson, P.M., Tetali, P.: Displacement convexity of entropy and related inequalities on graphs. Probab. Theory Relat. Fields (2014)
Harremoës, P., Johnson, O., Kontoyiannis, I.: Thinning and the law of small numbers. In: IEEE International Symposium on Information Theory, 2007. ISIT 2007, pp. 1491–1495. IEEE (2007)
Hillion, E., Johnson, O., Yu, Y.: Translations of probability measures on ℤ
Léonard, C.: From the Schrödinger problem to the Monge–Kantorovich problem. J. Funct. Anal. (2011)
Lott, J., Villani, C.: Ricci curvature for metric-measure spaces via optimal transport. Ann. Math. 169, 903–991
Ohta, S.: On the measure contraction property of metric measure spaces. Commentarii Mathematici Helvetici 82(4), 805–828 (2007)
Rényi, A.: A characterization of poisson processes. Magyar Tud. Akad. Mat. Kutató. Int. Közl 1, 519–527 (1956)
Sturm, K.T.: On the geometry of metric measure spaces I. Acta Math. 196(1), 65–131 (2006)
Sturm, K.T.: On the geometry of metric measure spaces II. Acta Math. 196(1), 133–177 (2006)
Villani, C.: Topics in optimal transportation, vol. 58. Amer Mathematical Society (2003)
Villani, C.: Optimal transport: old and new, vol. 338. Springer, Berlin (2009)
Yu, Y., Johnson, O.: Concavity of entropy under thinning. In: IEEE International Symposium on Information Theory, 2009. ISIT 2009, pp. 144–148. IEEE (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hillion, E. Contraction of Measures on Graphs. Potential Anal 41, 679–698 (2014). https://doi.org/10.1007/s11118-014-9388-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11118-014-9388-7