<p> and are the network size and the number of links, respectively. is the network efficiency <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0107056#pone.0107056-Latora1" target="_blank">[36]</a>, denoted as , where is the shortest distance between nodes and . and are clustering coefficient <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0107056#pone.0107056-Watts1" target="_blank">[12]</a> and assortative coefficient <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0107056#pone.0107056-Newman2" target="_blank">[33]</a>, respectively. and are the average degree and the average shortest distance. denotes the degree heterogeneity defined as .</p><p>The basic structural...
<p>(A) The clustering coefficient and (B) the characteristic path length are shown as a function of ...
<p>Size of networks studied in this paper, along with their average degree 〈<i>k</i>〉 and degree ass...
<p>Clustering coefficient (<b>A</b>), shortest path length (<b>B</b>), global efficiency (<b>C</b>) ...
<p>Structural properties including the network size (N), number of edges (E), the community number (...
<p> and are the number of nodes and links, and are the maximum of in-degree and out-degree of all...
<p> and denote the number of nodes and links. and are the average clustering coefficient and the ...
<p>n and m are the total numbers of nodes and links, respectively. and denote the average and the ...
<p>Number of vertices , number of edges , average degree , number of connected components , average ...
<p>Explanation of the clustering coefficient and path length using a schematic whole-brain binary ne...
<p> represents the size of the giant component, denotes the clustering coefficient, and are respe...
<p>Modularity , diameter , fraction of nodes in the largest component , global clustering coefficien...
<p>(a): proportion of the pastures in the largest connected component (stars: the buffer widths for ...
<p>For each network, we show its name and reference; number of nodes () and edges (); mean degree ()...
<p>High-level statistics in the last snapshot of the social networks analyzed (N = nodes; E = links;...
<p>(a) The degree distribution specifies how likely it is for a person to have a particular number o...
<p>(A) The clustering coefficient and (B) the characteristic path length are shown as a function of ...
<p>Size of networks studied in this paper, along with their average degree 〈<i>k</i>〉 and degree ass...
<p>Clustering coefficient (<b>A</b>), shortest path length (<b>B</b>), global efficiency (<b>C</b>) ...
<p>Structural properties including the network size (N), number of edges (E), the community number (...
<p> and are the number of nodes and links, and are the maximum of in-degree and out-degree of all...
<p> and denote the number of nodes and links. and are the average clustering coefficient and the ...
<p>n and m are the total numbers of nodes and links, respectively. and denote the average and the ...
<p>Number of vertices , number of edges , average degree , number of connected components , average ...
<p>Explanation of the clustering coefficient and path length using a schematic whole-brain binary ne...
<p> represents the size of the giant component, denotes the clustering coefficient, and are respe...
<p>Modularity , diameter , fraction of nodes in the largest component , global clustering coefficien...
<p>(a): proportion of the pastures in the largest connected component (stars: the buffer widths for ...
<p>For each network, we show its name and reference; number of nodes () and edges (); mean degree ()...
<p>High-level statistics in the last snapshot of the social networks analyzed (N = nodes; E = links;...
<p>(a) The degree distribution specifies how likely it is for a person to have a particular number o...
<p>(A) The clustering coefficient and (B) the characteristic path length are shown as a function of ...
<p>Size of networks studied in this paper, along with their average degree 〈<i>k</i>〉 and degree ass...
<p>Clustering coefficient (<b>A</b>), shortest path length (<b>B</b>), global efficiency (<b>C</b>) ...