Modeling Spatial Social Complex Networks for Dynamical Processes

Figure 6

Decentralized paths found with the mixed greedy strategy. (a) Fraction of completed searches in the range . The mixed strategy beats the pure greedy algorithm in the pink-shaded region, . At the success rate of the mixed strategy matches the rate reported in Milgram’s work [13]. Inset: for the whole range of . (b) Average path length from points in City 2 to City 1 (top, purple curve) and average number of links to reach City 1 (bottom, orange curve) in the range . Inset: Same, for the full range of . (c) The effect of incidental attrition: Shown is the distribution of path lengths, for (solid line) along with , accounting for probability of incidental dropout (broken line). The overall success rate reduces from to and the conditional average path length decreases from 16 to 11.7. (Both curves are normalized in the figure, to highlight the change in shape that results from incidental attrition.)

(a)

(b)

(c)