SearcharxivSearch

arXiv · 1104.1496

Poisson representations of branching Markov and measure-valued branching processes

Abstract

Representations of branching Markov processes and their measure-valued limits in terms of countable systems of particles are constructed for models with spatially varying birth and death rates. Each particle has a location and a "level," but unlike earlier constructions, the levels change with time. In fact, death of a particle occurs only when the level of the particle crosses a specified level $r$, or for the limiting models, hits infinity. For branching Markov processes, at each time $t$, conditioned on the state of the process, the levels are independent and uniformly distributed on $[0,r]$. For the limiting measure-valued process, at each time $t$, the joint distribution of locations and levels is conditionally Poisson distributed with mean measure $K(t)\times\varLambda$, where $\varLambda$ denotes Lebesgue measure, and $K$ is the desired measure-valued process. The representation simplifies or gives alternative proofs for a variety of calculations and results including conditioning on extinction or nonextinction, Harris's convergence theorem for supercritical branching processes, and diffusion approximations for processes in random environments.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas G. Kurtz, Eliane R. Rodrigues. 2011-04-08. Poisson representations of branching Markov and measure-valued branching processes. https://doi.org/10.1214/10-aop574

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