A steady state model for graph power laws
离散数学
2011-03-08 v1 无序系统与神经网络
社会与信息网络
摘要
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.
引用
@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}
}
备注
8 pages, 5 figures