How to Compute Times of Random Walks Based Distributed Algorithms

Abstract

Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led to compute certain quantities, namely the hitting times and the cover time. Until now, only bounds on these quantities… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics