It's a Small World for Random Surfers
Discrete Mathematics
2014-04-30 v1 Probability
Abstract
We prove logarithmic upper bounds for the diameters of the random-surfer Webgraph model and the PageRank-based selection Webgraph model, confirming the small world phenomenon holds for them. In the special case when the generated graph is a tree, we provide close lower and upper bounds for the diameters of both models.
Keywords
Cite
@article{arxiv.1404.7189,
title = {It's a Small World for Random Surfers},
author = {Abbas Mehrabian and Nick Wormald},
journal= {arXiv preprint arXiv:1404.7189},
year = {2014}
}
Comments
36 pages, 1 figure