Papers › Continuous limits of large plant-pollinator random networks and some applications
Continuous limits of large plant-pollinator random networks and some applications
Sylvain Billiard, Hélène Leman, Thomas Rey, Viet Chi Tran
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections