SearcharxivSearch

arXiv · 1610.04647

Coagulation and universal scaling limits for critical Galton-Watson processes

Abstract

The basis of this paper is the elementary observation that the $n$-step descendant distribution of any Galton-Watson process satisfies a discrete Smoluchowski coagulation equation with multiple coalescence. Using this we obtain necessary and sufficient criteria for the convergence of scaling limits of Galton-Watson processes that are simpler (and equivalent) to the classical criteria obtained by Grimvall in 1974. Our results provide a clear and natural interpretation, and an alternate proof, of the fact that the L\'evy jump measure of certain CSBPs satisfies a generalized Smoluchowski equation. (This result was previously proved by Bertoin and Le Gall in 2006.) Moreover, our analysis shows that the nonlinear scaling dynamics of CSBPs becomes linear and purely dilatational when expressed in terms of the L\'evy triple associated with the branching mechanism. We use this to prove existence of universal critical Galton-Watson and CSBPs analogous to W. Doeblin's "universal laws". Namely, these universal processes generate all possible critical and subcritical CSBPs as subsequential scaling limits. Our convergence results rely on a natural topology for L\'evy triples and a continuity theorem for Bernstein transforms (Laplace exponents). We develop these in a self-contained appendix.

Explore related subjects

Keep this discovery

BibTeXRIS

Gautam Iyer, Nicholas Leger, Robert L. Pego. 2016-10-14. Coagulation and universal scaling limits for critical Galton-Watson processes. https://arxiv.org/abs/1610.04647

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