Figure 1
From: Optimal search strategies on complex multi-linked networks
The average search time on synthetic networks displays an optimum as a function of the relative weight of local and non-local moves.
Upper panel: scale-free network generated with the preferential attachment method3 with 
and average connectivity 
. Lower panel: Watts and Strogatz small-world random network with 
44, 
and average connectivity 
. Here the sparse symmetric matrix 
has been generated with 
(scale-free) and 
(Watts-Strogatz). The insets show the position of the minimum 
and the corresponding shortest average time 
(normalized to the case of a purely local walker, 
) as a function of the average fraction of long-range accessible nodes 
. The data are averaged over 
independent realizations of the random matrices 
and error bars correspond to one standard deviation.
