The red line indicates the significant level of connections indicating transfer of information between regions. Here we use tmax = 10, μ = 1, wE = 0.5, wI = −1. The networks are randomly initialized with n ranging from 50 to 1000 with nobs = 50, k1 ∈ {2, 3}, and kA ranging from to 2n with kB = 0.</p
<p>A circle, triangle, and + mark the the mean performance versus ability for thresholds of <i>θ</i>...
<p>Classification accuracy as a function of network load (Lexicon size), averaged over 10 networks w...
Graph theoretical analysis has played a key role in characterizing global features of the topology o...
Blue = A → B, red = B → A. The black line indicates the level above which the number of connections ...
A network with few connections between nodes is low in global efficiency as it takes many jumps to t...
<p>Clustering coefficient (<b>A</b>), shortest path length (<b>B</b>), global efficiency (<b>C</b>) ...
<p>(<b>A</b>) TE p-value histogram for real and randomized data. Real data show many more pairs of n...
<p><b>(a)</b> Results versus the numbers of incoming links. A total of 300 BA random networks with d...
<p>Choosing a noise threshold requires balance between two competing requirements for correctly iden...
For all frames n = kA = 50, kB = 0, tmax = 10. (a) wE = 0.4, wI = −0.5, μ = 10 and k1 = 2 (b) wE = 0...
(a) Scatter plots show the transmission cost associated to each node when it acts as source () and t...
<p>The figure illustrates the number of connections per gene in the feed efficiency network and the ...
The average effective size for three kinds of networks is computed in a random sample (with replacem...
<p>A) Performance over networks as connections are added to an empty network based on node degree (l...
<p>The connectivity of a single network grown with the Barabási-Albert algorithm with <i>p</i> = 0.6...
<p>A circle, triangle, and + mark the the mean performance versus ability for thresholds of <i>θ</i>...
<p>Classification accuracy as a function of network load (Lexicon size), averaged over 10 networks w...
Graph theoretical analysis has played a key role in characterizing global features of the topology o...
Blue = A → B, red = B → A. The black line indicates the level above which the number of connections ...
A network with few connections between nodes is low in global efficiency as it takes many jumps to t...
<p>Clustering coefficient (<b>A</b>), shortest path length (<b>B</b>), global efficiency (<b>C</b>) ...
<p>(<b>A</b>) TE p-value histogram for real and randomized data. Real data show many more pairs of n...
<p><b>(a)</b> Results versus the numbers of incoming links. A total of 300 BA random networks with d...
<p>Choosing a noise threshold requires balance between two competing requirements for correctly iden...
For all frames n = kA = 50, kB = 0, tmax = 10. (a) wE = 0.4, wI = −0.5, μ = 10 and k1 = 2 (b) wE = 0...
(a) Scatter plots show the transmission cost associated to each node when it acts as source () and t...
<p>The figure illustrates the number of connections per gene in the feed efficiency network and the ...
The average effective size for three kinds of networks is computed in a random sample (with replacem...
<p>A) Performance over networks as connections are added to an empty network based on node degree (l...
<p>The connectivity of a single network grown with the Barabási-Albert algorithm with <i>p</i> = 0.6...
<p>A circle, triangle, and + mark the the mean performance versus ability for thresholds of <i>θ</i>...
<p>Classification accuracy as a function of network load (Lexicon size), averaged over 10 networks w...
Graph theoretical analysis has played a key role in characterizing global features of the topology o...
DOI
Add to ORKG