A Hodge-FAST Framework for High-Resolution Dynamic Functional Connectivity Analysis of Higher Order Interactions in EEG Signals
We introduce a novel framework that integrates Hodge decomposition with Filtered Average Short-Term (FAST) functional connectivity to analyze dynamic functional connectivity (DFC) in EEG signals. This method leverages graph-based topology and simplicial analysis to explore transient connectivity patterns at multiple scales, addressing noise, sparsity, and computational efficiency. The temporal EEG data are first sparsified by keeping only the most globally important connections, instantaneous connectivity at these connections is then filtered by global long-term stable correlations. This tensor is then decomposed into three orthogonal components to study signal flows over higher-order structures such as triangle and loop structures. Our analysis of Alzheimer-related MCI patients show significant temporal differences related to higher-order interactions that a pairwise analysis on its own does not implicate. This allows us for the first time to capture higher-dimensional interactions at high temporal resolution in noisy EEG signal recordings.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyEEGFunctional ConnectivitySimilar Papers 제목 키워드 기반
Topology-Preserving Neural Operator Learning via Hodge Decomposition
In this paper, we study solution operators of physical field equations on geometric meshes from a function-space perspective. We reveal that Hodge orthogonality fundamentally resolves spectral interference by isolating u…
Hodge-Decomposition of Brain Networks
We propose to analyze dynamically changing brain networks by decomposing them into three orthogonal components through the Hodge decomposition. We propose to quantify the magnitude and relative strength of each component…
Hodge Laplacians and Hodge Diffusion Maps
We introduce Hodge Diffusion Maps, a novel manifold learning algorithm designed to analyze and extract topological information from high-dimensional data-sets. This method approximates the exterior derivative acting on d…
Dimensionality ReductionCheeger--Hodge Contrastive Learning for Structurally Robust Graph Representation Learning
Graph Contrastive Learning (GCL) has emerged as a prominent framework for unsupervised graph representation learning. However, relying on augmentation design alone to define the invariances learned by GCL can be brittle …
Graph Representation LearningContrastive LearningHodgelets: Localized Spectral Representations of Flows on Simplicial Complexes
We develop wavelet representations for edge-flows on simplicial complexes, using ideas rooted in combinatorial Hodge theory and spectral graph wavelets. We first show that the Hodge Laplacian can be used in lieu of the g…