SearcharxivSearch

arXiv · 2201.05219

Continuous limits of large plant-pollinator random networks and some applications

Abstract

We study a stochastic individual-based model of interacting plant and pollinator species through a bipartite graph: each species is a node of the graph, an edge representing interactions between a pair of species. The dynamics of the system depends on the between- and within-species interactions: pollination by insects increases plant reproduction rate but has a cost which can increase plant death rate, depending on the densities of pollinators. Pollinators reproduction is increased by the resources harvested on plants. Each species is characterized by a trait corresponding to its degree of generalism. This trait determines the structure of the interaction graph and the quantities of resources exchanged between species. Our model includes in particular nested or modular networks. Deterministic approximations of the stochastic measure-valued process by systems of ordinary differential equations or integro-differential equations are established and studied, when the population is large or when the graph is dense and can be replaced with a graphon. The long-time behaviors of these limits are studied and central limit theorems are established to quantify the difference between the discrete stochastic individual-based model and the deterministic approximations. Finally, studying the continuous limits of the interaction network and the resulting PDEs, we show that nested plant-pollinator communities are expected to collapse towards a coexistence between a single pair of species of plants and pollinators.

Explore related subjects

Keep this discovery

BibTeXRIS

Sylvain Billiard, Hélène Leman, Thomas Rey, Viet Chi Tran. 2022-01-13. Continuous limits of large plant-pollinator random networks and some applications. https://arxiv.org/abs/2201.05219

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