The Web as a graph

  • Authors:
  • Ravi Kumar;Prabhakar Raghavan;Sridhar Rajagopalan;D. Sivakumar;Andrew Tompkins;Eli Upfal

  • Affiliations:
  • IBM Almaden Research Center K53/B1, 650 Harry Road, San Jose CA;-;-;-;-;Computer Science Department, Brown University, Providence, RI

  • Venue:
  • PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
  • Year:
  • 2000

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 has about a billion nodes today, several billion links, and appears to grow exponentially with time. There are many reasons—mathematical, sociological, and commercial—for studying the evolution of this graph. We first review a set of algorithms that operate on the Web graph, addressing problems from Web search, automatic community discovery, and classification. We then recall a number of measurements and properties of the Web graph. Noting that traditional random graph models do not explain these observations, we propose a new family of random graph models.