no code implementations • 23 Oct 2017 • Michael Amir, Alfred M. Bruckstein
Furthermore, assuming a certain natural probability distribution over the move choices of the agents on the grid (in case there are multiple shortest paths between an agent and its predecessor), the walks converge to the uniform distribution over all shortest paths from $s$ to $t$.
