dorsal/arxiv
View SchemaA Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
| Authors | Dinghua Shi, Xiang Zhu, Liming Liu |
|---|---|
| Categories | |
| ArXiv ID | physics/0409061 |
| URL | https://arxiv.org/abs/physics/0409061 |
Abstract
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.
{
"annotation_id": "00572c1e-fb2c-41f0-995c-40973e4500e1",
"date_created": "2026-03-02T18:00:53.563000Z",
"date_modified": "2026-03-02T18:00:53.563000Z",
"file_hash": "c1288a6af1919271ed435e7677455cf57e16eebc78fc9591ce2df80703a1bfc9",
"private": false,
"record": {
"abstract": "In this paper, we present a simple model of scale-free networks that\nincorporates both preferential \u0026 random attachment and anti-preferential \u0026\nrandom deletion at each time step. We derive the degree distribution\nanalytically and show that it follows a power law with the degree exponent in\nthe range of (2,infinity). We also find a way to derive an expression of the\nclustering coefficient for growing networks and compute the average path length\nthrough simulation.",
"arxiv_id": "physics/0409061",
"authors": [
"Dinghua Shi",
"Xiang Zhu",
"Liming Liu"
],
"categories": [
"physics.data-an"
],
"title": "A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability",
"url": "https://arxiv.org/abs/physics/0409061"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7bc7899d-45c8-480a-b6e7-4dbdf28596c1",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}