Figure 4
From: Optimal search strategies on complex multi-linked networks
Existence of an optimum for the average search time in a multi-linked network with 
.
Density plot of the average search time for networks with 
nodes and 
. Data are obtained from formula (3), via numerical inversion of matrix (5), for every choice of 
and 
. In both cases here depicted, the three matrices are generated according to the Watts-Strogatz algorithm, for different choices of the probability 
and the initial connectivity 
, (
): 
, 
, 
, 
(lower triangle), 
, 
, 
, 
(upper triangle). The dashed crosses identify the optimal values for 
and 
as predicted by the approximated numerical expression (8).
