2002/03/30 by David Eppstein, Joseph Wang, Eppstein, David +1
Computer Science · Physics and Astronomy · #Caching and Content Delivery #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #Disordered Systems and Neural Networks (cond-mat.dis-nn) #FOS: Computer and information sciences #FOS: Physical sciences #G.2.2 #G.3 #Peer-to-Peer Network Technologies #Social and Information Networks (cs.SI) #cond-mat.dis-nn #cs.DM #cs.SI
paper · pdf · doi:10.48550/arxiv.cs/0204001
8 pages, 5 figures
arxiv created 2002/03/30 · openalex publication_date 2002/03/30 · arxiv updated 2011/03/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.