SearcharxivSearch

arXiv · 2507.14676

On the critical parameters of branching random walks

Abstract

Given a discrete spatial structure $X$, we define continuous-time branching processes that model a population breeding and dying on $X$. These processes are usually called branching random walks. They are characterized by breeding rates $k_{xy}$ (governing the rate at which individuals at $x$ send offspring to $y$), and by a multiplicative speed parameter $\lambda$. These processes also serve as models for epidemic spreading, where $\lambda k_{xy}$ represents the infection rate from $x$ to $y$. Two critical parameters of interest are the global critical parameter $\lambda_w$, related to global survival, and the local critical parameter $\lambda_s$, related to survival within finite sets (with $\lambda_w\le\lambda_s$). In disease control, the primary goal is to lower $\lambda$ so that the process dies out, at least locally. Nevertheless, a process that survives globally can still pose a threat, especially if sudden changes cause global survival to transition into local survival. In fact, local modifications to the rates can affect the values of both critical parameters, making it important to understand when and how they can be increased. Using results on the comparison of extinction probabilities for a single branching random walk across different sets, we extend the analysis to extinction probabilities and critical parameters of pairs of branching random walks whose rates coincide outside a fixed set $A \subseteq X$. We say that two branching random walks are equivalent if their rates coincide everywhere except on a finite subset of $X$. Given an equivalence class of branching random walks, we prove that if one process has $\lambda^*_w \neq \lambda^*_s$, then $\lambda^*_w$ is the maximal possible value of this parameter within the class. We describe the possible configurations for the critical parameters within these equivalence classes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniela Bertacchi, Fabio Zucca. 2025-07-19. On the critical parameters of branching random walks. https://arxiv.org/abs/2507.14676

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