Modeling Spatial Social Complex Networks for Dynamical Processes

Figure 5

Statistics of greedy path length obtained by randomly sampling node pairs where and belong to the cities 1 and 2, see Figure 2(b). In the baseline model there are very few short, greedy paths. Connecting to closest neighbors increases the success rate significantly, but the paths found are quite longer. Even a tiny percentage of relocations not only further increases the success rate, but also reduces the greedy path length significantly.