Benedikt Stufler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Benedikt Stufler has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Sigurdur Örn Stefánsson
Mathematics division, University of Iceland, Reykjavik, Iceland
3 shared publications - Jakob E. Björnberg
Chalmers University of Gothenburg Sweden
2 shared publications - Joonas Turunen
Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland
2 shared publications Daniel Amankwah
1 shared publication- Daniel Amankwah
Mathematics division, University of Iceland, Reykjavik, Iceland
1 shared publication Delphin Sénizergues
MODAL’X, UPL, Univ. Paris Nanterre, CNRS, F92000 Nanterre, France
1 shared publication
Latest Publications
- Open Access
- 27 August 2026
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 39 (4) , 75
The Scaling Limit of Random Two-Connected Series–Parallel Maps
A finite graph embedded in the plane is called a series–parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series–parallel maps with n edges and show that under fairly general integrability conditions on these weights, the maps with distances rescaled by a factor $$n^{-1/2}$$ converge to a constant multiple of Aldous’ continuum random tree (CRT) in the Gromov–Hausdorff sense. The proof relies on a bijection between a set of trees with n leaves and a set of series–parallel maps with n edges, together with a novel blob decomposition of the maps.- 27 August 2026
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 39 (4) , 75
Open AccessThe Scaling Limit of Random Two-Connected Series–Parallel Maps
A finite graph embedded in the plane is called a series–parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series–parallel maps with n edges and show that under fairly general integrability conditions on these weights, the maps with distances rescaled by a factor $$n^{-1/2}$$ converge to a constant multiple of Aldous’ continuum random tree (CRT) in the Gromov–Hausdorff sense. The proof relies on a bijection between a set of trees with n leaves and a set of series–parallel maps with n edges, together with a novel blob decomposition of the maps. - Open Access
Scaling limits of multitype Bienaymé trees
We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first, conditioning on the value of a linear combination of the numbers of vertices of given types; and second, conditioning on the precise number of vertices belonging to a selected subset of types. We prove that, under a finite exponential moment condition, the scaling limit as the tree size tends to infinity is given by the Brownian Continuum Random Tree. Additionally, we establish strong non-asymptotic tail bounds for the height of such trees. Our main tools include a flattening operation applied to multitype trees and sharp estimates regarding the structure of monotype trees with a given sequence of degrees.
Open AccessScaling limits of multitype Bienaymé trees
We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first, conditioning on the value of a linear combination of the numbers of vertices of given types; and second, conditioning on the precise number of vertices belonging to a selected subset of types. We prove that, under a finite exponential moment condition, the scaling limit as the tree size tends to infinity is given by the Brownian Continuum Random Tree. Additionally, we establish strong non-asymptotic tail bounds for the height of such trees. Our main tools include a flattening operation applied to multitype trees and sharp estimates regarding the structure of monotype trees with a given sequence of degrees.
- Open Access
- 26 May 2025
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 38 (3) , 1-29
Poisson–Dirichlet Scaling Limits of Kemp’s Supertrees
We determine the Gromov–Hausdorff–Prokhorov scaling limits and local limits of Kemp’s d-dimensional binary trees and other models of supertrees. The limits exhibit a root vertex with infinite degree and are constructed by rescaling infinitely many independent stable trees or other spaces according to a function of a two-parameter Poisson–Dirichlet process and gluing them together at their roots. We discuss universality aspects of random spaces constructed in this fashion and sketch a phase diagram.
- 26 May 2025
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 38 (3) , 1-29
Open AccessPoisson–Dirichlet Scaling Limits of Kemp’s Supertrees
We determine the Gromov–Hausdorff–Prokhorov scaling limits and local limits of Kemp’s d-dimensional binary trees and other models of supertrees. The limits exhibit a root vertex with infinite degree and are constructed by rescaling infinitely many independent stable trees or other spaces according to a function of a two-parameter Poisson–Dirichlet process and gluing them together at their roots. We discuss universality aspects of random spaces constructed in this fashion and sketch a phase diagram.
- Open Access
The scaling limit of random 2-connected series-parallel maps
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps with $n$ edges and show that under some integrability conditions on these weights, the maps with distances rescaled by a factor $n^{-1/2}$ converge to a constant multiple of Aldous' continuum random tree (CRT) in the Gromov--Hausdorff sense. The proof relies on a bijection between a set of trees with $n$ leaves and a set of series-parallel maps with $n$ edges, which enables one to compare geodesics in the maps and in the corresponding trees via a Markov chain argument introduced by Curien, Haas and Kortchemski (2015).Open AccessThe scaling limit of random 2-connected series-parallel maps
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps with $n$ edges and show that under some integrability conditions on these weights, the maps with distances rescaled by a factor $n^{-1/2}$ converge to a constant multiple of Aldous' continuum random tree (CRT) in the Gromov--Hausdorff sense. The proof relies on a bijection between a set of trees with $n$ leaves and a set of series-parallel maps with $n$ edges, which enables one to compare geodesics in the maps and in the corresponding trees via a Markov chain argument introduced by Curien, Haas and Kortchemski (2015). - 1 January 2024
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 21 (1) , 129-178
First-passage percolation on random simple triangulations
- 1 January 2024
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 21 (1) , 129-178
First-passage percolation on random simple triangulations
- Open Access
- 14 July 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (3) , P3.32
Cut Vertices in Random Planar Maps
The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical classes of planar maps (like outerplanar maps) we obtain a central limit theorem, too. Interestingly the combinatorics behind this seemingly simple problem is quite involved.- 14 July 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (3) , P3.32
Open AccessCut Vertices in Random Planar Maps
The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical classes of planar maps (like outerplanar maps) we obtain a central limit theorem, too. Interestingly the combinatorics behind this seemingly simple problem is quite involved. - Open Access
- 1 January 2023
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 28 (none) , 1-53
Decorated stable trees
We define decorated α-stable trees which are informally obtained from an α-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the α-stable looptrees of Curien and Kortchemski, where those metric spaces are just deterministic circles. We provide different constructions for these objects, which allows us to understand some of their geometric properties, including compactness, Hausdorff dimension and self-similarity in distribution. We prove an invariance principle which states that under some conditions, analogous discrete objects, random decorated discrete trees, converge in the scaling limit to decorated α-stable trees. We mention a few examples where those objects appear in the context of random trees and planar maps, and we expect them to naturally arise in many more cases.
- 1 January 2023
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 28 (none) , 1-53
Open AccessDecorated stable trees
We define decorated α-stable trees which are informally obtained from an α-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the α-stable looptrees of Curien and Kortchemski, where those metric spaces are just deterministic circles. We provide different constructions for these objects, which allows us to understand some of their geometric properties, including compactness, Hausdorff dimension and self-similarity in distribution. We prove an invariance principle which states that under some conditions, analogous discrete objects, random decorated discrete trees, converge in the scaling limit to decorated α-stable trees. We mention a few examples where those objects appear in the context of random trees and planar maps, and we expect them to naturally arise in many more cases.
- Open Access
- 26 November 2021
- Published by Wiley in Random Structures & Algorithms
- Vol. 61 (2) , 397-421
A branching process approach to level‐k phylogenetic networks
The mathematical analysis of random phylogenetic networks via analytic and algorithmic methods has received increasing attention in the past years. In the present work we introduce branching process methods to their study. This approach appears to be new in this context. Our main results focus on random level‐k networks with n labeled leaves. Although the number of reticulation vertices in such networks is typically linear in n, we prove that their asymptotic global and local shape is tree‐like in a well‐defined sense. We show that the depth process of vertices in a large network converges towards a Brownian excursion after rescaling by . We also establish Benjamini–Schramm convergence of large random level‐k networks towards a novel random infinite network.
- 26 November 2021
- Published by Wiley in Random Structures & Algorithms
- Vol. 61 (2) , 397-421
Open AccessA branching process approach to level‐k phylogenetic networks
The mathematical analysis of random phylogenetic networks via analytic and algorithmic methods has received increasing attention in the past years. In the present work we introduce branching process methods to their study. This approach appears to be new in this context. Our main results focus on random level‐k networks with n labeled leaves. Although the number of reticulation vertices in such networks is typically linear in n, we prove that their asymptotic global and local shape is tree‐like in a well‐defined sense. We show that the depth process of vertices in a large network converges towards a Brownian excursion after rescaling by . We also establish Benjamini–Schramm convergence of large random level‐k networks towards a novel random infinite network.
- Open Access
- 26 March 2021
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 35 (2) , 1324-1342
Quenched Local Convergence of Boltzmann Planar Maps
Stephenson (2018) established annealed local convergence of Boltzmann planar maps conditioned to be large. The present work uses results on rerooted multi-type branching trees to prove a quenched version of this limit.
- 26 March 2021
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 35 (2) , 1324-1342
Open AccessQuenched Local Convergence of Boltzmann Planar Maps
Stephenson (2018) established annealed local convergence of Boltzmann planar maps conditioned to be large. The present work uses results on rerooted multi-type branching trees to prove a quenched version of this limit.