<p>Because the network is relatively small, the largest degree we get is only 30. Therefore, the results in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0110184#pone-0110184-g006" target="_blank">Figure 6a</a> just demonstrate that when the degree is small, how the sentiments' correlations vary with node degrees. While regarding to <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0110184#pone-0110184-g006" target="_blank">Figure 6b</a>, the linear bin is used to get emotion sequences for nodes with clusterings within the same bin.</p
<p><b>(a)</b> The size of the maximum matching <i>n</i><sub>max</sub> increases monotonically with t...
<p>Clustering coefficient (A) and degree assortativity (B) values generated by the CMext and SpecNet...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social,...
<p>For each network, we show its name and reference; number of nodes () and edges (); mean degree ()...
Both the x-axis and the y-axis are on the logarithmic scale. The main takeaway is that nodes with sm...
<p>Plot shows average clustering coefficient of nodes per degree for full (left figure) and major (r...
<p>Structural properties including the network size (N), number of edges (E), the community number (...
<p>For each network, nodes were divided into 6 bins according to degree: 5 equally-sized bins, and a...
<p>Black lines indicate best linear fit to the data (dashed) and model (solid) networks. In panel <i...
<p>The plot shows the average in-degree of the neighbours of nodes with a given out-degree <sup>+</...
<p>For each network, nodes were divided into 6 bins according to degree: 5 equally-sized bins, and a...
<p>The top 10 genes of a random network denote the gene that rank top 10 in the random network initi...
<p>Relationship between average buffer size and node degree for EP on networks with 500 nodes (left ...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, and soc...
<p> and are the network size and the number of links, respectively. is the network efficiency <a h...
<p><b>(a)</b> The size of the maximum matching <i>n</i><sub>max</sub> increases monotonically with t...
<p>Clustering coefficient (A) and degree assortativity (B) values generated by the CMext and SpecNet...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social,...
<p>For each network, we show its name and reference; number of nodes () and edges (); mean degree ()...
Both the x-axis and the y-axis are on the logarithmic scale. The main takeaway is that nodes with sm...
<p>Plot shows average clustering coefficient of nodes per degree for full (left figure) and major (r...
<p>Structural properties including the network size (N), number of edges (E), the community number (...
<p>For each network, nodes were divided into 6 bins according to degree: 5 equally-sized bins, and a...
<p>Black lines indicate best linear fit to the data (dashed) and model (solid) networks. In panel <i...
<p>The plot shows the average in-degree of the neighbours of nodes with a given out-degree <sup>+</...
<p>For each network, nodes were divided into 6 bins according to degree: 5 equally-sized bins, and a...
<p>The top 10 genes of a random network denote the gene that rank top 10 in the random network initi...
<p>Relationship between average buffer size and node degree for EP on networks with 500 nodes (left ...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, and soc...
<p> and are the network size and the number of links, respectively. is the network efficiency <a h...
<p><b>(a)</b> The size of the maximum matching <i>n</i><sub>max</sub> increases monotonically with t...
<p>Clustering coefficient (A) and degree assortativity (B) values generated by the CMext and SpecNet...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social,...