scholarly journals Spectral graph theory of brain oscillations -- revisited and improved

2021 ◽  
Author(s):  
Parul Verma ◽  
Srikantan Nagarajan ◽  
Ashish Raj

Mathematical modeling of the relationship between the functional activity and the structural wiring of the brain has largely been undertaken using non-linear and biophysically detailed mathematical models with regionally varying parameters. While this approach provides us a rich repertoire of multistable dynamics that can be displayed by the brain, it is computationally demanding. Moreover, although neuronal dynamics at the microscopic level are nonlinear and chaotic, it is unclear if such detailed nonlinear models are required to capture the emergent meso- (regional population ensemble) and macro-scale (whole brain) behavior, which is largely deterministic and reproducible across individuals. Indeed, recent modeling effort based on spectral graph theory has shown that an analytical model without regionally varying parameters can capture the empirical magnetoencephalography frequency spectra and the spatial patterns of the alpha and beta frequency bands accurately. In this work, we demonstrate an improved hierarchical, linearized, and analytic spectral graph theory-based model that can capture the frequency spectra obtained from magnetoencephalography recordings of resting healthy subjects. We reformulated the spectral graph theory model in line with classical neural mass models, therefore providing more biologically interpretable parameters, especially at the local scale. We demonstrated that this model performs better than the original model when comparing the spectral correlation of modeled frequency spectra and that obtained from the magnetoencephalography recordings. This model also performs equally well in predicting the spatial patterns of the empirical alpha and beta frequency bands.

2020 ◽  
Vol 32 (12) ◽  
pp. 2422-2454
Author(s):  
Amir Hossein Ghaderi ◽  
Bianca R. Baltaretu ◽  
Masood Nemati Andevari ◽  
Vishal Bharmauria ◽  
Fuat Balci

The brain may be considered as a synchronized dynamic network with several coherent dynamical units. However, concerns remain whether synchronizability is a stable state in the brain networks. If so, which index can best reveal the synchronizability in brain networks? To answer these questions, we tested the application of the spectral graph theory and the Shannon entropy as alternative approaches in neuroimaging. We specifically tested the alpha rhythm in the resting-state eye closed (rsEC) and the resting-state eye open (rsEO) conditions, a well-studied classical example of synchrony in neuroimaging EEG. Since the synchronizability of alpha rhythm is more stable during the rsEC than the rsEO, we hypothesized that our suggested spectral graph theory indices (as reliable measures to interpret the synchronizability of brain signals) should exhibit higher values in the rsEC than the rsEO condition. We performed two separate analyses of two different datasets (as elementary and confirmatory studies). Based on the results of both studies and in agreement with our hypothesis, the spectral graph indices revealed higher stability of synchronizability in the rsEC condition. The k-mean analysis indicated that the spectral graph indices can distinguish the rsEC and rsEO conditions by considering the synchronizability of brain networks. We also computed correlations among the spectral indices, the Shannon entropy, and the topological indices of brain networks, as well as random networks. Correlation analysis indicated that although the spectral and the topological properties of random networks are completely independent, these features are significantly correlated with each other in brain networks. Furthermore, we found that complexity in the investigated brain networks is inversely related to the stability of synchronizability. In conclusion, we revealed that the spectral graph theory approach can be reliably applied to study the stability of synchronizability of state-related brain networks.


2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Yajing Wang ◽  
Yubin Gao

Spectral graph theory plays an important role in engineering. Let G be a simple graph of order n with vertex set V=v1,v2,…,vn. For vi∈V, the degree of the vertex vi, denoted by di, is the number of the vertices adjacent to vi. The arithmetic-geometric adjacency matrix AagG of G is defined as the n×n matrix whose i,j entry is equal to di+dj/2didj if the vertices vi and vj are adjacent and 0 otherwise. The arithmetic-geometric spectral radius and arithmetic-geometric energy of G are the spectral radius and energy of its arithmetic-geometric adjacency matrix, respectively. In this paper, some new upper bounds on arithmetic-geometric energy are obtained. In addition, we present the Nordhaus–Gaddum-type relations for arithmetic-geometric spectral radius and arithmetic-geometric energy and characterize corresponding extremal graphs.


Sign in / Sign up

Export Citation Format

Share Document