Skip to main content
Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

< Back to Article

Fig 1.

Example of a MNS calculation.

Node 1 shares 4 neighbouring nodes (squares) with node 2. Since this is an undirected network, the MNS of node 1 to node 2 is 4, and vice versa.

More »

Fig 1 Expand

Fig 2.

Example of a MNS grouping.

Nodes A to G are divided into 3 groups (diamond, square and circle). The numbers attached to the edges are the MNS of a pair of nodes. Numbers in red indicates the highest MNS with another node. It must be noted that not all possible related nodes and edges are depicted in this figure.

More »

Fig 2 Expand

Table 1.

Example of the capacity of a given node for accepting a neighbouring node into its community.

More »

Table 1 Expand

Fig 3.

The flowchart of CLPA-GNR.

More »

Fig 3 Expand

Table 2.

Summary of the generated LFR networks.

More »

Table 2 Expand

Table 3.

Summary of generated GN networks.

More »

Table 3 Expand

Table 4.

Summary of the real-world networks.

More »

Table 4 Expand

Fig 4.

The NMI comparison on undirected and unweighted small LFR benchmark networks with small average degree.

The size of the networks, size of the communities and the average degree are n, C and k, respectively.

More »

Fig 4 Expand

Fig 5.

The NMI comparison on undirected and unweighted small LFR benchmark networks with large average degree.

The legend is the same as in Fig 4.

More »

Fig 5 Expand

Fig 6.

The NMI comparison on undirected and unweighted big LFR benchmark networks with small average degree.

The legend is the same as in Fig 4.

More »

Fig 6 Expand

Fig 7.

The NVI comparison on undirected and unweighted small LFR benchmark networks with large average degree.

More »

Fig 7 Expand

Fig 8.

The NVI comparison on undirected and unweighted big LFR benchmark networks with large average degree.

The legend is the same as in Fig 7.

More »

Fig 8 Expand

Fig 9.

The NVI comparison on undirected and unweighted GN and RC benchmark networks. The size of community for RC ranges from 2 to 157.

The legend is the same as in Figs 4 and 7.

More »

Fig 9 Expand

Table 5.

The values of μ and D when CLPA-GNR, LPA, Infomap, GANXiS and NIBLPA obtain trivial detection.

More »

Table 5 Expand

Table 6.

The NVI of real-world networks with ground truth communities.

Bold values are the best detection algorithm for each network.

More »

Table 6 Expand

Table 7.

The modularity (Q) for all the real-world networks.

Bold values are the best detection algorithm for each network.

More »

Table 7 Expand

Table 8.

The modularity density (Qds) for all the real-world networks.

Bold values are the best detection algorithm for each network.

More »

Table 8 Expand