Hole Detection in Metabolic Connectivity of Alzheimer’s Disease Using k −Laplacian
Recent studies have found that the modular structure of functional brain network is disrupted during the progress of Alzheimer’s disease. The modular structure of network is the most basic topological invariant in determining the shape of network in the view of algebraic topology. In this study, we propose a new method to find another higher order topological invariant, hole, based on persistent homology. If a hole exists in the network, the information can be inefficiently delivered between regions. If we can localize the hole in the network, we can infer the reason of network inefficiency. We propose to detect the persistent hole using the spectrum of k −Laplacian, which is the generalized version of graph Laplacian. The method is applied to the metabolic network based on FDG-PET data of Alzheimer disease (AD), mild cognitive impairment (MCI) and normal control (NC) groups. The experiments show that the persistence of hole can be used as a biological marker of disease progression to AD. The localized hole may help understand the brain network abnormality in AD, revealing that the limbic-temporo-parietal association regions disturb direct connections between other regions.
KeywordsMild Cognitive Impairment Simplicial Complex Brain Network Connectivity Matrix Functional Brain Network
- 5.Muhammad, A., Egerstedt, M.: Control using higher order laplacians in network topologies. In: Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems, pp. 1024–1038 (2006)Google Scholar
- 7.Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction. American Mathematical Society Press (2009)Google Scholar
- 12.Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, No. 92. American Mathematical Society (1996)Google Scholar
- 13.Balakrishnan, S., Fasy, B.T., Lecci, F., Rinaldo, A., Singh, A., Wasserman, L.: Statistical inference for persistent homology (2013)Google Scholar