Document Open Access Logo

It’s a Small World for Random Surfers

Authors Abbas Mehrabian, Nick Wormald

Thumbnail PDF


  • Filesize: 0.5 MB
  • 15 pages

Document Identifiers

Author Details

Abbas Mehrabian
Nick Wormald

Cite AsGet BibTex

Abbas Mehrabian and Nick Wormald. It’s a Small World for Random Surfers. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 857-871, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)


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 get close lower and upper bounds for the diameters of both models.
  • random-surfer webgraph model
  • PageRank-based selection model
  • smallworld phenomenon
  • height of random trees
  • probabilistic analysis
  • large deviations


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail