SearcharxivSearch

arXiv · 2004.01417

Comparison principles and applications to mathematical modelling of vegetal meta-communities

Abstract

This article partakes of the PEGASE project the goal of which is a better understanding of the mechanisms explaining the behaviour of species living in a network of forest patches linked by ecological corridors (hedges for instance). Actually we plan to study the effect of the fragmentation of the habitat on biodiversity. A simple neutral model for the evolution of abundances in a vegetal metacommunity is introduced. Migration between the communities is explicitely modelized in a deterministic way, while the reproduction process is dealt with using Wright-Fisher models, independently within each community. The large population limit of the model is considered. The hydrodynamic limit of this split-step method is proved to be the solution of a partial differential equation with a deterministic part coming from the migration process and a diffusion part due to the Wright-Fisher process. Finally, the diversity of the metacommunity is adressed through one of its indicator, the mean extinction time of a species. At the limit, using classical comparison principles, the exchange process between the communities is proved to slow down extinction. This shows that the existence of corridors seems to be good for the biodiversity.

Explore related subjects

Keep this discovery

BibTeXRIS

Gauthier Delvoye, Olivier Goubet, Frédéric Paccaut. 2020-04-03. Comparison principles and applications to mathematical modelling of vegetal meta-communities. https://arxiv.org/abs/2004.01417

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