(Enter summary)
Abstract: This note proposes a new framework for 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. The resulting algorithms often operate in linear time. They can be implemented easily within a computer algebra system, be analysed mathematically with great precision, and, when suitably tuned, tend to be... (Update)
Context of citations to this paper: More
.... An extended abstract summarizing several of the results described here has been presented at the ICALP 2002 Conference in Malaga [18]. 2. Boltzmann models and samplers We consider a class C of combinatorial objects of sorts, with j j the size function mapping C to Z 0...
Cited by: More
Generating Labeled Planar Graphs Uniformly at Random - Bodirsky, Gröpl, Kang (2003)
(Correct)
Boltzmann Samplers For The Random Generation Of.. - Duchon, Flajolet, ..
(Correct)
Similar documents (at the sentence level):
24.4%: Random Sampling from Boltzmann Principles - Duchon, Flajolet, Louchard.. (2002)
(Correct)
Active bibliography (related documents): More All
0.4: Basic Analytic Combinatorics of Directed Lattice Paths - Banderier, Flajolet (2001)
(Correct)
0.3: Probabilistic Analysis of Carlitz Compositions - Guy Louchard And
(Correct)
0.3: Monotone Runs of Uniformly Distributed Integer Random.. - Guy Louchard November
(Correct)
Similar documents based on text: More All
0.2: Computer Algebra Libraries for Combinatorial Structures - Flajolet, Salvy (1995)
(Correct)
0.2: A Calculus for the Random Generation of Combinatorial.. - Flajolet, Zimmermann.. (1993)
(Correct)
0.2: Polynomial Factorization Challenges - Zimmermann, Bernardin, Monagan (1996)
(Correct)
Related documents from co-citation: More All
2: Probabilistic Analysis of Column-Convex and Directed Diagonally-Convex Animals
- LOUCHARD - 1997
2: A logical approach to asymptotic combinatorics (context) - Compton - 1987
2: Random sampling of large planar maps and convex polyhedra (context) - Schaeffer - 1999
BibTeX entry: (Update)
Duchon, P., Flajolet, P., Louchard, G., and Schaeffer, G. Random sampling from Boltzmann principles. In Automata, Languages, and Programming (2002), P. Widmayer et al., Ed., no. 2380 in Lecture Notes in Computer Science, Springer Verlag, pp. 501-513. http://citeseer.ist.psu.edu/duchon02random.html More
@misc{ duchon02random,
author = "P. Duchon and P. Flajolet and G. Louchard and G. Schaeffer",
title = "Random sampling from Boltzmann principles",
text = "Duchon, P., Flajolet, P., Louchard, G., and Schaeffer, G. Random sampling
from Boltzmann principles. In Automata, Languages, and Programming (2002),
P. Widmayer et al., Ed., no. 2380 in Lecture Notes in Computer Science,
Springer Verlag, pp. 501-513.",
year = "2002",
url = "citeseer.ist.psu.edu/duchon02random.html" }
Citations (may not include all citations):
213
Non-Uniform Random Variate Generation (context) - Devroye - 1986
154
Combinatorial Enumeration (context) - Goulden, Jackson - 1983
151
Cambridge University Press (context) - Stanley - 1998
116
Graphical Enumeration (context) - Harary, Palmer - 1973
85
Mathematics for the analysis of algorithms (context) - Greene, Knuth - 1981
81
Combinatorial Algorithms (context) - Nijenhuis, Wilf - 1978
70
Statistical Mechanics (context) - Huang - 1987
65
Asymptotic enumeration methods
- Odlyzko - 1995
36
The complexity of nonuniform random number generation (context) - Knuth, Yao
34
A calculus for the random generation of labelled combinatori.. (context) - Flajolet, Zimmerman et al. - 1994
34
Ordered cycle lengths in a random permutation (context) - Shepp, Lloyd - 1966
19
Probabilistic analysis of column-convex and directed diagona..
- Louchard - 1997
19
Probabilistic analysis of column-convex and directed diagona..
- Louchard - 1999
15
Theoretical Computer Science (context) - Flajolet, Salvy et al. - 1991
12
Uniform random generation of decomposable structures using o..
- Denise, Zimmermann - 1999
12
Systems of functional equations
- Drmota - 1997
12
Statistical mechanics of combinatorial partitions
- Vershik - 1996
11
Analytic Combinatorics (context) - Flajolet, Sedgewick
10
Computation of generating functions for biological molecules (context) - Howell, Smith et al. - 1980
9
Random sampling of large planar maps and convex polyhedra (context) - Schaeffer - 1999
9
Theoretical Computer Science (context) - Louchard - 1996
7
The random generation of directed animals (context) - Barcucci, Pinzani et al. - 1994
7
Largest component in random combinatorial structures (context) - Gourdon - 1998
7
Asymptotic properties of some underdiagonal walks generation..
- Louchard - 1999
6
Discrete Mathematics and Theoretical Computer Science (context) - Dutour, edou - 1998
6
Published electronically at http://www (context) - Sloane - 2000
5
Finite range random walk on free groups and homogeneous tree.. (context) - Lalley
5
Large deviations for integer partitions
- Dembo, Vershik et al. - 2000
2
Relaxed random generation of trees (context) - Duchon - 2001
2
American Matematical Monthly (context) - Odlyzko, Wilf et al. - 1988
2
ethodes d'analyse pour les constructions combinatoires et le.. (context) - Soria-Cousineau - 1990
Documents on the same site (http://www.loria.fr/~schaeffe/):
Random Maps, Coalescing Saddles, Singularity.. - Banderier..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC