Two-level relationships and Scale-Free Networks
| dc.creator | Stauffer, F. | |
| dc.date | 2005-08-18 | |
| dc.date | 2006-05-16 | |
| dc.date.accessioned | 2026-07-07T06:41:36Z | |
| dc.date.available | 2026-07-07T06:41:36Z | |
| dc.description | Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a naïve implementation of the Barabási and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures. | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0508434 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0508434 | |
| dc.identifier | Physica A, 365, 565-570 (2006) | |
| dc.identifier | doi:10.1016/j.physa.2005.12.070 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101724 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Two-level relationships and Scale-Free Networks | |
| dc.type | text |