Search arXivSearch

arXiv · 1301.0119

Stochastic spatial model of producer-consumer systems on the lattice

Abstract

The objective of this paper is to give a rigorous analysis of a stochastic spatial model of producer-consumer systems that has been recently introduced by Kang and the author to understand the role of space in ecological communities in which individuals compete for resources. Each point of the square lattice is occupied by an individual which is characterized by one of two possible types, and updates its type in continuous time at rate one. Each individual being thought of as a producer and consumer of resources, the new type at each update is chosen at random from a certain interaction neighborhood according to probabilities proportional to the ability of the neighbors to consume the resource produced by the individual to be updated. In addition to giving a complete qualitative picture of the phase diagram of the spatial model, our results indicate that the nonspatial deterministic mean-field approximation of the stochastic process fails to describe the behavior of the system in the presence of local interactions. In particular, we prove that, in the parameter region where the nonspatial model displays bistability, there is a dominant type that wins regardless of its initial density in the spatial model, and that the inclusion of space also translates into a significant reduction of the parameter region where both types coexist.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Lanchier. 2013-01-01. Stochastic spatial model of producer-consumer systems on the lattice. https://arxiv.org/abs/1301.0119

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