A steady state model for graph power laws

Abstract

Power law distribution seems to be an important characteristic of web graphs. Several existing web graph models generate power law graphs by adding new vertices and non-uniform edge connectivities to existing graphs. Researchers have conjectured that preferential connectivity and incremental growth are both required for the power law distribution. In this paper, we propose a different web graph model with power law distribution that does not require incremental growth. We also provide a comparison of our model with several others in their ability to predict web graph clustering behavior.

8 pages, 5 figures

Cited by in corpus (6)

• An expert system for detecting automobile insurance fraud using social network analysis
• Self-similar scaling of density in complex real-world networks
• Complex Networks
• Neighbor selection and hitting probability in small-world graphs
• Storage Balancing in Self-organizing Multimedia Delivery Systems
• Generating random bigraphs with preferential attachment