# Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions

• Russell A. Martin
• Dana Randall
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1671)

## Abstract

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.

## References

1. 1.
Colbourn, C.J., Myrvold, W.J., Neufeld, E.: Two algorithms for unranking arborescences. J. Algorithms 20, 268–281 (1996)
2. 2.
Gessel, I.M., Viennot, X.G.: Binomial determinants, paths, and hook length formulae. Advances in Mathematics 58, 300–321 (1985)
3. 3.
Gessel, I.M., Viennot, X.G.: Determinants, paths, and plane partitions (1989) (Preprint)Google Scholar
4. 4.
Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43, 169–188 (1986)
5. 5.
Jockusch, W., Propp, J., Shor, P.: Random domino tilings and the arctic circle theorem (1995) (Preprint)Google Scholar
6. 6.
Kenyon, R.: Local statistics of dimers on a lattice. Annates de I’Institut Henri Poincaré - Probabilitiés et Statistigues 33, 591–618 (1997)
7. 7.
Lindström, B.: On the vector representations of induced matroids. Bulletin of the London Mathematical Society 5, 85–90 (1973)
8. 8.
Luby, M., Randall, D., Sinclair, A.: Markov chain algorithms for planar lattice structures. In: Proc. 36th IEEE Symposium on Foundations of Computer Science, pp. 150–159 (1995)Google Scholar
9. 9.
McShine, L., Tetali, P.: On the mixing time of the triangulation walk and other Catalan structures. Randomization Methods in Algorithm Design, DJMACS-AMS 43 (1998)Google Scholar
10. 10.
Sherman, J., Morrison, W.J.: Adjustment of an inverse matrix corresponding to changes in the elements of a given column or a given row of the original matrix. The Annals of Mathematical Statistics 20, 621 (1949)Google Scholar
11. 11.
Stembridge, J.R.: Non-intersecting paths, Pfaffians, and plane partitions. Advances in Mathematics 83, 96–131 (1990)
12. 12.
Wilson, D.B.: Determinant algorithms for random planar structures. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 258–267 (1997)Google Scholar