##
**Chase-escape on the configuration model.**
*(English)*
Zbl 1496.60116

Summary: Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-\(\lambda\) Poisson process while being chased and consumed by blue particles according to a rate-\(1\) Poisson process. Given a growing sequence of finite graphs, the critical rate \(\lambda_c\) is the largest value of \(\lambda\) for which red fails to reach a positive fraction of the vertices with high probability. We provide a conjecturally sharp lower bound and an implicit upper bound on \(\lambda_c\) for supercritical random graphs sampled from the configuration model with independent and identically distributed degrees with finite second moment. We additionally show that the expected number of sites occupied by red undergoes a phase transition and identify the location of this transition.

### MSC:

60K35 | Interacting random processes; statistical mechanics type models; percolation theory |

PDFBibTeX
XMLCite

\textit{E. Bernstein} et al., Electron. Commun. Probab. 27, Paper No. 29, 14 p. (2022; Zbl 1496.60116)

### References:

[1] | David Aldous and William B. Krebs, The birth-and-assassination process, Statistics & Probability Letters 10 (1990), 427-430. · Zbl 0712.60090 |

[2] | Erin Beckman, Keisha Cook, Nicole Eikmeier, Sarai Hernandez-Torres, and Matthew Junge, Chase-escape with death on trees, The Annals of Probability 49 (2021), no. 5, 2530-2547. · Zbl 1489.60011 |

[3] | Béla Bollobás and Oliver Riordan, An old approach to the giant component problem, Journal of Combinatorial Theory, Series B 113 (2015), 236-260. · Zbl 1315.05123 |

[4] | Charles Bordenave, On the birth-and-assassination process, with an application to scotching a rumor in a network, Electronic Journal of Probability 13 (2008), 2014-2030. · Zbl 1187.60065 |

[5] | Charles Bordenave, Extinction probability and total progeny of predator-prey dynamics on infinite trees, Electronic Journal of Probability 19 (2014), no. 20, 1-33. · Zbl 1307.60115 |

[6] | Duncan S Callaway, Mark EJ Newman, Steven H Strogatz, and Duncan J Watts, Network robustness and fragility: Percolation on random graphs, Physical review letters 85 (2000), no. 25, 5468. |

[7] | Elisabetta Candellero and Alexandre Stauffer, First passage percolation in hostile environment is not monotone, 2110.05821 (2021). · Zbl 1492.60268 |

[8] | Guilherme Ferraz de Arruda, Elcio Lebensztayn, Francisco A Rodrigues, and Pablo Rodríguez, A process of rumour scotching on finite populations, Royal Society open science 2 (2015), no. 9, 150240. |

[9] | Maria Deijfen and Remco van der Hofstad, The winner takes it all, The Annals of Applied Probability 26 (2016), no. 4, 2419-2453. · Zbl 1352.60129 |

[10] | Rick Durrett, Matthew Junge, and Si Tang, Coexistence in chase-escape, Electronic Communications in Probability 25 (2020), 14 pp. · Zbl 1434.60285 |

[11] | Thomas Finn and Alexandre Stauffer, Non-equilibrium multi-scale analysis and coexistence in competing first passage percolation, 2009.05463 (2020). |

[12] | Olle Häggström and Robin Pemantle, First passage percolation and a model for competing spatial growth, Journal of Applied Probability 35 (1998), no. 3, 683-692. · Zbl 0920.60085 |

[13] | Alexander Hinsen, Benedikt Jahnel, Elie Cali, and Jean-Philippe Wary, Phase transitions for chase-escape models on Poisson-Gilbert graphs, Electronic Communications in Probability 25 (2020), 1 - 14. · Zbl 1434.60194 |

[14] | Christopher Hoffman, Geodesics in first passage percolation, The Annals of Applied Probability (2008), 1944-1969. · Zbl 1153.60055 |

[15] | Svante Janson, The probability that a random multigraph is simple, Combinatorics, Probability and Computing 18 (2009), no. 1-2, 205-225. · Zbl 1216.05145 |

[16] | Svante Janson and Malwina Luczak, A new approach to the giant component problem, Random Structures & Algorithms 34 (2009), no. 2, 197-216. · Zbl 1177.05110 |

[17] | Felix Joos, Guillem Perarnau, Dieter Rautenbach, and Bruce Reed, How to determine if a random graph with a fixed degree sequence has a giant component, Probability Theory and Related Fields 170 (2018), 263-310. · Zbl 1379.05102 |

[18] | Matthew James Keeling, The ecology and evolution of spatial host-parasite systems, Ph.D. thesis, University of Warwick, 1995. |

[19] | George Kordzakhia, The escape model on a homogeneous tree, Electronic Communications in Probability 10 (2005), 113-124. · Zbl 1111.60075 |

[20] | Igor Kortchemski, A predator-prey SIR type dynamics on large complete graphs with three phase transitions, Stochastic Processes and their Applications 125 (2015), no. 3, 886-917. · Zbl 1334.60181 |

[21] | Igor Kortchemski, Predator-prey dynamics on infinite trees: A branching random walk approach, Journal of Theoretical Probability 29 (2016), no. 3, 1027-1046. · Zbl 1349.92125 |

[22] | Aanjaneya Kumar, Peter Grassberger, and Deepak Dhar, Chase-escape percolation on the 2d square lattice, Physica A: Statistical Mechanics and its Applications (2021), 126072. · Zbl 1528.92040 |

[23] | Michael Molloy and Bruce Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms 6 (1995), no. 2-3, 161-180. · Zbl 0823.05050 |

[24] | Mark EJ Newman, The structure and function of complex networks, SIAM review 45 (2003), no. 2, 167-256. · Zbl 1029.68010 |

[25] | David Rand, Matthew Keeling, and Howard Wilson, Invasion, stability and evolution to criticality in spatially extended, artificial host—pathogen ecologies, Proceedings of the Royal Society of London. Series B: Biological Sciences 259 (1995), no. 1354, 55-63. |

[26] | Si Tang, George Kordzakhia, and Steven Lalley, Phase transition for the chase-escape model on 2d lattices, 1807.08387 (2018). |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.