This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A Hodge-FAST Framework for High-Resolution Dynamic Functional Connectivity
Analysis of Higher Order Interactions in EEG Signals

Om Roy1,*, Yashar Moshfeghi1, Jason Smith3, Agustin Ibanez4,5,
Mario A. Parra2, Keith M. Smith1
*Corresponding Author: Om Roy, [email protected] 1Computer and Information Sciences, University of Strathclyde, Glasgow, UK
2Psychological Sciences and Health, University of Strathclyde, Glasgow, UK
3Department of Mathematics, Nottingham Trent University, Nottingham, UK
4Latin American Brain Health Institute (BrainLat), Universidad Adolfo Ibañez, Santiago, Chile
5Global Brain Health Institute, Trinity College Dublin, Dublin, Ireland
Abstract

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.

I Introduction

There has been a boom of studies in recent years studying brain recordings processed into networks [1, 2, 3, 4]. Most work predominantly focuses on the use of graph theory, a rich mathematical field that studies networks in the form of pairwise interactions of nodes with accompanying edges [5]. While being very informative and useful in providing network metrics to distinguish between control and diseased states, it neglects the presence of higher-order topological interactions [6]. The brain is a complex system with various dynamically interacting sub-systems, in order to truly get a thorough understanding of its topology it is crucial to understand its behaviour throughout time [7, 9], in particular, how these higher-order interactions reveal complimentary information in addition to traditional pair-wise analysis.

The electroencephalogram (EEG) is a relatively cheap, non-invasive approach to measure neural activity using electrical currents measured directly on the scalp [3, 10]. Having a very high temporal resolution [11, 12], unmatched by even more expensive methods such as fMRI, there is a high degree of untapped potential in uncovering useful information throughout time. This potential is majorly impaired by the large amount of inherent noise in the medium, that is, effects of volume conduction are present due to the presence of muscle bone between the recording medium and the source (the neurological components themselves) [9, 1]. This has motivated the development of noise-robust methods to exploit the temporal resolution of the EEG and in turn determining the statistical correspondence between approximate regions of the brain throughout time, this has been termed as Dynamic Functional Connectivity (DFC) [7, 8].

While there have been many approaches in the estimation of DFC in EEG signals, approaches leveraging methods from Network Science have seen a rise in popularity. In particular, we recently introduced Filtered Average Short-Term (FAST) functional connectivity (FC) [1]. FAST FC is a novel approach that leverages a stable filter of long-term global correlation computed over all participants involved in a time-locked cognitive task. This is used to filter individual instantaneous connectivity profiles of individual participants. This approach has been shown to be effective even in very noisy conditions while also outperforming traditional spectral approaches such as the Wavelet Transform in DFC analysis of EEG signals. Furthermore, this approach indicates a shift from graph based methods based in the Graph Fourier Domain [13] and thus does not require the computationally expensive procedure of eigen-decomposition, making it an interpretable, fast method.

Methods like FAST FC however, rely solely on pairwise interactions, neglecting the presence of higher order interactions between brain regions. Topological data analysis (TDA) [14, 15, 16] approaches that utilize persistent homology (PH) [17, 18, 19, 20, 21] use simplicial complexes[22] to model higher-order interactions. Simplicial complexes generalize the concept of interactions in a network in the sense that 0-way interactions are represented by nodes, 1-way interactions by edges and 2-way interactions are represented by triangles. This can be extended even further to structures such as tetrahedra. Equivalently, the Hodge Laplacian [23] serves as the generalization of the graph Laplacian to general simplicial complexes. Anand et al. [24, 25] exploited this relationship to produce the Hodge decomposition of brain networks which broke down pair-wise neurological interactions into gradient, curl and loop flows– orthogonal components that capture interactions at different orders. The gradient flow captures the behavior of node gradients, the curl flow the behavior of triangle induced flows and the harmonic flows implicates loop-like structures.

The application of the Hodge Decomposition of Brain networks and other topological approaches involving simplicial complexes has been limited to the analysis of static representations of functional connectivity [17, 18, 19]. In this work, we introduce a novel framework that integrates Hodge decomposition with FAST FC for analyzing dynamic functional connectivity (DFC) in EEG signals. This approach allows us to extend node-pair interactions to edge flows over triangular complexes, allowing us, for the first time, to capture higher-dimensional interactions at a high temporal resolution in noisy EEG signal recordings. Applying this to two independent cohorts of Sporadic and Familial Alzheimer Disease (AD) related Mild Cognitive Impairment (MCI) patients performing a time-locked shape-colour binding task we find consistent, reproducible significant differences between groups in time intervals that have been previously implicated in the task. This unveils new, potential specific biomarkers for the early detection of the debilitating condition worth further investigation.

II Methods

II-A FAST Functional Connectivity

FAST Functional Connectivity, inspired from the general graph-variate dynamic connectivity framework [26], provides an ideal platform for the analysis of DFC in EEG signals.

The long-term stable connectivity tensor, 𝑪FAST\bm{C}^{\text{FAST}} [1], serves as the foundation for filtering instantaneous edge flows. It is defined as the modulus of the Pearson correlation coefficient, averaged across NN participants:

CijFAST=1NP=1NCij(P),Cij(P)=tT(xi(t)x¯i)(xj(t)x¯j)tT(xi(t)x¯i)2tT(xj(t)x¯j)2.\begin{split}C_{ij}^{\text{FAST}}&=\frac{1}{N}\sum_{P=1}^{N}C_{ij}^{(P)},\\ C_{ij}^{(P)}&=\frac{\sum_{t\in T}\big{(}x_{i}(t)-\bar{x}_{i}\big{)}\big{(}x_{j}(t)-\bar{x}_{j}\big{)}}{\sqrt{\sum_{t\in T}\big{(}x_{i}(t)-\bar{x}_{i}\big{)}^{2}}\sqrt{\sum_{t\in T}\big{(}x_{j}(t)-\bar{x}_{j}\big{)}^{2}}}.\end{split} (1)

where xi(t)x_{i}(t) is the signal at node ii at time tt, and x¯i\bar{x}_{i} is the temporal mean at node ii.

The instantaneous connectivity tensor, 𝚯FAST\bm{\Theta}^{\text{FAST}}, can be computed using the local Dirichlet energy or the instantaneous correlation. For the local Dirichlet energy, it is given by:

ΘijFAST(t)={CijFAST(xi(t)xj(t))2,ij,0,i=j.\Theta_{ij}^{\text{FAST}}(t)=\begin{cases}C_{ij}^{\text{FAST}}\cdot\big{(}x_{i}(t)-x_{j}(t)\big{)}^{2},&i\neq j,\\ 0,&i=j.\end{cases} (2)

Alternatively, for the instantaneous correlation, it can be expressed as:

ΘijFAST(t)={CijFAST|(xi(t)x¯i)(xj(t)x¯j)|,ij,0,i=j.\Theta_{ij}^{\text{FAST}}(t)=\begin{cases}C_{ij}^{\text{FAST}}\cdot\big{|}(x_{i}(t)-\bar{x}_{i})(x_{j}(t)-\bar{x}_{j})\big{|},&i\neq j,\\ 0,&i=j.\end{cases} (3)

Where x¯i\bar{x}_{i} represents the mean of xix_{i} over the considered time window.

II-B Temporal Hodge Decomposition of FAST Tensor

In order to ensure computational efficiency when computing higher order structures we sparsify the connectivity tensor 𝚯FAST(t)\bm{\Theta}^{\text{FAST}}(t), using the mask matrix 𝑴\bm{M}, where:

Mij={1,if CijFASTCKFAST,0,otherwise,M_{ij}=\begin{cases}1,&\text{if }C_{ij}^{\text{FAST}}\geq C_{K}^{\text{FAST}},\\ 0,&\text{otherwise},\end{cases}

where the threshold CKFASTC_{K}^{\text{FAST}} is defined as the value in the connectivity matrix CijFASTC_{ij}^{\text{FAST}} above which only the top KK-th percentile of connections are retained, ensuring that only the strongest connections are preserved.

Once the connectivity tensor is sparsified,

𝚯¯FAST(t)=𝑴𝚯FAST(t),\bar{\bm{\Theta}}^{\text{FAST}}(t)=\bm{M}\odot\bm{\Theta}^{\text{FAST}}(t),

where \odot is the Hadamard product, we average it over a sliding window of size WW to capture the temporal dynamics while maintaining sparsity:

𝚯¯FAST(t)=1Wt=tt+W(𝑴𝚯FAST(t)).\bar{\bm{\Theta}}^{\text{FAST}}(t)=\frac{1}{W}\sum_{t^{\prime}=t}^{t+W}(\bm{M}\odot\bm{\Theta}^{\text{FAST}}(t^{\prime})).

Boundary operators are used to capture the interactions between simplicial complexes of different dimensions. For the pp-dimensional boundary operator Bp(t)B_{p}(t), we have:

Bpij={1,if the k-simplex is part of a (k+1)-simplex,0,otherwise.B_{p_{ij}}=\begin{cases}1,&\text{if the $k$-simplex is part of a $(k+1)$-simplex},\\ 0,&\text{otherwise}.\end{cases}

The operator BpB_{p} captures the interactions between lower-dimensional and higher-dimensional simplicial complexes at each time step.

Using these boundary operators, the pp-th Hodge Laplacian is expressed as:

Δp=BpBp+Bp+1Bp+1,\Delta_{p}=B_{p}^{\top}B_{p}+B_{p+1}B_{p+1}^{\top},

where BpBpB_{p}^{\top}B_{p} captures lower-dimensional interactions (e.g., nodes-to-edges), and Bp+1Bp+1B_{p+1}B_{p+1}^{\top} captures upper-dimensional interactions (e.g., edges-to-triangles).

As described in [24, 25], the coboundary operators δk\delta_{k} serve as the duals of boundary operators, mapping kk-simplices to (k+1)(k+1)-simplices. The coboundary operator δk\delta_{k} is the adjoint of the boundary operator k+1\partial_{k+1}. For real matrices, δk\delta_{k} is represented as the transpose of the matrix representation of k+1\partial_{k+1}: δk=Bk+1\delta_{k}=B_{k+1}^{\top}.

The temporal edge flow 𝚯¯FAST(t)\bar{\bm{\Theta}}^{\text{FAST}}(t) is decomposed into its gradient, curl, and harmonic components via Hodge decomposition:

𝚯¯FAST(t)=𝚯¯GFAST(t)+𝚯¯CFAST(t)+𝚯¯HFAST(t),\bar{\bm{\Theta}}^{\text{FAST}}(t)=\bar{\bm{\Theta}}_{G}^{\text{FAST}}(t)+\bar{\bm{\Theta}}_{C}^{\text{FAST}}(t)+\bar{\bm{\Theta}}_{H}^{\text{FAST}}(t),

where 𝚯¯GFAST(t)\bar{\bm{\Theta}}_{G}^{\text{FAST}}(t) captures global flows, 𝚯¯CFAST(t)\bar{\bm{\Theta}}_{C}^{\text{FAST}}(t) describes localized cycles (loops), and 𝚯¯HFAST(t)\bar{\bm{\Theta}}_{H}^{\text{FAST}}(t) is the harmonic component, which is divergence-free and curl-free.

The gradient flow, which is influenced by the gradients at the nodes, reflects the network’s overall tendencies. The curl flow, induced by interactions among triangles, reveals rotational behaviors within the network. Meanwhile, the harmonic flow identifies closed loop structures and uncovers the underlying topological features of the temporal network.

The gradient and curl components of the edge flow are obtained via least-squares minimization as projections onto the respective orthogonal planes (curl and harmonic):

𝚯¯GFAST(t)=argmins(t)𝚯¯FAST(t)δ0s(t)2,\bar{\bm{\Theta}}_{G}^{\text{FAST}}(t)=\arg\min_{s(t)}\|\bar{\bm{\Theta}}^{\text{FAST}}(t)-\delta_{0}s(t)\|^{2},
𝚯¯CFAST(t)=argminφ(t)𝚯¯FAST(t)δ1φ(t)2,\bar{\bm{\Theta}}_{C}^{\text{FAST}}(t)=\arg\min_{\varphi(t)}\|\bar{\bm{\Theta}}^{\text{FAST}}(t)-\delta_{1}^{\top}\varphi(t)\|^{2},

with the harmonic component calculated as the residual:

𝚯¯HFAST(t)=𝚯¯FAST(t)(𝚯¯GFAST(t)+𝚯¯CFAST(t)).\bar{\bm{\Theta}}_{H}^{\text{FAST}}(t)=\bar{\bm{\Theta}}^{\text{FAST}}(t)-(\bar{\bm{\Theta}}_{G}^{\text{FAST}}(t)+\bar{\bm{\Theta}}_{C}^{\text{FAST}}(t)).
Refer to caption
Figure 1: A simplified visual representation of the Hodge decomposition of edge flow into its fundamental components: gradient, curl, and harmonic flow. Here chains correspond to gradient flow, triangles represent curl flows and loops characterize harmonic flow.

II-C Data

This study examines two datasets of patients with mild cognitive impairment (MCI) due to Alzheimer’s Disease (AD) [27], focusing on the pre-dementia stage. The datasets are distinguished in considering familial (MCI-FAM) and sporadic (MCI-SPO) [28, 3] groups. MCI-FAM patients carry a genetic mutation and are at high risk for early-onset AD [29], while MCI-SPO patients have an undetermined risk. Both groups are compared to control participants without genetic mutations or psychiatric/neurological disorders.

The data consists of EEG recordings: 128-channel EEG data recorded at 512 Hz using a Biosemi Active Two System for MCI-SPO patients and 60-channel EEG data recorded at 500 Hz using a Neuroscan SynAmps 2.5 system for MCI-FAM patients[1]. The EEG signals were band-pass filtered from 1 to 100 Hz and down-sampled to 256 Hz.

The VSTM task used in this analysis is the binding task, where participants are presented with arrays of three distinct shapes, each with a unique color. The task involves three phases: encoding, a short delay, and a test period. Participants determine if the objects in two arrays are identical or different. The task is designed to prevent reliance on spatial cues by randomizing object positions and selecting shapes and colors from predefined sets [30, 31, 32]. Both MCI-FAM and MCI-SPO patients show clinically significant impairments in the binding task compared to healthy controls, with MCI-FAM performing worse clinically in the task[32, 33].

Signal pre-processing was applied to the EEG data of the encoding phase, filtering it into Delta (0-4Hz), Theta (4-8Hz), Alpha (8-12Hz) and Beta (12-16Hz) Frequency bands with each epoch lasting 1 second post stimuli exposure.

III Results

For each temporal window we take the mean of the vectorized connectivity profile for each orthogonal component. This gives us a single value for each participant at each time window. We perform the Wilcoxon Rank-Sum test for significant differences as a non-parametric approach to detect differences at the group level between controls and patients for each orthogonal component. We thus get 3 sets of pp-values corresponding to each component at each window. False Discovery Rate Correction is applied to account for false positives, however, this approach inherits the noise resistance of the FAST filter and thus we expect fewer false positives [1]. Cohen’s dd effect sizes are also computed with a negative value indicating an increased effect in the patient group.

III-A MCI-FAM

TABLE I: MCI-FAM Results. Node Function: Local Dirichlet Energy, Sparsity: Top 5% Connections, Number of Windows: 10.
Freq. Band Time Window P-Value FDR P-Value Effect Size Component
Delta 0.8-0.9 0.0022 0.0220 -1.4682 Curl
Delta 0.9-1.0 0.0113 0.0566 -1.4511 Curl
Theta 0.8-0.9 0.0006 0.0058 -1.6955 Curl
Theta 0.4-0.5 0.0312 0.3121 -1.1271 Harmonic
Alpha 0-0.1 0.0140 0.1402 1.0807 Gradient
Alpha 0.4-0.5 0.0376 0.1505 1.1777 Gradient
Alpha 0.5-0.6 0.0452 0.1505 1.1570 Gradient
Beta 0-0.1 0.0452 0.4516 0.8829 Curl
Beta 0-0.1 0.0312 0.3121 -0.9490 Harmonic
Beta 0.3-0.4 0.0173 0.0863 1.0494 Gradient
Beta 0.4-0.5 0.0058 0.0580 1.2730 Gradient

Table 1 presents significant pp-values at the 5 percent level and after FDR correction for each frequency band. Most differences are concentrated in the late and middle ranges. Highly significant results in the delta and theta bands, passing FDR correction in the 0.8-0.9 post-stimulus window, link to the Late Positive Potential (LPP), an event-related potential (ERP) [34] associated with explicit recognition memory and the binding task [28, 35]. Both bands show increased values in the patient group. Using the local Dirichlet energy (equation (2)), this indicates higher local variability in MCI-FAM patients at key global connections for the binding task. This result, associated with the curl component, suggests greater dysregulation or variability in interactions among triangles in the connectivity profile.

Significant differences are also seen in the 0.4-0.6 range across theta, alpha, and beta bands, consistent with the P300 range, an ERP previously linked to this group [1, 36, 37]. In the theta band, the harmonic component reveals these differences with larger values in patients, indicating increased local variability in loop-like structures. In contrast, the gradient component in the alpha and beta bands shows P300 differences as reduced local variability in patients.

The alpha and beta bands exhibit significant differences in the early 0-0.1 window, indicating the P100 ERP [35]. In the alpha band, the gradient component shows lower local variability in controls, while in the beta band, the curl and harmonic components show lower and higher variability in patients, respectively. The P100 has also been highlighted in prior dynamic functional connectivity analyses, particularly in the alpha band [9].

Refer to caption
Figure 2: Average edge flows for the top 10 % of the strongest global connections across different orthogonal planes at sample resolution, measured during a time-locked VSTM Binding Task in the Theta Band, for Familial Alzheimer’s Disease (MCI-FAM) patients and healthy controls

III-B MCI-SPO

TABLE II: MCI-SPO Results. Node Function: Instantaneous Correlation, Sparsity: Top 1% Connections, Number of Windows: 15.
Freq. Band Time Window P-Value FDR P-Value Effect Size Component
Delta 0.8-0.87 0.0460 0.6903 0.8579 Gradient
Delta 0.73-0.8 0.0383 0.1652 0.8336 Harmonic
Delta 0.8-0.87 0.0013 0.0190 1.3322 Harmonic
Delta 0.87-0.93 0.0261 0.1652 0.9660 Harmonic
Theta 0.33-0.4 0.0017 0.0248 1.4307 Gradient
Theta 0.33-0.4 0.0057 0.0860 1.1322 Curl
Theta 0.47-0.53 0.0261 0.3908 -0.9978 Harmonic
Alpha 0.93-1.0 0.0348 0.4507 0.7973 Curl

Table 2 represents the results for the MCI-SPO dataset, we use instantaneous correlation as the node function, representing synchronization of connectivity. The delta band shows a significant result passing FDR correction in the 0.8–0.87 window, overlapping with the LPP range observed in the MCI-FAM group. However, this time, the harmonic component is primarily implicated, with patients showing significantly reduced connectivity in loop-like structures. Additionally, the alpha band is involved in this LPP response, with reduced connectivity in triangular flows in patients.

The P300 is also implicated, particularly in the theta band during the early 0.33–0.4 window (P3a), as shown by the gradient, harmonic, and curl components. Patients exhibit reduced connectivity in the gradient and curl components but increased connectivity in the harmonic component during the later 0.47–0.53 window (P3b). This delayed increase likely reflects a delay in the P300 response, previously reported in Alzheimer’s disease-related impairments [38]. Notably, this delayed response is most pronounced in loop-like connectivity structures.

IV Discussion

In this work, we have developed a novel framework for the analysis of Dynamic Functional Connectivity in EEG signals using tools from topological data analysis and network science. This allowed us to go beyond pairwise interactions in transient connectivity profiles and consider higher-order interactions in the networks.

While higher-order interactions have long been hypothesized to be useful in the analysis of neurological systems, computational limitations and a lack of interpretability have made them impractical in practice. By employing the FAST filter as a thresholding approach, we can uniformly identify the most relevant global connections across participants. This method significantly accelerates the computation of higher-order structures while retaining high temporal resolution.

Applying our framework to the analysis of Familial and Sporadic Alzheimer-related MCI patients, we uncovered significant differences that align with existing literature and could serve as potential biomarkers for early Alzheimer’s detection. These findings were consistent across independent patient groups and experimental setups, reinforcing the robustness of our approach. Additionally, our framework simultaneously detects previously implicated results in this data, providing compelling evidence that higher-order interactions influence transient brain networks. For instance, while both MCI-FAM and MCI-SPO are implicated by the LPP, the specific components differ: MCI-FAM shows implications in the curl component, whereas MCI-SPO involves the harmonic and gradient components.

To our knowledge, this work is the first to extend beyond static networks, enabling efficient analysis of higher-order interactions in Dynamic Functional Connectivity of EEG signals. It effectively handles noise in small temporal windows while representing higher-dimensional structures. We believe this framework opens new possibilities for applying TDA to EEG signals and uncovering biomarkers for neurological disorders that pairwise interactions alone cannot detect. We encourage further exploration in this direction.

V Conclusions

In this work we have introduced the first framework capable of detecting higher order dynamic interactions in EEG networks with a low computational cost. Applied to two independent datasets of Patients with Alzheimer’s related MCI undergoing a time-locked VSTM task, we see reproducible differences across both datasets that align strongly with previous EEG studies on the task and thus may be used as potential biomarkers. We show how these differences are implicated by specific components each with an independent geometric flow revealing specific insights into how neurological disorders disrupt these networks. We have opened up the possibility for more applications of higher order interactions to dynamic brain networks and encourage work in this domain extending beyond just the EEG.

References

  • [1] Om Roy, Yashar Moshfeghi, Agustin Ibanez, Francisco Lopera, Mario A. Parra, Keith M. Smith; FAST functional connectivity implicates P300 connectivity in working memory deficits in Alzheimer’s disease. Network Neuroscience 2024;
  • [2] Roy, O, Moshfeghi, Y, Ibanez, A, Lopera, F, Parra, MA and Smith, KM 2023, Robust, high temporal-resolution EEG functional connectivity detects increased connectivity coinciding with P300 in visual short-term memory binding in both familial and sporadic prodromal Alzheimer’s Disease. in Complex Networks 2023: The 12th International conference on complex networks and their applications. pp. 679-682.
  • [3] Smith, K. M., Starr, J. M., Escudero, J., Ibáñez, A., and Parra, M. A. (2022). Abnormal functional hierarchies of EEG networks in familial and sporadic prodromal Alzheimer’s disease during visual short-term memory binding. Frontiers in Neuroimaging, 1, 883968. https://doi.org/10.3389/fnimg.2022.883968,
  • [4] Bassett, D., Sporns, O. Network neuroscience. Nat Neurosci 20, 353–364 (2017). https://doi.org/10.1038/nn.4502
  • [5] Bullmore, E., Sporns, O. Complex brain networks: graph theoretical analysis of structural and functional systems. Nat Rev Neurosci 10, 186–198 (2009). https://doi.org/10.1038/nrn2575
  • [6] Santoro, A., Battiston, F., Lucas, M. et al. Higher-order connectomics of human brain function reveals local topological signatures of task decoding, individual identification, and behavior. Nat Commun 15, 10244 (2024). https://doi.org/10.1038/s41467-024-54472-y
  • [7] Hutchison RM, Womelsdorf T, Allen EA, Bandettini PA, Calhoun VD, Corbetta M, Della Penna S, Duyn JH, Glover GH, Gonzalez-Castillo J, Handwerker DA, Keilholz S, Kiviniemi V, Leopold DA, de Pasquale F, Sporns O, Walter M, Chang C. Dynamic functional connectivity: promise, issues, and interpretations. Neuroimage. 2013 Oct 15;80:360-78. doi: 10.1016/j.neuroimage.2013.05.079. Epub 2013 May 24. PMID: 23707587; PMCID: PMC3807588.
  • [8] Julia Schumacher, Luis R. Peraza, Michael Firbank, Alan J. Thomas, Marcus Kaiser, Peter Gallagher, John T. O’Brien, Andrew M. Blamire, John-Paul Taylor,Dynamic functional connectivity changes in dementia with Lewy bodies and Alzheimer’s disease,NeuroImage: Clinical,Volume 22,2019,101812,ISSN 2213-1582,https://doi.org/10.1016/j.nicl.2019.101812.
  • [9] Smith, K., Ricaud, B., Shahid, N. et al. Locating Temporal Functional Dynamics of Visual Short-Term Memory Binding using Graph Modular Dirichlet Energy. Sci Rep 7, 42013 (2017). https://doi.org/10.1038/srep42013
  • [10] Klimesch, W. (1999). EEG alpha and theta oscillations reflect cognitive and memory performance: A review and analysis. Brain Research Reviews, 29(2–3), 169–195. https://doi.org/10.1016/s0165-0173(98)00056-3, [PubMed]
  • [11] Mammone, N., De Salvo, S., Bonanno, L., Ieracitano, C., Marino, S., Marra, A., et al. (2018). Brain network analysis of compressive sensed high-density EEG signals in AD and MCI subjects. IEEE Trans. Industr. Inform. 15, 527–536. doi: 10.1109/TII.2018.286843
  • [12] Morabito, F. C., Campolo, M., Labate, D., Morabito, G., Bonanno, L., Bramanti, A., et al. (2015). A longitudinal EEG study of Alzheimer’s disease progression based on a complex network approach. Int. J. Neural Syst. 25:1550005. doi: 10.1142/s0129065715500057
  • [13] Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F.., and Vandergheynst, P. (2018). Graph signal processing: Overview, challenges, and applications. Proceedings of the IEEE, 106(5), 808–828. https://doi.org/10.1109/JPROC.2018.2820126
  • [14] Chazal, F. and Michel, B., 2021. An introduction to topological data analysis: fundamental and practical aspects for data scientists. Frontiers in artificial intelligence, 4, p.667963.
  • [15] A.E. Sizemore, J.E. Phillips, R. Ghrist, and D. S. Bassett, “The importance of the whole: topological data analysis for the network neuroscientist,” Network Neuroscience, vol. 3, no. 3, pp. 656–673, 2019.
  • [16] M.K. Chung, H. Lee, A. DiChristofano, H. Ombao, and V. Solo, “Exact topological inference of the resting-state brain networks in twins,” Network Neuroscience, vol. 3, pp. 674–694, 2019.
  • [17] Gupta, Kurusetti Vinay, Jyotiranjan Beuria, and Laxmidhar Behera. ”Characterizing EEG signals of meditative states using persistent homology and Hodge spectral entropy.” Biomedical Signal Processing and Control 89 (2024): 105779.
  • [18] K. Gaurav, H. Jain and T. K. Reddy, ”Characterizing neural activity from EEG signals during game interaction using persistent homology,” 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT), Kamand, India, 2024, pp. 1-7, doi: 10.1109/ICCCNT61001.2024.10725755.
  • [19] Liu, C., Ma, X., Wang, J., Zhang, J., Zhang, H., Xie, S., et al. (2021). “Neurophysiological assessment of image quality from EEG using persistent homology of brain network” in 2021 IEEE International Conference on Multimedia and Expo (ICME). (New York, NY, USA: IEEE), 1–6.
  • [20] Wang, Y., Ombao, H., and Chung, M. K. (2019). “Statistical persistent homology of brain signals” in 2019 ICASSP 2019–2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (IEEE), 1125–1129.
  • [21] H. Lee, H. Kang, M.K. Chung, B.-N. Kim, and D.S Lee,“Persistent brain network homology from the perspective of dendrogram,” IEEE Transactions on Medical Imaging, vol. 31, pp. 2267–2277, 2012.
  • [22] S. Barbarossa and S. Sardellitti, “Topological signal processing over simplicial complexes,” IEEE Transactions on Signal Processing, vol. 68, pp. 2992–3007, 2020.
  • [23] L.H. Lim, “Hodge Laplacians on graphs,” SIAM Review, vol. 62, no. 3, pp. 685–715, 2020.
  • [24] D. V. Anand and M. K. Chung, ”Hodge Laplacian of Brain Networks,” in IEEE Transactions on Medical Imaging, vol. 42, no. 5, pp. 1563-1573, May 2023, doi: 10.1109/TMI.2022.3233876.
  • [25] Anand, D. Vijay et al. “Hodge-Decomposition of Brain Networks.” 2024 IEEE International Symposium on Biomedical Imaging (ISBI) (2022): 1-5.
  • [26] K. Smith, L. Spyrou and J. Escudero, ”Graph-Variate Signal Analysis,” in IEEE Transactions on Signal Processing, vol. 67, no. 2, pp. 293-305, 15 Jan.15, 2019, doi: 10.1109/TSP.2018.2881658
  • [27] Parra, M. A., Muniz-Terrera, G., Danso, S. O., Ritchie, K., and Ritchie, C. W. (2021). Memory assessment and dementia risk in the PREVENT study. Alzheimer’s and Dementia: The Journal of the Alzheimer’s Association, 17(S6), e055104. https://doi.org/10.1002/alz.055104
  • [28] Pietto, M., Parra, M. A., Trujillo, N., Flores, F., García, A. M., Bustin, J., … Baez, S. (2016). Behavioral and electrophysiological correlates of memory binding deficits in patients at different risk levels for Alzheimer’s disease. Journal of Alzheimer’s Disease, 53(4), 1325–1340. https://doi.org/10.3233/JAD-160056
  • [29] Acosta-Baena, N., Sepulveda-Falla, D., Lopera-Gómez, C. M., Jaramillo-Elorza, M. C., Moreno, S., Aguirre-Acevedo, D. C., … Lopera, F. (2011). Pre-dementia clinical stages in presenilin 1 E280A familial early-onset Alzheimer’s disease: A retrospective cohort study. Lancet Neurology, 10(3), 213–220. https://doi.org/10.1016/S1474-4422(10)70323-9,
  • [30] Parra, M. A., Mikulan, E., Trujillo, N., Della Sala, S., Lopera, F., Manes, F., … Ibanez, A. (2017). Brain information sharing during visual short-term memory binding yields a memory biomarker for familial Alzheimer’s disease. Current Alzheimer Research, 14(12), 1335–1347.
  • [31] Parra, M. A., Abrahams, S., Logie, R. H., Méndez, L. G., Lopera, F., and Della Sala, S. (2010). Visual short-term memory binding deficits in familial Alzheimer’s disease. Brain, 133(9), 2702–2713.
  • [32] Mario A. Parra, Sharon Abrahams, Katia Fabi, Robert Logie, Simona Luzzi, Sergio Della Sala, Short-term memory binding deficits in Alzheimer’s disease, Brain, Volume 132, Issue 4, April 2009, Pages 1057–1066, https://doi.org/10.1093/brain/awp036
  • [33] Parra, M. A., Gazes, Y., Habeck, C., and Stern, Y. (2024). Exploring the association between amyloid-beta and memory markers for Alzheimer’s disease in cognitively unimpaired older adults. Journal of Prevention of Alzheimer’s Disease, 11(2), 339–347. https://doi.org/10.14283/jpad.2024.11,
  • [34] Ibanez, A., Melloni, M., Huepe, D., Helgiu, E., Rivera-Rei, A., Canales-Johnson, A., … Moya, A. (2012). What event-related potentials (ERPs) bring to social neuroscience? Social Neuroscience, 7(6), 632–649.
  • [35] Paitel, E. R., Samii, M. R., and Nielson, K. A. (2021). A systematic review of cognitive event-related potentials in mild cognitive impairment and Alzheimer’s disease. Behavioural Brain Research, 396, 112904. https://doi.org/10.1016/j.bbr.2020.112904, [PubMed]
  • [36] Pedroso, R. V., Fraga, F. J., Corazza, D. I., Andreatto, C. A. A., de Melo Coelho, F. G., Costa, J. L. R., and Santos-Galduróz, R. F. (2012). P300 latency and amplitude in Alzheimer’s disease: A systematic review. Brazilian Journal of Otorhinolaryngology, 78(4), 126–132. https://doi.org/10.1590/S1808-86942012000400023,
  • [37] Parra, M. A., Ascencio, L. L., Urquina, H. F., Manes, F., and Ibáñez, A. M. (2012). P300 and neuropsychological assessment in mild cognitive impairment and Alzheimer dementia. Frontiers in Neurology, 3, 172. https://doi.org/10.3389/fneur.2012.00172,
  • [38] Kraiuhin C, Gordon E, Coyle S, Sara G, Rennie C, Howson A, Landau P, Meares R. Normal latency of the P300 event-related potential in mild-to-moderate Alzheimer’s disease and depression. Biol Psychiatry. 1990 Sep 1;28(5):372-86. doi: 10.1016/0006-3223(90)90406-r. PMID: 2207218.