Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 53
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    ARRATIA, RICHARD and DeSALVO, STEPHEN 2016. Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example. Combinatorics, Probability and Computing, Vol. 25, Issue. 03, p. 324.

    Basset, Nicolas 2016. Counting and Generating Permutations in Regular Classes. Algorithmica,

    He, Xiao Zhang, Tian Hu, Chang-Jun Ma, Zhiyi and Shao, Weizhong 2016. An MDE performance testing framework based on random model generation. Journal of Systems and Software,

    Kifetew, Fitsum Meshesha Tiella, Roberto and Tonella, Paolo 2016. Generating valid grammar-based test inputs by means of genetic programming and annotated grammars. Empirical Software Engineering,

    Popoola, Saheed Kolovos, Dimitrios S. and Rodriguez, Horacio Hoyos 2016. Theory and Practice of Model Transformations.

    Rivin, Igor 2016. Spectral Experiments+. Experimental Mathematics, Vol. 25, Issue. 4, p. 379.

    BANDERIER, CYRIL and DRMOTA, MICHAEL 2015. Formulae and Asymptotics for Coefficients of Algebraic Functions. Combinatorics, Probability and Computing, Vol. 24, Issue. 01, p. 1.

    Chauvel, Franck Song, Hui Ferry, Nicolas and Fleurey, Franck 2015. Evaluating robustness of cloud-based systems. Journal of Cloud Computing, Vol. 4, Issue. 1,

    Feldt, Robert and Poulding, Simon 2015. 2015 IEEE/ACM 8th International Workshop on Search-Based Software Testing. p. 1.

    Fu, Benjamin M.M. Han, Hillary S.W. and Reidys, Christian M. 2015. On RNA–RNA interaction structures of fixed topological genus. Mathematical Biosciences, Vol. 262, p. 88.

    GRYGIEL, KATARZYNA and LESCANNE, PIERRE 2015. Counting and generating terms in the binary lambda calculus. Journal of Functional Programming, Vol. 25,

    Huang, Fenix W.D. and Reidys, Christian M. 2015. Shapes of topological RNA structures. Mathematical Biosciences, Vol. 270, p. 57.

    Martins, Rodrigo S. V. and Panario, Daniel 2015. On the heuristic of approximating polynomials over finite fields by random mappings. International Journal of Number Theory, p. 1.

    BOUSQUET-MÉLOU, MIREILLE and WELLER, KERSTIN 2014. Asymptotic Properties of Some Minor-Closed Classes of Graphs. Combinatorics, Probability and Computing, Vol. 23, Issue. 05, p. 749.

    Drmota, M. Gimenez, O. Noy, M. Panagiotou, K. and Steger, A. 2014. The maximum degree of random planar graphs. Proceedings of the London Mathematical Society, Vol. 109, Issue. 4, p. 892.

    Pilaud, Vincent and Rué, Juanjo 2014. Analytic combinatorics of chord and hyperchord diagrams with k crossings. Advances in Applied Mathematics, Vol. 57, p. 60.

    Xiao, He Tian, Zhang Zhiyi, Ma and Weizhong, Shao 2014. 2014 IEEE 38th Annual Computer Software and Applications Conference. p. 11.

    Bodini, O. Gardy, D. and Jacquot, A. 2013. Asymptotics and random sampling for BCI and BCK lambda terms. Theoretical Computer Science, Vol. 502, p. 227.

    Feldt, Robert and Poulding, Simon 2013. 2013 IEEE 24th International Symposium on Software Reliability Engineering (ISSRE). p. 350.

    Huang, Fenix W.D. Nebel, Markus E. and Reidys, Christian M. 2013. Generation of RNA pseudoknot structures with topological genus filtration. Mathematical Biosciences, Vol. 245, Issue. 2, p. 216.


Boltzmann Samplers for the Random Generation of Combinatorial Structures

  • DOI:
  • Published online: 01 September 2004

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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *