Boltzmann Sampling of Unlabelled Structures

DOI10.1137/1.9781611972979.5zbMath1430.68164OpenAlexW2280812408MaRDI QIDQ5194612

Éric Fusy, Carine Pivoteau, Philippe Flajolet

Publication date: 16 September 2019

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

Full work available at URL: https://doi.org/10.1137/1.9781611972979.5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (24)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ On the lexicographical generation of compressed codes ⋮ Uniform random posets ⋮ Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation ⋮ Scaling limits of random Pólya trees ⋮ Boltzmann samplers for \(v\)-balanced cycles ⋮ A new dichotomic algorithm for the uniform random generation of words in regular languages ⋮ Non-redundant random generation algorithms for weighted context-free grammars ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Graphon convergence of random cographs ⋮ Generating constrained random data with uniform distribution ⋮ Counting and generating terms in the binary lambda calculus ⋮ Algorithms for combinatorial structures: well-founded systems and Newton iterations ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ Compact representations of all members of an independence system ⋮ Boltzmann samplers for first-order differential specifications ⋮ Controlled non-uniform random generation of decomposable structures ⋮ Counting, Generating, Analyzing and Sampling Tree Alignments ⋮ Enumeration and random generation of accessible automata ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ Unlabelled Gibbs partitions ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis

This page was built for publication: Boltzmann Sampling of Unlabelled Structures