Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs

DOI10.1017/S0963548305007352zbMath1103.65012OpenAlexW1996771179MaRDI QIDQ5479034

Dana Randall, Russell Martin

Publication date: 6 July 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007352

zbMATH Keywords

Markov Chain Monte Carlo methodscircuits in lattice graphscombinatorial sampling problemsstaircase walks

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Applications of graph theory (05C90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Numerical analysis or methods applied to Markov chains (65C40) Convergence of probability measures (60B10)

Related Items (7)

Elementary bounds on mixing times for decomposable Markov chains ⋮ Polynomial time approximate or perfect samplers for discretized Dirichlet distribution ⋮ Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Mixing and hitting times for Gibbs samplers and other non-Feller processes ⋮ Mixing of permutations by biased transpositions ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix

This page was built for publication: Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs