{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:57:23Z","timestamp":1775595443371,"version":"3.50.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2004,9,24]],"date-time":"2004-09-24T00:00:00Z","timestamp":1095984000000},"content-version":"unspecified","delay-in-days":85,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2004,7]]},"abstract":"<jats:p>This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call <jats:italic>Boltzmann models<\/jats:italic>. 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 \u2013 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.<\/jats:p>","DOI":"10.1017\/s0963548304006315","type":"journal-article","created":{"date-parts":[[2004,9,24]],"date-time":"2004-09-24T13:28:19Z","timestamp":1096032499000},"page":"577-625","source":"Crossref","is-referenced-by-count":154,"title":["Boltzmann Samplers for the Random Generation of Combinatorial Structures"],"prefix":"10.1017","volume":"13","author":[{"given":"PHILIPPE","family":"DUCHON","sequence":"first","affiliation":[]},{"given":"PHILIPPE","family":"FLAJOLET","sequence":"additional","affiliation":[]},{"given":"GUY","family":"LOUCHARD","sequence":"additional","affiliation":[]},{"given":"GILLES","family":"SCHAEFFER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2004,9,24]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548304006315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T15:48:20Z","timestamp":1750434500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548304006315\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":0,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0963548304006315"],"URL":"https:\/\/doi.org\/10.1017\/s0963548304006315","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,7]]}}}