<p>The detailed parameters for three different resolutions , , and of the communities detected in the benchmark hierarchical networks H13-4 and H15-2, where is the number of discovered communities.</p
<p>Parameters of networks' largest component used for community structure analysis.</p
<p>The networks have nodes, coarse-level module sizes between and nodes, and fine-level module si...
The community structure detected by different recursive runs of the method (A,B,C,D). In the bottom ...
<p>Each graph contains 128 vertices, and each vertex is connected to exactly others. These vertices...
<p>Two representative community structures obtained by MMCD on hierarchical GN benchmark.</p
<p>NMI Benchmark by three community detection algorithms comparing with Yang's labeled community str...
<p>Number of communities by three community detection algorithms and Yang's labeled community struct...
<p>Figures A–D show how well the algorithm reveals the three-level organization of the hierarchical ...
<p>X-axis indicates the resolution parameter <i>λ</i>, and Y-axis indicates the modularity and norma...
Five levels of hierarchical community decomposition are illustrated. The width of the triangle origi...
<p>Panel (a) refers to the navpoint network, panel (b) to the sector network, and panel (c) to the a...
A community detection algorithm is considered to have a resolution limit if the scale of the smalles...
(A) Graphs can display heterogeneity in hierarchical community structure. To gain intuition regardin...
<p>(left) Node-betweenness-centrality [<a href="http://www.plosone.org/article/info:doi/10.1371/jour...
Parameters of networks: (a) kmax=30, cmax=150; (b) kmax=100, cmax=150; (c) kmax=30, cmax=600; (d) km...
<p>Parameters of networks' largest component used for community structure analysis.</p
<p>The networks have nodes, coarse-level module sizes between and nodes, and fine-level module si...
The community structure detected by different recursive runs of the method (A,B,C,D). In the bottom ...
<p>Each graph contains 128 vertices, and each vertex is connected to exactly others. These vertices...
<p>Two representative community structures obtained by MMCD on hierarchical GN benchmark.</p
<p>NMI Benchmark by three community detection algorithms comparing with Yang's labeled community str...
<p>Number of communities by three community detection algorithms and Yang's labeled community struct...
<p>Figures A–D show how well the algorithm reveals the three-level organization of the hierarchical ...
<p>X-axis indicates the resolution parameter <i>λ</i>, and Y-axis indicates the modularity and norma...
Five levels of hierarchical community decomposition are illustrated. The width of the triangle origi...
<p>Panel (a) refers to the navpoint network, panel (b) to the sector network, and panel (c) to the a...
A community detection algorithm is considered to have a resolution limit if the scale of the smalles...
(A) Graphs can display heterogeneity in hierarchical community structure. To gain intuition regardin...
<p>(left) Node-betweenness-centrality [<a href="http://www.plosone.org/article/info:doi/10.1371/jour...
Parameters of networks: (a) kmax=30, cmax=150; (b) kmax=100, cmax=150; (c) kmax=30, cmax=600; (d) km...
<p>Parameters of networks' largest component used for community structure analysis.</p
<p>The networks have nodes, coarse-level module sizes between and nodes, and fine-level module si...
The community structure detected by different recursive runs of the method (A,B,C,D). In the bottom ...