On the shuffling algorithm for domino tilings
From MaRDI portal
Abstract: We study the dynamics of a certain discrete model of interacting particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of interlacing Brownian motions which can be used to construct Dyson's non-intersecting Brownian motion. We conjecture that Warren's model can be recovered as a scaling limit of our discrete model and prove some partial results in this direction. As an application to one of these results we use it to rederive the known result that random tilings of an Aztec diamond, suitably rescaled near a turning point, converge to the GUE minor process.
Recommendations
- A note on domino shuffling
- On the domino shuffle and matrix refactorizations
- A shuffling theorem for reflectively symmetric tilings
- A short proof of two shuffling theorems for tilings and a weighted generalization
- The complexity of generalized domino tilings
- On a problem in shuffling
- Shuffling algorithm for boxed plane partitions
- Domino tilings and determinants
- On the shape of permutomino tiles
- Shuffling lattices
Cited in
(24)- Shuffling algorithm for boxed plane partitions
- Shuffling lattices
- Perturbed GUE minor process and Warren's process with drifts
- The domino shuffling algorithm and anisotropic KPZ stochastic growth
- Fluctuations of the arctic curve in the tilings of the Aztec diamond on restricted domains
- Limits of multilevel TASEP and similar processes
- Universality of local statistics for noncolliding random walks
- Determinantal structures in space-inhomogeneous dynamics on interlacing arrays
- Tacnode GUE-minor processes and double Aztec diamonds
- A note on domino shuffling
- Interacting particle systems at the edge of multilevel Dyson Brownian motions
- Anisotropic growth of random surfaces in \({2+1}\) dimensions
- Consecutive minors for Dyson's Brownian motions
- Markov processes on the path space of the Gelfand-Tsetlin graph and on its boundary
- Lectures on integrable probability
- Geometric RSK and the Toda lattice
- The Dyson Brownian minor process
- Random tilings and Markov chains for interlacing particles
- A color-to-spin domino Schensted algorithm
- Matrix Whittaker processes
- Interlaced particle systems and tilings of the Aztec diamond
- Shuffling algorithm for coupled tilings of the Aztec diamond
- Local statistics and shuffling for dimers on a square-hexagon lattice
- Multilevel Dyson Brownian motions via Jack polynomials
This page was built for publication: On the shuffling algorithm for domino tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967719)