Spatial Invasion of Cooperative Parasites
Vianney Brouard, Cornelia Pokalyuk, Marco Seiler, Hung Tran

TL;DR
This paper analyzes the invasion probabilities and times of cooperative parasites in spatially structured host populations modeled by random geometric graphs, providing bounds and asymptotic characterizations supported by simulations.
Contribution
It introduces bounds and asymptotic results for invasion probabilities and times of cooperative parasites in spatial networks, extending previous models to spatially structured populations.
Findings
Invasion probabilities relate to survival probabilities of cooperative branching processes.
Asymptotic invasion times are characterized mathematically.
Simulation results support theoretical bounds.
Abstract
In this paper we study invasion probabilities and invasion times of cooperative parasites spreading in spatially structured host populations. The spatial structure of the host population is given by a random geometric graph on , , with a Poisson()-distributed number of vertices and in which vertices are connected over an edge when they have a distance of at most for some and . At a host infection many parasites are generated and parasites move along edges to neighbouring hosts. We assume that parasites have to cooperate to infect hosts, in the sense that at least two parasites need to attack a host simultaneously. We find lower and upper bounds on the invasion probability of the parasites in terms of survival probabilities of branching processes with cooperation. Furthermore,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Game Theory and Cooperation · Stochastic processes and statistical mechanics · Evolution and Genetic Dynamics
