A Genetic Simulated Annealing Algorithm to Optimize the Small-World Network Generating Process

Figure 4

Optimizing results for improving efficiency of transforming other networks to small-world networks. The figures show small-world property for three algorithms. (a) shows the results of small-world property optimization on a regular network. The results of corresponding network compute the average value SW after 100 times by reconnecting all the edges randomly on a regular network. (b) shows the results of small-world property optimization on a random network. Since the results of the six runs of the greedy algorithm are the same, the max and mean values of the greedy algorithm overlap.

(a)

(b)