Showing math.PRShow all
3 papers · 1 filter
math.PR2026
Source localisation in simple random walks
Ritesh Goenka, Peter Keevash, Tomasz Przybyłowski
We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first steps. Conside…
math.PR2024
Dissipative particle systems on expanders
John Haslegrave, Peter Keevash
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different s…
math.PR2024
Balanced two-type annihilation: mean-field asymptotics
John Haslegrave, Peter Keevash
We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, an…