Perfect sampling algorithm for Schur processes

Abstract : We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tilings of the plane. Our algorithm, which is of polynomial complexity, is both exact (i.e. the output follows exactly the target probability law, which is either Boltzmann or uniform in our case), and entropy optimal (i.e. it reads a minimal number of random bits as an input). It can be viewed as a (far reaching) common generalization of the RSK algorithm for plane partitions and of the domino shuffling algorithm for domino tilings of the Aztec diamond. At a technical level, it relies on unified bijective proofs of the different types of Cauchy identities for Schur functions, and on an adaptation of Fomin's growth diagram description of the RSK algorithm to that setting. Simulations performed with this algorithm suggest previously unobserved phenomena in the limit shapes for some tiling models.
Liste complète des métadonnées
Contributeur : Jérémie Bouttier <>
Soumis le : mardi 15 juillet 2014 - 11:28:01
Dernière modification le : jeudi 29 mars 2018 - 17:08:03

Lien texte intégral


  • HAL Id : hal-01023784, version 1
  • ARXIV : 1407.3764



Dan Betea, Cédric Boutillier, Jérémie Bouttier, Guillaume Chapuy, Sylvie Corteel, et al.. Perfect sampling algorithm for Schur processes. 11 pages, 8 figures. 2014. 〈hal-01023784〉



Consultations de la notice