Search

We explore the stability and dynamic properties of a hierarchical, linearized, and analytic spectral graph model for neural oscillations that integrates the structural wiring of the brain. Previously, we have shown that this model can accurately capture the frequency spectra and the spatial patterns of the alpha and beta frequency bands obtained from magnetoencephalography recordings without regionally varying parameters. Here, we show that this macroscopic model based on long-range excitatory connections exhibits dynamic oscillations with a frequency in the alpha band even without any oscillations implemented at the mesoscopic level. We show that depending on the parameters, the model can exhibit combinations of damped oscillations, limit cycles, or unstable oscillations. We determined bounds on model parameters that ensure stability of the oscillations simulated by the model. Finally, we estimated time-varying model parameters to capture the temporal fluctuations in magnetoencephalography activity. We show that a dynamic spectral graph modeling framework with a parsimonious set of biophysically interpretable model parameters can thereby be employed to capture oscillatory fluctuations observed in electrophysiological data in various brain states and diseases.

The anatomic validity of structural connectomes remains a significant uncertainty in neuroimaging. Edge-centric tractography reconstructs streamlines in bundles between each pair of cortical or subcortical regions. Although edge bundles provides a stronger anatomic embedding than traditional connectomes, calculating them for each region-pair requires exponentially greater computation. We observe that major speedup can be achieved by reducing the number of streamlines used by probabilistic tractography algorithms. To ensure this does not degrade connectome quality, we calculate the identifiability of edge-centric connectomes between test and re-test sessions as a proxy for information content. We find that running PROBTRACKX2 with as few as 1 streamline per voxel per region-pair has no significant impact on identifiability. Variation in identifiability caused by streamline count is overshadowed by variation due to subject demographics. This finding even holds true in an entirely different tractography algorithm using MRTrix. Incidentally, we observe that Jaccard similarity is more effective than Pearson correlation in calculating identifiability for our subject population.

The anatomic validity of structural connectomes remains a significant uncertainty in neuroimaging. Edge-centric tractography reconstructs streamlines in bundles between each pair of cortical or subcortical regions. Although edge bundles provides a stronger anatomic embedding than traditional connectomes, calculating them for each region-pair requires exponentially greater computation. We observe that major speedup can be achieved by reducing the number of streamlines used by probabilistic tractography algorithms. To ensure this does not degrade connectome quality, we calculate the identifiability of edge-centric connectomes between test and re-test sessions as a proxy for information content. We find that running PROBTRACKX2 with as few as 1 streamline per voxel per region-pair has no significant impact on identifiability. Variation in identifiability caused by streamline count is overshadowed by variation due to subject demographics. This finding even holds true in an entirely different tractography algorithm using MRTrix. Incidentally, we observe that Jaccard similarity is more effective than Pearson correlation in calculating identifiability for our subject population.

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 and without multistable dynamics 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.

The relationship between the brain's structural wiring and the functional patterns of neural activity is of fundamental interest in computational neuroscience. We examine a hierarchical, linear graph spectral model of brain activity at mesoscopic and macroscopic scales. The model formulation yields an elegant closed-form solution for the structure-function problem, specified by the graph spectrum of the structural connectome's Laplacian, with simple, universal rules of dynamics specified by a minimal set of global parameters. The resulting parsimonious and analytical solution stands in contrast to complex numerical simulations of high dimensional coupled nonlinear neural field models. This spectral graph model accurately predicts spatial and spectral features of neural oscillatory activity across the brain and was successful in simultaneously reproducing empirically observed spatial and spectral patterns of alpha-band (8-12 Hz) and beta-band (15-30 Hz) activity estimated from source localized magnetoencephalography (MEG). This spectral graph model demonstrates that certain brain oscillations are emergent properties of the graph structure of the structural connectome and provides important insights towards understanding the fundamental relationship between network topology and macroscopic whole-brain dynamics. .

The relationship between the brain's structural wiring and the functional patterns of neural activity is of fundamental interest in computational neuroscience. We examine a hierarchical, linear graph spectral model of brain activity at mesoscopic and macroscopic scales. The model formulation yields an elegant closed-form solution for the structure-function problem, specified by the graph spectrum of the structural connectome's Laplacian, with simple, universal rules of dynamics specified by a minimal set of global parameters. The resulting parsimonious and analytical solution stands in contrast to complex numerical simulations of high dimensional coupled nonlinear neural field models. This spectral graph model accurately predicts spatial and spectral features of neural oscillatory activity across the brain and was successful in simultaneously reproducing empirically observed spatial and spectral patterns of alpha-band (8-12 Hz) and beta-band (15-30 Hz) activity estimated from source localized magnetoencephalography (MEG). This spectral graph model demonstrates that certain brain oscillations are emergent properties of the graph structure of the structural connectome and provides important insights towards understanding the fundamental relationship between network topology and macroscopic whole-brain dynamics. .

Complex networks emerge as a natural framework to describe real-life phe- nomena involving a group of entities and their interactions, i.e., a social net- work. Furthermore, other problems involve a collection of networks, such as multi-layer, temporal, or brain networks (connectomes). With the increas- ing availability of graph-shaped data and associated meta-data, i.e., node or edge attributes, machine learning (ML) techniques on networks have risen in popularity. However, there are still several challenging issues to be addressed concerning feature engineering, graph representation, visualization, and general graph mining applications. This thesis contributes to bridging the gap between ML and complex net- works. We investigate dynamics on networks such as discrete and continuous- time random walks, in two directions. First, we develop a multi-scale anomaly detection algorithm on attributed networks. We exploit the link between graph signal processing and the Markov stability framework used in community de- tection, for spotting anomalous nodes in multiple contexts of the network. Second, we introduce a generalization of assortativity on networks operating on scalar and categorical node attributes. These coefficients turn out to be useful descriptors to build network fingerprints, so that we can perform super- vised graph classification, i.e., predicting the toxicity of molecules or classifying Reddit discussion threads. Besides, we develop an unsupervised approach to learn graph embeddings from a collection of networks. By learning a non-linear mapping from input graphs to a lower-dimensional feature space, we obtain useful graphs representa- tions used in graph visualization, clustering, and classification, e.g., predicting people’s gender based on their structural connectome. Finally, we propose a principled approach to identify stable biomarkers for schizophrenia diagnosis in the human connectome. From an ML perspective, the problem is stated as an embedded f, (SC - Sciences) -- UCL, 2019

This paper presents a novel method for the reconstruction of a neural network connectivity using calcium fluorescence data. We introduce a fast unsupervised method to integrate different networks that reconstructs structural connectivity from neuron activity. Our method improves the state-of-the-art reconstruction method General Transfer Entropy (GTE). We are able to better eliminate indirect links, improving therefore the quality of the network via a normalization and ensemble process of GTE and three new informative features. The approach is based on a simple combination of networks, which is remarkably fast. The performance of our approach is benchmarked on simulated time series provided at the connectomics challenge and also submitted at the public competition, Peer Reviewed, Postprint (published version)