Author:
Guo Guangxing,Zhao Yanli,Liu Chenxu,Fu Yongcan,Xi Xinhua,Jin Lizhong,Shi Dongli,Wang Lin,Duan Yonghong,Huang Jie,Tan Shuping,Yin Guimei
Abstract
With the development of network science and graph theory, brain network research has unique advantages in explaining those mental diseases, the neural mechanism of which is unclear. Additionally, it can provide a new perspective in revealing the pathophysiological mechanism of brain diseases from the system level. The selection of threshold plays an important role in brain networks construction. There are no generally accepted criteria for determining the proper threshold. Therefore, based on the topological data analysis of persistent homology theory, this study developed a multi-scale brain network modeling analysis method, which enables us to quantify various persistent topological features at different scales in a coherent manner. In this method, the Vietoris–Rips filtering algorithm is used to extract dynamic persistent topological features by gradually increasing the threshold in the range of full-scale distances. Subsequently, the persistent topological features are visualized using barcodes and persistence diagrams. Finally, the stability of persistent topological features is analyzed by calculating the Bottleneck distances and Wasserstein distances between the persistence diagrams. Experimental results show that compared with the existing methods, this method can extract the topological features of brain networks more accurately and improves the accuracy of diagnostic and classification. This work not only lays a foundation for exploring the higher-order topology of brain functional networks in schizophrenia patients, but also enhances the modeling ability of complex brain systems to better understand, analyze, and predict their dynamic behaviors.
Subject
Cellular and Molecular Neuroscience,Neuroscience (miscellaneous)
Reference59 articles.
1. Persistence images: A stable vector representation of persistent homology.;Adams;J. Mach. Learn. Res.,2017
2. Persistent homology for random fields and complexes. Borrowing strength: Theory powering applications–a Festschrift for Lawrence D. Brown.;Adler;Inst. Math. Stat.,2010
3. Approximation algorithms for bipartite matching with metric and geometric costs;Agarwal;Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing,2014
4. Persistence homology of networks: Methods and applications.;Aktas;Appl. Netw. Sci.,2019
5. On the stability of persistent entropy and new summary functions for topological data analysis.;Atienza;Pattern Recognize.,2020
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献