SearcharxivSearch

arXiv · 2509.05231

Moments of density-dependent branching processes and their genealogy

Abstract

A density-dependent branching process is a particle system in which individuals reproduce independently, but in a way that depends on the current population size. This feature can model a wide range of ecological interactions at the cost of breaking the branching property. We propose a general approach for studying the genealogy of these models based on moments. Building on a recent work of Bansaye, we show how to compute recursively these moments in a similar spirit to the many-to-few formula in the theory of branching processes. These formulas enable one to deduce the convergence of the genealogy by studying the population density, for which stochastic calculus techniques are available. As a first application of these ideas, we consider a density-dependent branching process started close to a stable equilibrium of the ecological dynamics. We show that, under a finite second moment assumption, its genealogy converges to Kingman's coalescent when the carrying capacity of the population goes to infinity.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathilde André, Félix Foutel-Rodier, Emmanuel Schertzer. 2025-09-05. Moments of density-dependent branching processes and their genealogy. https://arxiv.org/abs/2509.05231

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