Discrete small world networks
凝聚态物理
2007-05-23 v1
摘要
Small world models are networks consisting of many local links and fewer long range 'shortcuts', used to model networks with a high degree of local clustering but relatively small diameter. Here, we concern ourselves with the distribution of typical inter-point network distances. We establish approximations to the distribution of the graph distance in a discrete ring network with extra random links, and compare the results to those for simpler models, in which the extra links have zero length and the ring is continuous.
引用
@article{arxiv.cond-mat/0304020,
title = {Discrete small world networks},
author = {A. D. Barbour and G. Reinert},
journal= {arXiv preprint arXiv:cond-mat/0304020},
year = {2007}
}
备注
48 pages