<p>We set and . Each data point is obtained by averaging over 100 independent runs.</p
Information flow, opinion, and epidemics spread over structured networks. When using node centrality...
Information flow, opinion, and epidemics spread over structured networks. When using node centrality...
<p>Comparison of distributions of various network quantities in the year . Authority (blue), Hub (re...
<p>The initially infected nodes are the top-50 nodes obtained by out-degree centrality (squares), Pa...
<p>The non-overlapped nodes in the top-50 lists are initially infected. We set . Each data point is ...
<p>Here we focus on the ranks of the top- ( = 20 and 50) nodes with maximal out-degrees. We abbrevia...
<p>Here we focus on the ranks of the top- ( = 20 and 50) nodes with maximal out-degrees. We abbrevia...
<p>The top-ranked vertices in two networks based on different centrality measures.</p
<p><i>R</i><sub>in</sub> and <i>R</i><sub>out</sub> represent the rankings by the in and out-degree....
<p>Plot shows average clustering coefficient of nodes per degree for full (left figure) and major (r...
The article of record as published may be found at https://doi.org/10.1007/s13278-018-0520-3Identify...
<p>Each column corresponds to a specific network (all species or by single species) Each line relate...
<p>The total number of descriptors equals 919. They belong to 6 different categories which are as fo...
This study is focused on a proposed alternative algorithm for Google's PageRank, named Hermitian cen...
<p>(a) Three basic network centralities. The <i>Degree</i> is the number of node's neighbors; the sh...
Information flow, opinion, and epidemics spread over structured networks. When using node centrality...
Information flow, opinion, and epidemics spread over structured networks. When using node centrality...
<p>Comparison of distributions of various network quantities in the year . Authority (blue), Hub (re...
<p>The initially infected nodes are the top-50 nodes obtained by out-degree centrality (squares), Pa...
<p>The non-overlapped nodes in the top-50 lists are initially infected. We set . Each data point is ...
<p>Here we focus on the ranks of the top- ( = 20 and 50) nodes with maximal out-degrees. We abbrevia...
<p>Here we focus on the ranks of the top- ( = 20 and 50) nodes with maximal out-degrees. We abbrevia...
<p>The top-ranked vertices in two networks based on different centrality measures.</p
<p><i>R</i><sub>in</sub> and <i>R</i><sub>out</sub> represent the rankings by the in and out-degree....
<p>Plot shows average clustering coefficient of nodes per degree for full (left figure) and major (r...
The article of record as published may be found at https://doi.org/10.1007/s13278-018-0520-3Identify...
<p>Each column corresponds to a specific network (all species or by single species) Each line relate...
<p>The total number of descriptors equals 919. They belong to 6 different categories which are as fo...
This study is focused on a proposed alternative algorithm for Google's PageRank, named Hermitian cen...
<p>(a) Three basic network centralities. The <i>Degree</i> is the number of node's neighbors; the sh...
Information flow, opinion, and epidemics spread over structured networks. When using node centrality...
Information flow, opinion, and epidemics spread over structured networks. When using node centrality...
<p>Comparison of distributions of various network quantities in the year . Authority (blue), Hub (re...
DOI
Add to ORKG