Random generation of combinatorial structures: Boltzmann samplers and beyond

Philippe Duchon 1, 2
1 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : The Boltzmann model for the random generation of ''decomposable'' combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling uniformly from the set of objects of a given size is somehow relaxed, though uniformity among objects of each size is still ensured. Generating functions, rather than the enumeration sequences they are based on, are the crucial ingredient. We give a brief description of the general theory, as well as a number of newer developments.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

Contributor : Philippe Duchon <>
Submitted on : Wednesday, December 21, 2011 - 2:21:07 PM
Last modification on : Thursday, January 11, 2018 - 6:22:11 AM
Document(s) archivé(s) le : Thursday, March 22, 2012 - 2:26:49 AM


Files produced by the author(s)


  • HAL Id : hal-00654267, version 1
  • ARXIV : 1112.5071


Philippe Duchon. Random generation of combinatorial structures: Boltzmann samplers and beyond. Winter Simulation Conference, Dec 2011, Phoenix, United States. ⟨hal-00654267⟩



Record views


Files downloads