Using Complex Networks to Characterize International Business Cycles

Background

There is a rapidly expanding literature on the application of complex networks in economics that focused mostly on stock markets. In this paper, we discuss an application of complex networks to study international business cycles.

Methodology/Principal Findings

We construct complex networks based on GDP data from two data sets on G7 and OECD economies. Besides the well-known correlation-based networks, we also use a specific tool for presenting causality in economics, the Granger causality. We consider different filtering methods to derive the stationary component of the GDP series for each of the countries in the samples. The networks were found to be sensitive to the detrending method. While the correlation networks provide information on comovement between the national economies, the Granger causality networks can better predict fluctuations in countries’ GDP. By using them, we can obtain directed networks allows us to determine the relative influence of different countries on the global economy network. The US appears as the key player for both the G7 and OECD samples.

Conclusion

The use of complex networks is valuable for understanding the business cycle comovements at an international level.     

Integration of protein motions with molecular networks reveals different mechanisms for permanent and transient interactions

The integration of molecular networks with other types of data, such as changing levels of gene expression or protein-structural features, can provide richer information about interactions than the simple node-and-edge representations commonly used in the network community. For example, the mapping of 3D-structural data onto networks enables classification of proteins into singlish- or multi-interface hubs (depending on whether they have >2 interfaces). Similarly, interactions can be classified as permanent or transient, depending on whether their interface is used by only one or by multiple partners. Here, we incorporate an additional dimension into molecular networks: dynamic conformational changes. We parse the entire PDB structural databank for alternate conformations of proteins and map these onto the protein interaction network, to compile a first version of the Dynamic Structural Interaction Network (DynaSIN). We make this network available as a readily downloadable resource file, and we then use it to address a variety of downstream questions. In particular, we show that multi-interface hubs display a greater degree of conformational change than do singlish-interface ones; thus, they show more plasticity which perhaps enables them to utilize more interfaces for interactions. We also find that transient associations involve smaller conformational changes than permanent ones. Although this may appear counterintuitive, it is understandable in the following framework: as proteins involved in transient interactions shuttle between interchangeable associations, they interact with domains that are similar to each other and so do not require drastic structural changes for their activity. We provide evidence for this hypothesis through showing that interfaces involved in transient interactions bind fewer classes of domains than those in a control set.     

Condition-dependent functional connectivity: syntax networks in bilinguals

This paper introduces a method to study the variation of brain functional connectivity networks with respect to experimental conditions in fMRI data. It is related to the psychophysiological interaction technique introduced by Friston et al. and extends to networks of correlation modulation (CM networks). Extended networks containing several dozens of nodes are determined in which the links correspond to consistent correlation modulation across subjects. In addition, we assess inter-subject variability and determine networks in which the condition-dependent functional interactions can be explained by a subject-dependent variable. We applied the technique to data from a study on syntactical production in bilinguals and analysed functional interactions differentially across tasks (word reading or sentence production) and across languages. We find an extended network of consistent functional interaction modulation across tasks, whereas the network comparing languages shows fewer links. Interestingly, there is evidence for a specific network in which the differences in functional interaction across subjects can be explained by differences in the subjects' syntactical proficiency. Specifically, we find that regions, including ones that have previously been shown to be involved in syntax and in language production, such as the left inferior frontal gyrus, putamen, insula, precentral gyrus, as well as the supplementary motor area, are more functionally linked during sentence production in the second, compared with the first, language in syntactically more proficient bilinguals than in syntactically less proficient ones. Our approach extends conventional activation analyses to the notion of networks, emphasizing functional interactions between regions independently of whether or not they are activated. On the one hand, it gives rise to testable hypotheses and allows an interpretation of the results in terms of the previous literature, and on the other hand, it provides a basis for studying the structure of functional interactions as a whole, and hence represents a further step towards the notion of large-scale networks in functional imaging.     

Identifying Cognitive States Using Regularity Partitions

Functional Magnetic Resonance (fMRI) data can be used to depict functional connectivity of the brain. Standard techniques have been developed to construct brain networks from this data; typically nodes are considered as voxels or sets of voxels with weighted edges between them representing measures of correlation. Identifying cognitive states based on fMRI data is connected with recording voxel activity over a certain time interval. Using this information, network and machine learning techniques can be applied to discriminate the cognitive states of the subjects by exploring different features of data. In this work we wish to describe and understand the organization of brain connectivity networks under cognitive tasks. In particular, we use a regularity partitioning algorithm that finds clusters of vertices such that they all behave with each other almost like random bipartite graphs. Based on the random approximation of the graph, we calculate a lower bound on the number of triangles as well as the expectation of the distribution of the edges in each subject and state. We investigate the results by comparing them to the state of the art algorithms for exploring connectivity and we argue that during epochs that the subject is exposed to stimulus, the inspected part of the brain is organized in an efficient way that enables enhanced functionality.     

Efficient Partitioning of Memory Systems and Its Importance for Memory Consolidation

Long-term memories are likely stored in the synaptic weights of neuronal networks in the brain. The storage capacity of such networks depends on the degree of plasticity of their synapses. Highly plastic synapses allow for strong memories, but these are quickly overwritten. On the other hand, less labile synapses result in long-lasting but weak memories. Here we show that the trade-off between memory strength and memory lifetime can be overcome by partitioning the memory system into multiple regions characterized by different levels of synaptic plasticity and transferring memory information from the more to less plastic region. The improvement in memory lifetime is proportional to the number of memory regions, and the initial memory strength can be orders of magnitude larger than in a non-partitioned memory system. This model provides a fundamental computational reason for memory consolidation processes at the systems level.     

Gene co-expression network topology provides a framework for molecular characterization of cellular state

MOTIVATION: Gene expression data have become an instrumental resource in describing the molecular state associated with various cellular phenotypes and responses to environmental perturbations. The utility of expression profiling has been demonstrated in partitioning clinical states, predicting the class of unknown samples and in assigning putative functional roles to previously uncharacterized genes based on profile similarity. However, gene expression profiling has had only limited success in identifying therapeutic targets. This is partly due to the fact that current methods based on fold-change focus only on single genes in isolation, and thus cannot convey causal information. In this paper, we present a technique for analysis of expression data in a graph-theoretic framework that relies on associations between genes. We describe the global organization of these networks and biological correlates of their structure. We go on to present a novel technique for the molecular characterization of disparate cellular states that adds a new dimension to the fold-based methods and conclude with an example application to a human medulloblastoma dataset. RESULTS: We have shown that expression networks generated from large model-organism expression datasets are scale-free and that the average clustering coefficient of these networks is several orders of magnitude higher than would be expected for similarly sized scale-free networks, suggesting an inherent hierarchical modularity similar to that previously identified in other biological networks. Furthermore, we have shown that these properties are robust with respect to the parameters of network construction. We have demonstrated an enrichment of genes having lethal knockout phenotypes in the high-degree (i.e. hub) nodes in networks generated from aggregate condition datasets; using process-focused Saccharomyces cerivisiae datasets we have demonstrated additional high-degree enrichments of condition-specific genes encoding proteins known to be involved in or important for the processes interrogated by the microarrays. These results demonstrate the utility of network analysis applied to expression data in identifying genes that are regulated in a state-specific manner. We concluded by showing that a sample application to a human clinical dataset prominently identified a known therapeutic target. AVAILABILITY: Software implementing the methods for network generation presented in this paper is available for academic use by request from the authors in the form of compiled linux binary executables.     

RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology

Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2) corresponding to the second eigenvalues (λ2) associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2′s components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2′s components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼220 nucleotides). While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs also suggest design strategies for novel RNA motifs.