arXiv (All)
open access
Optimal State-Space Order for Spectral Gaps of Sliding-Window Occupation Counts
Let $P$ be an irreducible reversible Markov kernel on a $m$-state space $Ω$, and denote its right spectral gap $γ=1-λ_2(P)$. From a stationary trajectory, let $K_t$ be the occupation-count vector of the length-$n$ window beginning at time $t$. The stationary pair $(K_0,K_1)$ defines a reversible pro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds#178902
- ABC: Any-Subset Autoregression via Non-Markovian Diffusion Bridges in Continuous Time and Space#684440
- ABC: Any-Subset Autoregression via Non-Markovian Diffusion Bridges in Continuous Time and Space#682665
- Thresholds and Fluctuations for Colorful Arithmetic Progressions in Sparse Random Colorings#1084973
- Selection of Order of Observation in Optimal Stopping Problems#322177
Record · ID 1064380
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive