Latest posts

Multivariate embedding away from lateralisation maps

In order to characterise a low-dimensional structure of functional brain lateralisation, a spectral embedding of the LI maps was performed using eigendecomposition of graph normalised Laplacian of similarity matrix 80 . The method sought to uncover geometric features in the similarities between the lateralisation maps by converting these similarities into distances between lateralisation maps in the embedded space (the higher similarity between lateralisation profiles, the smaller the distance). To this end, the LI maps were “de-noised,” in a sense that they were reconstructed as the matrix product of 171 components and their spatial maps. Every element of the similarity matrix was calculated as a dot product taken for a pair of “denoised” LI maps across all voxels (i.e., an element of the similarity matrix was a sum of products of voxelwise values for a pair of maps). Negative values were zeroed to permit estimability. The embedding dimensions were ordered according to their eigenvalues, from small to large. The first non-informative dimension associated with a zero eigenvalue was dropped. In the analysis we sought to determine whether there exists a structure in a low-dimensional representation of the data, specifically data structural triangularity, and if it does, in how many dimensions this structure is preserved (for eigenvalue plot-see Supplementary Figure 6). The triangular structure was quantified as a t-ratio, i.e., a ratio between the area of the convex hull encompassing all points in embedded space and an encompassing triangle of a minimal area 27 . These values were compared to the t-ratios of random LI maps. These random maps were obtained by generating 2000 sets of blackchristianpeoplemeet tips 590 random maps via the permutation of the voxel order. For each set, random LI maps were calculated for each pair and then submitted to varimax analysis with the number of principal components = 171.