1 paper
Mikhail Beliayeu, Petr Chmel, Bhargav Narayanan +1
Given a connected graph G with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on G, a random walker moves as follows: from an…