SearcharxivSearch

arXiv · 1907.02344

On the Maximal Displacement of Near-critical Branching Random Walks

Abstract

We consider a branching random walk on $\mathbb{Z}$ started by $n$ particles at the origin, where each particle disperses according to a mean-zero random walk with bounded support and reproduces with mean number of offspring $1+\theta/n$. For $t\geq 0$, we study $M_{nt}$, the rightmost position reached by the branching random walk up to generation $[nt]$. Under certain moment assumptions on the branching law, we prove that $M_{nt}/\sqrt{n}$ converges weakly to the rightmost support point of the local time of the limiting super-Brownian motion. The convergence result establishes a sharp exponential decay of the tail distribution of $M_{nt}$. We also confirm that when $\theta>0$, the support of the branching random walk grows in a linear speed that is identical to that of the limiting super-Brownian motion which was studied by Pinsky in [28]. The rightmost position over all generations, $M:=\sup_t M_{nt}$, is also shown to converge weakly to that of the limiting super-Brownian motion, whose tail is found to decay like a Gumbel distribution when $\theta<0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Eyal Neuman, Xinghua Zheng. 2019-07-04. On the Maximal Displacement of Near-critical Branching Random Walks. https://arxiv.org/abs/1907.02344

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