By Topic

Simulating the Webgraph: a comparative analysis of models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Donato, D. ; Dipt. di Informatica e Sistemistica, Rome Univ., Italy ; Laura, L. ; Leonardi, S. ; Millozzi, S.

The Webgraph is the directed graph produced by the World Wide Web's hyperlinked structure: its nodes are static html pages, and its edges are the hyperlinks between two pages. Since the early '90s, the Web has grown exponentially - a trend we expect will continue. Today's Webgraph has several billion edges, but in spite of its size, it exhibits a well-defined structure characterized by several properties. In the past few years, several research papers have reported these properties and proposed various random graph models. We simulated several of these models and compared them against a 300-million-node sample of the Webgraph provided by the Stanford WebBase project (∼testbed/doc2/WebBase/). All the software we developed to perform this comparison is free to download from the European Research Project COSIN Web site ( Over the past six years, computer scientists, economists, mathematicians, and physicists have extensively studied the Webgraph's properties. All this research was motivated primarily by the need to efficiently mine the huge quantities of information on the Web - information that is often distributed among several pages. The first major discovery concerned in-degree, an intuitive and simplistic measure of page importance. (Each node in a directed graph is characterized by in-degree and out-degree - the number of incoming and outgoing links, respectively).

Published in:

Computing in Science & Engineering  (Volume:6 ,  Issue: 6 )