A Parallel Community Structure Mining Method in Big Social Networks

Algorithm 1

Steady visiting probability vector calculation on MapReduce (VPC).

  (1) method  (nid , node )

  (2)   //(8)

  (3)   emit(nid , ) //pass along network structure

  (4)   for all nodeid   do

  (5)      emit(nid , ) //pass pagerank contribution to neighbors

  (6)   endfor

  (7) method  (nid ,)

  (8)   

  (9)   for all    do

(10)      if    then

 (11)         //recover local network structure

(12)      else

(13)         //sums pagerank contributions

(14)      endif

(15)   endfor

(16)   

(17)   emit(nid , )