A steady state model for graph power laws
Discrete Mathematics
2011-03-08 v1 Disordered Systems and Neural Networks
Social and Information Networks
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.
Cite
@article{arxiv.cs/0204001,
title = {A steady state model for graph power laws},
author = {David Eppstein and Joseph Wang},
journal= {arXiv preprint arXiv:cs/0204001},
year = {2011}
}
Comments
8 pages, 5 figures