SearcharxivSearch

arXiv · 2608.18320

Asymptotics for Beta-Splitting Trees via Homogeneous Fragmentations and Meromorphic Potential Theory

Abstract

Inspired by recent work of Aldous, Janson, and Pittel on the critical beta-splitting model, we study the full beta-splitting family for beta greater than minus two through a canonical continuous-time embedding into a homogeneous exchangeable fragmentation. In this representation, the frequency of a tagged fragment is described by a subordinator. We express the continuous height of a typical leaf, its occupation probabilities, the discrete height, and the total continuous-time length in terms of the potential measure of this subordinator. Renewal theory yields first-order asymptotics and a central limit theorem for the continuous height. A regenerative-composition representation gives Gaussian limits for the discrete height above and at the critical value, and a non-Gaussian power-law limit below it. We also obtain residue expansions for the potential measure and the mean continuous height using meromorphic potential theory and generalized Nevanlinna functions. Finally, we study the maximum continuous-time height, proving a law of large numbers and a mixed Gumbel limit. At the critical parameter value, this resolves an open problem of Aldous and Janson.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yoana R. Chorbadzhiyska, Martin Minchev, Mladen Savov. 2026-08-18. Asymptotics for Beta-Splitting Trees via Homogeneous Fragmentations and Meromorphic Potential Theory. https://arxiv.org/abs/2608.18320

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR