Realistic network growth using only local information: From random to scale-free and beyond
| dc.creator | Smith, David M. D. | |
| dc.creator | Lee, Chiu Fan | |
| dc.creator | Johnson, Neil F. | |
| dc.date | 2006-08-31 | |
| dc.date | 2006-09-04 | |
| dc.date.accessioned | 2026-07-07T07:19:55Z | |
| dc.date.available | 2026-07-07T07:19:55Z | |
| dc.description | We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment probabilities. Scale-free networks arise at the transition point between quasi-random and quasi-ordered networks. We provide a detailed formalism which accurately describes the entire network range, including this critical point. Our formalism is built around a statistical description of the inter-node linkages, as opposed to the single-node degrees, and can be applied to any real-world network -- in particular, those where node-node degree correlations might be important. | |
| dc.description | Minor typos corrected | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0608733 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0608733 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114805 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Physics and Society | |
| dc.title | Realistic network growth using only local information: From random to scale-free and beyond | |
| dc.type | text |