SearcharxivSearch

arXiv · 2110.02714

Spatial Populations with seed-bank: renormalisation on the hierarchical group

Abstract

We consider a system of interacting diffusions labeled by a geographic space that is given by the hierarchical group $\Omega_N$ of order $N\in\mathbb{N}$. Individuals live in colonies and are subject to resampling and migration as long as they are active. Each colony has a seed-bank into which individuals can retreat to become dormant, suspending their resampling and migration until they become active again. The migration kernel has a hierarchical structure: individuals hop between colonies at a rate that depends on the hierarchical distance between the colonies. The seed-bank has a layered structure: when individuals become dormant they acquire a colour that determines the rate at which they become active again. The latter allows us to model seed-banks whose wake-up times have a fat tail. We analyse a system of coupled stochastic differential equations that describes the population in the large-colony-size limit. For fixed $N\in\mathbb{N}$, the system exhibits a dichotomy between coexistence and clustering. We identify the range of parameters controlling the migration and the seed-bank for which clustering prevails. We carry out a multi-scale renormalisation analysis in the hierarchical mean-field limit $N\to\infty$. We show that block averages on hierarchical space-time scale $k \in \mathbb{N}$ perform a diffusion with a renormalised diffusion function that depends on $k$. In the clustering regime, after an appropriate scaling with $k$, this diffusion function converges to the Fisher-Wright diffusion function as $k\to\infty$, irrespective of the diffusion function controlling the resampling. For several subclasses of parameters we identify the speed at which the scaled renormalised diffusion function converges to the Fisher-Wright diffusion as $k\to\infty$. We show that the seed-bank reduces the speed compared to the model without seed-bank.

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Greven, Frank den Hollander, Margriet Oomen. 2021-10-06. Spatial Populations with seed-bank: renormalisation on the hierarchical group. https://arxiv.org/abs/2110.02714

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