An Improved Local Community Detection Algorithm Using Selection Probability

Algorithm 1

ILCDSP algorithm.

Input: A source node 𝑣₀ and a network

Output: A local community containing source node 𝑣₀

(1) Merge the source node 𝑣₀ into 𝐷 and merge the

  neighbor nodes of 𝑣₀ into 𝑆

(2) Set local modularity 𝑀=0

(3) Calculate 𝑃_𝑖 for each node in 𝑁 which makes Δ𝑀>0

(4) Do

(5) While  𝑁 is not empty Do

(6) Generate 𝑟∈[0,1] randomly, find the candidate node 𝑣

(7) Merge node 𝑣 into 𝐷, and remove it from 𝑆

(8) Update 𝑆,𝐵,𝑀

(9) Until no new node is merged into 𝐷

(10) Return  𝐷