SearcharxivSearch

arXiv · 2401.07891

Where do (random) trees grow leaves?

Abstract

We study a model of random binary trees grown "by the leaves" in the style of Luczak and Winkler. If $\tau_n$ is a uniform plane binary tree of size $n$, Luczak and Winkler, and later explicitly Caraceni and Stauffer, constructed a measure $\nu_{\tau_n}$ such that the tree obtained by adding a cherry on a leaf sampled according to $\nu_{\tau_n}$ is still uniformly distributed on the set of all plane binary trees with size $n+1$. It turns out that the measure $\nu_{\tau_n}$, which we call the leaf-growth measure, is noticeably different from the uniform measure on the leaves of the tree $\tau_n$. In fact, we prove that, as $n \to \infty$, with high probability it is almost entirely supported by a subset of only $n^{3 ( 2 - \sqrt{3})+o(1)} \approx n^{0.8038...}$ leaves. In the continuous setting, we construct the scaling limit of this measure, which is a probability measure on the Brownian Continuum Random Tree supported by a fractal set of dimension $ 6 (2 - \sqrt{3})$. We also compute the full (discrete) multifractal spectrum. This work is a first step towards understanding the diffusion limit of the discrete leaf-growth procedure.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandra Caraceni, Nicolas Curien, Robin Stephenson. 2024-01-15. Where do (random) trees grow leaves?. https://arxiv.org/abs/2401.07891

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