115 citations · 602 across the 20 of their papers we have counts for
1 paper · 1 filter
Felix Thiel, Itay Mualem, David Kessler +1
A classical random walker starting on a node of a finite graph will always reach any other node since the search is ergodic, namely it is fully exploring space, hence the arrival p…