• Publications
• Influence
Exact sampling with coupled Markov chains and applications to statistical mechanics
• Mathematics
• 15 August 1996
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chainExpand
Exact sampling with coupled Markov chains and applications to statistical mechanics
• Computer Science
• Random Struct. Algorithms
• 1996
This work describes a simple variant of the Markov chain method that determines on its own when to stop, and that outputs samples in exact accordance with the desired distribution, and can sample from the Gibbs distributions associated with various statistical mechanics models. Expand
Alternating sign matrices and domino tilings
• Mathematics
• 1 June 1991
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives theExpand
A variational principle for domino tilings
• Mathematics
• 30 August 2000
1.1. Description of results. A domino is a 1 x 2 (or 2 x 1) rectangle, and a tiling of a region by dominos is a way of covering that region with dominos so that there are no gaps or overlaps. InExpand
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Computer Science
• J. Algorithms
• 1 May 1998
Algorithms for generating a random sample from the state space of a Markov chain in accordance with the steady-state probability law of the chain are given, improving on earlier results and exploiting the duality between the two problems. Expand
Chip-Firing and Rotor-Routing on Directed Graphs
• Mathematics
• 22 January 2008
We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguingExpand
Generalized domino-shuffling
• J. Propp
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2 November 2001
This article presents efficient algorithms that work in this context to solve three problems: finding the sum of the weights of the matchings of a weighted Aztec diamond graph An; computing the probability that a randomly-chosen matching of An, will include a particular edge (where the probability of a matching is proportional to its weight); and generating a match of An at random. Expand
Lattice structure for orientations of graphs
Earlier researchers have studied the set of orientations of a connected finite graph \$G\$, and have shown that any two such orientations having the same flow-difference around all closed loops can beExpand
Homomesy in Products of Two Chains
• Mathematics, Computer Science
• Electron. J. Comb.
• 7 February 2013
A theoretical framework for results of this kind is described and old and new results for the actions of promotion and rowmotion on the poset that is the product of two chains are discussed. Expand
The Shape of a Typical Boxed Plane Partition
• Mathematics
• 13 January 1998
Using a calculus of variations approach, we determine the shape of a typical plane partition in a large box (i.e., a plane partition chosen at random according to the uniform distribution on allExpand