arXiv (All)
open access
On efficient estimates of the rate of convergence for Markov chains
The paper presents efficient approaches for evaluating convergence rate in total variation for finite and general linear Markov chains. The motivation for studying convergence rate in this metric is its usefulness in various limit theorems. For homogeneous Markov chains the goal is to compare severa
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
- Central Limit Theorems for Sample Fréchet Means of Manifold-Valued Markov Chains#1049002
- Markov Chain CLTs: Resolving Open Problems#984713
- Large deviations for reducible Markov chains#364128
- Mixing times of Markov chains : acceleration and cutoff in random environment#124521
- Second-order perturbation bounds for Gibbs samplers under strong spatial mixing#1071279
Record · ID 987561
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