collaborators

11 papers

math.PR2026

Non-bijective scaling limits and phase transitions of planar maps

Benedikt Stufler

We prove that the uniform random non-separable planar map with edges admits the Brownian sphere as Gromov--Hausdorff--Prokhorov scaling limit as tends to infinity. Our proo…

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.PR2026

Uniform integrability of the distance to the nearest leaf in random trees

Víctor J. Maciá, Benedikt Stufler

We study the distance from the root to the nearest leaf, the analogous quantity for a uniformly chosen vertex, and its protection number, in size-conditioned simply generated trees…

math.PR2026

Scaling limits of multitype Bienaymé trees

Louigi Addario-Berry, Philipp Beltran, Benedikt Stufler +1

We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied…