Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer membership management. While several such algorithms are ubiquitous, and use numerous random walk samples, the walks themselves have always been performed naively.
['Atish Das Sarma', 'Anisur Rahaman Molla', 'Gopal Pandurangan']
Near-optimal random walk sampling in distributed networks