Lower Bounds of Mixing Rate for a Class of Markov Processes
โ Scribed by Klokov, S. A.
- Book ID
- 118219837
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2007
- Tongue
- English
- Weight
- 149 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0040-585X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We study general geometric techniques for bounding the spectral gap of a reversible Markov chain. We show that the best bound obtainable using these techniques can be computed in polynomial time via semidefinite programming, and is off by at most a factor of order log 2 n, where n is the number of s
A general Markov process with innovation is introduced and its properties are studied. Based on the structure of this process, one can develop an), autoregrsssive process of first order minification structure as a special case of this. A necessary and suificient condition for the general autoregress