SearcharxivSearch

arXiv · 2507.19615

Population dynamics under random switching

Abstract

Populations interact non-linearly and are influenced by environmental fluctuations. In order to have realistic mathematical models, one needs to take into account that the environmental fluctuations are inherently stochastic. Often, environmental stochasticity is modeled by systems of stochastic differential equations. However, this type of stochasticity is not always the best suited for ecological modeling. Instead, biological systems can be modeled using piecewise deterministic Markov processes (PDMP). For a PDMP the process follows the flow of a system of ordinary differential equations for a random time, after which the environment switches to a different state, where the dynamics is given by a different system of differential equations. Then this is repeated. The current paper is devoted to the study of the dynamics of $n$ populations described by $n$-dimensional Kolmogorov PDMP. We provide sharp conditions for persistence and extinction, based on the invasion rates (Lyapunov exponents) of the ergodic probability measures supported on the boundary of the positive orthant. In order to showcase the applicability of our results, we apply the theory in some interesting ecological examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandru Hening, Siddharth Sabharwal. 2025-07-25. Population dynamics under random switching. https://arxiv.org/abs/2507.19615

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