Random sampling from Boltzmann principles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 501-513

  Duchon, Philippe ^a   Flajolet, Philippe ^b   Louchard, Guy ^c   Schaeffer, Gilles ^d  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^d LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

BOLTZMANN MODEL; BOLTZMANN PRINCIPLE; COMPUTER ALGEBRA SYSTEMS; EXTENDED ABSTRACTS; LINEAR TIME; RANDOM GENERATION; RANDOM SAMPLING;

AUTOMATA THEORY;

EID: 84869168747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_43     Document Type: Conference Paper

References (14)

1. Barcucci, E., Pinzani, R., and Sprugnoli, R. The random generation of directed animals. Theoretical Computer Science 127, 2 (1994), 333-350.
2. Bergeron, F., Labelle, G., and Leroux, P. Combinatorial species and treelike structures. Cambridge University Press, Cambridge, 1998. Translated from the 1994 French original by Margaret Readdy, With a foreword by Gian-Carlo Rota.
3. Denise, A., and Zimmermann, P. Uniform random generation of decomposable structures usingfloating -point arithmetic. Theoretical Computer Science 218, 2 (1999), 233-248.
4. Devroye, L. Non-Uniform Random Variate Generation. Springer Verlag, 1986.
5. Duchon, P., Flajolet, P., Louchard, G., and Schaeffer, G. Boltzmann samplers for random combinatorial generation. In preparation, 2002.
6. Flajolet, P., Salvy, B., and Zimmermann, P. Automatic average-case analysis of algorithms. Theoretical Computer Science 79, 1 (Feb. 1991), 37-109.
7. Flajolet, P., and Sedgewick, R. Analytic Combinatorics. 2001. Book in preparation: Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162, 4103 and electronically under http://algo.inria.fr/ flajolet/Publications/books.html.
8. Flajolet, P., Zimmermann, P., and Van Cutsem, B. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science 132, 1-2 (1994), 1-35.
9. Goulden, I. P., and Jackson, D. M. Combinatorial Enumeration. John Wiley, New York, 1983.
10. Knuth, D. E., and Yao, A. C. The complexity of nonuniform random number generation. In Algorithms and complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, Pa., 1976). Academic Press, New York, 1976, pp. 357-428.
11. Louchard, G. Asymptotic properties of some underdiagonal walks generation algorithms. Theoretical Computer Science 218, 2 (1999), 249-262.
12. Nijenhuis, A., and Wilf, H. S. Combinatorial Algorithms, second ed. Academic Press, 1978.
13. Odlyzko, A. M. Asymptotic enumeration methods. In Handbook of Combinatorics, R. Graham, M. Grötschel, and L. Lovász, Eds., vol. II. Elsevier, Amsterdam, 1995, pp. 1063-1229.
14. Sloane, N. J. A. The On-Line Encyclopedia of Integer Sequences. 2000. Published electronically at http://www.research.att.com/~njas/sequences/.