The web as a graph: measurements, models, and methods

  • Authors:
  • Jon M. Kleinberg;Ravi Kumar;Prabhakar Raghavan;Sridhar Rajagopalan;Andrew S. Tomkins

  • Affiliations:
  • Department of Computer Science, Cornell University, Ithaca, NY;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA

  • Venue:
  • COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today, over a billion links, and appears to grow exponentially with time. There are many reasons -- mathematical, sociological, and commercial -- for studying the evolution of this graph. In this paper we begin by describing two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery. We then report a number of measurements and properties of this graph that manifested themselves as we ran these algorithms on the Web. Finally, we observe that traditional random graph models do not explain these observations, and we propose a new family of random graph models. These models point to a rich new sub-field of the study of random graphs, and raise questions about the analysis of graph algorithms on the Web.