Shuffling algorithm for boxed plane partitions
From MaRDI portal
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 x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of each step involves O((a+b)c) operations. 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-dimensional sections. The limiting correlation functions define a two-dimensional determinantal point processes with certain Gibbs properties.
Recommendations
Cites work
- scientific article; zbMATH DE number 6472600 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- A variational principle for domino tilings
- Alternating-sign matrices and domino tilings. I
- Anisotropic growth of random surfaces in \({2+1}\) dimensions
- Another involution principle-free bijective proof of Stanley's hook-content formula
- Asymptotics of Plancherel-type random partitions
- Configurational entropy of codimension-one tilings and directed membranes
- Correlation function of Schur process with application to local geometry of a random 3-dimensional Young diagram
- Eigenvalues of GUE minors
- Entropy and boundary conditions in random rhombus tilings
- Generalized domino-shuffling.
- Generating random elements of finite distributive lattices
- Gibbs ensembles of nonintersecting paths
- Height fluctuations in the honeycomb dimer model
- Limit shapes and the complex Burgers equation
- Local statistics of lattice dimers
- Markov chain algorithms for planar lattice structures
- Markov processes on partitions
- Matrices coupled in a chain: I. Eigenvalue correlations
- Mixing times of lozenge tiling and card shuffling Markov chains
- Non-intersecting paths, random tilings and random matrices
- Non-intersecting, simple, symmetric random walks and the extended Hahn kernel.
- Nonintersecting paths and the Hahn orthogonal polynomial ensemble
- On the shuffling algorithm for domino tilings
- Orthogonal polynomial ensembles in probability theory
- Periodic Schur process and cylindric partitions
- Strong stationary times via a new form of duality
- The shape of a typical boxed plane partition
- Watermelon uniform random generation with applications
Cited in
(28)- Nearest neighbor Markov dynamics on Macdonald processes
- The ASEP and determinantal point processes
- Anisotropic growth of random surfaces in \({2+1}\) dimensions
- Domino statistics of the two-periodic Aztec diamond
- Bulk universality for random lozenge tilings near straight boundaries and for tensor products
- Asymptotics of uniformly random lozenge tilings of polygons. Gaussian free field
- Hook formulas for skew shapes. III: Multivariate and product formulas
- Two-dimensional anisotropic KPZ growth and limit shapes
- \(q\)-distributions on boxed plane partitions
- Markov processes on the path space of the Gelfand-Tsetlin graph and on its boundary
- Perturbed GUE minor process and Warren's process with drifts
- Determinantal structures in space-inhomogeneous dynamics on interlacing arrays
- Schur dynamics of the Schur processes
- Plane partitions with two-periodic weights
- Macdonald processes
- Multilevel Dyson Brownian motions via Jack polynomials
- On the shuffling algorithm for domino tilings
- Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes
- Elliptically distributed lozenge tilings of a hexagon
- Rewriting history in integrable stochastic particle systems
- Shuffle algorithm for singular 2-D system
- Computing a pyramid partition generating function with dimer shuffling
- Representations of classical Lie groups and quantized free convolution
- Random forests and networks analysis
- Difference operators and determinantal point processes
- Gaussian asymptotics of discrete \(\beta \)-ensembles
- Lectures on integrable probability
- Limits of multilevel TASEP and similar processes
This page was built for publication: Shuffling algorithm for boxed plane partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011405)
