Sampling Eulerian orientations of triangular lattice graphs

DOI10.1016/j.jda.2008.09.006zbMath1184.05119MaRDI QIDQ1026226

Páidí Creed

Publication date: 24 June 2009

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

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

zbMATH Keywords

Markov chain Monte Carlo; Eulerian orientations; randomised algorithms; rapid mixing; torpid mixing

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

Related Items

Path coupling without contraction, Mixing Times of Markov Chains of 2-Orientations, Sampling and Counting 3-Orientations of Planar Triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Archimedean ice
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Comparison theorems for reversible Markov chains
• Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
• Lattice structures from planar graphs
• On the number of Eulerian orientations of a graph
• Path coupling without contraction
• Analyzing Glauber dynamics by comparison of Markov chains
• Markov Chain Algorithms for Planar Lattice Structures
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Approximating the Permanent
• Path coupling using stopping times and counting independent sets and colorings in hypergraphs
• On the Number of α-Orientations
• Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
• Random sampling of 3‐colorings in ℤ²