Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Entropy factorization via curvature (2407.13457v2)

Published 18 Jul 2024 in math.PR, math.CO, and math.FA

Abstract: We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy subadditivity and generalized Brascamp-Lieb inequalities, and provide a sharp modified log-Sobolev inequality for the Gibbs sampler of several particle systems in both continuous and discrete settings. The method allows us to obtain simple proofs of known results, as well as some new inequalities. We illustrate this through various applications, including discrete Gaussian free fields on arbitrary networks, the down-up walk on uniform $n$-sets, the uniform measure over permutations, and the uniform measure on the unit sphere in $\Rn$. Our method also yields a simple, coupling-based proof of the celebrated logarithmic Sobolev inequality for Langevin diffusions in a convex potential, which is one of the most emblematic applications of the Bakry-\'Emery criterion.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets