SearcharxivSearch

arXiv · math/0512550

A two-species competition model on Z^d

Abstract

We consider a two-type stochastic competition model on the integer lattice Z^d. The model describes the space evolution of two ``species'' competing for territory along their boundaries. Each site of the space may contain only one representative (also referred to as a particle) of either type. The spread mechanism for both species is the same: each particle produces offspring independently of other particles and can place them only at the neighboring sites that are either unoccupied, or occupied by particles of the opposite type. In the second case, the old particle is killed by the newborn. The rate of birth for each particle is equal to the number of neighboring sites available for expansion. The main problem we address concerns the possibility of the long-term coexistence of the two species. We have shown that if we start the process with finitely many representatives of each type, then, under the assumption that the limit set in the corresponding first passage percolation model is uniformly curved, there is positive probability of coexistence.

Explore related subjects

Keep this discovery

BibTeXRIS

George Kordzakhia, Steven P. Lalley. 2005-12-24. A two-species competition model on Z^d. https://arxiv.org/abs/math/0512550

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