arXiv (All)
open access
Estimating MCMC convergence rates using common random number simulation
This paper presents how to use common random number (CRN) simulation to evaluate Markov chain Monte Carlo (MCMC) convergence to stationarity. We provide an upper bound on the Wasserstein distance of a Markov chain to its stationary distribution after $N$ steps in terms of averages over CRN simulatio
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
- Defining and Differentiating Repeatability in Monte Carlo Simulation Studies#663264
- Defining and Differentiating Repeatability in Monte Carlo Simulation Studies#660450
- Construction of cumulative mean bounds for simulation output#919731
- Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation#927067
- Optimistic Estimation of Convergence in Markov Chains with the Average-Mixing Time#1014456
Record · ID 996851
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