A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Limit theorems for an epidemic model on the com-plete graph
We study the following random walks system on the complete graph with n vertices. At time zero, there is a number of active and inactive particles living on the vertices. Active particles move as continuous-time, rate 1, random walks on the graph, and, any time a vertex with an inactive particle on it is visited, this particle turns into active and starts an independent random walk. However, for a fixed integer L ≥ 1, each active particle dies at the instant it reaches a total of L jumpsfatcat:oa7w2zbt7zfgrafvrxogbc2hvi