# Exact-size Sampling of Enriched Trees in Linear Time

@inproceedings{Panagiotou2021ExactsizeSO, title={Exact-size Sampling of Enriched Trees in Linear Time}, author={Konstantinos Panagiotou and Leon Ramzews and Benedikt Stufler}, year={2021} }

Various combinatorial classes such as outerplanar graphs and maps, series-parallel graphs, substitution-closed classes of permutations and many more allow bijective encodings by so-called enriched trees, which are rooted trees with additional structure on the offspring of each node. Using this universal description we develop sampling procedures that uniformly generate objects from this classes with a given size n in expected time O(n). The key ingredient is a representation of enriched trees…

## References

SHOWING 1-10 OF 49 REFERENCES

Uniform random sampling of planar graphs in linear time

- Mathematics, Computer ScienceRandom Struct. Algorithms
- 2009

This article introduces new algorithms for the uniform random generation of labelled planar graphs that combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic description of the generating functions countingPlanar graphs, which was recently obtained by Gimenez and Noy.

Boltzmann Sampling of Unlabelled Structures

- 2006

Boltzmann models from statistical physics combined with methods from analytic combinatorics give rise to efficient algorithms for the random generation of unlabelled objects. The resulting algorithms…

Boltzmann Samplers, Pólya Theory, and Cycle Pointing

- Mathematics, Computer ScienceSIAM J. Comput.
- 2011

A general method to count unlabeled combinatorial structures and to efficiently generate them at random and present a random sampling framework based on both the principles of Boltzmann sampling and Polya operators is introduced.

Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs

- Mathematics, Computer ScienceANALCO
- 2018

A characterization for the split-decomposition trees of cactus graphs is derived, a general template of symbolic grammars are produced, and random generation is implemented for these graphs, building on work by Iriza (2015).

Polynomial tuning of multiparametric combinatorial samplers

- Computer Science, MathematicsANALCO
- 2018

This paper proposes an efficient polynomial-time, with respect to the number of tuned parameters, tuning algorithm based on convex optimisation techniques and illustrates the efficiency of this approach using several applications of rational, algebraic and Polya structures.

Limits of random tree-like discrete structures

- Mathematics
- 2016

We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We…

Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation

- Mathematics
- 2011

We give a unified treatment of the limit, as the size tends to infinity,
of simply generated random trees,
including both
the well-known result in the standard case
of critical Galton–Watson…

A decorated tree approach to random permutations in substitution-closed classes

- Mathematics
- 2019

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from…

Generating Outerplanar Graphs Uniformly at Random

- Mathematics, Computer ScienceCombinatorics, Probability and Computing
- 2006

A counting technique using the decomposition of a graph according to its block structure is presented, and the exact number of labelled and unlabelled outerplanar graphs are computed.

A Calculus for the Random Generation of Labelled Combinatorial Structures

- Computer Science, MathematicsTheor. Comput. Sci.
- 1994

A general strategy is developed for solving the random generation problem with two closely related types of methods: for structures of size n, the boustrophedonic algorithms exhibit a worst-case behaviour of the form O(n log n); the sequential algorithms have worst case O( n2), while offering good potential for optimizations in the average case.