Multiple Pathways Analysis of Brain Functional Networks from EEG Signals: An Application to Real Data

In the present study, we propose a theoretical graph procedure to investigate multiple pathways in brain functional networks. By taking into account all the possible paths consisting of h links between the nodes pairs of the network, we measured the global network redundancy R (h) as the number of parallel paths and the global network permeability P (h) as the probability to get connected. We used this procedure to investigate the structural and dynamical changes in the cortical networks estimated from a dataset of high-resolution EEG signals in a group of spinal cord injured (SCI) patients during the attempt of foot movement. In the light of a statistical contrast with a healthy population, the permeability index P (h) of the SCI networks increased significantly (P < 0.01) in the Theta frequency band (3-6 Hz) for distances h ranging from 2 to 4. On the contrary, no significant differences were found between the two populations for the redundancy index R (h) . The most significant changes in the brain functional network of SCI patients occurred mainly in the lower spectral contents. These changes were related to an improved propagation of communication between the closest cortical areas rather than to a different level of redundancy. This evidence strengthens the hypothesis of the need for a higher functional interaction among the closest ROIs as a mechanism to compensate the lack of feedback from the peripheral nerves to the sensomotor areas.

Estimating complex cortical networks via surface recordings-A critical note

We discuss potential caveats when estimating topologies of 3D brain networks from surface recordings. It is virtually impossible to record activity from all single neurons in the brain and one has to rely on techniques that measure average activity at sparsely located (non-invasive) recording sites Effects of this spatial sampling in relation to structural network measures like centrality and assortativity were analyzed using multivariate classifiers A simplified model of 3D brain connectivity incorporating both short- and long-range connections served for testing. To mimic M/EEG recordings we sampled this model via non-overlapping regions and weighted nodes and connections according to their proximity to the recording sites We used various complex network models for reference and tried to classify sampled versions of the ""brain-like"" network as one of these archetypes It was found that sampled networks may substantially deviate in topology from the respective original networks for small sample sizes For experimental studies this may imply that surface recordings can yield network structures that might not agree with its generating 3D network. (C) 2010 Elsevier Inc All rights reserved

The indirect amygdala-dorsal striatum pathway mediates conditioned freezing: Insights on emotional memory networks

The dorsal striatum (DS) is involved in various forms of learning and memory such as procedural learning, habit learning, reward-association and emotional learning. We have previously reported that bilateral DS lesions disrupt tone fear conditioning (TFC), but not contextual fear conditioning (CFC) [Ferreira TL, Moreira KM, Ikeda DC, Bueno OFA, Oliveira MGM (2003) Effects of dorsal striatum lesions in tone fear conditioning and contextual fear conditioning. Brain Res 987:17-24]. To further elucidate the participation of DS in emotional learning, in the present study, we investigated the effects of bilateral pretest (postraining) electrolytic DS lesions on TFC. Given the well-acknowledged role of the amygdala in emotional learning, we also examined a possible cooperation between DS and the amygdala in TFC, by using asymmetrical electrolytic lesions, consisting of a unilateral lesion of the central amygdaloid nucleus (CeA) combined to a contralateral DS lesion. The results show that pre-test bilateral DS lesions disrupt TFC responses, suggesting that DS plays a role in the expression of TFC. More importantly, rats with asymmetrical pre-training lesions were impaired in TFC, but not in CFC tasks. This result was confirmed with muscimol asymmetrical microinjections in DS and CeA, which reversibly inactivate these structures. On the other hand, similar pretest lesions as well as unilateral electrolytic lesions of CeA and DS in the same hemisphere did not affect TFC. Possible anatomical substrates underlying the observed effects are proposed. Overall, the present results underscore that other routes, aside from the well-established CeA projections to the periaqueductal gray, may contribute to the acquisition/consolidation of the freezing response associated to a TFC task. It is suggested that CeA may presumably influence DS processing via a synaptic relay on dopaminergic neurons of the substantia nigra compacta and retrorubral nucleus. The present observations are also in line with other studies showing that TFC and CFC responses are mediated by different anatomical networks. (C) 2008 IBRO. Published by Elsevier Ltd. All rights reserved.

Loops, Chains, Sheets, and Networks from Variable Coordination of Cu(hfac)(2) with a Flexibly Hinged Aminoxyl Radical Ligand

One pair of reactants, Cu(hfac)(2) = M and the hinge-flexible radical ligand 5-(3-N-tert-butyl-N-aminoxylphenyl)pyrimidine (3PPN = L), yields a diverse set of five coordination complexes: a cyclic loop M(2)L(1) dimer; a 1:1 cocrystal between an M(2)L(2) loop and an ML(2) fragment; a ID chain of M(2)L(2) loops linked by M; two 2D M(3)L(2) networks of (M-L)(n) chains crosslinked by M with different repeat length pitches; a 3D M(3)L(2) network of M(2)L(2) loops cross-linking (M-L)(n)-type chains with connectivity different from those in the 2D networks. Most of the higher dimensional complexes exhibit reversible, temperature-dependent spin-state conversion of high-temperature paramagnetic states to lower magnetic moment states having antiferromagnetic exchange within Cu-ON bonds upon cooling, with accompanying bond contraction. The 3D complex also exhibited antiferromagnetic exchange between Cu(II) ions linked in chains through pyrimidine rings.

MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

A structure-dynamic approach to cortical organization: Number of paths and accessibility

A structure-dynamic approach to cortical systems is reported which is based on the number of paths and the accessibility of each node. The latter measurement is obtained by performing self-avoiding random walks in the respective networks, so as to simulate dynamics, and then calculating the entropies of the transition probabilities for walks starting from each node. Cortical networks of three species, namely cat, macaque and humans, are studied considering structural and dynamical aspects. It is verified that the human cortical network presents the highest accessibility and number of paths (in terms of z-scores). The correlation between the number of paths and accessibility is also investigated as a mean to quantify the level of independence between paths connecting pairs of nodes in cortical networks. By comparing the cortical networks of cat, macaque and humans, it is verified that the human cortical network tends to present the largest number of independent paths of length larger than four. These results suggest that the human cortical network is potentially the most resilient to brain injures. (C) 2009 Elsevier B.V. All rights reserved.

Modeling connectivity in terms of network activity

A new complex network model is proposed which is founded on growth, with new connections being established proportionally to the current dynamical activity of each node, which can be understood as a generalization of the Barabasi-Albert static model. By using several topological measurements, as well as optimal multivariate methods (canonical analysis and maximum likelihood decision), we show that this new model provides, among several other theoretical kinds of networks including Watts-Strogatz small-world networks, the greatest compatibility with three real-world cortical networks.

Beyond the average: Detecting global singular nodes from local features in complex networks

Deviations from the average can provide valuable insights about the organization of natural systems. The present article extends this important principle to the systematic identification and analysis of singular motifs in complex networks. Six measurements quantifying different and complementary features of the connectivity around each node of a network were calculated, and multivariate statistical methods applied to identify singular nodes. The potential of the presented concepts and methodology was illustrated with respect to different types of complex real-world networks, namely the US air transportation network, the protein-protein interactions of the yeast Saccharomyces cerevisiae and the Roget thesaurus networks. The obtained singular motifs possessed unique functional roles in the networks. Three classic theoretical network models were also investigated, with the Barabasi-Albert model resulting in singular motifs corresponding to hubs, confirming the potential of the approach. Interestingly, the number of different types of singular node motifs as well as the number of their instances were found to be considerably higher in the real-world networks than in any of the benchmark networks. Copyright (C) EPLA, 2009

Seeking for simplicity in complex networks

Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being ""simple"". While a great deal of the attention so far dedicated to complex networks has been duly driven by the ""complex"" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

Functional and Structural Connectivity Between the Perigenual Anterior Cingulate and Amygdala in Bipolar Disorder

Objective: Abnormalities in the morphology and function of two gray matter structures central to emotional processing, the perigenual anterior cingulate cortex (pACC) and amygdala, have consistently been reported in bipolar disorder (BD). Evidence implicates abnormalities in their connectivity in BD. This study investigates the potential disruptions in pACC-amygdala functional connectivity and associated abnormalities in white matter that provides structural connections between the two brain regions in BD. Methods: Thirty-three individuals with BD and 31 healthy comparison subjects (HC) participated in a scanning session during which functional magnetic resonance imaging (fMRI) during processing of face stimuli and diffusion tensor imaging (DTI) were performed. The strength of pACC-amygdala functional connections was compared between BD and HC groups, and associations between these functional connectivity measures from the fMRI scans and regional fractional anisotropy (FA) from the DTI scans were assessed. Results: Functional connectivity was decreased between the pACC and amygdala in the BD group compared with HC group, during the processing of fearful and happy faces (p < .005). Moreover, a significant positive association between pACC-amygdala functional coupling and FA in ventrofrontal white matter, including the region of the uncinate fasciculus, was identified (p < .005). Conclusion: This study provides evidence for abnormalities in pACC-amygdala functional connectivity during emotional processing in BD. The significant association between pACC-amygdala functional connectivity and the structural integrity of white matter that contains pACC-amygdala connections suggest that disruptions in white matter connectivity may contribute to disturbances in the coordinated responses of the pACC and amygdala during emotional processing in BD.

A multi-GPU algorithm for large-scale neuronal networks

Large-scale simulations of parts of the brain using detailed neuronal models to improve our understanding of brain functions are becoming a reality with the usage of supercomputers and large clusters. However, the high acquisition and maintenance cost of these computers, including the physical space, air conditioning, and electrical power, limits the number of simulations of this kind that scientists can perform. Modern commodity graphical cards, based on the CUDA platform, contain graphical processing units (GPUs) composed of hundreds of processors that can simultaneously execute thousands of threads and thus constitute a low-cost solution for many high-performance computing applications. In this work, we present a CUDA algorithm that enables the execution, on multiple GPUs, of simulations of large-scale networks composed of biologically realistic Hodgkin-Huxley neurons. The algorithm represents each neuron as a CUDA thread, which solves the set of coupled differential equations that model each neuron. Communication among neurons located in different GPUs is coordinated by the CPU. We obtained speedups of 40 for the simulation of 200k neurons that received random external input and speedups of 9 for a network with 200k neurons and 20M neuronal connections, in a single computer with two graphic boards with two GPUs each, when compared with a modern quad-core CPU. Copyright (C) 2010 John Wiley & Sons, Ltd.