Comparison of the small-world topology between anatomical and functional connectivity in the human brain

We applied graph analysis to both anatomical and functional connectivity in the human brain. Anatomical connectivity was acquired from diffusion tensor imaging data by probabilistic fiber tracking, and functional connectivity was extracted from resting-state functional magnetic resonance imaging data by calculating correlation maps of time series. For the same subject, anatomical networks seemed to be disassortative, while functional networks were significantly assortative. Anatomical networks showed higher efficiency and smaller diameters than functional networks. It can be proposed that anatomical connectivity, as a major constraint of functional connectivity, has a relatively stable and efficient structure to support functional connectivity that is more changeable and flexible.     

Investigating the neural basis for fMRI-based functional connectivity in a blocked design: application to interregional correlations and psycho-physiological interactions

This paper investigates how well different kinds of fMRI functional connectivity analysis reflect the underlying interregional neural interactions. This is hard to evaluate using real experimental data where such relationships are unknown. Rather, we use a biologically realistic neural model to simulate both neuronal activities and multiregional fMRI data from a blocked design. Because we know how every element in the model is related to every other element, we can compare functional connectivity measurements across different spatial and temporal scales. We focus on (1) psycho-physiological interaction (PPI) analysis, which is a simple brain connectivity method that characterizes the activity in one brain region by the interaction between another region's activity and a psychological factor, and (2) interregional correlation analysis. We investigated the neurobiological underpinnings of PPI using simulated neural activities and fMRI signals generated by a large-scale neural model that performs a visual delayed match-to-sample task. Simulated fMRI data are generated by convolving integrated synaptic activities (ISAs) with a hemodynamic response function. The simulation was done under three task conditions: high-attention, low-attention and a control task ('passive viewing'). We investigated how biological and scanning parameters affect PPI and compared these with functional connectivity measures obtained using correlation analysis. We performed correlational and PPI analyses with three types of time-series data: ISA, fMRI and deconvolved fMRI (which yields estimated neural signals) obtained using a deconvolution algorithm. The simulated ISA can be considered as the 'gold standard' because it represents the underlying neural activity. Our main findings show (1) that evaluating the change in an interregional functional connection using the difference in regression coefficients (as is essentially done in the PPI method) produces results that better reflect the underlying changes in neural interrelationships than does evaluating the functional connectivity difference as a change in correlation coefficient; (2) that using fMRI and deconvolved fMRI data led to similar conclusions in the PPI-based functional connectivity results, and these generally agreed with the nature of the underlying neural interactions; and (3) the functional connectivity correlation measures often led to different conclusions regarding significance for different scanning and hemodynamic parameters, but the significances of the PPI regression parameters were relatively robust. These results highlight the way in which neural modeling can be used to help validate the inferences one can make about functional connectivity based on fMRI data.     

时变动态贝叶斯网络模型及其在皮层脑电网络连接中的应用

大脑执行语言的发音需要顶叶、颞叶、额叶等多个脑区协同完成.皮层脑电具有高时间分辨率、较高空间分辨率和高信噪比等优势,为研究大脑的电生理特性提供了重要的技术手段.为了探索大脑对语言的动态处理过程,利用多尺度皮层脑电(标准电极与微电极)分析了被试在执行音节朗读任务时的皮层脑电信号的高频gamma段特征,提出采用时变动态贝叶斯网络构建单次实验任务的有向网络.结果显示该方法能够快速有效地构建语言任务过程中标准电极、微电极以及二者之间的有向网络连接,且反映了大规模网络(标准电极之间的连接)、局部网络(微电极之间的连接)以及大规模网络与局部网络之间的连接(标准电极与微电极之间的连接)随语言任务发生的动态改变.研究还发现,发音时刻之前与之后的网络连接存在显著性差异,且发音方式不同的音节网络间也存在明显差异.该研究将有助于癫痫等神经疾病的术前临床评估以及理解大脑对语言加工的实时处理过程.     

Evaluation of network robustness using a node tearing algorithm

Until recently the study of failure and vulnerability in complex networks focused on the role of high degree nodes, and the relationship between their removal and network connectivity. Recent evidence suggested that in some network configurations, the removal of lower degree nodes can also cause network fragmentation. We present a disassembling algorithm that identifies nodes that are core to network connectivity. The algorithm is based on network tearing in which communities are defined and used to construct a hierarchical structure. Cut-nodes, which are located at the boundaries of the communities, are the key interest. Their importance in the overall network connectivity is characterized by their participation with neighbouring communities in each level of the hierarchy. We examine the impact of these cut-nodes by studying the change in size of the giant component, local and global efficiencies, and how the algorithm can be combined with other community detection methods to reveal the finer internal structure within a community.     

A Resiliency-Connectivity metric in wireless sensor networks with key predistribution schemes and node compromise attacks

Applications for wireless sensor networks require widespread, highly reliable communications even in the face of adversarial influences. Maintaining connectivity and secure communications between entities are vital networking properties towards ensuring the successful and accurate completion of desired sensing tasks. We examine the required communication range for nodes in a wireless sensor network with respect to several parameters. Network properties such as key predistribution schemes and node compromise attacks are modelled with several network parameters and studied in terms of how they influence global network connectivity. These networks are physically vulnerable to malicious behavior by way of node compromise attacks that may affect global connectivity. We introduce a metric that determines the resilience of a network employing a key predistribution scheme with respect to node compromise attacks. In this work,we provide the first study of global network connectivity and its relationship to node compromise attacks. Existing work considers the relationship between the probability of node compromise and the probability of link compromise and the relationship of the probability of secure link establishment and overall network connectivity for the Erdős network model. Here, we present novel work which combines these two relationships to study the relationship between node compromise attacks and global network connectivity. Our analysis is performed with regard to large-scale networks; however, we provide simulation results for both large-scale and small-scale networks. First, we derive a single expression to determine the required communication radius for wireless sensor networks to include the effects of key predistribution schemes. From this, we derive an expression for determining required communication range after an adversary has compromised a fraction of the nodes in the network. The required communication range represents the resource usage of nodes in a network to cope with key distribution schemes and node compromise attacks. We introduce the Resiliency-Connectivity metric, which measures the resilience of a network in expending its resources to provide global connectivity in adverse situations.     

Spin glasses on Bethe lattices for large coordination number

We study spin glasses on random lattices with finite connectivity. In the infinite connectivity limit they reduce to the Sherrington Kirkpatrick model. In this paper we investigate the expansion around the high connectivity limit. Within the replica symmetry breaking scheme at two steps, we compute the free energy at the first order in the expansion in inverse powers of the average connectivity (z), both for the fixed connectivity and for the fluctuating connectivity random lattices. It is well known that the coefficient of the 1/z correction for the free energy is divergent at low temperatures if computed in the one step approximation. We find that this annoying divergence becomes much smaller if computed in the framework of the more accurate two steps breaking. Comparing the temperature dependance of the coefficients of this divergence in the replica symmetric, one step and two steps replica symmetry breaking, we conclude that this divergence is an artefact due to the use of a finite number of steps of replica symmetry breaking. The 1/z expansion is well defined also in the zero temperature limit. Received 15 July 2002 Published online 31 December 2002     

Epidemic outbreaks in complex heterogeneous networks

We present a detailed analytical and numerical study for the spreading of infections with acquired immunity in complex population networks. We show that the large connectivity fluctuations usually found in these networks strengthen considerably the incidence of epidemic outbreaks. Scale-free networks, which are characterized by diverging connectivity fluctuations in the limit of a very large number of nodes, exhibit the lack of an epidemic threshold and always show a finite fraction of infected individuals. This particular weakness, observed also in models without immunity, defines a new epidemiological framework characterized by a highly heterogeneous response of the system to the introduction of infected individuals with different connectivity. The understanding of epidemics in complex networks might deliver new insights in the spread of information and diseases in biological and technological networks that often appear to be characterized by complex heterogeneous architectures. Received 20 September 2001 and Received in final form 4 February 2002     

Partitioning networks into clusters and residuals with average association

We investigate the problem of detecting clusters exhibiting higher-than-average internal connectivity in networks of interacting systems. We show how the average association objective formulated in the context of spectral graph clustering leads naturally to a clustering strategy where each system is assigned to at most one cluster. A residual set is formed of the systems that are not members of any cluster. Maximization of the average association objective leads to a discrete optimization problem, which is difficult to solve, but a relaxed version can be solved using an eigendecomposition of the connectivity matrix. A simple approach to extracting clusters from a relaxed solution is described and developed by applying a variance maximizing solution to the relaxed solution, which leads to a method with increased accuracy and sensitivity. Numerical studies of theoretical connectivity models and of synchronization clusters in a lattice of coupled Lorenz oscillators are conducted to show the efficiency of the proposed approach. The method is applied to an experimentally obtained human resting state functional magnetic resonance imaging dataset and the results are discussed.     

Virtual topology design of shared channel lightwave networks

Channel sharing in a WDM-based lightwaue network provides a way to reduce the number of wauelengths required for the implementation of a large network, while the network virtual connectivity can be dramatically increased. In this paper, we first introduce a so-called group policy that achieves a virtual topology with maximum connectivity and simplifies the optimal design of a trafjic sensitiue virtual topology. We propose a two-stage algorithm: a node-to-group assignment and a wauelength-to-group assignment. The results show that the proposed algorithm is a practical tool that efjiciently reconfigures the connectivity diagram to fit best the current traffic pattern.     

Spatial brain networks

The human brain is a wonderfully complex organ characterized by heterogeneous connectivity between cellular and tissue units. This complexity supports the rich repertoire of dynamics and function that is characteristic of human cognition. While studies of brain connectivity have provided important insight into healthy cognition as well as its alteration in psychiatric disorders and neurological disease, an understanding of how this connectivity is embedded into the 3-dimensional space of the skull has remained elusive. In this article, we will motivate the importance of studying the brain as a spatially embedded network, particularly for understanding the rules of its development and alterations to those rules that may occur in neurodevelopmental disorders such as schizophrenia. We will review recent evidence for well-defined wiring rules in the brain, informed by notions of wiring minimization, spatially localized modules, and hierarchically nested topology. We will then discuss potential drivers of these rules in the form of evolution, genetics, energy, and the need for computational complexity. Finally, we will conclude with a discussion of emerging frontiers in the study of spatial brain networks, both in theory and modeling, and their potential to enhance our understanding of mental health.     

Self-organization of balanced nodes in random networks with transportation bandwidths

We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths along the transportation links. The mean-field approach is applicable when the connectivity is sufficiently high. It allows us to derive the resource shortage of a node as a well-defined function of its capacity. For networks with uniformly high connectivity, an efficient profile of the allocated resources is obtained, which exhibits features similar to the Maxwell construction. These results have good agreements with simulations, where nodes self-organize to balance their shortages, forming extensive clusters of nodes interconnected by unsaturated links. The deviations from the mean-field analyses show that nodes are likely to be rich in the locality of gifted neighbors. In scale-free networks, hubs make sacrifice for enhanced balancing of nodes with low connectivity.     

Role of unstable directions in the equilibrium and aging dynamics of supercooled liquids

The connectivity of the potential energy landscape in supercooled atomic liquids is investigated through a calculation of the instantaneous normal modes spectrum and a detailed analysis of the unstable directions in configuration space. We confirm the hypothesis that the mode-coupling critical temperature is the T at which the dynamics crosses over from free to activated exploration of configuration space. We also observe changes in the local connectivity of configuration space sampled during aging, following a temperature jump from a liquid to a glassy state.     

Emergent criticality through adaptive information processing in boolean networks

We study information processing in populations of boolean networks with evolving connectivity and systematically explore the interplay between the learning capability, robustness, the network topology, and the task complexity. We solve a long-standing open question and find computationally that, for large system sizes N, adaptive information processing drives the networks to a critical connectivity K(c)=2. For finite size networks, the connectivity approaches the critical value with a power law of the system size N. We show that network learning and generalization are optimized near criticality, given that the task complexity and the amount of information provided surpass threshold values. Both random and evolved networks exhibit maximal topological diversity near K(c). We hypothesize that this diversity supports efficient exploration and robustness of solutions. Also reflected in our observation is that the variance of the fitness values is maximal in critical network populations. Finally, we discuss implications of our results for determining the optimal topology of adaptive dynamical networks that solve computational tasks.     

Fastest learning in small-world neural networks

We investigate supervised learning in neural networks. We consider a multi-layered feed-forward network with back propagation. We find that the network of small-world connectivity reduces the learning error and learning time when compared to the networks of regular or random connectivity. Our study has potential applications in the domain of data-mining, image processing, speech recognition, and pattern recognition.     

Estimation of the effective and functional human cortical connectivity with structural equation modeling and directed transfer function applied to high-resolution EEG

Different brain imaging devices are presently available to provide images of the human functional cortical activity, based on hemodynamic, metabolic or electromagnetic measurements. However, static images of brain regions activated during particular tasks do not convey the information of how these regions are interconnected. The concept of brain connectivity plays a central role in the neuroscience, and different definitions of connectivity, functional and effective, have been adopted in literature. While the functional connectivity is defined as the temporal coherence among the activities of different brain areas, the effective connectivity is defined as the simplest brain circuit that would produce the same temporal relationship as observed experimentally among cortical sites. The structural equation modeling (SEM) is the most used method to estimate effective connectivity in neuroscience, and its typical application is on data related to brain hemodynamic behavior tested by functional magnetic resonance imaging (fMRI), whereas the directed transfer function (DTF) method is a frequency-domain approach based on both a multivariate autoregressive (MVAR) modeling of time series and on the concept of Granger causality.

This study presents advanced methods for the estimation of cortical connectivity by applying SEM and DTF on the cortical signals estimated from high-resolution electroencephalography (EEG) recordings, since these signals exhibit a higher spatial resolution than conventional cerebral electromagnetic measures. To estimate correctly the cortical signals, we used a subject's multicompartment head model (scalp, skull, dura mater, cortex) constructed from individual MRI, a distributed source model and a regularized linear inverse source estimates of cortical current density. Before the application of SEM and DTF methodology to the cortical waveforms estimated from high-resolution EEG data, we performed a simulation study, in which different main factors (signal-to-noise ratio, SNR, and simulated cortical activity duration, LENGTH) were systematically manipulated in the generation of test signals, and the errors in the estimated connectivity were evaluated by the analysis of variance (ANOVA). The statistical analysis returned that during simulations, both SEM and DTF estimators were able to correctly estimate the imposed connectivity patterns under reasonable operative conditions, that is, when data exhibit an SNR of at least 3 and a LENGTH of at least 75 s of nonconsecutive EEG recordings at 64 Hz of sampling rate.

Hence, effective and functional connectivity patterns of cortical activity can be effectively estimated under general conditions met in any practical EEG recordings, by combining high-resolution EEG techniques and linear inverse estimation with SEM or DTF methods. We conclude that the estimation of cortical connectivity can be performed not only with hemodynamic measurements, but also with EEG signals treated with advanced computational techniques.     

Coloring random graphs

We study the graph coloring problem over random graphs of finite average connectivity c. Given a number q of available colors, we find that graphs with low connectivity admit almost always a proper coloring, whereas graphs with high connectivity are uncolorable. Depending on q, we find the precise value of the critical average connectivity c(q). Moreover, we show that below c(q) there exists a clustering phase c in [c(d),c(q)] in which ground states spontaneously divide into an exponential number of clusters and where the proliferation of metastable states is responsible for the onset of complexity in local search algorithms.     

Connectivity degrees in the threshold preferential attachment model

In this paper we present a study of the connectivity degrees of the threshold preferential attachment model, a generalization of the Barabási-Albert model to heterogeneous complex networks. The threshold model incorporates the states of the nodes in its preferential linking rule and assumes that the affinity between network nodes follows an inverse relationship with the distance between their states. We numerically analyze the connectivity degrees of the model, studying the influence of the main parameters on the distribution of connectivity degrees and its statistics, the average degree and highest degree of the network. We show that such statistics exhibit markedly different behaviors in the dependence on the model parameters, particularly as regards the interaction threshold. Nevertheless, we show that the two statistics converge in the limit of null threshold and often exhibit scaling that can be described by power laws of the model parameters.     

Topology of evolving networks: local events and universality

Networks grow and evolve by local events, such as the addition of new nodes and links, or rewiring of links from one node to another. We show that depending on the frequency of these processes two topologically different networks can emerge, the connectivity distribution following either a generalized power law or an exponential. We propose a continuum theory that predicts these two regimes as well as the scaling function and the exponents, in good agreement with numerical results. Finally, we use the obtained predictions to fit the connectivity distribution of the network describing the professional links between movie actors.     

Fast response and temporal coherent oscillations in small-world networks

We have investigated the role that different connectivity regimes play in the dynamics of a network of Hodgkin-Huxley neurons by computer simulations. The different connectivity topologies exhibit the following features: random topologies give rise to fast system response yet are unable to produce coherent oscillations in the average activity of the network; on the other hand, regular topologies give rise to coherent oscillations, but in a temporal scale that is not in accordance with fast signal processing. Finally, small-world topologies, which fall between random and regular ones, take advantage of the best features of both, giving rise to fast system response with coherent oscillations.