One-Step Memory Random Walk on Complex Networks: An Efficient Local Navigation Strategy

We propose one-step memory random walk on complex networks for which at each time step, the walker will not be allowed to revisit the last position. Mean first passage time is adopted to quantify i...