An Autonomous Divisive Algorithm for Community Detection Based on Weak Link and Link-Break Strategy

Algorithm 1

Determination of the weak link.

(1) Input: Graph , node set , link set .

(2) Output: Weak link set .

(3) Process:

(4) for each link

(5) calculate , , , .

(6) if    &  

(7) .

(8) end if

(9) end for

(10) return Weak link set .