SearcharxivSearch

arXiv · 2308.01571

Branching random walks with regularly varying perturbations

Abstract

We consider a modification of classical branching random walk, where we add i.i.d. perturbations to the positions of the particles in each generation. In this model, which was introduced and studied by Bandyopadhyay and Ghosh (2023), perturbations take form $\frac 1 \theta \log\frac X E$, where $\theta$ is a positive parameter, $X$ has arbitrary distribution $\mu$ and $E$ is exponential with parameter 1, independent of $X$. Working under finite mean assumption for $\mu$, they proved almost sure convergence of the rightmost position to a constant limit, and identified the weak centered asymptotics when $\theta$ does not exceed certain critical parameter $\theta_0$. This paper complements their work by providing weak centered asymptotics for the case when $\theta > \theta_0$ and extending the results to $\mu$ with regularly varying tails. We prove almost sure convergence of the rightmost position and identify the appropriate centering for the weak convergence, which is of form $\alpha n + c \log n$, with constants $\alpha$, $c$ depending on the ratio of $\theta$ and $\theta_0$. We describe the limiting distribution and provide explicitly the constants appearing in the centering.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof Kowalski. 2023-08-03. Branching random walks with regularly varying perturbations. https://doi.org/10.1051/ps%2F2024014

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