Retention Profiles and KL Contraction Bounds in Finite Markov Chains

Abstract

We study Kullback-Leibler (KL) contraction in finite Markov chains through a row-wise perspective. Evaluating the SDPI ratio at point masses yields a state-indexed retention profile r(x)=DKL(P(x,·)\|π)/(1/π(x)) and a localization ratio L(P)= rπ/M∈[0,1] (with M=x r(x), rπ=Eπr) that distinguishes localized from global contraction obstructions. Our main contributions are (i) a convexity-gap identity showing that the gap between the row-averaged divergence and DKL(μP\|π) equals the mutual information Iμ(X;Y), and a derived decomposition of the contraction ratio into entropy inflation and a mutual-information penalty; (ii) a Cheeger-type lower bound on M, tying the bottleneck geometry of P directly to the row-retention profile; (iii) an explicit construction proving that L(Pn) 0 does not force ηKL(Pn)/Mn 1, identifying cardinality of high-retention states (not their π-mass) as the decisive quantity. Alongside these, we record structural consequences, optimal Markov/reverse-Markov tail bounds for r, a Bhatia-Davis variance bound, two-sided spectral bounds with an explicit cubic correction, a KL/Pinsker mixing-time bound, and tensorization for product chains. We further show that L(P) is structurally decoupled from the spectral gap, the Cheeger constant, and the mixing time: every vertex-transitive chain satisfies L(P)=1 regardless of its mixing speed, and the empirical rank correlations between L(P) and these classical invariants on a diverse but limited test suite are essentially zero. The numerical experiments are exploratory and not used as evidence for a universal classification theorem.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…