Path coupling without contraction

DOI10.1016/j.jda.2006.04.001zbMath1137.60046OpenAlexW2028817978WikidataQ56323867 ScholiaQ56323867MaRDI QIDQ2457299

Magnus Bordewich, Martin Dyer

Publication date: 30 October 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.04.001

zbMATH Keywords

Markov chain Monte CarloMarkov chaincoupling

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov processes (60J99)

Related Items

On Sampling Simple Paths in Planar Graphs According to Their Lengths, Sparse expanders have negative curvature, Mixing time and expansion of non-negatively curved Markov chains, Randomly coloring random graphs, Matrix norms and rapid mixing for spin systems, Sampling Eulerian orientations of triangular lattice graphs

Cites Work

• Sampling Eulerian orientations of triangular lattice graphs
• Improved bounds for sampling colorings
• Markov Chain Algorithms for Planar Lattice Structures
• A more rapidly mixing Markov chain for graph colorings
• Random sampling of 3‐colorings in ℤ²
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• On Markov Chains for Independent Sets
• Probability and Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item