## Boltzmann Samplers For The Random Generation Of Combinatorial Structures (2004)

### Cached

### Download Links

- [algo.inria.fr]
- [algo.inria.fr]
- [www-rocq.inria.fr]
- DBLP

### Other Repositories/Bibliography

Venue: | Combinatorics, Probability and Computing |

Citations: | 67 - 2 self |

### BibTeX

@ARTICLE{Duchon04boltzmannsamplers,

author = {Philippe Duchon and Philippe Flajolet and Guy Louchard and Gilles Schaeffer},

title = {Boltzmann Samplers For The Random Generation Of Combinatorial Structures},

journal = {Combinatorics, Probability and Computing},

year = {2004},

volume = {13},

pages = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models. The idea is to perform random generation of possibly complex structured objects by placing an appropriate measure spread over the whole of a combinatorial class -- an object receives a probability essentially proportional to an exponential of its size. As demonstrated here, the resulting algorithms based on real-arithmetic operations often operate in linear time. They can be implemented easily, be analysed mathematically with great precision, and, when suitably tuned, tend to be very efficient in practice.