Skip to Main content Skip to Navigation
Conference papers

Dirichlet Random Sampling for Multiplicative Combinatorial Structures

Olivier Bodini Jérémie Lumbroso 1
1 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In 2001, Duchon, Flajolet, Louchard and Schaeffer introduced Boltzmann samplers, a radically novel way to efficiently generate huge random combinatorial objects without any preprocessing; the insight was that the probabilities can be obtained directly by evaluating the generating functions of combinatorials classes. Over the following decade, a vast array of papers has increased the formal expressiveness of these random samplers. Our paper introduces a new kind of sampler which generates multiplicative combinatorial structures, which enumerated by Dirichlet generating functions. Such classes, which are significantly harder to analyze than their additive counterparts, are at the intersection of combinatorics and analytic number theory. Indeed, one example we fully discuss is that of ordered factorizations. While we recycle many of the concepts of Boltzmann random sampling, our samplers no longer obey a Boltzmann distribution; we thus have coined a new name for them: Dirichlet samplers. These are very efficient as they can generate objects of size n in O((log n) 2) worst-case time complexity. By providing a means by which to generate very large random multiplicative objects, our Dirichlet samplers can facilitate the investigation of these interesting, yet little studied structures. We also hope to illustrate some of our general ideas regarding the future direction for random sampling.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01258779
Contributor : Lip6 Publications <>
Submitted on : Tuesday, January 19, 2016 - 2:31:53 PM
Last modification on : Thursday, March 21, 2019 - 1:21:08 PM

Links full text

Identifiers

Citation

Olivier Bodini, Jérémie Lumbroso. Dirichlet Random Sampling for Multiplicative Combinatorial Structures. Meeting on Analytic Algorithmics and Combinatorics (ANALCO) 2012, Jan 2012, Kyoto, Japan. pp.92-106, ⟨10.1137/1.9781611973020.12⟩. ⟨hal-01258779⟩

Share

Metrics

Record views

74