Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions
- Cite this paper as:
- Martin R.A., Randall D. (1999) Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions. In: Hochbaum D.S., Jansen K., Rolim J.D.P., Sinclair A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg
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  and triangulations , while an algorithm which successively calculates ratios of determinants has led to a very fast method for sampling fixed routings . We extend Wilson’s determinant algorithm  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  and a method of Colbourn, Myrvold and Neufeld  for efficiently calculating ratios of determinants. As an application, we show how to sample tilings on planar lattice regions with free boundary conditions.
Unable to display preview. Download preview PDF.