Figure 6: NNG equilibria of real networks helps to improve or degrade their navigability.
From: Navigable networks as Nash equilibria of navigation games

The edges from the NNG equilibria of the considered real networks are first sorted in the decreasing order of betweenness centrality, and then either added to the real network if not already there (panel (a)), or removed from the network if present (panel (b)). The x-axis shows the percentage of added or removed edges compared with the number of edges in the original real network. Navigation success ratio is computed as the number of node pairs between which geometric routing is successful divided by the number of all node pairs.