𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Slow Mixing of Markov Chains Using Fault Lines and

✍ Scribed by Sam Greenberg; Dana Randall

Publisher
Springer
Year
2008
Tongue
English
Weight
510 KB
Volume
58
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A semidefinite bound for mixing rates of
A semidefinite bound for mixing rates of Markov chains
✍ Nabil Kahale πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 214 KB πŸ‘ 2 views

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

Quantitative evaluation of thin-layer ch
Quantitative evaluation of thin-layer chromatograms. 5. Calculation of reflectance and transmission using Markov chains
✍ ProΕ‘ek, M. ;Medja, A. ;Kučan, E. ;Katič, M. ;Bano, M. πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

## Abstract Changes of reflected and transmitted light in cases where a band lies in different sublayers of a thin‐layer chromatogram are calculated by the use of Markov chains. The problem of a β€œrandom walk with absorbing barriers” is described and compared with the problem of transmission and ref