Webgraph
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
- The webgraph is an example of a scale-free network.
Applications
The webgraph is used for:
- computing the PageRank[5] of the WWW-pages;
- computing the personalized PageRank;[6]
- detecting webpages of similar topics, through graph-theoretical properties only, like co-citation;[7]
- and identifying hubs and authorities in the web for HITS algorithm.
References
- ^ P. Erdős, A. Renyi, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960)
- hdl:2434/372411.
- S2CID 9155618.
- S2CID 524106..
- Systems 30, 107 (1998)
- S2CID 7069190.