Persistent Homology of Fractional Gaussian Noise
arXiv:2101.03328 · doi:10.1103/PhysRevE.104.034116
Abstract
In this paper, we employ the persistent homology (PH) technique to examine the topological properties of fractional Gaussian noise (fGn). We develop the weighted natural visibility graph algorithm, and the associated simplicial complexes through the filtration process are quantified by PH. The evolution of the homology group dimension represented by Betti numbers demonstrates a strong dependency on the Hurst exponent (). The coefficients of the birth and death curve of the -dimensional topological holes (-holes) at a given threshold depend on which is almost not affected by finite sample size. We show that the distribution function of a lifetime for -holes decays exponentially and the corresponding slope is an increasing function versus , and more interestingly, the sample size effect completely disappears in this quantity. The persistence entropy logarithmically grows with the size of the visibility graph of a system with almost -dependent prefactors. On the contrary, the local statistical features are not able to determine the corresponding Hurst exponent of fGn data, while the moments of eigenvalue distribution () for reveal a dependency on , containing the sample size effect. Finally, the PH shows the correlated behavior of electroencephalography for both healthy and schizophrenic samples.
17 pages, 12 figures, matched to the published version
References in corpus (12)
- From time series to complex networks: the visibility graph
- Multifractal detrended cross-correlation analysis for two nonstationary signals
- Complex network approaches to nonlinear time series analysis
- Persistent Homology of Complex Networks
- Hypergraph reconstruction from network data
- Growing scale-free simplices
- Homological Percolation and the Euler Characteristic
- Minimizing the effect of trends on detrended fluctuation analysis of long-range correlated noise
- Topological Persistence Machine of Phase Transitions
- Simplicial degree in complex networks. Applications of Topological Data Analysis to Network Science
- Fractal Dimension Estimation with Persistent Homology: A Comparative Study
- Finding hidden order in spin models with persistent homology