Optimization of the Critical Diameter and Average Path Length of Social Networks

Algorithm 4

Disassortativeness Learning.

Input: the offspring chromosome: . The adjacency matrix of the initial network: .

  ;

(3) Update the matrix by decoding ;

(4) Find the element of with the minimum sum value of nodes pair degrees;

(5) ;

(6) Find the element of with the “maximum” difference value of nodes pair degrees;

(7) ;

(8) Output: .