A new method to automatically compute processing times for random walks based distributed algorithms
Thibault Bernard, A. Bui, M. Bui, D. Sohier · 2004
Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.