2000 character limit reached
It's a Small World for Random Surfers (1404.7189v1)
Published 28 Apr 2014 in cs.DM and math.PR
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.