License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.857
URN: urn:nbn:de:0030-drops-47437
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4743/
Mehrabian, Abbas ;
Wormald, Nick
It’s a Small World for Random Surfers
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 get close lower and upper bounds for the diameters of both models.
BibTeX - Entry
@InProceedings{mehrabian_et_al:LIPIcs:2014:4743,
author = {Abbas Mehrabian and Nick Wormald},
title = {{It’s a Small World for Random Surfers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {857--871},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4743},
URN = {urn:nbn:de:0030-drops-47437},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.857},
annote = {Keywords: random-surfer webgraph model, PageRank-based selection model, smallworld phenomenon, height of random trees, probabilistic analysis, large deviations}
}
Keywords: |
|
random-surfer webgraph model, PageRank-based selection model, smallworld phenomenon, height of random trees, probabilistic analysis, large deviations |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) |
Issue Date: |
|
2014 |
Date of publication: |
|
04.09.2014 |