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
Items 101–158 of 158
Ramírez‐Toraño, F., Abbas, K., Bruña, R., Pedro, S. M.-D., Gómez‐Ruiz, N., Barabash, A., Pereda, E., Marcos, A., López-Higes, R., Maestú, F., et al. (2021) · Cerebral Cortex Communications · doi:10.1093/texcom/tgab051 · Cited by 8
“For each subtrait, we retained the giant component of the connectivity pattern, hence, discarding spurious edges involving one or a few brain areas (Goñi et al. 2013).”
MethodSelf-citationFate of Duplicated Neural Structures
Seoane, L. F. (2020) · Entropy · doi:10.3390/e22090928 · Cited by 9
“They are less rigorous, but still useful tools to contemplate possible morphologies or designs [192–199].”
BackgroundAdaptive Motif-based Topology Control in Mobile Software Defined Wireless Sensor Networks
Roy, S., Dutta, R., Ghosh, N., & Ghosh, P. (2021) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc49032.2021.9369601 · Cited by 6
“…measures how effectively the network exchanges information; it is defined as the harmonic mean of shortest path lengths between all node pairs [13], [36], [37], and is calculated as: In We calculate the average degree, network efficiency ( Z ) and average residual energy of the WSN for varying power…”
BackgroundAlves, C. L., Ciba, M., Toutain, T. G. L. D. O., Porto, J. A. M., de Sena, E. P., Thielemann, C., & Rodrigues, F. A. (2024) · Journal of Physics Complexity · doi:10.1088/2632-072x/ad1c68 · Cited by 4
“Furthermore, many recent studies [97, 104] have excluded weighted edges, turning them into binary edges, since weightless networks are simpler to characterize and there are many more measures, from complex networks to weightless networks.”
BackgroundConservative Versus Non-conservative Diffusion Toward a Target in a Networked Environment
Estrada, E. (2024) · Springer eBooks · doi:10.1007/978-3-031-67802-8_21 · Cited by 5
Coming up short: Generative network models fail to accurately capture long-range connectivity
Oldham, S., Fornito, A., & Ball, G. (2025) · Network Neuroscience · doi:10.1162/netn.a.35 · Cited by 10
“These alternatives were informed by approaches proposed by other studies (Akarca et al., 2025; Goñi et al., 2013; Liu et al., 2024), including TND (similarity across global measures of topology), TF diff (Euclidean norm of the difference between correlation matrices of topological features), max( r…”
Rethinking Healthcare Teams’ Practices Using Network Science: Implications, Challenges, and Benefits
Aloini, D., Ferraro, G., Iovanella, A., & Stefanini, A. (2022) · Applied Sciences · doi:10.3390/app12125841 · Cited by 5
Optimality Pressures toward Lateralization of Complex Brain Functions
Seoane, L. F. (2023) · Physical Review X · doi:10.1103/physrevx.13.031028 · Cited by 9
Resolving inter-regional communication capacity in the human connectome
Milisav, F., Bazinet, V., Iturria‐Medina, Y., & Mišić, B. (2023) · Network Neuroscience · doi:10.1162/netn_a_00318 · Cited by 3
Lou, C., Cross, A. M., Peters, L., Ansari, D., & Joanisse, M. F. (2024) · Network Neuroscience · doi:10.1162/netn_a_00414 · Cited by 3
Automatic Discovery of Families of Network Generative Processes
Menezes, T., & Roth, C. (2019) · Springer proceedings in complexity · doi:10.1007/978-3-030-14683-2_4 · Cited by 6
“, 2013], communication efficiency [Goñi et al., 2013], graphlets [Yaveroglu et al.”
BackgroundNetwork-Based Approach for Modeling and Analyzing Coronary Angiography
Ravandi, B., & Ravandi, A. (2020) · Springer proceedings in complexity · doi:10.1007/978-3-030-40943-2_15 · Cited by 4
“The routing efficiency, also known as global efficiency enables to quantify how cost-efficient a particular network is, where the cost depends on the weight of edges [31].”
BackgroundA general framework for characterizing optimal communication in brain networks
Fakhar, K., Hadaeghi, F., Seguin, C., Dixit, S., Messé, A., Zamora‐López, G., Mišić, B., & Hilgetag, C. C. (2025) · eLife · doi:10.7554/elife.101780.3 · Cited by 13
Mapping life’s disparity and evolutionary constraints in a geometric complexity space
Dera, G., Nardin, É., Risser, L., Albino, M., Garnier, Q., Kardacz, M., & Monge-Waleryszak, L. (2026) · Science Advances · doi:10.1126/sciadv.aea6945 · Cited by 4
“In a conceptual communication efficiency framework, such adaptations could also explain the maintenance of long linear shapes (e.g., parasitic worms) that generally suffer from limitations in resource diffusion ( 85 ).”
A Hybrid Routing Pattern in Human Brain Structural Network Revealed By Evolutionary Computation
Liang, Q., Ma, J., Chen, X., Lin, Q., Shu, N., Dai, Z., & Lin, Y. (2024) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2024.3351907 · Cited by 4
“Well-known for high adaptability, global search ability, and implicit parallelism, GAs have been successfully applied to a wide range of engineering and scientific problems [46], [47], [48], including the study of human connectome [18], [49], [50], [51].”
BackgroundMethodInfluentialEvent‐Marked Windowed Communication: Inferring Activity Propagation from Neural Time Series
Mohan, V. M., Varley, T. F., Cash, R. F. H., Seguin, C., & Zalesky, A. (2025) · Human Brain Mapping · doi:10.1002/hbm.70223 · Cited by 3
“…et al. 2019; Seguin et al. 2023b), ranging from information transfer via neural oscillations (Bonnefond et al. 2017; Fries 2005, 2015; Hahn et al. 2014; Jensen and Mazaheri 2010) to network measures of connectome communication (Avena-Koenigsberger et al. 2019; Goñi et al. 2013; Seguin et al. 2018).”
Identifying brain network topology changes in task processes and psychiatric disorders
Rezaeinia, P., Fairley, K., Pal, P., Meyer, F. G., & Carter, R. M. (2019) · Network Neuroscience · doi:10.1162/netn_a_00122 · Cited by 3
“monly used and are the focus of active research (Goñi et al., 2013; Lambiotte, Delvenne, & Barahona, 2014; Shen & Meyer, 2008).”
BackgroundAn eccentric perspective on brain networks
de Reus, M. A. (2015) · Brain Center Rudolf Magnus · Cited by 3
Akbarian, B., & Erfanian, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.03091 · Cited by 3
“The diffusion efficiency is measured by the expected number of steps that takes a random walker starting at node 𝑖 to arrive at node 𝑗 for the first time [45].”
BackgroundCompression supports low-dimensional representations of behavior across neural circuitsPreprint
Zhou, D., Kim, J. Z., Pines, A. R., Sydnor, V. J., Roalf, D. R., Detre, J. A., Gur, R. C., Gur, R. E., Satterthwaite, T. D., & Bassett, D. S. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.11.29.518415 · Cited by 7
“We count the number walkers by dividing a given probability of walkers not taking shortest paths by the probability that walkers do not take shortest paths [36, 37].”
BackgroundConnectome embedding in multidimensional graph spaces
Mach, M., Amico, E., Liégeois, R., Preti, M. G., Griffa, A., Ville, D. V. D., & Pedersen, M. (2024) · Network Neuroscience · doi:10.1162/netn_a_00393 · Cited by 4
“…in neuroscience since the brain and its neurons comprise complex and multiscale interconnected networks (Avena-Koenigsberger et al., 2015; Bullmore & Sporns, 2009; Farahani et al., 2019; Fornito et al., 2016; Goñi et al., 2013; Simas et al., 2015; Sporns, 2016; Stam, 2014; Wang et al., 2010).”
Wang, S., Qin, J., Yang, L.-L., Ji, Y., Huang, H., Gao, X.-S., Zhou, Z.-M., Guo, Z.-R., Wu, Y. E., Tian, L., et al. (2025) · World Journal of Psychiatry · doi:10.5498/wjp.v15.i5.102706 · Cited by 4
Yu, F., Wu, G., Li, W., Wang, Y., Wang, J., Wang, M., Kong, D., Yang, J. G., Ren, X., Yang, Z., et al. (2025) · BMC Medicine · doi:10.1186/s12916-025-04556-3 · Cited by 3
Human cortical networks trade communication efficiency for computational reliability
Fakhar, K., Akarca, D., Luppi, A. I., Oldham, S., Hadaeghi, F., Vértes, P. E., Bullmore, E. T., Hilgetag, C. C., & Astle, D. E. (2026) · Science Advances · doi:10.1126/sciadv.aef2894 · Cited by 4
Motifs, Small Worlds, and Network Economy
(2016) · Elsevier eBooks · doi:10.1016/b978-0-12-407908-3.00008-x · Cited by 3
Modularized Brain Network for Eliminating Volume Conduction Effects
Chakladar, D. D., & Liwicki, F. (2024) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc54092.2024.10831826 · Cited by 3
“In contrast, LE leads to local knowledge transfer between EEG channels within a region [25].”
Yeung, H. W., Buchanan, C. R., Moodie, J. E., Deary, I. J., Tucker–Drob, E. M., Bastin, M. E., Whalley, H. C., Smith, K., & Cox, S. R. (2025) · Human Brain Mapping · doi:10.1002/hbm.70314 · Cited by 2
“Diffusion efficiency (Goñi et al. 2013; Wang and Pei 2008): where t ij is the mean first-passage time for node i and j .”
Efficient network navigation with partial information
Yan, X., Sporns, O., & Avena‐Koenigsberger, A. (2020) · IEEE International Conference on Networking, Sensing and Control (ICNSC) · doi:10.1109/icnsc48988.2020.9238119 · Cited by 2
“Yet, such a navigation model assumes that system’s elements having information about the global topology and therefore shortest paths connecting the constituent elements [3].”
BackgroundSelf-citationLow-dimensional morphospace of topological motifs in human fMRI brain networksPreprint
Morgan, S., Achard, S., Termenon, M., Bullmore, E., & Vértes, P. (2017) · bioRxiv · doi:10.1101/153320 · Cited by 24
“This allows us to build a low-dimensional morphospace defined by these first two PCs. Morphospaces have already been shown as a promising approach to study network topology [4, 14].”
BackgroundKuceyeski, A. F., Jamison, K. W., Owen, J. P., Raj, A., & Mukherjee, P. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/320515 · Cited by 7
A morphospace framework to assess configural breadth based on brain functional networksPreprint
Duong-Tran, D. A., Amico, E., Corominas‐Murtra, B., Abbas, K., Džemidžić, M., Kareken, D. A., Ventresca, M., & Goñi, J. (2019) · arXiv (Cornell University) · Cited by 2
Self-citationA general framework for characterizing optimal communication in brain networksPreprint
Fakhar, K., Hadaeghi, F., Seguin, C., Dixit, S., Messé, A., Zamora‐López, G., Mišić, B., & Hilgetag, C. C. (2024) · eLife · doi:10.7554/elife.101780 · Cited by 2
Adebisi, A. T., Lee, H., & Veluvolu, K. C. (2023) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm58861.2023.10385749 · Cited by 1
“The diffusion efficiency which is a complementary measure to the global efficiency is an analytic measures capable of characterizing network communication during random walk process [18].”
BackgroundNavigational bottlenecks in nonconservative diffusion dynamics on networks
Soares, G. G., & Estrada, E. (2024) · AIMS Mathematics · doi:10.3934/math.20241182 · Cited by 2
“Di ff usion is a navigational process which seems to be ubiquitous in nature, implying that [9] “communication occurs in the absence of specific targets, or that, even if targets are specified, a lack of knowledge about global network topology prevents particles or messages from taking the shortest…”
BackgroundNetwork Efficiency under Nonconservative Diffusion
Azemar, A., & Estrada, E. (2025) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/24m167038x · Cited by 1
Exploring the transmission of cognitive task information through optimal brain pathways
Wang, Z., Yang, Y., Huang, Z., Zhao, W., Su, K., Zhu, H., & Yin, D. (2025) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1012870 · Cited by 1
“Accordingly, several network communication models that do not require centralized knowledge, such as diffusion models [44–47], path ensembles [48], and navigation [49], have been proposed to characterize neural signaling.”
Barceló-Coblijn, L., Eguíluz, V. M., & Seoane, L. F. (2026) · Physical Review Research · doi:10.1103/d93c-hm6w · Cited by 1
Commute Time as a Method to Explore Brain Functional Connectomes
Sato, J. R., Sato, C. M., Silva, M. K. D. C., & Biazoli, C. E. (2018) · Brain Connectivity · doi:10.1089/brain.2018.0598 · Cited by 2
“…Gon˜i and colleagues (2014) have found that the relationships between structural network and spontaneous functional connectivity are suggestive of diffusion, spreading, or greedy routing dynamics (Abdelnour et al., 2014; Gon˜i et al., 2013; O’Dea et al., 2013; van den Heuvel et al., 2012).”
BackgroundDetecting Square Grid Structure in an Animal Neuronal Network
Friedman, R. (2022) · NeuroSci · doi:10.3390/neurosci3010007 · Cited by 1
“In addition, the regular grid structure represents a localization of information [5,10], as exemplified by a model of particles traveling across a network, and correspondingly their level of efficiency and capability in routing [11].”
BackgroundMethodInfluentialPuxeddu, M. G., Seguin, C., & Sporns, O. (2024) · Elsevier eBooks · doi:10.1016/b978-0-12-820480-1.00165-0 · Cited by 1
Self-citationA General Framework for Characterizing Optimal Communication in Brain NetworksPreprint
Fakhar, K., Hadaeghi, F., Seguin, C., Dixit, S., Messé, A., Zamora‐López, G., Mišić, B., & Hilgetag, C. C. (2024) · eLife · doi:10.7554/elife.101780.1 · Cited by 2
Connectome architecture favours within-module diffusion and between-module routingPreprint
Seguin, C., Puxeddu, M. G., Faskowitz, J., Betzel, R. F., & Sporns, O. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.02.10.637586 · Cited by 2
Self-citationStructural and Synaptic Dysregulation Drives Network Vulnerability in APOE4 Human Neuronal NetworksPreprint
Grønlie, M. B., Fiskum, V., Sandvig, A., & Sandvig, I. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.05.04.722197 · Cited by 1
“Large values indicate efficient information flow and functional integration (Latora and Marchiori, 2001) (Goñi et al., 2013).”
Towards an information theoretical description of communication in brain networksPreprint
Amico, E., Abbas, K., Duong-Tran, D. A., Tipnis, U., Rajapandian, M., Chumin, E. J., Ventresca, M., Harezlak, J., & Goñi, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.02601
“Hybrid models exploring a spectrum of communication dynamics (including search information (Goñi et al., 2013, 2014), navigation (Seguin, Heuvel, & Zalesky, 2018), or k-shortest path ensembles (Avena-Koenigsberger et al., 2017)) have also been investigated.”
BackgroundSelf-citationPompilus, M., Colón-Pérez, L. M., Grudny, M. M., & Febo, M. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.06.13.150060
Ramírez‐Toraño, F. (2021) · UPM Digital Archive (Technical University of Madrid) · doi:10.20868/upm.thesis.66243
Evolutionary paths to lateralization of complex brain functionsPreprint
Seoane, L. F. (2021) · arXiv (Cornell University) · doi:10.12751/nncn.bc2022.036 · Cited by 2
Liang, Q., Ma, J., Chen, X., Dai, Z., & Lin, Y. (2021) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2021.11.25.469862
“In contrast to the idea of optimal routing, some researchers proposed SCN communication strategies based on the concept of random walking [18].”
Background(2016) · Elsevier eBooks · doi:10.1016/b978-0-12-407908-3.10000-7
Beyond the shortest path—diffusion-based routing strategies
Chung, A. W. (2023) · Elsevier eBooks · doi:10.1016/b978-0-323-85280-7.00014-2
On the application of Machine Learning and Complex Networks to Neuroscience
Alves, C. L. (2023) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.55.2023.tde-31082023-145944
Barceló-Coblijn, L., Eguı́luz, V. M., & Seoane, L. F. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.02.19.639060
A General Framework for Characterizing Optimal Communication in Brain NetworksPreprint
Fakhar, K., Hadaeghi, F., Seguin, C., Dixit, S., Messé, A., Zamora‐López, G., Mišić, B., & Hilgetag, C. C. (2025) · eLife · doi:10.7554/elife.101780.2 · Cited by 1
Brain network communication in remission: a comparative study of bipolar and unipolar depression
Liu, H., Xia, Y. X., Hua, L., Sun, H., Yan, R., Yao, Z., & Qin, J. (2025) · Journal of Psychiatric Research · doi:10.1016/j.jpsychires.2025.03.057
Connaughton, M., Leemans, A., Silk, T. J., Anderson, V. A., O’Hanlon, E., Whelan, R., & McGrath, J. (2025) · Biological Psychiatry Cognitive Neuroscience and Neuroimaging · doi:10.1016/j.bpsc.2025.09.022 · Cited by 1
Argyropoulou, M. I., Margariti, P. N., Xydis, V. G., Drougia, A. A., Styliara, E., Giapros, V. I., & Astrakas, L. G. (2025) · Pediatric Radiology · doi:10.1007/s00247-025-06422-z
“The routing model describes a single efficient signal transfer through a shortest path, but this necessitates a priori global knowledge of the network topology [28].”
InfluentialCasti, P., Sorbino, M., Mencattini, A., García‐Colomo, A., Susi, G., Maestú, F., & Martinelli, E. (2025) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2025.3643054
“The following descriptors were extracted from the graphs of each test subject for, as indicators of the topology of the GNN-learned graphs [32], [57], [58], [59].”
Shin, J., Scimeca, M., Li, R., Kiran, S., & Sung, J. E. (2026) · Aphasiology · doi:10.1080/02687038.2026.2648119
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.