Search arXivSearch

arXiv · 1302.3147

On a stochastic Ricker competition model

Abstract

We model the evolution of two competing populations $U_t, V_t $ by a two-dimensional size-dependent branching process. The population characteristics are assumed to be close to each other, as in a resident-mutant situation. Given that $U_t = m$ and $V_t = n$ the expected values of $U_{t+1}$ and $V_{t+1}$ are given by $me^{r - K(m + bn)} $ and $ne^{\tilde r - \tilde K (n + am)}$, respectively, where $r, \tilde r$ model the intrinsic population growth, $K, \tilde K $ model the force of inhibition on the population growth by the present population (such as scarcity of food), and $ a, b $ model the interaction between the two populations. For small $K, \tilde K $ the process typically follows the corresponding deterministic Ricker competition model closely, for a very long time. Under some conditions, notably a mutual invasibility condition, the deterministic model has a coexistence fixed point in the open first quadrant. The asymptotic behaviour is studied through the quasi-stationary distribution of the process. We initiate a study of those distributions as the inhibitive force $K, \tilde K$ approach 0.

Explore related subjects

Keep this discovery

BibTeXRIS

Göran Högnäs. 2013-02-13. On a stochastic Ricker competition model. https://arxiv.org/abs/1302.3147

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