Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques

Volume 1671 of the series Lecture Notes in Computer Science pp 257-268

Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions

  • Russell A. MartinAffiliated withSchool of Mathematics, Georgia Institute of Technology
  • , Dana RandallAffiliated withCollege of Computing and School of Mathematics, Georgia Institute of Technology

* Final gross prices may vary according to local VAT.

Get Access


Sets of non-intersecting, monotonic lattice paths, or fixed routings, provide a common representation for several combinatorial problems and have been the key element for designing sampling algorithms. Markov chain algorithms based on routings have led to efficient samplers for tilings, Eulerian orientations [8] and triangulations [9], while an algorithm which successively calculates ratios of determinants has led to a very fast method for sampling fixed routings [12]. We extend Wilson’s determinant algorithm [12] to sample free routings where the number of paths, as well as the endpoints, are allowed to vary. The algorithm is based on a technique due to Stembridge for counting free routings by calculating the Pfaffian of a suitable matrix [11] and a method of Colbourn, Myrvold and Neufeld [1] for efficiently calculating ratios of determinants. As an application, we show how to sample tilings on planar lattice regions with free boundary conditions.