Random walks on weighted graphs and applications to on-line algorithms
Don Coppersmith, Peter G. Doyle, Prabhakar Raghavan, Marc Snir · Journal of the ACM · 1993
The design and analysis of randomized on-line algorithms are studied.This problem is shown to be closely related to the synthesis of random wdlks on graphs with positive real costs on their edges.A theory is developed for the synthesis of such wdlks, and it is employed to design competitive on-line algorithms.