Protean Graphs with a Variety of Ranking Schemes

The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to another. Recently there has been considerable interest in using random graphs to model complex real-world networks to gain an insight into their properties. In this paper, we propose a generalized version of the protean graph (a random model of the web graph) in which the degree of a vertex depends on its age. Classic protean graphs can be seen as a special case of the rank-based approach where vertices are ranked according to age. Here, we investigate graph generation models based on other ranking schemes and show that these models lead to graphs with a power law degree distribution.

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Pawel Pralat
• Keywords: Classic Protean Graphs, COCOA 2008, Discrete Geometry, Protean Graphs, Vertices Corresponds