SearcharxivSearch

arXiv · 2309.14738

The maximal displacement of radially symmetric branching random walk in $\mathbb{R}^d$

Abstract

We consider discrete-time branching random walks with a radially symmetric distribution. Independently of each other individuals generate offspring whose relative locations are given by a copy of a radially symmetric point process $\mathcal{L}$. The number of particles at time $t$ form a supercritical Galton-Watson process. We investigate the maximal distance to the origin of such branching random walks. Conditioned on survival, we show that, under some assumptions on $\mathcal{L}$, it grows in the same way as for branching Brownian motion or a broad class of one-dimensional branching random walks: the first term is linear in time and the second logarithmic. The constants in front of these terms are explicit and depend only on the mean measure of $\mathcal{L}$ and dimension. Our main tool in the proof is a ballot theorem with moving barrier which may be of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Viktor Bezborodov, Nina Gantert. 2023-09-26. The maximal displacement of radially symmetric branching random walk in $\mathbb{R}^d$. https://arxiv.org/abs/2309.14738

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