Quantifying efficient information exchange in real network flows
arXiv:2003.11374 · doi:10.1038/s42005-021-00612-5
Abstract
Network science enables the effective analysis of real interconnected systems, characterized by a complex interplay between topology and interconnections strength. It is well-known that the topology of a network affects its resilience to failures or attacks, as well as its functions. Exchanging information is crucial for many real systems: the internet, transportation networks and the brain are key examples. Despite the introduction of measures of efficiency to analyze network flows, i.e. topologies characterized by weighted connectivity, here we show that they fail to capture combined information of link existence and link weight. In this letter we propose a physically-grounded estimator of flow efficiency which can be computed for every weighted network, regardless from the scale and nature of weights and from any (missing) metadata. Remarkably, results show that our estimator captures the heterogeneity of flows along with topological differences and its complement information obtained from percolation analysis of several empirical systems, including transportation, trade, migrations, and brain networks. We show that cutting the heaviest connections may increase the average communication efficiency of the system and hence, counterintuively, a sparser network is not necessarily less efficient. Remarkably, our estimator enables the comparison of communication efficiency of networks arising from different fields, without the possible pitfalls deriving from the scale of flow.
References in corpus (19)
- Emergence of scaling in random networks
- Community structure in social and biological networks
- Power-law distributions in empirical data
- Error and attack tolerance of complex networks
- Efficient Behavior of Small-World Networks
- The architecture of complex weighted networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Economic Small-World Behavior in Weighted Networks
- Layer aggregation and reducibility of multilayer interconnected networks
- Efficient routing on complex networks
- Is the Boston subway a small-world network ?
- Locating the Source of Diffusion in Large-Scale Networks
- Memory in network flows and its effects on spreading dynamics and community detection
- Vulnerability and Protection of Critical Infrastructures
- Power grids vulnerability: a complex network approach
- Localization and Spreading of Diseases in Complex Networks
- Enhancing complex-network synchronization
- The hidden topological structure of flow network functionality
- Percolation under Noise: Detecting Explosive Percolation Using the Second Largest Component
Cited by in corpus (7)
- Robustness and resilience of complex networks
- From the origin of life to pandemics: Emergent phenomena in complex systems
- Multilayer Network Science: from Cells to Societies
- Network diffusion capacity unveiled by dynamical paths
- Deep-learning-aided dismantling of interdependent networks
- Robustness Assessment of Complex Networks using the Idle Network
- Understanding How Network Geometry Influences Diffusion Processes in Complex Networks: A Focus on Cryptocurrency Blockchains and Critical Infrastructure Networks