| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Efficiency of informational transfer in regular and complex networks | I. Vragovi’c
; E. Louis
; A. Díaz-Guilera
; | Date: |
7 Oct 2004 | Subject: | Disordered Systems and Neural Networks | cond-mat.dis-nn | Affiliation: | Departamento de Fisica Aplicada, Instituto Universitario de Materiales and Unidada Asociada CSIC-UA, Universidad de Alicante, Spain. Departament de Física Fonamental, Universitat de Barcelona, Spain. | Abstract: | We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study non-clustered systems, we propose a modification of this measure on the local level. We apply this method to an extension of the class of small-worlds that includes {it declustered} networks, and show that they are locally quite efficient, although their clustering coefficient is practically zero. Unweighted systems with small-world and scale-free topologies are shown to be both globally and locally efficient. Our method is also applied to characterize weighted networks. In particular we examine the properties of underground transportation systems of Madrid and Barcelona and reinterpret the results obtained for the Boston subway network. | Source: | arXiv, cond-mat/0410174 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |