activity
20142026
most citedA decorated tree approach to random permutations in substitution-closed classes

20 citations · 44 across the 24 of their papers we have counts for

collaborators
Showing math.COShow all

11 papers · 1 filter

math.CO2026

Limit laws of random simplex tree-child networks

Víctor J. Maciá, Benedikt Stufler

We prove that the longer and shorter Sackin indices of a uniformly random simplex tree-child network with taxa admit joint distributional limits after rescaling by .…

math.CO2026

Linear time sampling of Pólya trees

Benedikt Stufler

We present an algorithm for exact-size sampling of uniformly random Pólya trees with linear expected runtime.

math.CO2026

Asymptotic enumeration of unlabelled cubic planar graphs

Benedikt Stufler

We determine the precise asymptotic number of unlabelled cubic planar graphs with vertices. Our approach blends generating series methods with computational bounds and probabil…

math.CO2024

Gibbs partitions and lattice paths

Niccolò Bosio, Markus Kuba, Benedikt Stufler

This work is devoted to the analysis of a Gibbs partition model, also known as a composition scheme. We consider a natural new condition on the component weights. It leads to a new…

math.CO2023

Probabilistic enumeration and equivalence of nonisomorphic trees

Benedikt Stufler

We present a new probabilistic proof of Otter's asymptotic formula for the number of unlabelled trees with a given number of vertices. We additionally prove a new approximation res…

math.CO2021★ 1 cited

Exact-size Sampling of Enriched Trees in Linear Time

Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler

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…

math.CO2018

Graph limits of random unlabelled -trees

Emma Yu Jin, Benedikt Stufler

We study random unlabelled -dimensional trees by combining the colouring approach by Gainer-Dewar and Gessel (2014) with the cycle pointing method by Bodirsky, Fusy, Kang and Vi…

math.CO2018

Pattern occurrences in random planar maps

Michael Drmota, Benedikt Stufler

We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear w…

math.CO2017

Asymptotic properties of random unlabelled block-weighted graphs

Benedikt Stufler

We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzma…

math.CO2016★ 5 cited

Unlabelled Gibbs partitions

Benedikt Stufler

We study random composite structures considered up to symmetry that are sampled according to weights on the inner and outer structures. This model may be viewed as an unlabelled ve…

math.CO2016

Gibbs partitions: the convergent case

Benedikt Stufler

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We dem…