Explore the Frontier of Global Academia

AcademicHub aggregates real-time literature from top journals and preprint platforms. Build your personal research radar and let large language models compile cross-disciplinary analysis briefings automatically.

Authors: Benedikt Stufler ×

↻ Shuffle

01.

arXiv (math.PR) 2026-06-17 DOI: arXiv:2606.17992

Asymptotic enumeration of unlabelled cubic planar graphs

Authors:

Benedikt Stufler ↗

arXiv:2606.17992v1 Announce Type: cross Abstract: We determine the precise asymptotic number of unlabelled cubic planar graphs with $n$ vertices. Our approach blends generating series methods with computational bounds and probabilistic local large deviation theorems.

Read & Discuss → View Source →

02.

arXiv (math.PR) 2026-06-16 DOI: arXiv:2606.15339

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

Authors:

V\'ictor J. Maci\'a ↗Benedikt Stufler ↗

arXiv:2606.15339v1 Announce Type: new Abstract: 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. We prove a uniform exponential tail bound for each of these quantities, valid for arbitrary offspring distributions. As a consequence, these random variables are uniformly integrable of every order. This yields convergence of all moments to those of the corresponding local limit. The argument is probabilistic and unified across the three quantities.

Read & Discuss → View Source →

03.

arXiv (math.PR) 2026-06-15 DOI: arXiv:2507.23241

Scaling limits of multitype Bienaymé trees

Authors:

Louigi Addario-Berry ↗Philipp Beltran ↗Benedikt Stufler ↗Paul Th\'evenin ↗

arXiv:2507.23241v2 Announce Type: replace Abstract: 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 nonasymptotic 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.

Read & Discuss → View Source →