SearcharxivSearch

arXiv · 1205.4919

Daphnias: from the individual based model to the large population equation

Abstract

The class of deterministic 'Daphnia' models treated by Diekmann et al. (J Math Biol 61: 277-318, 2010) has a long history going back to Nisbet and Gurney (Theor Pop Biol 23: 114-135, 1983) and Diekmann et al. (Nieuw Archief voor Wiskunde 4: 82-109, 1984). In this note, we formulate the individual based models (IBM) supposedly underlying those deterministic models. The models treat the interaction between a general size-structured consumer population ('Daphnia') and an unstructured resource ('algae'). The discrete, size and age-structured Daphnia population changes through births and deaths of its individuals and throught their aging and growth. The birth and death rates depend on the sizes of the individuals and on the concentration of the algae. The latter is supposed to be a continuous variable with a deterministic dynamics that depends on the Daphnia population. In this model setting we prove that when the Daphnia population is large, the stochastic differential equation describing the IBM can be approximated by the delay equation featured in (Diekmann et al., l.c.).

Explore related subjects

Keep this discovery

BibTeXRIS

J. A. J. Metz, Viet Chi Tran. 2012-05-22. Daphnias: from the individual based model to the large population equation. https://doi.org/10.1007/s00285-012-0619-5

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