Connectivity Matrix Seriation via Relaxation
Fig 3
Performance of the smooth-index algorithm for matrices with different densities.
A Example matrices for N = 50 neurons, given a density of 50% in the lower triangle. B Performance of the algorithm as a function of the number of neurons. Plotted is the fraction of non-zero entries in the upper triangle of the matrix in case of the original connectivity matrix before scrambling (in black), after out-degree sorting (in red) and after smooth-index sorting (in blue). C CPU time needed for out-degree sorting (in red) and for smooth-index sorting (in blue) as a function of the number of neurons. Data in B and C represent the mean +- standard deviation (shaded area) obtained from 10 sorting runs. D-F Same as above, but for a density of 35% in the lower triangle. G-I Same as above, but for a density of 20% in the lower triangle.