57 citations · 257 across the 30 of their papers we have counts for
3 papers · 1 filter
Frog model wakeup time on the complete graph
Nikki Cartern, Brittany Dygert, Matthew Junge +4
The frog model is a system of random walks where active particles set sleeping particles in motion. On the complete graph with n vertices it is equivalent to a well-understood rumo…
Site recurrence for coalescing random walk
Itai Benjamini, Eric Foxall, Ori Gurel-Gurevich +2
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process i…
From transience to recurrence with Poisson tree frogs
Christopher Hoffman, Tobias Johnson, Matthew Junge
Consider the following interacting particle system on the -ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are…