Laws of large numbers for the frog model on the complete graph

Abstract

The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of the frog model on the complete graph with $N+1$ vertices. In the first version we consider, active particles have geometrically distributed lifetimes. In the second version, the displacement of each awakened particle lasts until it hits a vertex already visited by the process. For each model, we prove that as $N\to \infty$, the trajectory of the process is well approximated by a three-dimensional discrete-time dynamical system. We also study the long-term behavior of the corresponding deterministic systems.

References in corpus (14)

• Differential equation approximations for Markov chains
• Phase transition for the frog model
• From transience to recurrence with Poisson tree frogs
• Absorbing-State Phase Transition for Driven-Dissipative Stochastic Dynamics on $Z$
• Recurrence and transience for the frog model on trees
• A new upper bound for the critical probability of the frog model on homogeneous trees
• Infection spread for the frog model on trees
• The critical density for the frog model is the degree of the tree
• Frogs on trees?
• Cover time for the frog model on trees
• A large deviations principle for the Maki-Thompson rumour model
• Phase transition for the frog model on biregular trees
• Random walks systems with finite lifetime on $\mathbb{Z}$
• Frog model wakeup time on the complete graph