Random generation of combinatorial structures: Boltzmann samplers and beyond

Authors:
Philippe Duchon
Affiliations:
LaBRI, INRIA/Université de Bordeaux, Talence cedex, France
Venue:
Proceedings of the Winter Simulation Conference
Year:
2011

Citing 6
Cited 0

A calculus for the random generation of labelled combinatorial structures

Theoretical Computer Science
How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph

Journal of Algorithms
Random Sampling from Boltzmann Principles

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Boltzmann Samplers for the Random Generation of Combinatorial Structures

Combinatorics, Probability and Computing
Analytic Combinatorics

Analytic Combinatorics
Boltzmann samplers for first-order differential specifications

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.