8 citations · 35 across the 17 of their papers we have counts for
1 paper · 1 filter
Tal Orenshtein, Igor Shinkar
We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex m…