Network exploration by random walks: A large deviation perspective

Sarvesh K. Upadhyay, Trifce Sandev, Sanjay Kumar +1

We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus…