Table 1 Outline of the boundary node vicinity algorithm
From: Uncovering nodes that spread information between communities in social networks
1 | Extract the set of connected graphs from the original graph |
2 | For each connected component obtain the community labels for the graph |
3 | Obtain the set of boundary nodes |
4 | Measure the local vicinity of each boundary node using the fixed length random walk method and aggregate all of the values in the graph into a normalized score |