Mixing Times of Markov Chains of 2-Orientations

DOI10.1007/978-3-319-30139-6_10zbMath1478.60197OpenAlexW2477386835MaRDI QIDQ2803817

Daniel Heldt, Stefan Felsner

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_10

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of planar orientations with prescribed degrees
• Sampling Eulerian orientations of triangular lattice graphs
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Comparison theorems for reversible Markov chains
• Generating random elements of finite distributive lattices
• Lattice structures from planar graphs
• Bijections for Baxter families and related objects
• Analyzing Glauber dynamics by comparison of Markov chains
• Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• ULD-Lattices and Δ-Bonds
• Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids
• A more rapidly mixing Markov chain for graph colorings
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• On topological aspects of orientations

This page was built for publication: Mixing Times of Markov Chains of 2-Orientations