Growing Small-World Networks Generated by Attaching to Edges
| dc.creator | Zhang, Zhongzhi | |
| dc.creator | Rong, Lili | |
| dc.date | 2005-03-28 | |
| dc.date | 2005-05-27 | |
| dc.date.accessioned | 2026-07-25T23:26:01Z | |
| dc.description | We introduce a minimal model of small-world growing network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially with degree and average clustering coefficient $C={3/2}ln3-1\approx 0.6479$, which are in good agreement with the numerical simulations. We also prove that the increasing tendency of average path length of the considered network is a little slower than the logarithm of the network order $N$. | |
| dc.description | 8 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0503637 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0503637 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/98400 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Growing Small-World Networks Generated by Attaching to Edges | |
| dc.type | text |