Abstract
We show that in power law random graphs, almost surely, the expected rate at which a random walk with lookahead discovers the nodes of the graph is sublinear.
Citation
Milena Mihail. Amin Saberi. Prasad Tetali. "Random Walks with Lookahead on Power Law Random Graphs." Internet Math. 3 (2) 147 - 152, 2006.
Information
Published: 2006
First available in Project Euclid: 7 March 2008
zbMATH: 1125.05095
MathSciNet: MR2321827
Rights: Copyright © 2006 A K Peters, Ltd.
