Sampling Eulerian orientations of triangular lattice graphs
type: Item
instance of: scholarly article
title: Sampling Eulerian orientations of triangular lattice graphs
zbMATH Open document ID: 1184.05119
author: Páidí Creed
published in: Journal of Discrete Algorithms
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5569514
zbMATH Keywords: randomised algorithms
zbMATH Keywords: Markov chain Monte Carlo
zbMATH Keywords: rapid mixing
zbMATH Keywords: torpid mixing
zbMATH Keywords: Eulerian orientations
MaRDI profile type: Publication
full work available at URL: j.jda.2008.09.006
OpenAlex ID: W2039172412
cites work: Q3660628
cites work: Q3324796
cites work: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
cites work: Path coupling without contraction
cites work: Path coupling using stopping times and counting independent sets and colorings in hypergraphs
cites work: Q5501802
cites work: Comparison theorems for reversible Markov chains
cites work: Q4263659
cites work: Archimedean ice
cites work: Q3154703
cites work: Lattice structures from planar graphs
cites work: On the Number of α-Orientations
cites work: Random sampling of 3‐colorings in ℤ2
cites work: Q3669422
cites work: Approximating the Permanent
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: Markov chain algorithms for planar lattice structures
cites work: Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
cites work: On the number of Eulerian orientations of a graph
cites work: Analyzing Glauber dynamics by comparison of Markov chains
cites work: Approximate counting, uniform generation and rapidly mixing Markov chains
cites work: The complexity of counting in sparse, regular, and planar graphs
DOI: 10.1016/J.JDA.2008.09.006
Recommended article: Sampling and counting 3-orientations of planar triangulations
Recommended article: Counting and sampling orientations on chordal graphs
Recommended article: Sampling colourings of the triangular lattice
Recommended article: Q3154703
Recommended article: Sampling planar tanglegrams and pairs of disjoint triangulations
Recommended article: Random lattice triangulations: structure and algorithms
Recommended article: Random lattice triangulations
Recommended article: Sampling the eigenvalues of a graph
Recommended article: Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Recommended article: Sampling Edge Covers in 3-Regular Graphs
description: scientific article; zbMATH DE number 5569514