Metraipolis › archive › dc_6f5c032dd1cd
Conditionally Resampled Sliding-Window Count Kernels: Spectral-Gap Bounds and Poincaré Inequalities — arXiv:2608.08678
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08678
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:02:48.819Z
- SHA-256 of the archived text
02449480325735da36cf77079dc8853381cea62a3fbf86f286c97d959c37598b- Stable URL of this page
https://metraipolis.com/documento/dc_6f5c032dd1cd
How to cite
Conditionally Resampled Sliding-Window Count Kernels: Spectral-Gap Bounds and Poincaré Inequalities — arXiv:2608.08678 — arXiv (en), https://arxiv.org/abs/2608.08678 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6f5c032dd1cd (Metraipolis archive dc_6f5c032dd1cd, sha256 02449480325735da36cf77079dc8853381cea62a3fbf86f286c97d959c37598b)
BibTeX
@misc{dc6f5c032dd1cd,
title = {Conditionally Resampled Sliding-Window Count Kernels: Spectral-Gap Bounds and Poincaré Inequalities — arXiv:2608.08678},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08678},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6f5c032dd1cd; sha256 02449480325735da36cf77079dc8853381cea62a3fbf86f286c97d959c37598b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08678. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the conditionally resampled sliding-window count kernel associated with the empirical counts of length-$n$ windows from a stationary finite-state reversible Markov chain. Although the resulting count process is generally not Markov, its stationary one-step conditional law defines a genuine Markov kernel. For every fixed strictly positive reversible kernel \(P\) on a finite state space, we present a Poincaré inequality for the induced count kernel $\tP_n$ of length $n$. In other words, we derive the lower bound of the spectral gap $\Gap(\tP_n)$ of $\tP_n$ as \[ \Gap(\tP_n)\ge \frac{c(P)}{n}, \] where \(c(P)>0\) depends only on \(P\). The proof combines a martingale oscillation inequality for the stationary path law with a direct comparison of coordinate oscillations to the Dirichlet form of the count kernel. A linear statistic of the count vector gives the matching \(O(1/n)\) upper bound, so for every fixed strictly positive reversible \(P\) one has \(\Gap(\tP_n)=\Theta_P(1/n)\). The resulting count-space Poincaré inequality yields a local-to-global variance bound for finite-window count statistics and, together with a general matrix-concentration principle, operator-norm concentration for matrix-valued empirical averages.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-11 in stat.ML).
Categorie arXiv: Statistics Theory (math.ST) ; Probability (math.PR); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2608.08678 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:01:32.156Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).