A Random-Surfer Web-Graph Model (2006) [5 citations — 0 self]
Download:
http://www.cs.cmu.edu/~avrim/Papers/webgraph.pdf
http://www.aladdin.cs.cmu.edu/papers/pdfs/y2006/ra
CACHED:
http://www.cs.cmu.edu/~avrim/Papers/webgraph.pdf
http://www.aladdin.cs.cmu.edu/papers/pdfs/y2006/ra
CACHED:
by
Avrim Blum Hubert
,
T-h. Hubert
,
Chan Mugizi
,
Robert Rwebangira
In ANALCO ’06: Proceedings of the eigth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Hubert06arandom-surfer,
author = {Avrim Blum Hubert and T-h. Hubert and Chan Mugizi and Robert Rwebangira},
title = {A Random-Surfer Web-Graph Model},
booktitle = {In ANALCO ’06: Proceedings of the eigth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics},
year = {2006},
pages = {238246}
}
author = {Avrim Blum Hubert and T-h. Hubert and Chan Mugizi and Robert Rwebangira},
title = {A Random-Surfer Web-Graph Model},
booktitle = {In ANALCO ’06: Proceedings of the eigth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics},
year = {2006},
pages = {238246}
}
Bookmarks
OpenURL
Abstract:
In this paper we provide theoretical and experimental results on a random-surfer model for construction of a random graph. In this model, a new node connects to the existing graph by choosing a start node at random and then performing a short random walk. We show that in certain formulations, this results in the same distribution as the preferentialattachment random-graph model, and in others we give a direct analysis of power-law distribution of degrees or "virtual degrees" of the resulting graphs. We also present experimental results for a number of settings of parameters that we are not able to analyze mathematically.
