Generating random elements of finite distributive lattices

This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using "coupling from the past" to remove initialization bias from Monte Carlo randomization. The article describes several applications to specific kinds of combinatorial objects such as tilings, constrained lattice paths, an alternating sign matrices.

[1]  Harold Marston Morse.  Recurrent geodesics on a surface of negative curvature , 1921 .

[2]  Herbert S. Wilf,et al.  On the Sequential and Random Selection of Subspaces over a Finite Field , 1977, J. Comb. Theory, Ser. A.

[3]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[4]  Michael Larsen,et al.  The Shape of a Typical Boxed Plane Partition , 1998, math/9801059.

[5]  Curtis Greene,et al.  Another Probabilistic Method in the Theory of Young Tableaux , 1984, J. Comb. Theory, Ser. A.

[6]  Herbert S. Wilf,et al.  The Enumeration of Connected Graphs and Linked Diagrams , 1979, J. Comb. Theory, Ser. A.

[7]  Herbert S. Wilf.  The Uniform Selection of Free Trees , 1981, J. Algorithms.

[8]  David Bruce Wilson,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.

[9]  W. S. Andrews.  Magic Squares and Cubes , 2018 .

[10]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[11]  Herbert S. Wilf,et al.  The Random Selection of Unlabeled Graphs , 1983, J. Algorithms.

[12]  Herbert S. Wilf,et al.  A Method and Two Algorithms on the Theory of Partitions , 1975, J. Comb. Theory, Ser. A.

[13]  James Ax,et al.  Group-theoretic treatment of the axioms of quantum mechanics , 1976 .

[14]  J. Propp,et al.  Alternating sign matrices and domino tilings , 1991, math/9201305.

[15]  Kenkichi Iwasawa,et al.  Lectures on p-adic L-functions , 1972 .

[16]  Kenneth B. Huber.  Department of Mathematics , 1894 .

[17]  H. Wilf,et al.  A probabilistic proof of a formula for the number of Young tableaux of a given shape , 1979 .

[18]  Jeffrey C. Lagarias,et al.  Tiling with polyominoes and combinatorial group theory , 1990, J. Comb. Theory, Ser. A.

[19]  W. Thurston.  Conway's tiling groups , 1990 .

[20]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[21]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[22]  Richard P. Stanley,et al.  Magic labelings of graphs, symmetric magic squares, systems of parameters, and Cohen-Macaulay rings , 1976 .

[23]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[24]  David P. Robbins,et al.  Alternating Sign Matrices and Descending Plane Partitions , 1983, J. Comb. Theory, Ser. A.

[25]  David Bruce Wilson,et al.  Determinant algorithms for random planar structures , 1997, SODA '97.

[26]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[27]  Richard P. Stanley,et al.  Linear homogeneous Diophantine equations and magic labelings of graphs , 1973 .

[28]  J. Shaw.  Combinatory Analysis , 1917, Nature.

[29]  Herbert S. Wilf.  A Unified Setting for Selection Algorithms (II) , 1978 .