Enumerative combinatorics
A logical approach to asymptotic combinatorics II: monadic second-order properties
Journal of Combinatorial Theory Series A
Generating functionology
Automatic average-case analysis of algorithms
Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How easy is collision search? Application to DES
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The random generation of directed animals
Theoretical Computer Science
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Probabilistic analysis of some (un)directed animals
Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
Asymptotic enumeration methods
Handbook of combinatorics (vol. 2)
Systems of functional equations
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Combinatorial structures and structures for classification
Computational Statistics & Data Analysis - Special issue on classification
Coloring rules for finite trees, and probabilities of monadic second order sentences
Random Structures & Algorithms
Probabilistic analysis of column-convex and directed diagonally-convex animals
Random Structures & Algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Largest component in random combinatorial structures
Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Random sampling of large planar maps and convex polyhedra
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Analytic combinatorics of non-crossing configurations
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Random Structures & Algorithms
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Random Sampling from Boltzmann Principles
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Journal of Symbolic Computation
Sampling adsorbing staircase walks using a new Markov chain decomposition method
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The randomness recycler: a new technique for perfect sampling
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Feature extraction from noisy speech signals
Feature extraction from noisy speech signals
Labelled formal languages and their uses
Labelled formal languages and their uses
Combinatorial Enumeration
Probabilistic Transforms for Combinatorial Urn Models
Combinatorics, Probability and Computing
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Generating labeled planar graphs uniformly at random
Theoretical Computer Science
Enumeration and random generation of accessible automata
Theoretical Computer Science
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Enumeration and generation with a string automata representation
Theoretical Computer Science
On properties of random dissections and triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Maximal biconnected subgraphs of random planar graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Uniform Random Generation of Huge Metamodel Instances
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
Fast and sound random generation for automated testing and benchmarking in objective Caml
Proceedings of the 2009 ACM SIGPLAN workshop on ML
The degree sequence of random graphs from subcritical classes†
Combinatorics, Probability and Computing
The relevant prefixes of coloured Motzkin walks: An average case analysis
Theoretical Computer Science
Uniform random sampling of planar graphs in linear time
Random Structures & Algorithms
Families of prudent self-avoiding walks
Journal of Combinatorial Theory Series A
Maximal biconnected subgraphs of random planar graphs
ACM Transactions on Algorithms (TALG)
Random sampling of plane partitions
Combinatorics, Probability and Computing
Controlled non-uniform random generation of decomposable structures
Theoretical Computer Science
Vertices of degree k in random maps
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
3-connected cores in random planar graphs
Combinatorics, Probability and Computing
An experimental study on generating planar graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Weakly directed self-avoiding walks
Journal of Combinatorial Theory Series A
Discovery of probabilistic mappings between taxonomies: principles and experiments
Journal on data semantics XV
Random generation of deterministic acyclic automata using Markov chains
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
SIAM Journal on Computing
The maximum degree of random planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On Buffon machines and numbers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the degree distribution of random planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Sampling different kinds of acyclic automata using Markov chains
Theoretical Computer Science
Algorithms for combinatorial structures: Well-founded systems and Newton iterations
Journal of Combinatorial Theory Series A
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
Asymptotic Study of Subcritical Graph Classes
SIAM Journal on Discrete Mathematics
Feat: functional enumeration of algebraic types
Proceedings of the 2012 Haskell Symposium
Boltzmann samplers for first-order differential specifications
Discrete Applied Mathematics
Boys-and-girls Birthdays and Hadamard Products
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Random generation of combinatorial structures: Boltzmann samplers and beyond
Proceedings of the Winter Simulation Conference
Asymptotic analysis and random sampling of digitally convex polyominoes
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
A new dichotomic algorithm for the uniform random generation of words in regular languages
Theoretical Computer Science
Non-redundant random generation algorithms for weighted context-free grammars
Theoretical Computer Science
Asymptotics and random sampling for BCI and BCK lambda terms
Theoretical Computer Science
Boltzmann samplers for v-balanced cycles
Theoretical Computer Science
| Hi-index | 0.01 |
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.