Skip to Main content Skip to Navigation
Conference papers

Boltzmann sampling of ordered structures

Olivier Roussel 1 Michèle Soria 1
1 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Boltzmann models from statistical physics combined with methods from analytic combinatorics give rise to efficient algorithms for the random generation of combinatorials objects. This paper proposes an efficient sampler which satisfies the Boltzmann model principle for ordered structures. This goal is achieved using a special operator, named 'box operator'. Under an abstract real-arithmetic computation model, our algorithm is of linear complexity upon free generation ; and for many classical structures, of linear complexity also provided a small tolerance is allowed on the size of the object drawn. The resulting programs make it possible to generate random objects of sizes up to $10^7$ on a standard machine.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Olivier Roussel Connect in order to contact the contributor
Submitted on : Wednesday, August 26, 2009 - 10:42:18 AM
Last modification on : Monday, July 26, 2021 - 3:42:03 PM
Long-term archiving on: : Monday, October 15, 2012 - 4:25:45 PM


Files produced by the author(s)



Olivier Roussel, Michèle Soria. Boltzmann sampling of ordered structures. LAGOS 2009 - 5th Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Rio Grande do Sul, Brazil. pp.305-310, ⟨10.1016/j.endm.2009.11.050⟩. ⟨hal-00411110⟩



Record views


Files downloads