A steady state model for graph power laws
<|reference_start|>A steady state model for graph power laws: 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.<|reference_end|>
@article{eppstein2002a,
    title={A steady state model for graph power laws},
    author={David Eppstein and Joseph Wang},
    journal={arXiv preprint arXiv:cs/0204001},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0204001},
    primaryClass={cs.DM cond-mat.dis-nn cs.SI}
}