SearcharxivSearch

arXiv · 1004.3061

Growth of Galton-Watson trees: immigration and lifetimes

Abstract

We study certain consistent families $(F_λ)_{λ\ge 0}$ of Galton-Watson forests with lifetimes as edge lengths and/or immigrants as progenitors of the trees in $F_λ$. Specifically, consistency here refers to the property that for each $μ\leλ$, the forest $F_μ$ has the same distribution as the subforest of $F_λ$ spanned by the black leaves in a Bernoulli leaf colouring, where each leaf of $F_λ$ is coloured in black independently with probability $μ/λ$. The case of exponentially distributed lifetimes and no immigration was studied by Duquesne and Winkel and related to the genealogy of Markovian continuous-state branching processes. We characterise here such families in the framework of arbitrary lifetime distributions and immigration according to a renewal process, related to Sagitov's (non-Markovian) generalisation of continuous-state branching renewal processes, and similar processes with immigration.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiao'ou Cao, Matthias Winkel. 2010-04-18. Growth of Galton-Watson trees: immigration and lifetimes. https://arxiv.org/abs/1004.3061

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