2009
DOI: 10.1016/j.aim.2008.11.008
|View full text |Cite
|
Sign up to set email alerts
|

Shuffling algorithm for boxed plane partitions

Abstract: We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a × b × c to (a − 1)One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions.Trajectories of our Markov chains can be viewed as random point configurations in the three-dimensional lattice. We compute the bulk limits of the correlation functions of the resulting random point process on suitable two-di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
49
0
2

Year Published

2010
2010
2020
2020

Publication Types

Select...
6

Relationship

5
1

Authors

Journals

citations
Cited by 37 publications
(51 citation statements)
references
References 27 publications
(51 reference statements)
0
49
0
2
Order By: Relevance
“…The special cases of such processes arise naturally in the study of two-dimensional statistical mechanics systems such as random stepped surfaces and various types of tilings (cf. [6,9,10,34]). …”
Section: Our Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The special cases of such processes arise naturally in the study of two-dimensional statistical mechanics systems such as random stepped surfaces and various types of tilings (cf. [6,9,10,34]). …”
Section: Our Resultsmentioning
confidence: 99%
“…On the discrete level our construction of the multilevel stochastic dynamics is based on a procedure introduced by Diaconis and Fill [16], which has recently been used extensively in the study of Markov chains on interlacing particle configurations (see e.g. [6,7,[9][10][11]). The idea is to use commuting Markov operators and conditional independence to construct a multilevel Markov chain with given single level marginals.…”
Section: Our Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…C k (x, t). Thus the kernel writes K(x, n, t; y, n, t) = w t (x) 12) which is conjugate to the kernel…”
Section: )mentioning
confidence: 99%
“…A shuffling algorithm for lozenge tilings of the hexagon (also known as boxed plane partitions) has been constructed in [12] using the formalism developed in this paper, see [12] for details.…”
Section: More General Growth Modelsmentioning
confidence: 99%