111 citations · 173 across the 11 of their papers we have counts for
15 papers · 1 filter
On the number of maximal paths in directed last-passage percolation
Hugo Duminil-Copin, Harry Kesten, Fedor Nazarov +2
We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice in which weights take finitely many values is typ…
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…
Random walk in a high density dynamic random environment
Frank den Hollander, Harry Kesten, Vladas Sidoravicius
The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves…
Oriented percolation in a random environment
Harry Kesten, Vladas Sidoravicius, Maria Eulalia Vares
On the lattice we consider the following oriented (northwest-northeast) site percolati…
Percolation since Saint-Flour
Geoffrey R. Grimmett, Harry Kesten
This is a short survey of work on percolation and first-passage percolation since the publication (in 1996 and 1984, respectively) of the two authors' Saint-Flour notes on these to…
On the compatibility of binary sequences
Harry Kesten, Bernardo N. B. de Lima, Vladas Sidoravicius +1
An ordered pair of semi-infinite binary sequences is said to be compatible if there is a way of removing a certain number (possibly infinite) of ones from and zeroes fr…