SearcharxivSearch

arXiv · 1305.1202

Trees under attack: a Ray-Knight representation of Feller's branching diffusion with logistic growth

Abstract

We obtain a representation of Feller's branching diffusion with logistic growth in terms of the local times of a reflected Brownian motion $H$ with a drift that is affine linear in the local time accumulated by $H$ at its current level. As in the classical Ray-Knight representation, the excursions of $H$ are the exploration paths of the trees of descendants of the ancestors at time $t=0$, and the local time of $H$ at height $t$ measures the population size at time $t$ (see e.g. \cite{LG4}). We cope with the dependence in the reproduction by introducing a pecking order of individuals: an individual explored at time $s$ and living at time $t=H_s$ is prone to be killed by any of its contemporaneans that have been explored so far. The proof of our main result relies on approximating $H$ with a sequence of Harris paths $H^N$ which figure in a Ray-Knight representation of the total mass of a branching particle system. We obtain a suitable joint convergence of $H^N$ together with its local times {\em and} with the Girsanov densities that introduce the dependence in the reproduction.

Explore related subjects

Keep this discovery

BibTeXRIS

Vi Le, Etienne Pardoux, Anton Wakolbinger. 2013-05-06. Trees under attack: a Ray-Knight representation of Feller's branching diffusion with logistic growth. https://doi.org/10.1007/s00440-011-0408-x

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