SearcharxivSearch

arXiv · 2509.26254

$K$-Branching Random Walk with Noisy Selection: Large Population Limits and Phase Transitions

Abstract

We analyze a variant of the Noisy $K$-Branching Random Walk, a population model that evolves according to the following procedure. At each time step, each individual produces a large number of offspring that inherit the fitness of their parents up to independent and identically distributed fluctuations. The next generation consists of a random sample of all the offspring so that the population size remains fixed, where the sampling is made according to a parameterized Gibbs measure of the fitness of the offspring. Our model interpolates between classical models of fitness waves and exhibits a novel phase transition in the propagation of the wave. By employing a stochastic Hopf-Cole transformation, we show that as we increase the population size, the random dynamics of the model can be described by deterministic operations acting on the limiting population densities. We then show that for fitness fluctuations with exponential tails, these operations admit a unique traveling wave solution with local stability. The traveling wave solution undergoes a phase transition when changing selection pressure, revealing a complex interaction between evolution and natural selection.

Explore related subjects

Keep this discovery

BibTeXRIS

Colin Desmarais, Emmanuel Schertzer, Zsófia Talyigás. 2025-09-30. $K$-Branching Random Walk with Noisy Selection: Large Population Limits and Phase Transitions. https://arxiv.org/abs/2509.26254

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