Connectivity Matrix Seriation via Relaxation
Fig 5
Identification of recurrent synapses by the smooth-index algorithm.
A Original matrix. B Scrambled matrix. C Matrix holding the probability of each connection as being classified as recurrent from 1000 sorting runs. D Same as C, but after reversed scrambling. E Recurrence probability of all reciprocal connections. F Original connectivity matrix (in blue) with identified recurrent connections in red (probability threshold = 0.45).