Exploring the Morphospace of Communication Efficiency in Complex Networks
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
Graph theoretical analysis has played a key role in characterizing global features of the topology of complex networks, describing diverse systems such as protein interactions, food webs, social relations and brain connectivity. How system elements communicate with each other depends not only on the structure of the network, but also on the nature of the system's dynamics which are constrained by the amount of knowledge and resources available for communication processes. Complementing widely used measures that capture efficiency under the assumption that communication preferentially follows shortest paths across the network ("routing"), we define analytic measures directed at characterizing network communication when signals flow in a random walk process ("diffusion"). The two dimensions of routing and diffusion efficiency define a morphospace for complex networks, with different network topologies characterized by different combinations of efficiency measures and thus occupying different regions of this space. We explore the relation of network topologies and efficiency measures by examining canonical network models, by evolving networks using a multi-objective optimization strategy, and by investigating real-world network data sets. Within the efficiency morphospace, specific aspects of network topology that differentially favor efficient communication for routing and diffusion processes are identified. Charting regions of the morphospace that are occupied by canonical, evolved or real networks allows inferences about the limits of communication efficiency imposed by connectivity and dynamics, as well as the underlying selection pressures that have shaped network topology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures





Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Hierarchy seems to pervade a coherent form of organization that allows reducing the costs associated to reliable information transmission [39] and to support efficient genetic and metabolic control in cellular networks [40].”
From On the origins of hierarchy in complex networks (2013) · cites this paper as [40]
Experimental — accuracy not yet measuredIn the citing paper
“Bow-tie networks, which have been suggested to define a flexible, robust and evolved type of systems [38, 40], perhaps resulting from selection for robustness would be a byproduct of the generation rules responsible for network growth.”
From On the origins of hierarchy in complex networks (2013) · cites this paper as [40]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 1×
“community structure can be determined by identifying a partition into non-overlapping modules (using an optimization algorithm such as the Louvain method [15]) that maximizes a modularity metric [16].”
MethodComplex network measures of brain connectivity: Uses and interpretations
Rubinov, M., & Sporns, O. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.10.003 · Cited by 11,522
Self-citationComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
The economy of brain network organization
Bullmore, E., & Sporns, O. (2012) · Nature Reviews Neuroscience · doi:10.1038/nrn3214 · Cited by 3,284
Self-citationNewman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
The Small World of the Cerebral Cortex
Sporns, O., & Zwi, J. D. (2004) · Neuroinformatics · doi:10.1385/ni:2:2:145 · Cited by 1,356
Self-citationIntroduction to Probability: The Binomial And Normal Probability Distributions
(2003) · Pharmaceutical Statistics · doi:10.1201/9780203912799.ch3 · Cited by 1,208
Comparing Brain Networks of Different Size and Connectivity Density Using Graph Theory
van Wijk, B. C. M., Stam, C. J., & Daffertshofer, A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013701 · Cited by 1,161
Random Walks on Complex Networks
Noh, J. D., & Rieger, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.118701 · Cited by 1,148
Information diffusion through blogspace
Gruhl, D., Guha, R., Liben-Nowell, D., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988739 · Cited by 1,041
Detecting rich-club ordering in complex networks
Colizza, V., Flammini, A., Serrano, M. A., & Vespignani, A. (2006) · Nature Physics · doi:10.1038/nphys209 · Cited by 1,001 · cited 2×
“Similar characteristics were found in a network containing a rich club [27].”
BackgroundResultInformation diffusion through blogspace
Gruhl, D., Liben-Nowell, D., Guha, R., & Tomkins, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1046456.1046462 · Cited by 927
The Mathematical Theory of Information
Kåhre, J. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0975-2 · Cited by 687
Navigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
Communication in Networks with Hierarchical Branching
Arenas, A., Díaz-Guilera, A., & Guimerà, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3196 · Cited by 449
Information Theory of Complex Networks: On Evolution and Architectural Constraints
Solé, R. V., & Valverde, S. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_9 · Cited by 337
Networks and Cities: An Information Perspective
Rosvall, M., Trusina, A., Minnhagen, P., & Sneppen, K. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.028701 · Cited by 239
Theoretical Morphology: The Concept and Its Applications
Chapman, R. E., & McGhee, G. R. (1999) · PALAIOS · doi:10.2307/3515317 · Cited by 221
Efficiency of informational transfer in regular and complex networks
Vragović, I., Louis, E., & Díaz-Guilera, A. (2005) · Physical Review E · doi:10.1103/physreve.71.036122 · Cited by 208
Entropy rate of diffusion processes on complex networks
Gómez-Gardeñes, J., & Latora, V. (2008) · Physical Review E · doi:10.1103/physreve.78.065102 · Cited by 199
Word of Mouth: Rumor Dissemination in Social Networks
Kostka, J., Oswald, Y. A., & Wattenhofer, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69355-0_16 · Cited by 198
Entropy optimization of scale-free networks’ robustness to random failures
Wang, B., Tang, H., Guo, C., & Xiu, Z. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.08.025 · Cited by 197
Biased random walks in complex networks: The role of local navigation rules
Fronczak, A., & Fronczak, P. (2009) · Physical Review E · doi:10.1103/physreve.80.016107 · Cited by 176
Optimization in Complex Networks
Cancho, R. F. I., & Solé, R. V. (2003) · Lecture Notes in Physics · doi:10.1007/978-3-540-44943-0_7 · Cited by 146
Grinstead, C. M., & Snell, J. L. (1997) · Works - Scholarship, Research, & Creative Expression (Swarthmore College) · Cited by 145
Navigating Ultrasmall Worlds in Ultrashort Time
Boguñá, M., & Krioukov, D. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.058701 · Cited by 117
Exploring complex networks through random walks
Costa, L. D. F., & Travieso, G. (2007) · Physical Review E · doi:10.1103/physreve.75.016102 · Cited by 95
Barthélemy, M., & Flammini, A. (2006) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2006/07/l07002 · Cited by 88
Effective measurement of network vulnerability under random and intentional attacks
Criado, R., Flores, J., Hernández‐Bermejo, B., Pello, J., & Romance, M. (2005) · Journal of Mathematical Modelling and Algorithms · doi:10.1007/s10852-005-9006-1 · Cited by 81
Network Structures from Selection Principles
Colizza, V., Banavar, J. R., Maritan, A., & Rinaldo, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.198701 · Cited by 71
Communication and optimal hierarchical networks
Guimerà, R., Arenas, A., & Dı́az-Guilera, A. (2001) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(01)00302-8 · Cited by 44
SWITCHER-RANDOM-WALKS: A COGNITIVE-INSPIRED MECHANISM FOR NETWORK EXPLORATION
Goñi, J., MARTINCORENA, I., Corominas‐Murtra, B., Arrondo, G., Ardanza-Trevijano, S., & Villoslada, P. (2010) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127410026204 · Cited by 38
Self-citationNavigating networks with limited information
Rosvall, M., Minnhagen, P., & Sneppen, K. (2005) · Physical Review E · doi:10.1103/physreve.71.066111 · Cited by 34
First passage time of multiple Brownian particles on networks with applications
Wang, S., & Pei, W. (2008) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.03.032 · Cited by 28
Optimal navigation in complex networks
Cajueiro, D. O. (2009) · Physical Review E · doi:10.1103/physreve.79.046103 · Cited by 22
Optimizing Brain Networks Topologies Using Multi-objective Evolutionary Computation
Santana, R., Bielza, C., & Larrañaga, P. (2010) · Neuroinformatics · doi:10.1007/s12021-010-9085-7 · Cited by 14
Learning paths in complex networks
Cajueiro, D. O., & Andrade, R. F. S. (2009) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/87/58004 · Cited by 10
Cited by
Communication dynamics in complex brain networks
Avena-Koenigsberger, A., Misic, B., & Sporns, O. (2018) · Nature Reviews Neuroscience · doi:10.1038/nrn.2017.149 · Cited by 856
“51) ) provides an upper limit on the integrative capacity of a network, not taking into account congestion or other sources of transmission delays, and assuming equal interaction likelihoods across all node pairs.”
BackgroundSelf-citationGraph analysis of the human connectome: Promise, progress, and pitfalls
Fornito, A., Zalesky, A., & Breakspear, M. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2013.04.087 · Cited by 743
“Rather, alternative routing strategies that require only local knowledge may provide more realistic models of information-processing in the brain (Boguna et al., 2009; Goni et al., 2013; Telesford et al., 2011; van den Heuvel et al., 2012).”
Resting-brain functional connectivity predicted by analytic measures of network communication
Goñi, J., van den Heuvel, M. P., Avena-Koenigsberger, A., Velez de Mendizabal, N., Betzel, R. F., Griffa, A., Hagmann, P., Corominas-Murtra, B., Thiran, J.-P., & Sporns, O. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1315529111 · Cited by 576
Self-citationCliques and cavities in the human connectome
Sizemore, A. E., Giusti, C., Kahn, A., Vettel, J. M., Betzel, R. F., & Bassett, D. S. (2018) · Journal of Computational Neuroscience · doi:10.1007/s10827-017-0672-6 · Cited by 372
“shortest-path efficiency, but also efficient in terms of a random walk-based measure of efficiency [63].”
BackgroundSelf-citationvan den Heuvel, M. P., Bullmore, E. T., & Sporns, O. (2016) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2016.03.001 · Cited by 328
Self-citation
Metadata
- Authors
- Goñi, J., Avena-Koenigsberger, A., Velez de Mendizabal, N., van den Heuvel, M. P., Betzel, R. F., & Sporns, O.
- Affiliations
- Indiana University Bloomington (US)
- Corresponding author
- Sporns, Olaf
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2013-03-07
- Volume
- 8
- Issue
- 3
- Pages
- e58070
- ISSN
- 1932-6203 (ISSN-L)
- PMC
- PMC3591454
- OpenAlex
- W2010195483
- Cited by
- 158
- References
- 46
- Citations by year
- 2026: 5 · 2025: 18 · 2024: 13 · 2023: 13 · 2022: 14 · 2021: 17 · 2020: 15 · 2019: 14 · 2018: 13 · 2017: 8 · 2016: 11 · 2015: 5 · 2014: 8 · 2013: 4
- FWCI
- 6.64
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- PLoS ONE (publishedVersion, cc-by)
- Europe PMC (PubMed Central) (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- Pure Amsterdam UMC (publishedVersion, other-oa)
- Amsterdam UMC (VU Amsterdam) - Institutional Repository (publishedVersion, other-oa)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Figshare (submittedVersion, cc-by)
- Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
- Funders
- James S. McDonnell Foundation
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Keywords
- communication efficiency, complex networks, morphospace, diffusion efficiency, routing efficiency, random walks, network topology
- MeSH terms
- Algorithms, Communication, Computer Simulation, Models, Theoretical
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.