Boltzmann Samplers, Pólya Theory, and Cycle Pointing
Reads0
Chats0
TLDR
In this paper, the authors introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random, based on pointing unlabelled structures in an unbiased way so that a structure of size $n$ gives rise to pointed structures.Abstract:
We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an “unbiased” way so that a structure of size $n$ gives rise to $n$ pointed structures. We extend Polya theory to the corresponding pointing operator and present a random sampling framework based on both the principles of Boltzmann sampling and Polya operators. All previously known unlabeled construction principles for Boltzmann samplers are special cases of our new results. Our method is illustrated in several examples: in each case, we provide enumerative results and efficient random samplers. The approach applies to unlabeled families of plane and nonplane unrooted trees, and tree-like structures in general, but also to families of graphs (such as cacti graphs and outerplanar graphs) and families of planar maps.read more
Citations
More filters
Posted Content
Random enriched trees with applications to random graphs
TL;DR: In this paper, the authors established limit theorems that describe the asymptotic local and global geometric behavior of random enriched trees considered up to symmetry, and applied these general results to random unlabelled weighted rooted graphs and uniform random unlabeled $k-trees that are rooted at a $k$-clique of distinguishable vertices.
Journal ArticleDOI
The maximum degree of random planar graphs
TL;DR: It is shown that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1logn.
Journal ArticleDOI
Boltzmann samplers for first-order differential specifications
TL;DR: An efficient Boltzmann sampler for ordered structures defined by first-order differential specifications is proposed and makes it possible to generate very large random objects, such as increasing trees, in a few seconds on a standard machine.
Posted Content
Scaling limits of random P\'olya trees
TL;DR: In this paper, the convergence of large uniform random polya trees with arbitrary degree restrictions to Aldous' Continuum Random Tree with respect to the Gromov-Hausdorff metric is established.
Journal ArticleDOI
Gibbs partitions: the convergent case
TL;DR: Since proper addable minor-closed classes of graphs belong to the more general family of small block-stable classes, this recovers and generalizes results by McDiarmid (2009).