Pith. sign in

REVIEW 1 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.17148 v2 pith:CHHQM2XP submitted 2024-01-30 math.PR math.COmath.DG

Entropy and curvature: beyond the Peres-Tetali conjecture

classification math.PR math.COmath.DG
keywords curvaturechainscontractiondistanceentropymlsiparticularprove
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study Markov chains with non-negative sectional curvature on finite metric spaces. Neither reversibility, nor the restriction to a particular combinatorial distance are imposed. In this level of generality, we prove that a 1-step contraction in the Wasserstein distance implies a 1-step contraction in relative entropy, by the same amount. Our result substantially strengthens a recent breakthrough of the second author, and has the advantage of being applicable to arbitrary scales. This leads to a time-varying refinement of the standard Modified Log-Sobolev Inequality (MLSI), which allows us to leverage the well-acknowledged fact that curvature improves at large scales. We illustrate this principle with several applications, including birth and death chains, colored exclusion processes, permutation walks, Gibbs samplers for high-temperature spin systems, and attractive zero-range dynamics. In particular, we prove a MLSI with constant equal to the minimal rate increment for the mean-field zero-range process, thereby answering a long-standing question.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Retention Profiles and KL Contraction Bounds in Finite Markov Chains

    math.PR 2026-06 unverdicted novelty 7.0

    Introduces retention profiles r(x) and localization ratio L(P) for row-wise KL contraction analysis in finite Markov chains, with convexity-gap identity equating divergence gap to mutual information and constructions ...