ASU Scholarship Showcase

The number and variety of connectivity estimation methods is likely to continue to grow over the coming decade. Comparisons between methods are necessary to prune this growth to only the most accurate and robust methods. However, the nature of connectivity is elusive with different methods potentially attempting to identify different aspects of connectivity. Commonalities of connectivity definitions across methods upon which base direct comparisons can be difficult to derive. Here, we explicitly define “effective connectivity” using a common set of observation and state equations that are appropriate for three connectivity methods: dynamic causal modeling (DCM), multivariate autoregressive modeling (MAR), and switching linear dynamic systems for fMRI (sLDSf). In addition while deriving this set, we show how many other popular functional and effective connectivity methods are actually simplifications of these equations. We discuss implications of these connections for the practice of using one method to simulate data for another method. After mathematically connecting the three effective connectivity methods, simulated fMRI data with varying numbers of regions and task conditions is generated from the common equation. This simulated data explicitly contains the type of the connectivity that the three models were intended to identify. Each method is applied to the simulated data sets and the accuracy of parameter identification is analyzed. All methods perform above chance levels at identifying correct connectivity parameters. The sLDSf method was superior in parameter estimation accuracy to both DCM and MAR for all types of comparisons.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.

Purpose: PET (positron emission tomography) imaging researches of functional metabolism using fluorodeoxyglucose ([superscript 18]F-FDG) of animal brain are important in neuroscience studies. FDG-PET imaging studies are often performed on groups of rats, so it is desirable to establish an objective voxel-based statistical methodology for group data analysis.

Material and Methods: This study establishes a statistical parametric mapping (SPM) toolbox (plug-ins) named spmratIHEP for voxel-wise analysis of FDG-PET images of rat brain, in which an FDG-PET template and an intracranial mask image of rat brain in Paxinos & Watson space were constructed, and the default settings were modified according to features of rat brain. Compared to previous studies, our constructed rat brain template comprises not only the cerebrum and cerebellum, but also the whole olfactory bulb which made the later cognitive studies much more exhaustive. And with an intracranial mask image in the template space, the brain tissues of individuals could be extracted automatically. Moreover, an atlas space is used for anatomically labeling the functional findings in the Paxinos & Watson space. In order to standardize the template image with the atlas accurately, a synthetic FDG-PET image with six main anatomy structures is constructed from the atlas, which performs as a target image in the co-registration.

Results: The spatial normalization procedure is evaluated, by which the individual rat brain images could be standardized into the Paxinos & Watson space successfully and the intracranial tissues could also be extracted accurately. The practical usability of this toolbox is evaluated using FDG-PET functional images from rats with left side middle cerebral artery occlusion (MCAO) in comparison to normal control rats. And the two-sample t-test statistical result is almost related to the left side MCA.

Conclusion: We established a toolbox of SPM8 named spmratIHEP for voxel-wise analysis of FDG-PET images of rat brain.

Background: Carriers of the APOE ε4 allele are at increased risk of developing Alzheimer’s disease (AD), and have been shown to have reduced cerebral metabolic rate of glucose (CMRgl) in the same brain areas frequently affected in AD. These individuals also exhibit reduced plasma levels of apolipoprotein E (apoE) attributed to a specific decrease in the apoE4 isoform as determined by quantification of individual apoE isoforms in APOE ε4 heterozygotes. Whether low plasma apoE levels are associated with structural and functional brain measurements and cognitive performance remains to be investigated.

Methods: Using quantitative mass spectrometry we quantified the plasma levels of total apoE and the individual apoE3 and apoE4 isoforms in 128 cognitively normal APOE ε3/ε4 individuals included in the Arizona APOE cohort. All included individuals had undergone extensive neuropsychological testing and 25 had in addition undergone FDG-PET and MRI to determine CMRgl and regional gray matter volume (GMV).

Results: Our results demonstrated higher apoE4 levels in females versus males and an age-dependent increase in the apoE3 isoform levels in females only. Importantly, a higher relative ratio of apoE4 over apoE3 was associated with GMV loss in the right posterior cingulate and with reduced CMRgl bilaterally in the anterior cingulate and in the right hippocampal area. Additional exploratory analysis revealed several negative associations between total plasma apoE, individual apoE isoform levels, GMV and CMRgl predominantly in the frontal, occipital and temporal areas. Finally, our results indicated only weak associations between apoE plasma levels and cognitive performance which further appear to be affected by sex.

Conclusions: Our study proposes a sex-dependent and age-dependent variation in plasma apoE isoform levels and concludes that peripheral apoE levels are associated with GMV, CMRgl and possibly cognitive performance in cognitively healthy individuals with a genetic predisposition to AD.