Short random walks on graphs

Abstract

We study the short term behavior of random walks on graphs, in particular, the rate at which a random walk discovers new vertices and edges. We prove a conjecture by Linial that the expected time to find ~ distinct vertices is O (Af3). We also prove an upper bound of O(A42) on the time to traverse M edges, and O (MN) on the time to either visit ~ vertices… (More)
DOI: 10.1145/167088.167275

Topics

Statistics

0246'96'99'02'05'08'11'14'17
Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Barnes1993ShortRW, title={Short random walks on graphs}, author={Greg Barnes and Uriel Feige}, booktitle={STOC}, year={1993} }