SearcharxivSearch

arXiv · 2108.00197

Spatially Inhomogeneous Populations with Seed-banks: II. Clustering Regime

Abstract

We consider a spatial version of the classical Moran model with seed-banks where the constituent populations have finite sizes. Individuals live in colonies labelled by $\mathbb{Z}^d$, $d\geq 1$, playing the role of a geographic space, carry one of the two $types$: $\heartsuit$ or $\spadesuit$, and change type via $resampling$ as long as they are $active$. Each colony contains a seed-bank into which individuals can enter to become $dormant$, suspending their resampling until they exit the seed-bank and become active again. Individuals resample not only from their own colony, but also from other colonies according to a symmetric random walk transition kernel. The latter is referred to as $migration$. The sizes of the populations vary across colonies and remain constant in time. It was shown in Hollander and Nandan (2021) that the system is well-defined, admits a family of equilibria parametrized by the initial density of type $\heartsuit$, and exhibits a dichotomy between $clustering$ (mono-type equilibrium) and $coexistence$ (multi-type equilibrium). This dichotomy is determined by a clustering criterion that is given in terms of a dual of the system, which consists of a system of $interacting$ coalescing random walks. In this paper we provide an alternative clustering criterion, given in terms of an auxiliary dual that is simpler than the original dual, and identify a range of parameters for which the criterion is met, which we refer to as the $clustering$ $regime$. It turns out that if the sizes of the active populations are non-clumping (i.e., do not take arbitrarily large values in finite regions of the geographic space) and the relative strengths of the seed-banks (i.e., the ratio of the sizes of dormant and active population in each colony) are bounded uniformly over the geographic space, then clustering prevails if and only if the (symmetrised) migration kernel is recurrent.

Explore related subjects

Keep this discovery

BibTeXRIS

Frank den Hollander, Shubhamoy Nandan. 2021-07-31. Spatially Inhomogeneous Populations with Seed-banks: II. Clustering Regime. https://doi.org/10.1016/j.spa.2022.04.010

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