Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
From MaRDI portal
circuits in lattice graphscombinatorial sampling problemsMarkov Chain Monte Carlo methodsstaircase walks
Applications of graph theory (05C90) Convergence of probability measures (60B10) Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40)
Recommendations
Cited in
(10)- Mixing and hitting times for Gibbs samplers and other non-Feller processes
- Mixing of permutations by biased transpositions
- Elementary bounds on mixing times for decomposable Markov chains
- New classes of degree sequences with fast mixing swap Markov chain sampling
- scientific article; zbMATH DE number 1834641 (Why is no real title available?)
- On irreducible denumerable continuous parameter circuit chains: Analysis of a generalized sample path case
- 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
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
- Approximate sampling and counting of graphs with near-regular degree intervals
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)
