Date of Submission
Spring 2020
Academic Program
Mathematics
Project Advisor 1
Matthew Junge
Abstract/Artist's Statement
Chase-escape is a competitive growth process in which prey spread through an environment while being chased and consumed by predators. The environment is typically modeled by a graph—such as a lattice, tree, or clique—and the species by particles competing to occupy sites. It is arguably more natural to study these dynamics in heterogeneous environments. To this end, we consider chase-escape on a canonical sparse random graph called the Erdo ̋s-R ́enyi graph. We show that if prey spreads too slowly then both species quickly die out. On the other hand, if prey spreads fast enough, then coexistence occurs. Concrete bounds are given for the location of the threshold. Simulation evidence is provided.
Open Access Agreement
Open Access
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Recommended Citation
Bernstein, Emma Sylvie, "Chase-Escape on Sparse Networks" (2020). Senior Projects Spring 2020. 326.
https://digitalcommons.bard.edu/senproj_s2020/326
This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.
Included in
Applied Mathematics Commons, Discrete Mathematics and Combinatorics Commons, Probability Commons