Authors
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D Sivakumar, Andrew Tomkins, Eli Upfal
Publication date
2000/11/12
Conference
Proceedings 41st Annual Symposium on Foundations of Computer Science
Pages
57-65
Publisher
IEEE
Description
The Web may be viewed as a directed graph each of whose vertices is a static HTML Web page, and each of whose edges corresponds to a hyperlink from one Web page to another. We propose and analyze random graph models inspired by a series of empirical observations on the Web. Our graph models differ from the traditional G/sub n,p/ models in two ways: 1. Independently chosen edges do not result in the statistics (degree distributions, clique multitudes) observed on the Web. Thus, edges in our model are statistically dependent on each other. 2. Our model introduces new vertices in the graph as time evolves. This captures the fact that the Web is changing with time. Our results are two fold: we show that graphs generated using our model exhibit the statistics observed on the Web graph, and additionally, that natural graph models proposed earlier do not exhibit them. This remains true even when these …
Total citations
20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202414284162736161594551476532423148452927362819614
Scholar articles
R Kumar, P Raghavan, S Rajagopalan, D Sivakumar… - Proceedings 41st Annual Symposium on Foundations …, 2000