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

Algorithm 6

Edge-Dropping-Learning.

Input: the offspring chromosome: .

The adjacency matrix of the initial network: . The number of nonexistent edges of the initial network: .

  ;

(3) Repeat

(4) islocal← TRUE;

(5) rearrange the sequence number of the chromosome seq=randperm(N _non);

(6)  for ; ; i++

(7)   if (seq(i)) = 1

(8)    (seq(i)) = 0;

(9)    if the diameter of updated network D = 2

(10)     islocal← FALSE;

(11)    else

(12)    ;

(13)   end if

(14)   end if

(15) end for

(16) Until islocal is TRUE;

(17) Output: .