Super-exponential extinction time of the contact process on random geometric graphs
Abstract
In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate λ >0, the contact process on these graphs survives a time super-exponential in the number of vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.