|
Boltzmann and recursive sampling and beyond| old_uid | 17514 |
|---|
| title | Boltzmann and recursive sampling and beyond |
|---|
| start_date | 2019/02/26 |
|---|
| schedule | 11h45-12h45 |
|---|
| online | no |
|---|
| summary | I will describe the recursive method and the Boltzmann random generation method. Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like structures. If time permits, I will explain different extensions of the Boltzmann sampling: for first-order and second-order differential structures (i.e. combinatorial families whose generating functions satisfy differential equations of the first and the second order, respectively). Next, I can explain some of our recent work: a polynomial-time oracle for multiparametric tuning of the Boltzmann sampler and its applications. |
|---|
| responsibles | Grandjean |
|---|
| |
|