Search arXivSearch

arXiv · 1204.2909

The Fleming-Viot limit of an interacting spatial population with fast density regulation

Abstract

We consider population models in which the individuals reproduce, die and also migrate in space. The population size scales according to some parameter $N$, which can have different interpretations depending on the context. Each individual is assigned a mass of 1/N and the total mass in the system is called \emph{population density}. The dynamics has an intrinsic density regulation mechanism that drives the population density towards an equilibrium. We show that under a timescale separation between the \emph{slow} migration mechanism and the \emph{fast} density regulation mechanism, the population dynamics converges to a Fleming-Viot process as the scaling parameter $N$ approaches $\infty$. We first prove this result for a basic model in which the birth and death rates can only depend on the population density. In this case we obtain a \emph{neutral} Fleming-Viot process. We then extend this model by including position-dependence in the birth and death rates, as well as, offspring dispersal and immigration mechanisms. We show how these extensions add \emph{mutation} and \emph{selection} to the limiting Fleming-Viot process. All the results are proved in a multi-type setting, where there are $q$ types of individuals interacting with each other. We illustrate the usefulness of our convergence result by discussing applications in population genetics and cell biology.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ankit Gupta. 2012-12-20. The Fleming-Viot limit of an interacting spatial population with fast density regulation. https://doi.org/10.1214/ejp.v17-1964

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR