Corpus ID: 2892782

Perfect sampling algorithm for Schur processes

@article{Betea2014PerfectSA,
  title={Perfect sampling algorithm for Schur processes},
  author={D. Betea and C{\'e}dric Boutillier and J. Bouttier and G. Chapuy and S. Corteel and M. Vuletic},
  journal={ArXiv},
  year={2014},
  volume={abs/1407.3764}
}
  • D. Betea, Cédric Boutillier, +3 authors M. Vuletic
  • Published 2014
  • Mathematics, Physics, Computer Science
  • ArXiv
  • 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… CONTINUE READING
    14 Citations
    From Aztec diamonds to pyramids: steep tilings
    • 18
    • PDF
    Random tilings and Markov chains for interlacing particles
    • 20
    • PDF
    Planar maps and random partitions
    • 1
    • PDF
    New edge asymptotics of skew Young diagrams via free boundaries.
    • 1
    • PDF

    References

    SHOWING 1-10 OF 38 REFERENCES
    Conditioned random walks and the RSK correspondence
    • 77
    • PDF
    Dimers on Rail Yard Graphs
    • 24
    • PDF
    Infinite wedge and random partitions
    • 259
    • PDF
    From Aztec diamonds to pyramids: steep tilings
    • 18
    • PDF
    Nearest neighbor Markov dynamics on Macdonald processes
    • 52
    • Highly Influential
    • PDF
    Correlation function of Schur process with application to local geometry of a random 3-dimensional Young diagram
    • 348
    • PDF
    Macdonald processes
    • 259
    • PDF
    Random Domino Tilings and the Arctic Circle Theorem
    • 182
    • PDF