Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks

Algorithm 1

Newman’s spectral method for several communities.

       Input: A network

       Output: A community structure

(1)     ;

(2)   ;

(3)   ;

(4)   

(5)   NewmanSpectral();

(6)   forall the  NewmanSpectral  do

(7)    Calculate the modularity matrix for ;

(8)    Find the eigenvector related to the largest algebraic eigenvalue of   (6);

      // Will split community   in    and  ;

(9)    ;

(10)  ;

(11)   foreach element of   do

(12)   if    then

(13)    ;

(14)     

(15)   else

(16)    ;

(17)    

(18)   end

(19)  end

(20)  Calculate the modularity variation with vector   (9);

(21)   if    then

   // Will try to split communities    and  ;

(22)   ;

(23)   NewmanSpectral();

(24)   NewmanSpectral();

(25)  else  // Found a community

(26)   ;

(27)   ;

(28)   ;

(29)  end

(30) end