CLTs and asymptotic variance of time-sampled Markov chains
英文摘要:
For a Markov transition kernel $P$ and a probability distribution $ μ$ on nonnegative integers, a time-sampled Markov chain evolves according to the transition kernel $P_μ = \sum_k μ(k)P^k.$ In this note we obtain CLT conditions for time-sampled Markov chains and derive a spectral formula for the asymptotic variance. Using these results we compare efficiency of Barker's and Metropolis algorithms in terms of asymptotic variance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。