### - Art Gallery -

In the mathematical theory of random processes, the Markov chain central limit theorem has a conclusion somewhat similar in form to that of the classic central limit theorem (CLT) of probability theory, but the quantity in the role taken by the variance in the classic CLT has a more complicated definition.

Statement

Suppose that:

the sequence $${\textstyle X_{1},X_{2},X_{3},\ldots }$$ of random elements of some set is a Markov chain that has a stationary probability distribution; and
the initial distribution of the process, i.e. the distribution of $${\textstyle X_{1}}$$, is the stationary distribution, so that $${\textstyle X_{1},X_{2},X_{3},\ldots }$$ are identically distributed. In the classic central limit theorem these random variables would be assumed to be independent, but here we have only the weaker assumption that the process has the Markov property; and
$${\textstyle g}$$ is some (measurable) real-valued function for which $${\textstyle \operatorname {var} (g(X_{1}))<+\infty .}$$

Now let

{\displaystyle {\begin{aligned}\mu &=\operatorname {E} (g(X_{1})),\\\sigma ^{2}&=\operatorname {var} (g(X_{1}))+2\sum _{k=1}^{\infty }\operatorname {cov} (g(X_{1}),g(X_{1+k})),\\{\widehat {\mu }}_{n}&={\frac {1}{n}}\sum _{k=1}^{n}g(X_{k}).\end{aligned}}}

Then as $${\textstyle n\to \infty ,}$$ we have[1]

$${\displaystyle {\hat {\mu }}_{n}\approx \operatorname {Normal} \left(\mu ,{\frac {\sigma ^{2}}{n}}\right),}$$

or more precisely,

$${\displaystyle {\sqrt {n}}({\hat {\mu }}_{n}-\mu )\ {\xrightarrow {\mathcal {D}}}\ {\text{Normal}}(0,\sigma ^{2}),}$$

where the decorated arrow indicates convergence in distribution.

Monte Carlo Setting

The Markov chain central limit theorem can be guaranteed for functionals of general state space Markov chains under certain conditions. In particular, this can be done with a focus on Monte Carlo settings. An example of the application in a MCMC (Markov Chain Monte Carlo) setting is the following:

Consider a simple hard-shell (also known as hard-core) model. Suppose X = {1, . . . , n 1 } × {1, . . . , n 2 } ⊆ Z 2 . A proper configuration on X consists of coloring each point either black or white in such a way that no two adjacent points are white. Let X denote the set of all proper configurations on X , N X (n 1 , n 2 ) be the total number of proper configurations and π be the uniform distribution on X so that each proper configuration is equally likely. Suppose our goal is to calculate the typical number of white points in a proper configuration; that is, if W (x) is the number of white points in x ∈ X then we want the value of

$${\displaystyle E_{\pi }W=\sum _{x\epsilon \mathrm {X} }={\frac {w{\bigl (}x{\bigr )}}{N_{\mathrm {X} }{\bigl (}n_{1},n_{2}{\bigr )}}}}$$

If n1 and n2 are even moderately large then we will have to resort to an approximation to E π W . Consider the following Markov chain on X. Fix p ∈ (0, 1) and set X 0 = x 0 where x 0 ∈ X is an arbitrary proper configuration. Randomly choose a point (x, y) ∈ X and independently draw U ∼ Uniform(0, 1). If u ≤ p and all of the adjacent points are black then color (x, y) white leaving all other points alone. Otherwise, color (x, y) black and leave all other points alone. Call the resulting configuration X 1 . Continuing in this fashion yields a Harris ergodic Markov chain {$$X_0 , X_1 , X_2$$ , . . .} having π as its invariant distribution. It is now a simple matter to estimate E π W with w̄ n . Also, since X is finite (albeit potentially large) it is well known that X will converge exponentially fast to π which implies that a CLT holds for w̄ n .

References

Geyer, Charles J. (2011). Introduction to Markov Chain Monte Carlo. In Handbook of MarkovChain Monte Carlo. Edited by S. P. Brooks, A. E. Gelman, G. L. Jones,and X. L. Meng. Chapman & Hall/CRC, Boca Raton, FL, Section 1.8. http://www.mcmchandbook.net/HandbookChapter1.pdf

Sources

Gordin, M. I. and Lifšic, B. A. (1978). "Central limit theorem for stationary Markov processes." Soviet Mathematics, Doklady, 19, 392–394. (English translation of Russian original).
Geyer, Charles J. (2011). "Introduction to MCMC." In Handbook of Markov Chain Monte Carlo, edited by S. P. Brooks, A. E. Gelman, G. L. Jones, and X. L. Meng. Chapman & Hall/CRC, Boca Raton, pp. 3–48.