Add to ORKGNational audienceIn this short note, we extend the Boltzmann model for combinatorial random sampling [8] to allow for infinite size objects; in particular, this extension now fully includes Galton-Watson processes. We then illustrate our idea with two examples, one of which is the generation of prefixes of infinite Cayley trees
1 online resource (72 pages) : illustrationsIncludes abstract and appendices.Includes bibliographica...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
41 pages, 2 figuresInternational audienceWe study the evolution of a particle system whose genealogy...
ABSTRACT. In this short note, we extend the Boltzmann model for combinatorial random sampling [8] to...
International audienceThe Boltzmann model for the random generation of ''decomposable'' combinatoria...
AbstractIn the framework of analytic combinatorics, Boltzmann models give rise to efficient algorith...
Randomly generating structured objects is important in testing and optimizing functional programs, w...
This article proposes a surprisingly simple framework for the random generation of combinatorial con...
Uniform random generation is a central issue in combinatorics. Indeed, random sampling is virtually ...
International audienceBoltzmann samplers are a kind of random samplers; in 2004, Duchon, Flajolet, L...
International audienceBoltzmann models from statistical physics, combined with methods from analytic...
Actes / Proceedings à paraître in Journal of Statistical Planning and Inference (special issue). htt...
This thesis examines two types of problems-that of analyzing large quantities of real data, and the ...
International audienceWe address the uniform random generation of words from a context-free language...
International audienceBoltzmann random generation applies to well-defined systems of recursive combin...
1 online resource (72 pages) : illustrationsIncludes abstract and appendices.Includes bibliographica...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
41 pages, 2 figuresInternational audienceWe study the evolution of a particle system whose genealogy...
ABSTRACT. In this short note, we extend the Boltzmann model for combinatorial random sampling [8] to...
International audienceThe Boltzmann model for the random generation of ''decomposable'' combinatoria...
AbstractIn the framework of analytic combinatorics, Boltzmann models give rise to efficient algorith...
Randomly generating structured objects is important in testing and optimizing functional programs, w...
This article proposes a surprisingly simple framework for the random generation of combinatorial con...
Uniform random generation is a central issue in combinatorics. Indeed, random sampling is virtually ...
International audienceBoltzmann samplers are a kind of random samplers; in 2004, Duchon, Flajolet, L...
International audienceBoltzmann models from statistical physics, combined with methods from analytic...
Actes / Proceedings à paraître in Journal of Statistical Planning and Inference (special issue). htt...
This thesis examines two types of problems-that of analyzing large quantities of real data, and the ...
International audienceWe address the uniform random generation of words from a context-free language...
International audienceBoltzmann random generation applies to well-defined systems of recursive combin...
1 online resource (72 pages) : illustrationsIncludes abstract and appendices.Includes bibliographica...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
41 pages, 2 figuresInternational audienceWe study the evolution of a particle system whose genealogy...