Random sampling of plane partitions

Details Random sampling of plane partitions Random sampling of plane partitions

2007-12-01

arxiv.org/abs/0712.0111v3

Mathematics

Combinatorics

23 pages

Scientific paper

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 $O(n (\ln n)^3)$ in approximate-size sampling and $O(n^{4/3})$ 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 $(a\times b)$-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.

Affiliated with

Also associated with

No associations

Rating

Random sampling of plane partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random sampling of plane partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random sampling of plane partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469241