Indexed metadata

Markov Chain CLTs: Resolving Open Problems

Austin Brown, Jeffrey S. Rosenthal, Quan Zhou

Source record

Source: arXiv

Published: Sep 7, 2026

arXiv: 2609.07819

Open original source ↗

Source abstract

Markov chain central limit theorems (CLTs) and their associated variances are very important for implementing Markov chain Monte Carlo algorithms among other applications. Häggström and Rosenthal (2007) presented various results regarding the equality of different formulae for this variance and also posed seven open problems. We resolve all seven in this paper. For stationary, ergodic and reversible chains, we prove that whenever the normalized partial sums satisfy a n\sqrt{n}-CLT, the variance limit is finite if the function is square-integrable, otherwise undefined. Moreover, failure of the n\sqrt{n}-CLT forces the normalized partial sums to be non-tight. We also show that Roberts' holding-probability condition precludes a CLT even without assuming reversibility or square-integrability. Finally, we develop a general principle that expresses Fourier coefficients as the autocovariances of an ergodic nonreversible Markov chain.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.