Automatic average-case analysis of algorithms
Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
The random generation of directed animals
Theoretical Computer Science
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Asymptotic enumeration methods
Handbook of combinatorics (vol. 2)
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Asymptotic properties of some underdiagonal walks generation algorithms
Theoretical Computer Science - Special issue on Caen '97
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Enumeration
Analytic Combinatorics
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal coding and sampling of triangulations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Generating labeled planar graphs uniformly at random
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
Random generation of combinatorial structures: Boltzmann samplers and beyond
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
This extended abstract proposes a surprisingly simple framework for the random generation of combinatorial configurations based on Boltzmann models. Random generation of possibly complex structured objects is performed by placingan appropriate measure spread over the whole of a combinatorial class. The resultingalg orithms can be implemented easily within a computer algebra system, be analysed mathematically with great precision, and, when suitably tuned, tend to be efficient in practice, as they often operate in linear time.