𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mean arrival times of sets for Markov chains

✍ Scribed by Yu. P. Filonov

Book ID
112470889
Publisher
Springer
Year
1989
Tongue
English
Weight
209 KB
Volume
41
Category
Article
ISSN
0041-5995

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Markov Chains for Independent Sets
On Markov Chains for Independent Sets
✍ Martin Dyer; Catherine Greenhill πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 219 KB

Random independent sets in graphs arise, for example, in statistical physics, in the hardcore model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for independent sets, which we refer to as the Luby᎐Vigoda chain. A new rapidly mixing Markov chain for independent sets is d

On mean recurrence times of Markov chain
On mean recurrence times of Markov chains and spanning tree invariants
✍ Ricardo GΓ³mez πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 141 KB

We show that the mean recurrence times of (countable state) irreducible and positively recurrent Markov chains are the spanning tree invariants of the first return loop systems. Then, by the Perron-Frobenius Theorem, the spanning tree invariants of the first return loop systems of a finite state Mar