SearcharxivSearch

arXiv · 2605.28801

Microscopic Weak Selection Principle for the Logistic Branching Brownian Motion with selection

Abstract

In this work, we present the logistic branching Brownian motion with selection (Log-BBM), a modification of the N-BBM defined by Groisman et. al (2020), in which birth and competition events are decoupled to allow for a variable population size that follows the branching process with logistic growth defined by Lambert (2005). We study the representation of the Log-BBM as a microscopic model for a FKPP-type equation. In the large population limit, the renormalised empirical measure of the Log-BBM converges weakly to a probability measure whose density solves a nonlocal version of the FKPP equation, while its cumulative distribution function solves the classical FKPP equation. We also show that this model exhibits behaviour that is characteristic of the Brunet-Derrida family of systems, in particular the so-called weak selection principle. Indeed, we show that, in the Log-BBM, the particles select the minimal propagation speed, in contrast to the FKPP equation, where the selected front speed depends on the initial condition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. E. Bravo Lozano, M. C. Fittipaldi. 2026-05-27. Microscopic Weak Selection Principle for the Logistic Branching Brownian Motion with selection. https://arxiv.org/abs/2605.28801

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