Search arXivSearch

arXiv · 2104.02715

The sum of powers of subtree sizes for conditioned Galton-Watson trees

Abstract

We study the additive functional $X_n(\alpha)$ on conditioned Galton-Watson trees given, for arbitrary complex $\alpha$, by summing the $\alpha$th power of all subtree sizes. Allowing complex $\alpha$ is advantageous, even for the study of real $\alpha$, since it allows us to use powerful results from the theory of analytic functions in the proofs. For $\Re\alpha < 0$, we prove that $X_n(\alpha)$, suitably normalized, has a complex normal limiting distribution; moreover, as processes in $\alpha$, the weak convergence holds in the space of analytic functions in the left half-plane. We establish, and prove similar process-convergence extensions of, limiting distribution results for $\alpha$ in various regions of the complex plane. We focus mainly on the case where $\Re\alpha > 0$, for which $X_n(\alpha)$, suitably normalized, has a limiting distribution that is not normal but does not depend on the offspring distribution $\xi$ of the conditioned Galton-Watson tree, assuming only that $E[\xi] = 1$ and $0 < \mathrm{Var} [\xi] < \infty$. Under a weak extra moment assumption on $\xi$, we prove that the convergence extends to moments, ordinary and absolute and mixed, of all orders. At least when $\Re\alpha > \frac12$, the limit random variable $Y(\alpha)$ can be expressed as a function of a normalized Brownian excursion.

Explore related subjects

Keep this discovery

BibTeXRIS

James Allen Fill, Svante Janson. 2021-04-06. The sum of powers of subtree sizes for conditioned Galton-Watson trees. https://arxiv.org/abs/2104.02715

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