Search arXivSearch

arXiv · 1908.05100

Fluctuations of propagation front in catalytic branching walk

Abstract

We consider a supercritical catalytic branching random walk (CBRW) on a multidimensional lattice Z^d (d is positive integer). The main subject of study is the behavior of particles cloud in space and time. For CBRW on an integer line, Carmona and Hu (2014) examined the asymptotical behavior of the maximal coordinate M_n of the particles at time n. They proved that M_n/n converges to \mu almost surely (on a set of local non-degeneracy of CBRW), as n tends to infinity, where \mu>0 is a certain constant. Under additional assumption of a single catalyst in CBRW they also investigated the fluctuations of M_n with respect to \mu n, as n grows to infinity. Bulinskaya (2018) extended the strong limit theorem by Carmona and Hu having estimated the rate of the population propagation for the front of a multidimensional CBRW. Now our aim is to analyze fluctuations of the propagation front in CBRW on Z^d. We not only solve the problem in a multidimensional setting but also, treating the case of an arbitrary finite number of catalysts for d = 1, generalize the result by Carmona and Hu with the help of other probabilistic-analytic methods. Keywords and phrases: catalytic branching random walk, supercritical regime, spread of population, propagation front, fluctuations of front.

Explore related subjects

Keep this discovery

BibTeXRIS

Ekaterina Vl. Bulinskaya. 2019-08-14. Fluctuations of propagation front in catalytic branching walk. https://doi.org/10.1137/s0040585x97t989672

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