SearcharxivSearch

arXiv · 1509.08619

Links between deterministic and stochastic approaches for invasion in growth-fragmentation-death models

Abstract

We present two approaches to study invasion in growth-fragmentation-death mod- els. The first one is based on a stochastic individual based model, which is a piecewise deterministic branching process with a continuum of types, and the second one is based on an integro-differential model. The invasion of the population is described by the survival probability for the former model and by an eigenproblem for the latter one. We study these two notions of invasion fitness, giving different characterizations of the growth of the population, and we make links between these two complementary points of view. In particular we prove that the two approaches lead to the same crite- rion of possible invasion. Based on Krein-Rutman theory, we also give a proof of the existence of a solution to the eigenproblem, which satisfies the conditions needed for our study of the stochastic model, hence providing a set of assumptions under which both approaches can be carried out. Finally, we motivate our work in the context of adaptive dynamics in a chemostat model.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabien Campillo, Nicolas Champagnat, Coralie Fritsch. 2015-09-29. Links between deterministic and stochastic approaches for invasion in growth-fragmentation-death models. https://arxiv.org/abs/1509.08619

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