{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:16:23Z","timestamp":1759335383153},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>This article presents uniform random generators of plane partitions according to 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<jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>(ln<jats:italic>n<\/jats:italic>)<jats:sup>3<\/jats:sup>) in approximate-size sampling and<jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>4\/3<\/jats:sup>) 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 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 (<jats:italic>a<\/jats:italic>\u00d7<jats:italic>b<\/jats:italic>)-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.<\/jats:p>","DOI":"10.1017\/s0963548309990332","type":"journal-article","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T11:40:46Z","timestamp":1257162046000},"page":"201-226","source":"Crossref","is-referenced-by-count":15,"title":["Random Sampling of Plane Partitions"],"prefix":"10.1017","volume":"19","author":[{"given":"OLIVIER","family":"BODINI","sequence":"first","affiliation":[]},{"given":"\u00c9RIC","family":"FUSY","sequence":"additional","affiliation":[]},{"given":"CARINE","family":"PIVOTEAU","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"S0963548309990332_ref16","doi-asserted-by":"publisher","DOI":"10.1142\/S0217751X07034970"},{"key":"S0963548309990332_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"S0963548309990332_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00002-E"},{"key":"S0963548309990332_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511613449"},{"key":"S0963548309990332_ref15","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1912.0009"},{"key":"S0963548309990332_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90007-6"},{"key":"S0963548309990332_ref6","first-page":"201","volume-title":"Proc. 4th Workshop on Analytic Algorithms and Combinatorics: ANALCO'07","author":"Flajolet","year":"2007"},{"key":"S0963548309990332_ref28","first-page":"258","volume-title":"SODA \u201997: Proc. 8th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"Wilson","year":"1997"},{"key":"S0963548309990332_ref10","unstructured":"[10] Fusy \u00c9. (2007) Uniform random sampling of planar graphs in linear time. Random Struct. Alg., to appear. arXiv:0705.1287"},{"key":"S0963548309990332_ref21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.46298\/dmtcs.239","article-title":"A direct bijective proof of the hook-length formula","volume":"1","author":"Novelli","year":"1997","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S0963548309990332_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01180268"},{"key":"S0963548309990332_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s002200100505"},{"key":"S0963548309990332_ref14","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/38\/19\/006"},{"key":"S0963548309990332_ref12","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1970.34.709"},{"key":"S0963548309990332_ref11","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1981.92.295"},{"key":"S0963548309990332_ref13","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1999.2979"},{"key":"S0963548309990332_ref24","article-title":"Hook length formula and geometric combinatorics","volume":"46","author":"Pak","year":"2001","journal-title":"S\u00e9minaire Lotharingien de Combinatoire"},{"key":"S0963548309990332_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006315"},{"key":"S0963548309990332_ref19","first-page":"361","article-title":"Asymptotic formula for the number of plane partitions of positive integers","volume":"59","author":"Mutafchiev","year":"2006","journal-title":"CR Acad. Bulgare Sci."},{"key":"S0963548309990332_ref20","volume-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1978"},{"key":"S0963548309990332_ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-03-00425-9"},{"key":"S0963548309990332_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02509449"},{"key":"S0963548309990332_ref23","article-title":"Random skew plane partitions and the Pearcey process","volume":"269","author":"Okounkov","year":"2007","journal-title":"Comm. Math. Phys."},{"key":"S0963548309990332_ref25","first-page":"475","volume-title":"Algorithms, Trees, Combinatorics and Probabilities: Proc. 5th Colloquium on Mathematics and Computer Science","author":"Pivoteau","year":"2008"},{"key":"S0963548309990332_ref26","doi-asserted-by":"crossref","DOI":"10.37236\/1330","article-title":"Generating random elements of finite distributive lattices","volume":"4","author":"Propp","year":"1997","journal-title":"Electron. J. Combin."},{"key":"S0963548309990332_ref29","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/os-2.1.177"},{"key":"S0963548309990332_ref31","article-title":"Proof of the alternating sign matrix conjecture","volume":"3","author":"Zeilberger","year":"1996","journal-title":"Electron. J. Combin."},{"key":"S0963548309990332_ref4","first-page":"137","article-title":"The shape of a typical boxed plane partition","volume":"4","author":"Cohn","year":"1998","journal-title":"New York J. Math."},{"key":"S0963548309990332_ref18","first-page":"A13","article-title":"The size of the largest part of random plane partitions of large integers","volume":"6","author":"Mutafchiev","year":"2006","journal-title":"Integers"},{"key":"S0963548309990332_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90226-7"},{"key":"S0963548309990332_ref30","first-page":"97","article-title":"On quantitative substitutional analysis","volume":"33","author":"Young","year":"1901","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548309990332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T07:10:14Z","timestamp":1634109014000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548309990332\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["S0963548309990332"],"URL":"https:\/\/doi.org\/10.1017\/s0963548309990332","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,2]]}}}