SearcharxivSearch

arXiv · 2602.20825

Asymptotic behavior of some stochastic models in population dynamics: a Hamilton-Jacobi approach

Abstract

In this paper, we investigate the asymptotic behavior of individual-based models describing the evolution of a population structured by a real trait, subject to selection and mutation. We consider two different sets of assumptions: first, the case of critical or subcritical branching population processes in a regime combining a discretization of the trait space, small mutations, large time and large initial population size, where we are able to characterize using a Hamilton-Jacobi approach, the survival set of the population, and the asymptotic of the logarithmic scaling of subpopulation sizes. Second, we generalize by a direct method the convergence to the classical Hamilton-Jacobi equation obtained in the super-critical branching regime considered in \cite{CMMT} to a more general trait space and under weaker assumptions. Moreover, we establish that the stochastic and the deterministic dynamics are asymptotically equivalent in large population.

Explore related subjects

Keep this discovery

BibTeXRIS

Anouar Jeddi. 2026-02-24. Asymptotic behavior of some stochastic models in population dynamics: a Hamilton-Jacobi approach. https://arxiv.org/abs/2602.20825

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