Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 144 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 428 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

A probabilistic approach to convex $(φ)$-entropy decay for Markov chains (2004.10850v2)

Published 22 Apr 2020 in math.PR

Abstract: We study the exponential dissipation of entropic functionals for continuous time Markov chains and the associated convex Sobolev inequalities, including MLSI and Beckner inequalities. We propose a method that combines the Bakry \'Emery approach and coupling arguments, which we use as a probabilistic alternative to the discrete Bochner identities. The method is well suited to work in a non perturbative setting and we obtain new estimates for interacting random walks beyond the high temperature/weak interaction regime. In this framework, we also show that the exponential contraction of the Wasserstein distance along the semigroup implies MLSI. We also revisit classical examples often obtaining new inequalities and sometimes improving on the best known constants. In particular, we analyse the zero range dynamics, hardcore and Bernoulli-Laplace models and the Glauber dynamics for the Curie Weiss and Ising model.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Questions

We haven't generated a list of open questions mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.