On an epidemic model on finite graphs
On an epidemic model on finite graphs
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda $) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple graph $G=(V,E)$. Initially, only the particles occupying $\mathbf{o}$ are active. Active particles …