Hypocoercivity in Discrete Time Markov Chains

• Hypocoercivity is characterized by uniform exponential convergence to equilibrium in non-reversible, discrete time Markov chains via operator splittings and projections onto mean-zero subspaces.
• The framework leverages spectral properties, similarity transforms, and, when necessary, Jordan block analysis to establish explicit mixing rates and exponential decay bounds.
• Practical implementations include non-reversible random walks and discrete kinetic schemes, where explicit hypocoercivity constants provide sharp non-asymptotic estimates for convergence and χ²-divergence.

The hypocoercivity phenomenon for discrete time Markov chains refers to uniform exponential convergence to equilibrium for a large class of non-reversible, discrete time stochastic processes, even in the absence of classical detailed-balance (i.e., non-selfadjointness of the transition operator). This concept generalizes spectral gap–based “coercivity” to operator splittings where neither part is coercive, originating in kinetic theory and extended here to finite Markov chains, time-discrete kinetic equations, and general linear dynamical systems. The foundational results are operator-theoretic, leveraging spectral properties, similarity transforms, and explicit control of non-reversible dynamics via projections onto mean-zero subspaces in weighted $\ell^2(\pi)$ spaces.

1. Operator-Theoretic Framework and Mean-Zero Subspace

Let $P\in\mathbb{R}^{n\times n}$ be the stochastic, irreducible, aperiodic transition matrix of a Markov chain on finite state space $X$ with stationary law $\pi=(\pi_1, \ldots, \pi_n)>0$. The natural Hilbert space is

$$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$

with inner product $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$.

The central tool is the orthogonal projection

$U_{\perp 1} := I - 1 \pi^T,$

which projects onto the mean-zero subspace $$V_{\perp 1} = \{f \in \ell^2(\pi): \langle f,1 \rangle_\pi = 0\}$$. This leads to the projected transition operator $PU_{\perp 1}$, acting on $V_{\perp 1}$, which governs convergence to equilibrium: $P\in\mathbb{R}^{n\times n}$0 Hence, the decay $P\in\mathbb{R}^{n\times n}$1 is controlled by the norm $P\in\mathbb{R}^{n\times n}$2. This operator commutes with $P\in\mathbb{R}^{n\times n}$3 and is the focus for quantitative analysis.

2. Hypocoercivity in the Diagonalizable Case

Assume that $P\in\mathbb{R}^{n\times n}$4 is diagonalizable on $P\in\mathbb{R}^{n\times n}$5. There exist $P\in\mathbb{R}^{n\times n}$6 and a diagonal $P\in\mathbb{R}^{n\times n}$7, with $P\in\mathbb{R}^{n\times n}$8, such that $P\in\mathbb{R}^{n\times n}$9, where $X$0 is the trivial eigenvalue and $X$1 are nontrivial. Define the operator condition number $X$2.

The discrete hypocoercivity estimate asserts: $X$3 where $X$4 and $X$5 is an explicit hypocoercivity constant.

Thus, for diagonalizable $X$6, one achieves a uniform, computable exponential bound on the convergence rate—exporting the exact concept of hypocoercivity from the continuous to discrete setting.

3. Non-Diagonalizable and General Hypocoercivity

If $X$7 is not diagonalizable, the spectral theory must account for Jordan block structure. The Jordan decomposition (after a suitable similarity via $X$8)

$X$9

involves $\pi=(\pi_1, \ldots, \pi_n)>0$0 block-diagonal with eigenvalues $\pi=(\pi_1, \ldots, \pi_n)>0$1, algebraic multiplicities $\pi=(\pi_1, \ldots, \pi_n)>0$2, geometric multiplicities $\pi=(\pi_1, \ldots, \pi_n)>0$3, and $\pi=(\pi_1, \ldots, \pi_n)>0$4.

Standard estimates yield, for $\pi=(\pi_1, \ldots, \pi_n)>0$5: $\pi=(\pi_1, \ldots, \pi_n)>0$6 The polynomial prefactors in $\pi=(\pi_1, \ldots, \pi_n)>0$7 reflect algebraic non-diagonalizability. Additionally, in control of $\pi=(\pi_1, \ldots, \pi_n)>0$8 convergence, the factor $\pi=(\pi_1, \ldots, \pi_n)>0$9 (for smallest stationary probability) appears, increasing the worst-case bound.

4. Quantitative Mixing, χ²-Divergence, and Submultiplicativity

Mixing to equilibrium is quantified through the pointwise and global $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$0-divergence: $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$1 The operator-theoretic approach establishes the submultiplicativity property: $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$2 where $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$3 is the second singular value. Globally,

$$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$4

Explicit checks on powers of $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$5—by spectral or numerical means—thus yield sharp, non-asymptotic mixing time estimates for any initial state, including non-reversible Markov chains.

5. Hypocontractivity, Discrete Indices, and Short-Time Plateau Phenomenon

The theory is supplemented and clarified by the concept of hypocontractivity from linear dynamical systems (Achleitner et al., 2022). For a (possibly non-symmetric) $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$6, after projecting onto mean-zero, the hypocoercivity/hypocontractivity index $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$7 is the minimal $$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$8 such that the iterated dissipation

$$\ell^2(\pi) = \left\{f:X\to\mathbb{R} \mid \|f\|_{\ell^2(\pi)}^2 = \sum_{i=1}^n \pi_i f(i)^2 < \infty\right\},$$9

is positive definite, with $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$0. This implies that $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$1 for $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$2, but $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$3, revealing a finite “plateau” of norm preservation followed by strict contraction and exponential decay. The drop is quantified by the smallest eigenvalue of $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$4 as

$$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$5

Efficient computation is via rank tests on controllability matrices. Concrete examples for non-reversible 3-state chains demonstrate this effect; e.g., for certain $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$6, $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$7 and first strict contraction occurs at $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$8.

6. Structure of Hypocoercivity for Discrete Kinetic Schemes

The explicit structure of hypocoercivity is illuminated in the context of discrete Fokker-Planck chains (Dujardin et al., 2018). Decompositions $$\langle f,g \rangle_\pi = \sum_{i=1}^n \pi_i f(i)g(i)$$9, with $U_{\perp 1} := I - 1 \pi^T,$0 coercive (“collision”) and $U_{\perp 1} := I - 1 \pi^T,$1 skew-adjoint (“transport”) and appropriate commutator control, enable the construction of modified discrete energies $U_{\perp 1} := I - 1 \pi^T,$2

$U_{\perp 1} := I - 1 \pi^T,$3

with shift $U_{\perp 1} := I - 1 \pi^T,$4, such that for suitable $U_{\perp 1} := I - 1 \pi^T,$5 and time step $U_{\perp 1} := I - 1 \pi^T,$6

$U_{\perp 1} := I - 1 \pi^T,$7

with $U_{\perp 1} := I - 1 \pi^T,$8 independent of discretization. The approach is robust: the same algebraic argument applies directly to general discrete Markov chains with analogous splitting and spectral gap properties, so long as a Poincaré-type inequality and relevant commutator identities are available.

7. Assumptions, Generalizations, and Limitations

The hypocoercivity framework for discrete time Markov chains applies to any finite, ergodic chain, regardless of reversibility. In the diagonalizable case, hypocoercivity constants $U_{\perp 1} := I - 1 \pi^T,$9 and $$V_{\perp 1} = \{f \in \ell^2(\pi): \langle f,1 \rangle_\pi = 0\}$$0 are explicit; in the general case, polynomial prefactors arise naturally from Jordan block structure. The theory has been shown to cover a wide class of non-reversible chains (notably, momentum-based samplers and non-reversible random walks), and produces the sharpest known mixing bounds without asymptotic approximations.

Limitations include the computational complexity of determining $$V_{\perp 1} = \{f \in \ell^2(\pi): \langle f,1 \rangle_\pi = 0\}$$1 (condition number of the similarity matrix), which may be mitigated by bounding via graph structure or pseudospectral estimates. Extending to countable or continuous states requires semigroup analogues and spectral calculus for infinite dimensions. Nevertheless, the foundational operator-theoretic approach, involving mean-zero projections and dissipation control, enables a unified and general methodology for non-asymptotic mixing and exponential convergence for discrete-time, non-reversible Markov chains. The interplay of spectral gap, non-selfadjointness, and cross-effects captured by commutators is now understood as a purely algebraic phenomenon, paralleling and extending Villani’s continuous-time hypocoercivity to the discrete-time, discrete-state setting.