Webgraph

Properties

• The degree distribution of the webgraph strongly differs from the degree distribution of the classical random graph model, the Erdős–Rényi model: in the Erdős–Rényi model, there are very few large degree nodes, relative to the webgraph's degree distribution. The precise distribution is unclear, however: it is relatively well described by a lognormal distribution, as well as the Barabási–Albert model for power laws.
• The webgraph is an example of a scale-free network.

  Applications

• The webgraph is used for computing the PageRank of the WWW pages.
• The webgraph is used for computing the personalized PageRank.
• The webgraph can be used for detecting webpages of similar topics, through graph-theoretical properties only, like co-citation
• The webgraph is applied in the HITS algorithm for identifying hubs and authorities in the web.