A new statistical approach for the extraction of adjacency matrix from effective connectivity networks

Graph theory is a powerful mathematical tool recently introduced in neuroscience field for quantitatively describing the main properties of investigated connectivity networks. Despite the technical advancements provided in the last few years, further investigations are needed for overcoming actual limitations in the field. In fact, the absence of a common procedure currently applied for the extraction of the adjacency matrix from a connectivity pattern has been leading to low consistency and reliability of ghaph indexes among the investigated population. In this paper we proposed a new approach for adjacency matrix extraction based on a statistical threshold as valid alternative to empirical approaches, extensively used in Neuroscience field (i.e. fixing the edge density). In particular we performed a simulation study for investigating the effects of the two different extraction approaches on the topological properties of the investigated networks. In particular, the comparison was performed on two different datasets, one composed by uncorrelated random signals (null-model) and the other one by signals acquired on a mannequin head used as a phantom (EEG null-model). The results highlighted the importance to use a statistical threshold for the adjacency matrix extraction in order to describe the real existing topological properties of the investigated networks. The use of an empirical threshold led to an erroneous definition of small-world properties for the considered connectivity patterns