Random Sampling of Plane Partitions
From MaRDI portal
Publication:3557534
Abstract: This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is in approximate-size sampling and in exact-size sampling (under a real-arithmetic computation model). To our knowledge, these are the first polynomial-time samplers for plane partitions according to the size (there exist polynomial-time samplers of another type, which draw plane partitions that fit inside a fixed bounding box). The same principles yield efficient samplers for -boxed plane partitions (plane partitions with two dimensions bounded), and for skew plane partitions. The random samplers allow us to perform simulations and observe limit shapes and frozen boundaries, which have been analysed recently by Cerf and Kenyon for plane partitions, and by Okounkov and Reshetikhin for skew plane partitions.
Recommendations
- Sampling part sizes of random integer partitions
- Random plane partitions and corner distributions
- Sampling from finite random partitions
- Sampling parts of random integer partitions: a probabilistic and asymptotic analysis
- Random sampling of large planar maps and convex polyhedra
- Random partitions with restricted part sizes
- Random Set Partitions
- Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions
- Large Parts of Random Plane Partitions: a Poisson Limit Theorem
Cites work
- A calculus for the random generation of labelled combinatorial structures
- AMOEBAS AND INSTANTONS
- Another involution principle-free bijective proof of Stanley's hook-content formula
- Asymptotische Aussagen über Partitionen
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Correlation function of Schur process with application to local geometry of a random 3-dimensional Young diagram
- Enumeration of plane partitions
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- Matrix correspondences of plane partitions
- Mellin transforms and asymptotics: Harmonic sums
- Permutations, matrices, and generalized Young tableaux
- Rectangular vesicles in three dimensions
- Statistical mechanics of combinatorial partitions, and their limit shapes
- The low-temperature expansion of the Wulff crystal in the 3D Ising model
Cited in
(22)- Shuffling algorithm for boxed plane partitions
- Plane sampling
- The shape of a typical boxed plane partition
- Asymptotic analysis of expectations of plane partition statistics
- On a square-ice analogue of plane partitions
- Probabilistic divide-and-conquer: deterministic second half
- Building initial partitions through sampling techniques
- Boltzmann samplers for \(v\)-balanced cycles
- On the exhaustive generation of plane partitions
- A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- Perfect sampling algorithms for Schur processes
- The weighted hook length formula
- Problems in Plane Sampling
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Exact-Size Sampling of Enriched Trees in Linear Time
- \(q\)-distributions on boxed plane partitions
- Lozenge tilings of hexagons with removed core and satellites
- Schur dynamics of the Schur processes
- A unified treatment of families of partition functions
- Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis
- Lozenge tilings of hexagons with arbitrary dents
This page was built for publication: Random Sampling of Plane Partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557534)
