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
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-citationGenerative models of the human connectome
Betzel, R. F., Avena-Koenigsberger, A., Goñi, J., He, Y., de Reus, M. A., Griffa, A., Vértes, P. E., Mišic, B., Thiran, J.-P., Hagmann, P., et al. (2016) · NeuroImage · doi:10.1016/j.neuroimage.2015.09.041 · Cited by 303
Self-citationConsistency and differences between centrality measures across distinct classes of networks
Oldham, S., Fulcher, B., Parkes, L., Arnatkevic̆iūtė, A., Suo, C., & Fornito, A. (2019) · PLOS ONE · doi:10.1371/journal.pone.0220061 · Cited by 296
Brain network communication: concepts, models and applications
Seguin, C., Sporns, O., & Zalesky, A. (2023) · Nature Reviews Neuroscience · doi:10.1038/s41583-023-00718-5 · Cited by 284
“The resource efficiency 44 is defined as the number of random walks required to ensure that, with a given probability, at least one signal travels between source and target regions along the shortest path.”
BackgroundInfluentialSelf-citationThe development of brain network hubs
Oldham, S., & Fornito, A. (2019) · Developmental Cognitive Neuroscience · doi:10.1016/j.dcn.2018.12.005 · Cited by 250
Boguñá, M., Bonamassa, I., De Domenico, M., Havlin, S., Krioukov, D., & Serrano, M. Á. (2021) · Nature Reviews Physics · doi:10.1038/s42254-020-00264-4 · Cited by 213
Network analysis of particles and grains
Papadopoulos, L., Porter, M. A., Daniels, K. E., & Bassett, D. S. (2018) · Journal of Complex Networks · doi:10.1093/comnet/cny005 · Cited by 198
Null models in network neuroscience
Váša, F., & Mišić, B. (2022) · Nature Reviews Neuroscience · doi:10.1038/s41583-022-00601-9 · Cited by 200
Local structure-function relationships in human brain networks across the lifespan
Zamani Esfahlani, F., Faskowitz, J., Slack, J., Mišić, B., & Betzel, R. F. (2022) · Nature Communications · doi:10.1038/s41467-022-29770-y · Cited by 174
Self-citationSeguin, C., van den Heuvel, M. P., & Zalesky, A. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801351115 · Cited by 173
Rich Club Organization and Intermodule Communication in the Cat Connectome
de Reus, M. A., & van den Heuvel, M. P. (2013) · Journal of Neuroscience · doi:10.1523/jneurosci.1448-13.2013 · Cited by 162
“…proposed a number of interesting metrics that express communication in networks in terms of diffusion-like processes (Esquivel and Rosvall, 2011; Goñi et al., 2013), and studies examining the notion of path motifs in combination with these diffusion-based metrics would be of particular…”
BackgroundOn the origins of hierarchy in complex networks
Corominas-Murtra, B., Goñi, J., Solé, R. V., & Rodríguez-Caso, C. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1300832110 · Cited by 160
Self-citationSeguin, C., Tian, Y., & Zalesky, A. (2020) · Network Neuroscience · doi:10.1162/netn_a_00161 · Cited by 116
Communication Efficiency and Congestion of Signal Traffic in Large-Scale Brain Networks
Mišić, B., Sporns, O., & McIntosh, A. R. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003427 · Cited by 115
Self-citationA spectrum of routing strategies for brain networks
Avena-Koenigsberger, A., Yan, X., Kolchinsky, A., van den Heuvel, M. P., Hagmann, P., & Sporns, O. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006833 · Cited by 115
Self-citationDiversity of meso-scale architecture in human and non-human connectomes
Betzel, R. F., Medaglia, J. D., & Bassett, D. S. (2018) · RePEc: Research Papers in Economics · Cited by 122
Self-citationFragility and volatility of structural hubs in the human connectome
Gollo, L. L., Roberts, J. A., Cropley, V., Biase, M. A. D., Pantelis, C., Zalesky, A., & Breakspear, M. J. (2018) · Nature Neuroscience · doi:10.1038/s41593-018-0188-z · Cited by 111
Avena-Koenigsberger, A., Goñi, J., Solé, R., & Sporns, O. (2015) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0881 · Cited by 96
Self-citationInferring neural signalling directionality from undirected structural connectomes
Seguin, C., Razi, A., & Zalesky, A. (2019) · Nature Communications · doi:10.1038/s41467-019-12201-w · Cited by 96
“Di↵usion e ciency [23] quantifies how many intermediate regions (synapses), on average, a naive random walker needs to traverse to reach a desired destination region.”
BackgroundInfluentialA Network Convergence Zone in the Hippocampus
Mišić, B., Goñi, J., Betzel, R. F., Sporns, O., & McIntosh, A. R. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003982 · Cited by 94
“Moreover, a number of recent studies have shown that diffusion may be a viable mechanism for information transfer in real brain networks [54–56] (but see also [40,41]).”
BackgroundSelf-citationFunctional brain networks: great expectations, hard times and the big leap forward
Papo, D., Zanin, M., Pineda‐Pardo, J. A., Boccaletti, S., & Buldú, J. M. (2014) · Philosophical Transactions of the Royal Society B Biological Sciences · doi:10.1098/rstb.2013.0525 · Cited by 88
Simulated rich club lesioning in brain networks: a scaffold for communication and integration?
de Reus, M. A., & van den Heuvel, M. P. (2014) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2014.00647 · Cited by 89
Griffa, A., Baumann, P. S., Ferrari, C., Do, K. Q., Conus, P., Thiran, J.-P., & Hagmann, P. (2015) · Human Brain Mapping · doi:10.1002/hbm.22633 · Cited by 84
“The affected core of patients is characterized by microstructural changes of its connections as measured with gFA and inverse ADC leading to the above described topological changes.”
BackgroundSeguin, C., Jedynak, M., David, O., Sina Mansour, L., Sporns, O., & Zalesky, A. (2023) · Neuron · doi:10.1016/j.neuron.2023.01.027 · Cited by 95
Self-citationAvena‐Koenigsberger, A., Mišić, B., Hawkins, R. X. D., Griffa, A., Hagmann, P., Goñi, J., & Sporns, O. (2016) · Brain Structure and Function · doi:10.1007/s00429-016-1238-5 · Cited by 79
“On the other hand, measures such as mean first passage times (Grinstead and Snell 2012), diffusion efficiency (Goñi et al. 2013), communicability (Estrada and Hatano 2008), and random-walk betweenness (Newman 2005) take into account all paths (or walks) between node pairs, making no assumptions…”
BackgroundMethodInfluentialSelf-citationGriffa, A., Ricaud, B., Benzi, K., Bresson, X., Daducci, A., Vandergheynst, P., Thiran, J., & Hagmann, P. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2017.04.015 · Cited by 89
Mustafi, S. M., Harezlak, J., Koch, K. M., Nencka, A. S., Meier, T. B., West, J. D., Giza, C. C., DiFiori, J. P., Guskiewicz, K. M., Mihalik, J. P., et al. (2017) · Journal of Neurotrauma · doi:10.1089/neu.2017.5158 · Cited by 95
Park, B., de Wael, R. V., Paquola, C., Larivière, S., Benkarim, O. M., Royer, J., Tavakol, S., Rodríguez‐Cruces, R., Li, Q., Valk, S. L., et al. (2020) · NeuroImage · doi:10.1016/j.neuroimage.2020.117429 · Cited by 73
Brain network reconfiguration for language and domain-general cognitive control in bilinguals
Wu, J., Yang, J., Chen, M., Li, S., Zhang, Z., Kang, C., Ding, G., & Guo, T. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2019.06.022 · Cited by 76
Structural connectome topology relates to regional BOLD signal dynamics in the mouse brain
Sethi, S. S., Zerbi, V., Wenderoth, N., Fornito, A., & Fulcher, B. D. (2017) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4979281 · Cited by 68
Spatiotemporal ontogeny of brain wiring
Goulas, A., Betzel, R. F., & Hilgetag, C. C. (2019) · Science Advances · doi:10.1126/sciadv.aav9694 · Cited by 67
“1) (7, 8), including features such as modularity and short path lengths.”
BackgroundMethodSelf-citationSeguin, C., Sina Mansour, L., Sporns, O., Zalesky, A., & Calamante, F. (2022) · NeuroImage · doi:10.1016/j.neuroimage.2022.119323 · Cited by 77
Self-citationStructural-functional brain network coupling predicts human cognitive ability
Popp, J. L., Thiele, J. A., Faskowitz, J., Seguin, C., Sporns, O., & Hilger, K. (2024) · NeuroImage · doi:10.1016/j.neuroimage.2024.120563 · Cited by 81
Self-citationTopological and geometric measurements of force-chain structure
Giusti, C., Papadopoulos, L., Owens, E. T., Daniels, K. E., & Bassett, D. S. (2016) · Physical review. E · doi:10.1103/physreve.94.032909 · Cited by 67
Using Pareto optimality to explore the topology and dynamics of the human connectome
Avena-Koenigsberger, A., Goñi, J., Betzel, R. F., van den Heuvel, M. P., Griffa, A., Hagmann, P., Thiran, J.-P., & Sporns, O. (2014) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2013.0530 · Cited by 54
“Diffusion efficiency is then defined as follows [11]: (iii) Neural complexity Neuralcomplexity( C N )isameasurethatcapturesthecoexistenceof functionalsegregationandfunctional integrationinaneuralsystem [12].”
BackgroundMethodInfluentialSelf-citationKuceyeski, A. F., Jamison, K. W., Owen, J. P., Raj, A., & Mukherjee, P. (2019) · Human Brain Mapping · doi:10.1002/hbm.24713 · Cited by 53
“Global metrics of average degree, characteristic path length, global and local efficiency, clustering coefficient, modularity, small-world index, transitivity, average mean first passage time (Goñi et al., 2013), and mean navigation time (based on both connectivity strength and Euclidean distance) (Seguin, van den Heu…”
BackgroundMethodSystem-level matching of structural and functional connectomes in the human brain
Osmanlıoğlu, Y., Tunç, B., Parker, D., Elliott, M. A., Baum, G. L., Ćirić, R., Satterthwaite, T. D., Gur, R. E., Gur, R. C., & Verma, R. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2019.05.064 · Cited by 52
Gramatica, R., Matteo, T. D., Giorgetti, S., Barbiani, M., Bevec, D., & Aste, T. (2014) · PLoS ONE · doi:10.1371/journal.pone.0084912 · Cited by 59
Akbarian, B., & Erfanian, A. (2020) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2020.101878 · Cited by 58
Contreras, J. A., Goñi, J., Risacher, S. L., Sporns, O., & Saykin, A. J. (2015) · Current Behavioral Neuroscience Reports · doi:10.1007/s40473-015-0056-z · Cited by 51
“Another emergent area of research consists of network morphospaces [87–90] where networks occupy a space in n-dimensional systems that obey to different trade-offs of network characteristics.”
BackgroundSelf-citationBenchmarking methods for mapping functional connectivity in the brain
Liu, Z.-Q., Luppi, A. I., Hansen, J. Y., Tian, Y., Zalesky, A., Yeo, B. T. T., Fulcher, B., & Mišić, B. (2025) · Nature Methods · doi:10.1038/s41592-025-02704-4 · Cited by 82
“For asymmetric measures, we symmetrized the matrix by taking the average of the matrix with its transpose 114,115,119 .”
Aydın, S., Çetin, F. H., Uytun, M. Ç., Babadağı, Z., Güven, A. S., & Işık, Y. (2022) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2022.103626 · Cited by 51
Phase transitions in Pareto optimal complex networks
Seoane, L. F., & Solé, R. V. (2015) · Physical Review E · doi:10.1103/physreve.92.032807 · Cited by 49
Dimitriadis, S. I., Routley, B. C., Linden, D. E. J., & Singh, K. D. (2018) · Frontiers in Neuroscience · doi:10.3389/fnins.2018.00506 · Cited by 41
Efficient coding in the economics of human brain connectomics
Zhou, D., Lynn, C. W., Cui, Z., Ćirić, R., Baum, G. L., Moore, T. M., Roalf, D. R., Detre, J. A., Gur, R. C., Gur, R. E., et al. (2022) · Network Neuroscience · doi:10.1162/netn_a_00223 · Cited by 45
Automated Design Framework for Synthetic Biology Exploiting Pareto Optimality
Otero‐Muras, I., & Banga, J. R. (2017) · ACS Synthetic Biology · doi:10.1021/acssynbio.6b00306 · Cited by 46
Communicability Angle and the Spatial Efficiency of Networks
Estrada, E., & Hatano, N. (2016) · SIAM Review · doi:10.1137/141000555 · Cited by 45
Asymmetric signaling across the hierarchy of cytoarchitecture within the human connectome
Parkes, L., Kim, J. Z., Stiso, J., Calkins, M. E., Cieslak, M., Gur, R. E., Gur, R. C., Moore, T. M., Ouellet, M., Roalf, D. R., et al. (2022) · Science Advances · doi:10.1126/sciadv.add2185 · Cited by 38
Liu, Z.-Q., Shafiei, G., Baillet, S., & Mišić, B. (2023) · NeuroImage · doi:10.1016/j.neuroimage.2023.120276 · Cited by 36
Network Hierarchy Evolution and System Vulnerability in Power Grids
Luo, L., Han, B., & Rosas-Casals, M. (2016) · IEEE Systems Journal · doi:10.1109/jsyst.2016.2628410 · Cited by 31
“To be more specific, among different network evolution properties indicating the dynamic behavior in terms of system vulnerability, an especially important one to be addressed and adopted in this paper is the hierarchy metric, quantifying the network pyramidal structure [10]–[12].”
BackgroundToward an information theoretical description of communication in brain networks
Amico, E., Abbas, K., Duong-Tran, D. A., Tipnis, U., Rajapandian, M., Chumin, E. J., Ventresca, M., Harezlak, J., & Goñi, J. (2021) · Network Neuroscience · doi:10.1162/netn_a_00185 · Cited by 45
“Hybrid models exploring a spectrum of communication dynamics, including search information (Goñi et al., 2013, 2014), navigation (Seguin et al., 2018), or k-shortest path ensembles (Avena-Koenigsberger et al., 2017), have also been investigated.”
BackgroundSelf-citationGraph Theoretic Analysis of Human Brain Networks
Fornito, A. (2016) · Neuromethods · doi:10.1007/978-1-4939-5611-1_10 · Cited by 31
Multi-policy models of interregional communication in the human connectomePreprint
Betzel, R. F., Faskowitz, J., Mišić, B., Sporns, O., & Seguin, C. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.05.08.490752 · Cited by 24
“[83] Joaqúın Goñi, Andrea Avena-Koenigsberger, Nieves Velez de Mendizabal, Martijn P van den Heuvel, Richard F Betzel, and Olaf Sporns, “Exploring the morphospace of communication efficiency in complex networks,” PLoS One 8, e58070 (2013).”
BackgroundSelf-citationChari, A., Seunarine, K. K., He, X., Tisdall, M. M., Clark, C. A., Bassett, D. S., Scott, R. C., & Rosch, R. E. (2022) · Communications Biology · doi:10.1038/s42003-022-03342-8 · Cited by 27
“An alternative measure of network ef fi ciency that quanti fi es the ease of information transfer between nodes but when this information spreads by random diffusion; it is based on limited local knowledge of network topology 69 .”
Graph Theory Measures and Their Application to Neurosurgical Eloquence
Tanglay, O., Dadario, N. B., Chong, E. H. N., Tang, S. J., Young, I. M., & Sughrue, M. E. (2023) · Cancers · doi:10.3390/cancers15020556 · Cited by 24
“This presupposes that neurons have access to information about global topology when sending information [67].”
BackgroundLow-dimensional morphospace of topological motifs in human fMRI brain networks
Morgan, S. E., Achard, S., Termenón, M., Vértes, P. E., & Bullmore, E. T. (2018) · Network Neuroscience · doi:10.1162/netn_a_00038 · Cited by 27
Müller, M. D., Caporro, M., Gast, H., Pollo, C., Wiest, R., Schindler, K. A., & Rummel, C. (2019) · Human Brain Mapping · doi:10.1002/hbm.24816 · Cited by 22
“A characteristic of such star-structured networks is the low path length between any two nodes enabling fast transmission of information throughout them (Goñi et al., 2013).”
BackgroundDuong-Tran, D. A., Abbas, K., Amico, E., Corominas‐Murtra, B., Džemidžić, M., Kareken, D. A., Ventresca, M., & Goñi, J. (2021) · Network Neuroscience · doi:10.1162/netn_a_00193 · Cited by 22
Self-citationA simulated annealing algorithm for randomizing weighted networks
Milisav, F., Bazinet, V., Betzel, R. F., & Mišić, B. (2024) · Nature Computational Science · doi:10.1038/s43588-024-00735-z · Cited by 26
“3a) [5, 6, 29, 44, 45].”
Self-citationMultiobjective Optimization and Phase Transitions
Seoane, L. F., & Solé, R. V. (2016) · Springer proceedings in complexity · doi:10.1007/978-3-319-29228-1_22 · Cited by 14
“Two relevant examples from network theory: The efficiency of different topologies has been researched for the relay of information across a network using two distinct delivery heuristics [15].”
BackgroundMadole, J. W., Buchanan, C. R., Rhemtulla, M., Ritchie, S. J., Bastin, M. E., Deary, I. J., Cox, S. R., & Tucker–Drob, E. M. (2023) · NeuroImage · doi:10.1016/j.neuroimage.2023.120160 · Cited by 22
“, efficiency-based measures) because of how they capture local diffusion properties (Goñi et al., 2013).”
Contextual experience modifies functional connectome indices of topological strength and efficiency
Pompilus, M., Colón-Pérez, L. M., Grudny, M. M., & Febo, M. (2020) · Scientific Reports · doi:10.1038/s41598-020-76935-0 · Cited by 19
(2016) · Elsevier eBooks · doi:10.1016/b978-0-12-407908-3.00005-4 · Cited by 16
Patankar, S. P., Kim, J. Z., Pasqualetti, F., & Bassett, D. S. (2020) · Network Neuroscience · doi:10.1162/netn_a_00157 · Cited by 17
Damage to the structural connectome reflected in resting-state fMRI functional connectivity
Wodeyar, A., Cassidy, J. M., Cramer, S. C., & Srinivasan, R. (2020) · Network Neuroscience · doi:10.1162/netn_a_00160 · Cited by 17
“The models relating structural to functional connectivity may be diffusion (Goni et al., 2013; Noh & Rieger, 2004), where communication happens throughDiffusion: Communication between neural masses in distinct areas happens through activity passing by random walks over the structural connectome.…”
BackgroundMethodInfluentialNetwork neuroscience and the connectomics revolution
Betzel, R. F. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821861-7.00002-6 · Cited by 23
“[174] Joaqúın Goñi, Andrea Avena-Koenigsberger, Nieves Velez de Mendizabal, Martijn P van den Heuvel, Richard F Betzel, and Olaf Sporns, “Exploring the mor-”
BackgroundSelf-citationMotifs enable communication efficiency and fault-tolerance in transcriptional networks
Roy, S., Ghosh, P., Barua, D., & Das, S. K. (2020) · Scientific Reports · doi:10.1038/s41598-020-66573-x · Cited by 19
Accurate and fast path computation on large urban road networks: A general approach
Song, Q., Li, M., & Li, X. (2018) · PLoS ONE · doi:10.1371/journal.pone.0192274 · Cited by 14
Multisensory integration in the mouse cortical connectome using a network diffusion model
Shadi, K., Dyer, E. L., & Dovrolis, C. (2020) · Network Neuroscience · doi:10.1162/netn_a_00164 · Cited by 14
“…the literature that attempt to capture communication dynamics in the brain based on shortest path lengths, search information (Goñi et al., 2014), navigation (Seguin, van den Heuvel, & Zalesky, 2018), diffusion efficiency (Goñi et al., 2013), and others (Avena-Koenigsberger, Misic, & Sporns, 2018).”
BackgroundThe Connectomes: Methods of White Matter Tractography and Contributions of Resting State fMRI
Moody, J. F., Adluru, N., Alexander, A. L., & Field, A. S. (2021) · Seminars in Ultrasound CT and MRI · doi:10.1053/j.sult.2021.07.007 · Cited by 14
Evolution of Brains and Computers: The Roads Not Taken
Solé, R., & Seoane, L. F. (2022) · Entropy · doi:10.3390/e24050665 · Cited by 14
Connection strength of the macaque connectome augments topological and functional network attributes
de Lange, S. C., Ardesch, D. J., & van den Heuvel, M. P. (2019) · Network Neuroscience · doi:10.1162/netn_a_00101 · Cited by 13
Network bypasses sustain complexity
Estrada, E., Gómez‐Gardeñes, J., & Lacasa, L. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2305001120 · Cited by 15
“Why, then, complex networks are ubiquitously observed? First, note that walkers navigating a network do not necessarily have full information of the network structure, and geodesic navigation is indeed a global optimization problem [68] that, accordingly, “blind” walkers cannot perform.”
BackgroundPersonalized connectome fingerprints: Their importance in cognition from childhood to adult years
Munsell, B. C., Gleichgerrcht, E. L., Hofesmann, E., Delgaizo, J., McDonald, C. R., Marebwa, B., Styner, M. A., Fridriksson, J., Rorden, C., Focke, N. K. N., et al. (2020) · NeuroImage · doi:10.1016/j.neuroimage.2020.117122 · Cited by 13
“…(Section 2.5), 2) hubness only features (SI Appendix: Hubness measures), 3) region-to-region WM connectivity features (Section 2.4), and 4) graph topology dynamic features based on region-to-region communicability 4 (Estrada and Hatano, 2008) or mean first passage time 5 (Goñi et al., 2013).”
BackgroundInfluentialMa, J., Zhang, J., Lin, Y., & Dai, Z. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.118040 · Cited by 13
Predicting resting-state functional connectivity with efficient structural connectivity
Chen, X., & Wang, Y. (2018) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2017.7510880 · Cited by 16
“defined analytic measures in 2013 which were needed to access or trace the shortest paths to investigate communication efficiency in complex networks [27].”
BackgroundPareto Optimality in Multilayer Network Growth
Santoro, A., Latora, V., Nicosia, G., & Nicosia, V. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.128302 · Cited by 15
Shafiei, S. B., Durrani, M., Jing, Z., Mostowy, M., Doherty, P., Hussein, A. A., Elsayed, A. S., Iqbal, U. H., & Guru, K. A. (2021) · Sensors · doi:10.3390/s21051733 · Cited by 12
“Mean Pairwise Diffusion Efficiency of Cortices The diffusion efficiency between nodes ‘i’ and ‘j’ is the inverse of the mean first passage time from ‘i’ to ‘j’, that is the expected number of steps it takes a random walker starting at node i to arrive for the first time at node j [52].”
BackgroundNeudorf, J., Kress, S., & Borowsky, R. (2023) · Brain Structure and Function · doi:10.1007/s00429-023-02613-2 · Cited by 15
“…suggests that brain networks (at both the macroscale and microscale) typically demonstrate a balance of diffusion efficiency and global efficiency (Goñi et al. 2013), while also suggesting that this balance may lean more towards dominance of diffusion efficiency in human brains, in which case we…”
BackgroundMethodResultInfluentialRelation of connectome topology to brain volume across 103 mammalian species
Puxeddu, M. G., Faskowitz, J., Seguin, C., Yovel, Y., Assaf, Y., Betzel, R. F., & Sporns, O. (2024) · PLoS Biology · doi:10.1371/journal.pbio.3002489 · Cited by 16
“We brought SPE and CMY to a common, standardized, space by scaling them relative to the average values computed in one-dimensional lattices and random graphs with the same size and density of the brain network [47].”
Self-citationAsymmetric high-order anatomical brain connectivity sculpts effective connectivity
Sokolov, A. A., Zeidman, P., Razi, A., Erb, M., Ryvlin, P., Pavlova, M. A., & Friston, K. J. (2020) · Network Neuroscience · doi:10.1162/netn_a_00150 · Cited by 12
“The diffusion efficiency approach, described as the (inverse) mean first passage time of a Markov chain process (Goni et al. 2013; Seguin et al. 2019), is similar to in-degree normalisation.”
BackgroundResultChen, S., Seveno, D., & Gorbatikh, L. (2021) · Composites Part A Applied Science and Manufacturing · doi:10.1016/j.compositesa.2021.106632 · Cited by 11
Informational cost and networks navigability
Estrada, E. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2020.125914 · Cited by 10
The impact of aging on human brain network target controllability
Bassignana, G., Lacidogna, G., Bartolomeo, P., Colliot, O., & Fallani, F. D. V. (2022) · Brain Structure and Function · doi:10.1007/s00429-022-02584-w · Cited by 10
“Our approach was instead inspired by the diffusion processes taking place in the connectome (Worrell et al. 2017; Goñi et al. 2013; Avena-Koenigsberger et al. 2018; Raj et al. 2012; Abdelnour et al. 2018) and preserves the hierarchical and modular properties of the anatomical pathways.”
MethodNormative pathways in the functional connectome
Leming, M., Su, L., Chattopadhyay, S., & Suckling, J. (2018) · NeuroImage · doi:10.1016/j.neuroimage.2018.09.028 · Cited by 11
Yan, H., & Graham, D. (2020) · Network Neuroscience · doi:10.1162/netn_a_00165 · Cited by 11
“An alternative to random walk models is shortest path routing, which invokes the logic of evolved optimality (e.g., Bullmore and Sporns, 2009; Rubinov and Sporns, 2010; Goñi et al., 2013, 2014).”
BackgroundTranscriptional Regulatory Network Topology with Applications to Bio-inspired Networking: A Survey
Roy, S., Ghosh, P., Ghosh, N., & Das, S. K. (2021) · ACM Computing Surveys · doi:10.1145/3468266 · Cited by 11
“Literature on TRN uses an alternative measure of shortest path, based on harmonic mean of shortest paths, called network efficiency [66, 81].”
MethodBarceló-Coblijn, L., Benítez‐Burraco, A., & Irurtzun, A. (2015) · Biolinguistics · doi:10.5964/bioling.9037 · Cited by 7
Matyi, M. A., Cioabă, S. M., Banich, M. T., & Spielberg, J. M. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.118614 · Cited by 8
Paths, Diffusion, and Navigation
(2016) · Elsevier eBooks · doi:10.1016/b978-0-12-407908-3.00007-8 · Cited by 14
Abnormal Structural Network Communication Reflects Cognitive Deficits in Schizophrenia
Zorlu, N., Bayrakçı, A., Karakılıç, M., Zalesky, A., Seguin, C., Tian, Y., Gülyüksel, F., Yalınçetin, B., Oral, E., Gelal, F. M., et al. (2023) · Brain Topography · doi:10.1007/s10548-023-00954-z · Cited by 8
Current-flow efficiency of networks
Liu, K., & Yan, X.-Y. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.10.039 · Cited by 8
Optimizing Neighborhood Area Network Topology for Enhanced Communication in Smart Grid
Li, J.-H., Ding, Y., Yu, Z., Zhang, W., Ren, H., & Tian, Y. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3572632 · Cited by 6
“To quantitatively characterize network topological optimization, the metric of communication efficiency, defined as the average over the inverse of the distance between all pairs of nodes in a complex network [15], [16], is adopted.”
Graph vertex and spectral features for EEG-based motor imagery classification
Abdel-Aty, M. A., Rushdi, M. A., Rasmy, M., & Annaby, M. H. (2025) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2025.109944 · Cited by 7
A Perspective on Information Optimality in a Neural Circuit and Other Biological Systems
Friedman, R. (2022) · Signals · doi:10.3390/signals3020025 · Cited by 8
Reaction-diffusion models in weighted and directed connectomes
Schmitt, O., Nitzsche, C., Eipert, P., Prathapan, V., Hütt, M. ‐., & Hilgetag, C. C. (2022) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1010507 · Cited by 9
“Meanwhile, several research groups are engaged in the application of diffusion models in networks of nervous systems [40, 44–46].”
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.