Search arXivSearch

arXiv · 2607.15370

Limit laws of random simplex tree-child networks

Abstract

We prove that the longer and shorter Sackin indices of a uniformly random simplex tree-child network with $n$ taxa admit joint distributional limits after rescaling by $n^{-7/4}$. The limiting distributions are described by functionals of a Brownian excursion. We also identify the limiting law of the height after rescaling by $n^{-3/4}$, thereby answering a question of Zhang~(2022). Moreover, we establish sharp tail bounds for the height, which imply convergence of all moments in the above distributional limits. We further obtain a scaling limit for the entire height profile of the leaves. Finally, we determine the local limits of large simplex networks around the fixed root, a uniformly random vertex, and a uniformly random leaf.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Víctor J. Maciá, Benedikt Stufler. 2026-07-16. Limit laws of random simplex tree-child networks. https://arxiv.org/abs/2607.15370

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO