A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
| dc.creator | Shi, Dinghua | |
| dc.creator | Zhu, Xiang | |
| dc.creator | Liu, Liming | |
| dc.date | 2004-09-13 | |
| dc.date | 2004-09-22 | |
| dc.date.accessioned | 2026-07-07T05:52:41Z | |
| dc.date.available | 2026-07-07T05:52:41Z | |
| dc.description | In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that it follows a power law with the degree exponent in the range of (2,infinity). We also find a way to derive an expression of the clustering coefficient for growing networks and compute the average path length through simulation. | |
| dc.description | 15 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/physics/0409061 | |
| dc.identifier | http://arxiv.org/abs/physics/0409061 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/86394 | |
| dc.subject | Data Analysis, Statistics and Probability | |
| dc.title | A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability | |
| dc.type | text |