FIG. 6.

Correlation of the shortest-path (light blue) and random-walk (violet) approach with the simulations arrival time for an unweighted Barabási-Albert network (a) and a two-dimensional lattice embedding (c) both consisting of $V=500$ nodes. In (b) and (d) the corresponding networks visualization. The number of edges is, respectively, $E=998$ and $E=1000$. Parameters as in Fig 3.