Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
From MaRDI portal
Markov Chain Monte Carlo methodscircuits in lattice graphscombinatorial sampling problemsstaircase walks
Convergence of probability measures (60B10) Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Applications of graph theory (05C90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Recommendations
Cited in
(10)- Mixing of permutations by biased transpositions
- scientific article; zbMATH DE number 1834641 (Why is no real title available?)
- New classes of degree sequences with fast mixing swap Markov chain sampling
- On irreducible denumerable continuous parameter circuit chains: Analysis of a generalized sample path case
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
- Approximate sampling and counting of graphs with near-regular degree intervals
- Mixing and hitting times for Gibbs samplers and other non-Feller processes
- Elementary bounds on mixing times for decomposable Markov chains
This page was built for publication: Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479034)
