𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coupling and mixing times in a Markov chain

✍ Scribed by Jeffrey J. Hunter

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
427 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Variances of first passage times in a Ma
Variances of first passage times in a Markov chain with applications to mixing times
✍ Jeffrey J. Hunter πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 766 KB

In an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains, Linear Algebra Appl. 417 (2006) 108-123] the author introduced the statistic Ξ· i = m j =1 m ij Ο€ j as a measure of the "mixing time" or "time to stationarity" in a finite irreducible discrete time Markov cha

Fastest expected time to mixing for a Ma
Fastest expected time to mixing for a Markov chain on a directed graph
✍ Steve Kirkland πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 215 KB

For an irreducible stochastic matrix T, the Kemeny constant K(T) measures the expected time to mixing of the Markov chain corresponding to T. Given a strongly connected directed graph D, we consider the set Ξ£ D of stochastic matrices whose directed graph is subordinate to D, and compute the minimum

A more rapidly mixing Markov chain for g
A more rapidly mixing Markov chain for graph colorings
✍ Martin Dyer; Catherine Greenhill πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 351 KB πŸ‘ 2 views

We define a new Markov chain on proper k-colorings of graphs, and relate its convergence properties to the maximum degree ⌬ of the graph. The chain is shown to have bounds on convergence time appreciably better than those for the well-known JerrumrSalas᎐Sokal chain in most circumstances. For the cas