Sampling and Counting 3-Orientations of Planar Triangulations

Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a Schnyder wood that has proven powerful for various computing and combinatorics applications. We consider natural Markov chains for sampling uniformly from the set of 3-orientations. First, we study a “triangle-reversing” chain on the space of 3-orientations of a fixed triangulation that reverses the orientation of the edges around a triangle in each move. We show that, when restricted to planar triangulations of maximum degree six, this Markov chain is rapidly mixing and we can approximately count 3-orientations. Next, we construct a triangulation with high degree on which this Markov chain mixes slowly. Finally, we consider an “edge-flipping” chain on the larger state space consisting of 3-orientations of all planar triangulations on a fixed number of vertices. We prove that this chain is always rapidly mixing.

[1]  Martin E. Dyer,et al.  A more rapidly mixing Markov chain for graph colorings , 1998, Random Struct. Algorithms.

[2]  Elchanan Mossel,et al.  Mixing times of the biased card shuffling and the asymmetric exclusion process , 2002, math/0207199.

[3]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[4]  Nicolas Bonichon,et al.  Watermelon uniform random generation with applications , 2003, Theor. Comput. Sci..

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

[6]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[7]  Peter Winkler,et al.  On the number of Eulerian orientations of a graph , 1996 .

[8]  Dana Randall,et al.  Markov Chain Algorithms for Planar Lattice Structures , 2001, SIAM J. Comput..

[9]  Dana Randall,et al.  Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations , 2013, SODA.

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

[11]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.

[12]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

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

[14]  H. de Fraysseix,et al.  On topological aspects of orientations , 2001, Discret. Math..

[15]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[16]  Dana Randall,et al.  Slow Mixing of Markov Chains Using Fault Lines and Fat Contours , 2010, Algorithmica.

[17]  V. Vazirani,et al.  Accelerating simulated annealing for the permanent and combinatorial counting problems , 2006, SODA 2006.

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

[19]  D. Wilson.  Mixing times of lozenge tiling and card shuffling Markov chains , 2001, math/0102193.

[20]  Bruce A. Reed,et al.  On the mixing rate of the triangulation walk , 1997, Randomization Methods in Algorithm Design.

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

[22]  Stefan Felsner,et al.  On the Number of Planar Orientations with Prescribed Degrees , 2008, Electron. J. Comb..

[23]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[24]  Stefan Felsner,et al.  Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.

[25]  Páidí Creed.  Sampling Eulerian orientations of triangular lattice graphs , 2009, J. Discrete Algorithms.

[26]  Stefan Felsner,et al.  Geometric Graphs and Arrangements , 2004 .

[27]  Yi-Ting Chiang,et al.  Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[28]  Nicolas Bonichon,et al.  A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths , 2005, Discret. Math..

[29]  Nicolas Bonichon,et al.  Wagner's Theorem on Realizers , 2002, ICALP.

[30]  Dana Randall,et al.  Mixing times of Markov chains on 3-Orientations of Planar Triangulations , 2012 .

[31]  Dana Randall,et al.  Torpid mixing of simulated tempering on the Potts model , 2004, SODA '04.

[32]  Prasad Tetali,et al.  On the mixing time of the triangulation walk and other Catalan structures , 1997, Randomization Methods in Algorithm Design.

[33]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[34]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.