Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation
Résumé
In a probabilistic context, the main data structures of computer science are viewed as random combinatorial objects. Analytic Combinatorics, as described in the book by Flajolet & Sedgewick, provides a set of high-level tools for their probabilistic analysis. Recursive combinatorial defini- tions lead to generating function equations from which efficient algorithms can be designed for enumeration, random generation and, to some extent, asymptotic analysis. With a focus on random generation, this tutorial first covers the basics of Analytic Combinatorics and then describes the idea of Boltzmann sampling and its realisation.
The tutorial addresses a broad TCS audience and no particular pre-knowledge on analytic combinatorics is expected.
Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...