Bounding spectral gaps of Markov chains: a novel exact multi-decomposition technique
نویسندگان
چکیده
منابع مشابه
Variance Bounding Markov Chains
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...
متن کامل-spectral gaps for time discrete reversible Markov chains
In this paper we study the spectral properties of Markov-operator on L -spaces. Lawler and Sokal (Trans. Amer. Math. Soc., 1988, 309, pp. 557-580) used isoperimetric constants for discrete and continuous time Markov chains to obtain a spectral gap at 1. For time discrete Markov chains this does not exclude periodic behavior. We define a new constant measuring the distance from periodicity and g...
متن کاملVariance Bounding Markov Chains 1203 Theorem
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L2 functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pes...
متن کاملVariance Bounding Markov Chains by Gareth
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...
متن کاملExact Sampling with Markov Chains
Random sampling has found numerous applications in computer science, statistics, and physics. The most widely applicable method of random sampling is to use a Markov chain whose steady state distribution is the probability distribution r from which we wish to sample. After the Markov chain has been run for long enough, its state is approximately distributed according to 7r. The principal proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2003
ISSN: 0305-4470
DOI: 10.1088/0305-4470/36/13/301