SearcharxivSearch

arXiv · 1606.01285

Spread of a Catalytic Branching Random Walk on a Multidimensional Lattice

Abstract

For a supercritical catalytic branching random walk on Z^d (d is positive integer) with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. Namely, we divide by t the position coordinates of each particle existing at time t and then let t tend to infinity. It is shown that in the limit there are a.s. no particles outside the closed convex surface in R^d which we call the propagation front and, under condition of infinite number of visits of the catalysts set, a.s. there exist particles on the propagation front. We also demonstrate that the propagation front is asymptotically densely populated and derive its alternative representation. Recent strong limit theorems for total and local particles numbers established by the author play an essential role. The results obtained develop ones by Ph.Carmona and Y.Hu (2014) devoted to the spread of catalytic branching random walk on Z. Keywords and phrases: branching random walk, supercritical regime, spread of population, propagation front, many-to-one lemma.

Explore related subjects

Keep this discovery

BibTeXRIS

Ekaterina Vl. Bulinskaya. 2016-06-03. Spread of a Catalytic Branching Random Walk on a Multidimensional Lattice. https://doi.org/10.1016/j.spa.2017.09.007

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