Webgraph
Template:New unreviewed article
The webgraph describes the directed links between pages of the World Wide Web. A graph, in general, consists of several vertices, some pairs connected by edges. In a directed graph, edges are directed lines or arcs. The webgraph is a directed graph, whose vertices correspond to the pages of the WWW, and a directed edge connects page X to page Y if there exists a hyperlink on page X, referring to page Y.
Properties
- The degree distribution of the webgraph follows the power law, it strongly differs from the degree distribution of the classical random graph model, the Erdős-Rényi model [1].
- The webgraph is an example for scale-free network.
- The webgraph is an example for small-world network.
Applications
- The webgraph is used for computing the PageRank [2] of the WWW pages.
- The webgraph is used for computing the personalized PageRank [3].
- The webgraph can be used for detecting webpages of similar topics, through graph-theoretical properties only, like co-citation [4]
- The webgraph is applied in the HITS algorithm for identifying hubs and authorities in the web.
References
- ^ P. Erdős, A. Renyi, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960)
- ^ S. Brin, L. Page, Computer Networks and ISDN Systems 30, 107 (1998)
- ^ Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In Proceedings of the 12th international conference on World Wide Web (WWW '03). ACM, New York, NY, USA, 271-279. DOI=10.1145/775152.775191 http://doi.acm.org/10.1145/775152.775191
- ^ Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, Trawling the Web for emerging cyber-communities, Computer Networks, Volume 31, Issues 11-16, 17 May 1999, Pages 1481-1493, ISSN 1389-1286, DOI: 10.1016/S1389-1286(99)00040-7.