SearcharxivSearch

arXiv · 1812.09909

Survival Analysis of Particle Populations in Branching Random Walks

Abstract

It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time heavy-tailed branching random walks on a multidimensional lattice. We will be mainly interested in studying the problems related to the limiting behavior of branching random walks such as the existence of phase transitions under change of various parameters, the properties of the limiting distribution and the survival probability of a particle population. Emphasis is made on the survival analysis. The answers to these and other questions essentially depend on numerous factors which affect the properties of a branching random walk. Therefore, we will try to describe how the properties of a branching random walk depend on such characteristics of the underlying random walk as finiteness or infiniteness of the variance of jumps. The presented results are based on the Green's function representations of the transition probabilities of a branching random walk.

Explore related subjects

Keep this discovery

BibTeXRIS

Anastasiia Rytova, Elena Yarovaya. 2018-12-24. Survival Analysis of Particle Populations in Branching Random Walks. https://arxiv.org/abs/1812.09909

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