Benedikt Stufler

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 2016Show all

5 papers · 1 filter

math.PR2016

Limits of random tree-like discrete structures

Benedikt Stufler

We study a model of random $R$ -enriched trees that is based on weights on the $R$ -structures and allows for a unified treatment of a large family of random disc…

math.PR2016

Local limits of large Galton-Watson trees rerooted at a random vertex

Benedikt Stufler

We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard c…

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…

math.PR2016

Graph limits of random graphs from a subset of connected $k$ -trees

Michael Drmota, Emma Yu Jin, Benedikt Stufler

For any set $Ω$ of non-negative integers such that ${0, 1} \subseteq Ω$ and ${0, 1} \neq = Ω$ , we consider a random $Ω$ - $k$ -tree $G_{n, k}$ that is uniformly selected from all co…

Limits of random tree-like discrete structures

Local limits of large Galton-Watson trees rerooted at a random vertex

Unlabelled Gibbs partitions

Gibbs partitions: the convergent case

Graph limits of random graphs from a subset of connected k-trees

Graph limits of random graphs from a subset of connected $k$ -trees