From: An optimized approach for community detection and ranking
Notation | Definition and description |
---|---|
G | Given graph |
N, n | Set of nodes, node |
L, l | Set of links, link |
C, c | Set of community, community |
\(\eta\) | Number of nodes in each C |
\(R_{c}\) | Rank of community c |
\(\gamma\) | Number of edges between two C |
\(e_{b}\) | Designated edges between two C |
\(n_{s}^e \;{\rm and}\; n_{t}^e\) | Nodes on the side of an edge |
S | Similarity value |
s, e | Start and end node |
m, x | Mutual, exclusive neighbor |
\(\varUpsilon\) | Neighboring set |