Navigability evaluation of complex networks by greedy routing efficiency

Abstract

Network navigability is a key feature of complex networked systems. For a network embedded in a geometrical space, maximization of greedy routing (GR) measures based on the node geometrical coordinates can ensure efficient greedy navigability. In PNAS, Seguin et al. (PNAS 2018, vol. 115, no. 24) define a measure for quantifying the efficiency of brain network navigability in the Euclidean space, referred to as the efficiency ratio, whose formula exactly coincides with the GR-score (GR-efficiency) previously published by Muscoloni et al. (Nature Communications 2017, vol. 8, no. 1615). In this Letter, we point out potential flaws in the study of Seguin et al. regarding the discussion of the GR evaluation. In particular, we revise the concept of GR navigability, together with a careful discussion of the advantage offered by the new proposed GR-efficiency measure in comparison to the main measures previously adopted in literature. Finally, we clarify and standardize the GR-efficiency terminology in order to simplify and facilitate the discussion in future studies.

References in corpus (7)

• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Navigation of brain networks
• Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
• Network Mapping by Replaying Hyperbolic Growth
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Network Geometry Inference using Common Neighbors

Cited by in corpus (7)

• Network Geometry
• Modular gateway-ness connectivity and structural core organization in maritime network science
• Random hyperbolic graphs in $d+1$ dimensions
• Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces
• Optimisation of the coalescent hyperbolic embedding of complex networks
• Model-free hidden geometry of complex networks
• Quantifying navigation complexity in transportation networks