2004/10/31 by I. Vragović, E. Louis, Albert Dı́az-Guilera +1 · 1 citation
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Network Traffic and Congestion Control #Opinion Dynamics and Social Influence #cond-mat.dis-nn
paper · pdf · doi:10.1103/physreve.71.036122
10 pages and 9 figures
arxiv created 2004/12/27 · openalex publication_date 2005/03/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study nonclustered 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 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.