Sampling Eulerian orientations of triangular lattice graphs

We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although Mihail and Winkler (1989) showed that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian graphs. We analyse the mixing time of a Markov chain on the Eulerian orientations of a planar graph which moves between orientations by reversing the edges of directed faces. Using path coupling and the comparison method we obtain a polynomial upper bound on the mixing time of this chain for any solid subgraph of the triangular lattice. By considering the conductance of the chain we show that there exist non-solid subgraphs (subgraphs with holes) for which the chain will always take an exponential amount of time to converge. Finally, we show that the problem of counting Eulerian orientations remains #P-complete when restricted to planar graphs (Mihail and Winkler had already established this for general graphs).

[1]  Stefan Felsner,et al.  Lattice Structures from Planar Graphs , 2004, Electron. J. Comb..

[2]  Martin E. Dyer,et al.  Stopping Times, Metrics and Approximate Counting , 2006, ICALP.

[3]  Leslie Ann Goldberg,et al.  Random sampling of 3-colorings in Z2 , 2004, Random Struct. Algorithms.

[4]  Catherine S. Greenhill,et al.  Surveys in Combinatorics, 1999: Random Walks on Combinatorial Objects , 1999 .

[5]  I. Goulden,et al.  Combinatorial Enumeration , 2004 .

[6]  R. Baxter.  Exactly solved models in statistical mechanics , 1982 .

[7]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[8]  Leslie Ann Goldberg,et al.  Random sampling of 3-colorings in Z 2 , 2004 .

[9]  Martin E. Dyer,et al.  Path coupling without contraction , 2007, J. Discrete Algorithms.

[10]  Archimedean Ice , 2009, 0909.4007.

[11]  R. J. Baxter,et al.  F Model on a Triangular Lattice , 1969 .

[12]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[13]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[14]  Eric Vigoda,et al.  Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings , 2005, J. Discrete Algorithms.

[15]  Stefan Felsner,et al.  On the Number of α-Orientations , 2007 .

[17]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[18]  Dana Randall,et al.  Markov chain algorithms for planar lattice structures , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[19]  P. Diaconis,et al.  COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .

[20]  Martin E. Dyer,et al.  Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[21]  Peter Winkler,et al.  On the number of Eulerian orientations of a graph , 2005, Algorithmica.

[22]  Eric Vigoda,et al.  Accelerating simulated annealing for the permanent and combinatorial counting problems , 2006, SODA '06.

[23]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[24]  Dana Randall,et al.  Analyzing Glauber Dynamics by Comparison of Markov Chains , 1998, LATIN.

[25]  Marek Karpinski,et al.  Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs , 2005, Electron. Colloquium Comput. Complex..

[26]  P. Flajolet.  On approximate counting , 1982 .