Existence and sharpness of the phase transition for the frog model on transitive graphs

We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{P}\mathrm{o}\mathrm{i}\mathrm{s}\mathrm{s}\mathrm{o}\mathrm{n}(\lambda )$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping. Each active particle performs an independent, continuous-time simple random walk, becoming inactive after time $t$. Once an active frog jumps to a vertex, it activates all of its particles. The survival of active particles can be studied as a dependent percolation model with two parameters $\lambda$ and $t$. In the present work, we establish the existence of a phase transition with respect to each parameter for non-amenable graphs of bounded degrees and quasi-transitive graphs of superlinear polynomial growth, as well as prove the sharpness of the phase transition for transitive graphs.