2000 character limit reached
The contact process on scale-free geometric random graphs
Published 17 Aug 2022 in math.PR | (2208.08346v3)
Abstract: We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}d$. This class includes the age-dependent random connection model and the soft Boolean model. In the ultrasmall regime of these random graphs we provide exact asymptotics for the non-extinction probability when the rate of infection spread is small and show for a finite version of these graphs that the extinction time is of exponential order in the size of the graph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.