Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs

Combinatorics, Probability & Computing, pp. 411-448, 2006.

Cited by: 19|Views5
EI

Abstract:

Markov chain decomposition is a tool for analysing the convergence rate of a complicated Markov chain by studying its behaviour on smaller, more manageable pieces of the state space. Roughly speaking, if a Markov chain converges quickly to equilibrium when restricted to subsets of the state space, and if there is sufficient ergodic flow b...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments