Deterministic Small-World Networks
凝聚态物理
2009-11-07 v1
摘要
Many real life networks, such as the World Wide Web, transportation systems, biological or social networks, achieve both a strong local clustering (nodes have many mutual neighbors) and a small diameter (maximum distance between any two nodes). These networks have been characterized as small-world networks and modeled by the addition of randomness to regular structures. We show that small-world networks can be constructed in a deterministic way. This exact approach permits a direct calculation of relevant network parameters allowing their immediate contrast with real-world networks and avoiding complex computer simulations.
引用
@article{arxiv.cond-mat/0111194,
title = {Deterministic Small-World Networks},
author = {Francesc Comellas and Michael Sampels},
journal= {arXiv preprint arXiv:cond-mat/0111194},
year = {2009}
}
备注
6 pages, 1 figure