Design of On-line Algorithms Using Hitting Times


Random walks are well known for playing a crucial role in the design of randomized off-line as well as on-line algorithms. In this work we prove some basic identities for ergodic Markov chains (e.g., an interesting characterization of reversibility in Markov chains is obtained in terms of first passage times). Besides providing new insight into random walks… (More)
DOI: 10.1137/S0097539798335511


Cite this paper

@inproceedings{Tetali1994DesignOO, title={Design of On-line Algorithms Using Hitting Times}, author={Prasad Tetali}, booktitle={SODA}, year={1994} }