Two complementary representations of a scale-free network
| dc.creator | Nacher, J. C. | |
| dc.creator | Yamada, T. | |
| dc.creator | Goto, S. | |
| dc.creator | Kanehisa, M. | |
| dc.creator | Akutsu, T. | |
| dc.date | 2004-02-16 | |
| dc.date | 2005-04-13 | |
| dc.date.accessioned | 2026-07-07T05:51:14Z | |
| dc.date.available | 2026-07-07T05:51:14Z | |
| dc.description | Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx k^{-γ}$, where $P(k)$ denotes the frequency of the nodes that are connected to $k$ other nodes. Here we have carried out a study on scale-free networks, where a line graph transformation (i.e., edges in an initial network are transformed into nodes) is applied to a power-law distribution. Our results indicate that a power-law distribution as $P(k)\approx k^{-γ+1}$ is found for the transformed network together with a peak for low-degree nodes. In the present work we show a parametrization of this behaviour and discuss its application to real networks as metabolic networks, protein-protein interaction network and World Wide Web. | |
| dc.description | 18 pages, 8 figures. Minor changes. One figure added | |
| dc.identifier | https://arxiv.org/abs/physics/0402072 | |
| dc.identifier | http://arxiv.org/abs/physics/0402072 | |
| dc.identifier | Physica A 349 (2005) 349-363 | |
| dc.identifier | doi:10.1016/j.physa.2004.09.013 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/85957 | |
| dc.subject | Biological Physics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Data Analysis, Statistics and Probability | |
| dc.title | Two complementary representations of a scale-free network | |
| dc.type | text |