paper

Poincaré's Inequality on Sliding-Window Occupation Count Kernels and the Optimal Normalized Spectral-Gap Constant

arXiv:2609.27836

Abstract

Let be an irreducible reversible Markov kernel on an -state space , and denote its right spectral gap by $\Gap(P) =1-λ_2(P)$. For a stationary trajectory, let be the occupation-count vector of the length- window beginning at time . The stationary pair defines a reversible projected count kernel . For each fixed , define \[ c_m^\star= \inf_{\substack{|Ω|=m,\ P\ \mathrm{irreducible\ and\ reversible} n\ge2}} \frac{n\Gap(\widetilde P_n)}{\Gap(P)}. \] We prove \[ \frac1{1080m}\le c_m^\star\le q_{m-2}, \qquad q_0=\frac14,\quad q_{r+1}=q_r(1-q_r). \] We also show , which implies that . Thus, the reciprocal optimal comparison coefficient is of the order . In the two-state case, we determine the exact values and . %the exact constants for remain open. The lower bound also holds for and is uniform in , including sparse and periodic kernels. The proof combines short-window decorrelation with an averaged anchor-excursion decomposition, a Green-kernel hitting estimate, and a stopped Carleson--Hardy inequality. A nested rare-state construction produces finite -state witnesses whose normalized Rayleigh quotients approach through an ordered sequence of limits. For every fixed finite irreducible reversible aperiodic kernel on at least two states, $\Gap(\widetilde P_n)=Θ_P(n^{-1})$.

arXiv comment59 pages