Who is really in my social circle?

Journal of Internet Services and Applications

Table 2 Community detection algorithms

Abb.	Algorithm	ξ	Complexity	Ref.
LP	Label propagation	N	O(V)	[28]
LM	Louvain modularity	D	O(VlogV)	[5]
IM	Infomap	N	O(VlogV)	[62]
GOM	Greedy opt. of modularity	D	O(Vlog²(V))	[27]
LE	Leading eigenvector	D	O(V²logV)	[63, 78]
WT	Walktrap	N	O(V²logV)	[64]
EB	Edge betweenness	D	O(V³)	[79]

ξ: Algorithm state model (D-deterministic or N-non-deterministic); Time complexity computed under the assumption that the graph is sparse