Connectivity Matrix Seriation via Relaxation
Fig 2
Example performance of the smooth-index algorithm.
A Original matrix with a few recurrent connections. B Scrambled matrix, obtained by random index permutation. C Matrix resulting from smooth-index sorting. D Different cost functions as the algorithm performs the gradient descent. E Positions of all vertices zi during gradient descent. F Number of switches, calculated as the number of differences between two consecutive rank-sorted position vectors, during gradient descent.