Finotelli Paolo, Piccardi Carlo, Miglio Edie, Dulio Paolo
Department of Mathematics, Politecnico di Milano, Milan, Italy.
Department of Electronics, Information and Bioengineering, Politecnico di Milano, Milan, Italy.
Front Neurosci. 2021 Apr 28;15:665544. doi: 10.3389/fnins.2021.665544. eCollection 2021.
In this paper, we propose a graphlet-based topological algorithm for the investigation of the brain network at (RS). To this aim, we model the brain as a graph, where (labeled) nodes correspond to specific cerebral areas and links are weighted connections determined by the intensity of the (fMRI). Then, we select a number of working , namely, connected and non-isomorphic induced subgraphs. We compute, for each labeled node, its (GDV), which allows us to associate a GDV matrix to each one of the 133 subjects of the considered sample, reporting how many times each node of the atlas "touches" the independent orbits defined by the graphlet set. We focus on the 56 independent columns (i.e., non-redundant orbits) of the GDV matrices. By aggregating their count all over the 133 subjects and then by sorting each column independently, we obtain a , whose top-level entries highlight the nodes (i.e., brain regions) most frequently touching each of the 56 independent graphlet orbits. Then, by pairwise comparing the columns of the sorted node table in the top- entries for various values of , we identify sets of nodes that are consistently involved with high frequency in the 56 independent graphlet orbits all over the 133 subjects. It turns out that these sets consist of labeled nodes directly belonging to the (DMN) or strongly interacting with it at the RS, indicating that graphlet analysis provides a viable tool for the topological characterization of such brain regions. We finally provide a validation of the graphlet approach by testing its power in catching network differences. To this aim, we encode in a (GCM) the network information associated with each subject then construct a subject-to-subject (GCD) matrix based on the Euclidean distances between all possible pairs of GCM. The analysis of the clusters induced by the GCD matrix shows a clear separation of the subjects in two groups, whose relationship with the subject characteristics is investigated.
在本文中,我们提出了一种基于图元的拓扑算法,用于静息态(RS)脑网络的研究。为此,我们将大脑建模为一个图,其中(带标签的)节点对应于特定的脑区,边是由功能磁共振成像(fMRI)强度确定的加权连接。然后,我们选择一些工作图元,即连通且非同构的诱导子图。对于每个带标签的节点,我们计算其图元度值(GDV),这使我们能够为所考虑样本的133名受试者中的每一个关联一个GDV矩阵,报告图谱中的每个节点“接触”由图元集定义的独立轨道的次数。我们关注GDV矩阵的56个独立列(即非冗余轨道)。通过汇总133名受试者中所有列的计数,然后对每一列进行独立排序,我们得到一个节点表,其顶级条目突出显示了最频繁接触56个独立图元轨道中每一个的节点(即脑区)。然后,通过对排序后的节点表的列在不同阈值的顶级条目中进行两两比较,我们识别出在133名受试者的56个独立图元轨道中始终高频参与的节点集。结果表明,这些节点集由直接属于默认模式网络(DMN)或在静息态时与其强烈相互作用的带标签节点组成,这表明图元分析为这类脑区的拓扑特征提供了一个可行的工具。我们最终通过测试其捕捉网络差异的能力来验证图元方法。为此,我们在生成对抗网络(GCM)中编码与每个受试者相关的网络信息,然后基于所有可能的GCM对之间的欧几里得距离构建一个受试者间生成对抗差异(GCD)矩阵。对GCD矩阵诱导的聚类分析表明,受试者明显分为两组,并对它们与受试者特征的关系进行了研究。