Boltzmann Samplers, Pólya Theory, and Cycle Pointing
From MaRDI portal
Publication:3093621
DOI10.1137/100790082zbMath1232.05008arXiv1003.4546OpenAlexW1580809203MaRDI QIDQ3093621
Stefan Vigerske, Mihyun Kang, Manuel Bodirsky, Éric Fusy
Publication date: 18 October 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.4546
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Power series (including lacunary series) in one complex variable (30B10) Asymptotic enumeration (05A16)
Related Items
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ Random enriched trees with applications to random graphs ⋮ The maximum degree of random planar graphs ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Scaling limits of random Pólya trees ⋮ Boltzmann samplers for \(v\)-balanced cycles ⋮ Random graphs from a weighted minor-closed class ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Graphon convergence of random cographs ⋮ Limits of random tree-like discrete structures ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ On the shape of random Pólya structures ⋮ Symmetries of unlabelled planar triangulations ⋮ Phase transitions in graphs on orientable surfaces ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ Boltzmann samplers for first-order differential specifications ⋮ Simply Generated Unrooted Plane Trees ⋮ Graph limits of random unlabelled k-trees ⋮ Unlabelled Gibbs partitions
Uses Software
