Analytic samplers and the combinatorial rejection method

DOI10.1137/1.9781611973761.4zbMATH Open1429.68158arXiv1304.1881OpenAlexW1671746968MaRDI QIDQ5194792FDOQ5194792

Jérémie Lumbroso, Nicolas Rolin, Olivier Bodini

Publication date: 17 September 2019

Published in: 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Abstract: Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw approximate size objects from any class which can be specified through the symbolic method. This, through by evaluating the associated generating functions to obtain the correct branching probabilities. But these samplers require generating functions, in particular in the neighborhood of their sunglarity, which is a complex problem; they also require picking an appropriate tuning value to best control the size of generated objects. Although Pivoteau~etal have brought a sweeping question to the first question, with the introduction of their Newton oracle, questions remain. By adapting the rejection method, a classical tool from the random, we show how to obtain a variant of the Boltzmann sampler framework, which is tolerant of approximation, even large ones. Our goal for this is twofold: this allows for exact sampling with approximate values; but this also allows much more flexibility in tuning samplers. For the class of simple trees, we will try to show how this could be used to more easily calibrate samplers.

Full work available at URL: https://arxiv.org/abs/1304.1881

Recommendations

• Pointed versus singular Boltzmann samplers: a comparative analysis
• Polynomial tuning of multiparametric combinatorial samplers
• Exact-size sampling for Motzkin trees in linear time via Boltzmann samplers and holonomic specification
• Boltzmann sampling of unlabelled structures
• Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorics in computer science (68R05) Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15)

Cited In (3)

• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• A rejection technique for sampling from T -concave distributions
• On the number of unary-binary tree-like structures with restrictions on the unary height

This page was built for publication: Analytic samplers and the combinatorial rejection method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5194792)