Network geometry with flavor: From complexity to quantum geometry

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d -dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s =-1 ,0 ,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d . In d =1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d >1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t . Interestingly the NGF remains fully classical but its statistical properties reveal the relation to its quantum mechanical description. In fact the δ -dimensional faces of the NGF have generalized degrees that follow either the Fermi-Dirac, Boltzmann, or Bose-Einstein statistics depending on the flavor s and the dimensions d and δ .

Network geometry with flavor: From complexity to quantum geometry.

PubMed

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d-dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s=-1,0,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d. In d=1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d>1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t. Interestingly the NGF remains fully classical but its statistical properties reveal the relation to its quantum mechanical description. In fact the δ-dimensional faces of the NGF have generalized degrees that follow either the Fermi-Dirac, Boltzmann, or Bose-Einstein statistics depending on the flavor s and the dimensions d and δ.

The application of complex network time series analysis in turbulent heated jets

DOE Office of Scientific and Technical Information (OSTI.GOV)

Charakopoulos, A. K.; Karakasidis, T. E., E-mail: thkarak@uth.gr; Liakopoulos, A.

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topologicalmore » properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.« less

The application of complex network time series analysis in turbulent heated jets

DOE Office of Scientific and Technical Information (OSTI.GOV)

Charakopoulos, A. K.; Karakasidis, T. E., E-mail: thkarak@uth.gr; Liakopoulos, A.

2014-06-15

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topologicalmore » properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.« less

Higher-order clustering in networks

NASA Astrophysics Data System (ADS)

Yin, Hao; Benson, Austin R.; Leskovec, Jure

2018-05-01

A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucial to understanding complex networks, and the clustering behavior with respect to such higher-order network structures is not well understood. Here we introduce higher-order clustering coefficients that measure the closure probability of higher-order network cliques and provide a more comprehensive view of how the edges of complex networks cluster. Our higher-order clustering coefficients are a natural generalization of the traditional clustering coefficient. We derive several properties about higher-order clustering coefficients and analyze them under common random graph models. Finally, we use higher-order clustering coefficients to gain new insights into the structure of real-world networks from several domains.

Linguistic complex networks: Rationale, application, interpretation, and directions. Reply to comments on "Approaching human language with complex networks"

NASA Astrophysics Data System (ADS)

Cong, Jin; Liu, Haitao

2014-12-01

Amid the enthusiasm for real-world networks of the new millennium, the enquiry into linguistic networks is flourishing not only as a productive branch of the new networks science but also as a promising approach to linguistic research. Although the complex network approach constitutes a potential opportunity to make linguistics a science, the world of linguistics seems unprepared to embrace it. For one thing, linguistics has been largely unaffected by quantitative methods. Those who are accustomed to qualitative linguistic methods may find it hard to appreciate the application of quantitative properties of language such as frequency and length, not to mention quantitative properties of language modeled as networks. With this in mind, in our review [1] we restrict ourselves to the basics of complex networks and the new insights into human language with the application of complex networks. For another, while breaking new grounds and posing new challenges for linguistics, the complex network approach to human language as a new tradition of linguistic research is faced with challenges and unsolved issues of its own. It is no surprise that the comments on our review, especially their skepticism and suggestions, focus on various different aspects of the complex network approach to human language. We are grateful to all the insightful and penetrating comments, which, together with our review, mark a significant impetus to linguistic research from the complex network approach. In this reply, we would like to address four major issues of the complex network approach to human language, namely, a) its theoretical rationale, b) its application in linguistic research, c) interpretation of the results, and d) directions of future research.

A study of the electrical properties of complex resistor network based on NW model

NASA Astrophysics Data System (ADS)

Chang, Yunfeng; Li, Yunting; Yang, Liu; Guo, Lu; Liu, Gaochao

2015-04-01

The power and resistance of two-port complex resistor network based on NW small world network model are studied in this paper. Mainly, we study the dependence of the network power and resistance on the degree of port vertices, the connection probability and the shortest distance. Qualitative analysis and a simplified formula for network resistance are given out. Finally, we define a branching parameter and give out its physical meaning in the analysis of complex resistor network.

Adaptive capacity of geographical clusters: Complexity science and network theory approach

NASA Astrophysics Data System (ADS)

Albino, Vito; Carbonara, Nunzia; Giannoccaro, Ilaria

This paper deals with the adaptive capacity of geographical clusters (GCs), that is a relevant topic in the literature. To address this topic, GC is considered as a complex adaptive system (CAS). Three theoretical propositions concerning the GC adaptive capacity are formulated by using complexity theory. First, we identify three main properties of CAS s that affect the adaptive capacity, namely the interconnectivity, the heterogeneity, and the level of control, and define how the value of these properties influence the adaptive capacity. Then, we associate these properties with specific GC characteristics so obtaining the key conditions of GCs that give them the adaptive capacity so assuring their competitive advantage. To test these theoretical propositions, a case study on two real GCs is carried out. The considered GCs are modeled as networks where firms are nodes and inter-firms relationships are links. Heterogeneity, interconnectivity, and level of control are considered as network properties and thus measured by using the methods of the network theory.

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: The Fractal Dimensions of Complex Networks

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, XU

2009-08-01

It is shown that many real complex networks share distinctive features, such as the small-world effect and the heterogeneous property of connectivity of vertices, which are different from random networks and regular lattices. Although these features capture the important characteristics of complex networks, their applicability depends on the style of networks. To unravel the universal characteristics many complex networks have in common, we study the fractal dimensions of complex networks using the method introduced by Shanker. We find that the average 'density' (ρ(r)) of complex networks follows a better power-law function as a function of distance r with the exponent df, which is defined as the fractal dimension, in some real complex networks. Furthermore, we study the relation between df and the shortcuts Nadd in small-world networks and the size N in regular lattices. Our present work provides a new perspective to understand the dependence of the fractal dimension df on the complex network structure.

Graph theoretical analysis of complex networks in the brain

PubMed Central

Stam, Cornelis J; Reijneveld, Jaap C

2007-01-01

Since the discovery of small-world and scale-free networks the study of complex systems from a network perspective has taken an enormous flight. In recent years many important properties of complex networks have been delineated. In particular, significant progress has been made in understanding the relationship between the structural properties of networks and the nature of dynamics taking place on these networks. For instance, the 'synchronizability' of complex networks of coupled oscillators can be determined by graph spectral analysis. These developments in the theory of complex networks have inspired new applications in the field of neuroscience. Graph analysis has been used in the study of models of neural networks, anatomical connectivity, and functional connectivity based upon fMRI, EEG and MEG. These studies suggest that the human brain can be modelled as a complex network, and may have a small-world structure both at the level of anatomical as well as functional connectivity. This small-world structure is hypothesized to reflect an optimal situation associated with rapid synchronization and information transfer, minimal wiring costs, as well as a balance between local processing and global integration. The topological structure of functional networks is probably restrained by genetic and anatomical factors, but can be modified during tasks. There is also increasing evidence that various types of brain disease such as Alzheimer's disease, schizophrenia, brain tumours and epilepsy may be associated with deviations of the functional network topology from the optimal small-world pattern. PMID:17908336

Micro-Macro Analysis of Complex Networks

PubMed Central

Marchiori, Massimo; Possamai, Lino

2015-01-01

Complex systems have attracted considerable interest because of their wide range of applications, and are often studied via a “classic” approach: study a specific system, find a complex network behind it, and analyze the corresponding properties. This simple methodology has produced a great deal of interesting results, but relies on an often implicit underlying assumption: the level of detail on which the system is observed. However, in many situations, physical or abstract, the level of detail can be one out of many, and might also depend on intrinsic limitations in viewing the data with a different level of abstraction or precision. So, a fundamental question arises: do properties of a network depend on its level of observability, or are they invariant? If there is a dependence, then an apparently correct network modeling could in fact just be a bad approximation of the true behavior of a complex system. In order to answer this question, we propose a novel micro-macro analysis of complex systems that quantitatively describes how the structure of complex networks varies as a function of the detail level. To this extent, we have developed a new telescopic algorithm that abstracts from the local properties of a system and reconstructs the original structure according to a fuzziness level. This way we can study what happens when passing from a fine level of detail (“micro”) to a different scale level (“macro”), and analyze the corresponding behavior in this transition, obtaining a deeper spectrum analysis. The obtained results show that many important properties are not universally invariant with respect to the level of detail, but instead strongly depend on the specific level on which a network is observed. Therefore, caution should be taken in every situation where a complex network is considered, if its context allows for different levels of observability. PMID:25635812

Modeling and dynamical topology properties of VANET based on complex networks theory

NASA Astrophysics Data System (ADS)

Zhang, Hong; Li, Jie

2015-01-01

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What's more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

Modeling and dynamical topology properties of VANET based on complex networks theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Hong; Li, Jie, E-mail: prof.li@foxmail.com

2015-01-15

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate andmore » control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.« less

Relationship between microscopic dynamics in traffic flow and complexity in networks.

PubMed

Li, Xin-Gang; Gao, Zi-You; Li, Ke-Ping; Zhao, Xiao-Mei

2007-07-01

Complex networks are constructed in the evolution process of traffic flow, and the states of traffic flow are represented by nodes in the network. The traffic dynamics can then be studied by investigating the statistical properties of those networks. According to Kerner's three-phase theory, there are two different phases in congested traffic, synchronized flow and wide moving jam. In the framework of this theory, we study different properties of synchronized flow and moving jam in relation to complex network. Scale-free network is constructed in stop-and-go traffic, i.e., a sequence of moving jams [Chin. Phys. Lett. 10, 2711 (2005)]. In this work, the networks generated in synchronized flow are investigated in detail. Simulation results show that the degree distribution of the networks constructed in synchronized flow has two power law regions, so the distinction in topological structure can really reflect the different dynamics in traffic flow. Furthermore, the real traffic data are investigated by this method, and the results are consistent with the simulations.

Trade-offs between driving nodes and time-to-control in complex networks

PubMed Central

Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

2017-01-01

Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks. PMID:28054597

Trade-offs between driving nodes and time-to-control in complex networks

NASA Astrophysics Data System (ADS)

Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

2017-01-01

Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks.

Modeling Psychological Attributes in Psychology – An Epistemological Discussion: Network Analysis vs. Latent Variables

PubMed Central

Guyon, Hervé; Falissard, Bruno; Kop, Jean-Luc

2017-01-01

Network Analysis is considered as a new method that challenges Latent Variable models in inferring psychological attributes. With Network Analysis, psychological attributes are derived from a complex system of components without the need to call on any latent variables. But the ontological status of psychological attributes is not adequately defined with Network Analysis, because a psychological attribute is both a complex system and a property emerging from this complex system. The aim of this article is to reappraise the legitimacy of latent variable models by engaging in an ontological and epistemological discussion on psychological attributes. Psychological attributes relate to the mental equilibrium of individuals embedded in their social interactions, as robust attractors within complex dynamic processes with emergent properties, distinct from physical entities located in precise areas of the brain. Latent variables thus possess legitimacy, because the emergent properties can be conceptualized and analyzed on the sole basis of their manifestations, without exploring the upstream complex system. However, in opposition with the usual Latent Variable models, this article is in favor of the integration of a dynamic system of manifestations. Latent Variables models and Network Analysis thus appear as complementary approaches. New approaches combining Latent Network Models and Network Residuals are certainly a promising new way to infer psychological attributes, placing psychological attributes in an inter-subjective dynamic approach. Pragmatism-realism appears as the epistemological framework required if we are to use latent variables as representations of psychological attributes. PMID:28572780

Multifractal cross-correlation effects in two-variable time series of complex network vertex observables

NASA Astrophysics Data System (ADS)

OświÈ©cimka, Paweł; Livi, Lorenzo; DroŻdŻ, Stanisław

2016-10-01

We investigate the scaling of the cross-correlations calculated for two-variable time series containing vertex properties in the context of complex networks. Time series of such observables are obtained by means of stationary, unbiased random walks. We consider three vertex properties that provide, respectively, short-, medium-, and long-range information regarding the topological role of vertices in a given network. In order to reveal the relation between these quantities, we applied the multifractal cross-correlation analysis technique, which provides information about the nonlinear effects in coupling of time series. We show that the considered network models are characterized by unique multifractal properties of the cross-correlation. In particular, it is possible to distinguish between Erdös-Rényi, Barabási-Albert, and Watts-Strogatz networks on the basis of fractal cross-correlation. Moreover, the analysis of protein contact networks reveals characteristics shared with both scale-free and small-world models.

Complex networks as an emerging property of hierarchical preferential attachment.

PubMed

Hébert-Dufresne, Laurent; Laurence, Edward; Allard, Antoine; Young, Jean-Gabriel; Dubé, Louis J

2015-12-01

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of complex systems can be modeled as an organization of many embedded levels (potentially infinite in number), all of them following the same universal growth principle known as preferential attachment. We give examples of such hierarchy in real systems, for instance, in the pyramid of production entities of the film industry. More importantly, we show how real complex networks can be interpreted as a projection of our model, from which their scale independence, their clustering, their hierarchy, their fractality, and their navigability naturally emerge. Our results suggest that complex networks, viewed as growing systems, can be quite simple, and that the apparent complexity of their structure is largely a reflection of their unobserved hierarchical nature.

Complex networks as an emerging property of hierarchical preferential attachment

NASA Astrophysics Data System (ADS)

Hébert-Dufresne, Laurent; Laurence, Edward; Allard, Antoine; Young, Jean-Gabriel; Dubé, Louis J.

2015-12-01

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of complex systems can be modeled as an organization of many embedded levels (potentially infinite in number), all of them following the same universal growth principle known as preferential attachment. We give examples of such hierarchy in real systems, for instance, in the pyramid of production entities of the film industry. More importantly, we show how real complex networks can be interpreted as a projection of our model, from which their scale independence, their clustering, their hierarchy, their fractality, and their navigability naturally emerge. Our results suggest that complex networks, viewed as growing systems, can be quite simple, and that the apparent complexity of their structure is largely a reflection of their unobserved hierarchical nature.

Optimizing Nutrient Uptake in Biological Transport Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

2013-03-01

Many biological systems employ complex networks of vascular tubes to facilitate transport of solute nutrients, examples include the vascular system of plants (phloem), some fungi, and the slime-mold Physarum. It is believed that such networks are optimized through evolution for carrying out their designated task. We propose a set of hydrodynamic governing equations for solute transport in a complex network, and obtain the optimal network architecture for various classes of optimizing functionals. We finally discuss the topological properties and statistical mechanics of the resulting complex networks, and examine correspondence of the obtained networks to those found in actual biological systems.

[Neuronal and synaptic properties: fundamentals of network plasticity].

PubMed

Le Masson, G

2000-02-01

Neurons, within the nervous system, are organized in different neural networks through synaptic connections. Two fundamental components are dynamically interacting in these functional units. The first one are the neurons themselves, and far from being simple action potential generators, they are capable of complex electrical integrative properties due to various types, number, distribution and modulation of voltage-gated ionic channels. The second elements are the synapses where a similar complexity and plasticity is found. Identifying both cellular and synaptic intrinsic properties is necessary to understand the links between neural networks behavior and physiological function, and is a useful step towards a better control of neurological diseases.

Robustness and structure of complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai

This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks are much more vulnerable to localized attack compared with random attack. In the second part, we extend the tree-like generating function method to incorporating clustering structure in complex networks. We study the robustness of a complex network system, especially a network of networks (NON) with clustering structure in each network. We find that the system becomes less robust as we increase the clustering coefficient of each network. For a partially dependent network system, we also find that the influence of the clustering coefficient on network robustness decreases as we decrease the coupling strength, and the critical coupling strength qc, at which the first-order phase transition changes to second-order, increases as we increase the clustering coefficient.

Statistically Validated Networks in Bipartite Complex Systems

PubMed Central

Tumminello, Michele; Miccichè, Salvatore; Lillo, Fabrizio; Piilo, Jyrki; Mantegna, Rosario N.

2011-01-01

Many complex systems present an intrinsic bipartite structure where elements of one set link to elements of the second set. In these complex systems, such as the system of actors and movies, elements of one set are qualitatively different than elements of the other set. The properties of these complex systems are typically investigated by constructing and analyzing a projected network on one of the two sets (for example the actor network or the movie network). Complex systems are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set, and this heterogeneity makes it very difficult to discriminate links of the projected network that are just reflecting system's heterogeneity from links relevant to unveil the properties of the system. Here we introduce an unsupervised method to statistically validate each link of a projected network against a null hypothesis that takes into account system heterogeneity. We apply the method to a biological, an economic and a social complex system. The method we propose is able to detect network structures which are very informative about the organization and specialization of the investigated systems, and identifies those relationships between elements of the projected network that cannot be explained simply by system heterogeneity. We also show that our method applies to bipartite systems in which different relationships might have different qualitative nature, generating statistically validated networks in which such difference is preserved. PMID:21483858

Complex and unexpected dynamics in simple genetic regulatory networks

NASA Astrophysics Data System (ADS)

Borg, Yanika; Ullner, Ekkehard; Alagha, Afnan; Alsaedi, Ahmed; Nesbeth, Darren; Zaikin, Alexey

2014-03-01

One aim of synthetic biology is to construct increasingly complex genetic networks from interconnected simpler ones to address challenges in medicine and biotechnology. However, as systems increase in size and complexity, emergent properties lead to unexpected and complex dynamics due to nonlinear and nonequilibrium properties from component interactions. We focus on four different studies of biological systems which exhibit complex and unexpected dynamics. Using simple synthetic genetic networks, small and large populations of phase-coupled quorum sensing repressilators, Goodwin oscillators, and bistable switches, we review how coupled and stochastic components can result in clustering, chaos, noise-induced coherence and speed-dependent decision making. A system of repressilators exhibits oscillations, limit cycles, steady states or chaos depending on the nature and strength of the coupling mechanism. In large repressilator networks, rich dynamics can also be exhibited, such as clustering and chaos. In populations of Goodwin oscillators, noise can induce coherent oscillations. In bistable systems, the speed with which incoming external signals reach steady state can bias the network towards particular attractors. These studies showcase the range of dynamical behavior that simple synthetic genetic networks can exhibit. In addition, they demonstrate the ability of mathematical modeling to analyze nonlinearity and inhomogeneity within these systems.

The use of network analysis to study complex animal communication systems: a study on nightingale song.

PubMed

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-06-22

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the 'small-world' character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval.

The use of network analysis to study complex animal communication systems: a study on nightingale song

PubMed Central

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-01-01

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the ‘small-world’ character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval. PMID:24807258

A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks

NASA Astrophysics Data System (ADS)

Yasami, Yasser; Safaei, Farshad

2018-02-01

The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of cascade prediction in terms of accuracy.

Properties of a memory network in psychology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wedemann, Roseli S.; Donangelo, Raul; Carvalho, Luis A. V. de

We have previously described neurotic psychopathology and psychoanalytic working-through by an associative memory mechanism, based on a neural network model, where memory was modelled by a Boltzmann machine (BM). Since brain neural topology is selectively structured, we simulated known microscopic mechanisms that control synaptic properties, showing that the network self-organizes to a hierarchical, clustered structure. Here, we show some statistical mechanical properties of the complex networks which result from this self-organization. They indicate that a generalization of the BM may be necessary to model memory.

Properties of a memory network in psychology

NASA Astrophysics Data System (ADS)

Wedemann, Roseli S.; Donangelo, Raul; de Carvalho, Luís A. V.

2007-12-01

We have previously described neurotic psychopathology and psychoanalytic working-through by an associative memory mechanism, based on a neural network model, where memory was modelled by a Boltzmann machine (BM). Since brain neural topology is selectively structured, we simulated known microscopic mechanisms that control synaptic properties, showing that the network self-organizes to a hierarchical, clustered structure. Here, we show some statistical mechanical properties of the complex networks which result from this self-organization. They indicate that a generalization of the BM may be necessary to model memory.

Interactome Networks and Human Disease

PubMed Central

Vidal, Marc; Cusick, Michael E.; Barabási, Albert-László

2011-01-01

Complex biological systems and cellular networks may underlie most genotype to phenotype relationships. Here we review basic concepts in network biology, discussing different types of interactome networks and the insights that can come from analyzing them. We elaborate on why interactome networks are important to consider in biology, how they can be mapped and integrated with each other, what global properties are starting to emerge from interactome network models, and how these properties may relate to human disease. PMID:21414488

Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

2016-04-01

Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their macroscopic properties. Here, we propose a hierarchy of null models to generate random surrogates from a given spatially embedded network that can preserve certain global and local statistics associated with the nodes' embedding in a metric space. Comparing the original network's and the resulting surrogates' global characteristics allows one to quantify to what extent these characteristics are already predetermined by the spatial embedding of the nodes and links. We apply our framework to various real-world spatial networks and show that the proposed models capture macroscopic properties of the networks under study much better than standard random network models that do not account for the nodes' spatial embedding. Depending on the actual performance of the proposed null models, the networks are categorized into different classes. Since many real-world complex networks are in fact spatial networks, the proposed approach is relevant for disentangling the underlying complex system structure from spatial embedding of nodes in many fields, ranging from social systems over infrastructure and neurophysiology to climatology.

The new challenges of multiplex networks: Measures and models

NASA Astrophysics Data System (ADS)

Battiston, Federico; Nicosia, Vincenzo; Latora, Vito

2017-02-01

What do societies, the Internet, and the human brain have in common? They are all examples of complex relational systems, whose emerging behaviours are largely determined by the non-trivial networks of interactions among their constituents, namely individuals, computers, or neurons, rather than only by the properties of the units themselves. In the last two decades, network scientists have proposed models of increasing complexity to better understand real-world systems. Only recently we have realised that multiplexity, i.e. the coexistence of several types of interactions among the constituents of a complex system, is responsible for substantial qualitative and quantitative differences in the type and variety of behaviours that a complex system can exhibit. As a consequence, multilayer and multiplex networks have become a hot topic in complexity science. Here we provide an overview of some of the measures proposed so far to characterise the structure of multiplex networks, and a selection of models aiming at reproducing those structural properties and quantifying their statistical significance. Focusing on a subset of relevant topics, this brief review is a quite comprehensive introduction to the most basic tools for the analysis of multiplex networks observed in the real-world. The wide applicability of multiplex networks as a framework to model complex systems in different fields, from biology to social sciences, and the colloquial tone of the paper will make it an interesting read for researchers working on both theoretical and experimental analysis of networked systems.

Distributed rewiring model for complex networking: The effect of local rewiring rules on final structural properties.

PubMed

López Chavira, Magali Alexander; Marcelín-Jiménez, Ricardo

2017-01-01

The study of complex networks has become an important subject over the last decades. It has been shown that these structures have special features, such as their diameter, or their average path length, which in turn are the explanation of some functional properties in a system such as its fault tolerance, its fragility before attacks, or the ability to support routing procedures. In the present work, we study some of the forces that help a network to evolve to the point where structural properties are settled. Although our work is mainly focused on the possibility of applying our ideas to Information and Communication Technologies systems, we consider that our results may contribute to understanding different scenarios where complex networks have become an important modeling tool. Using a discrete event simulator, we get each node to discover the shortcuts that may connect it with regions away from its local environment. Based on this partial knowledge, each node can rewire some of its links, which allows modifying the topology of the entire underlying graph to achieve new structural properties. We proposed a distributed rewiring model that creates networks with features similar to those found in complex networks. Although each node acts in a distributed way and seeking to reduce only the trajectories of its packets, we observed a decrease of diameter and an increase in clustering coefficient in the global structure compared to the initial graph. Furthermore, we can find different final structures depending on slight changes in the local rewiring rules.

Discovering Network Structure Beyond Communities

NASA Astrophysics Data System (ADS)

Nishikawa, Takashi; Motter, Adilson E.

2011-11-01

To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving network structure remains a challenging problem. Here we overcome this difficulty by combining the visual pattern recognition ability of humans with the high processing speed of computers to develop an exploratory method for discovering groups of nodes characterized by common network properties, including but not limited to communities of densely connected nodes. Without any prior information about the nature of the groups, the method simultaneously identifies the number of groups, the group assignment, and the properties that define these groups. The results of applying our method to real networks suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest.

Multiscale unfolding of real networks by geometric renormalization

NASA Astrophysics Data System (ADS)

García-Pérez, Guillermo; Boguñá, Marián; Serrano, M. Ángeles

2018-06-01

Symmetries in physical theories denote invariance under some transformation, such as self-similarity under a change of scale. The renormalization group provides a powerful framework to study these symmetries, leading to a better understanding of the universal properties of phase transitions. However, the small-world property of complex networks complicates application of the renormalization group by introducing correlations between coexisting scales. Here, we provide a framework for the investigation of complex networks at different resolutions. The approach is based on geometric representations, which have been shown to sustain network navigability and to reveal the mechanisms that govern network structure and evolution. We define a geometric renormalization group for networks by embedding them into an underlying hidden metric space. We find that real scale-free networks show geometric scaling under this renormalization group transformation. We unfold the networks in a self-similar multilayer shell that distinguishes the coexisting scales and their interactions. This in turn offers a basis for exploring critical phenomena and universality in complex networks. It also affords us immediate practical applications, including high-fidelity smaller-scale replicas of large networks and a multiscale navigation protocol in hyperbolic space, which betters those on single layers.

Approaching human language with complex networks

NASA Astrophysics Data System (ADS)

Cong, Jin; Liu, Haitao

2014-12-01

The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics).

A framework for evaluating complex networks measurements

NASA Astrophysics Data System (ADS)

Comin, Cesar H.; Silva, Filipi N.; Costa, Luciano da F.

2015-06-01

A good deal of current research in complex networks involves the characterization and/or classification of the topological properties of given structures, which has motivated several respective measurements. This letter proposes a framework for evaluating the quality of complex-network measurements in terms of their effective resolution, degree of degeneracy and discriminability. The potential of the suggested approach is illustrated with respect to comparing the characterization of several model and real-world networks by using concentric and symmetry measurements. The results indicate a markedly superior performance for the latter type of mapping.

Detection of protein complex from protein-protein interaction network using Markov clustering

NASA Astrophysics Data System (ADS)

Ochieng, P. J.; Kusuma, W. A.; Haryanto, T.

2017-05-01

Detection of complexes, or groups of functionally related proteins, is an important challenge while analysing biological networks. However, existing algorithms to identify protein complexes are insufficient when applied to dense networks of experimentally derived interaction data. Therefore, we introduced a graph clustering method based on Markov clustering algorithm to identify protein complex within highly interconnected protein-protein interaction networks. Protein-protein interaction network was first constructed to develop geometrical network, the network was then partitioned using Markov clustering to detect protein complexes. The interest of the proposed method was illustrated by its application to Human Proteins associated to type II diabetes mellitus. Flow simulation of MCL algorithm was initially performed and topological properties of the resultant network were analysed for detection of the protein complex. The results indicated the proposed method successfully detect an overall of 34 complexes with 11 complexes consisting of overlapping modules and 20 non-overlapping modules. The major complex consisted of 102 proteins and 521 interactions with cluster modularity and density of 0.745 and 0.101 respectively. The comparison analysis revealed MCL out perform AP, MCODE and SCPS algorithms with high clustering coefficient (0.751) network density and modularity index (0.630). This demonstrated MCL was the most reliable and efficient graph clustering algorithm for detection of protein complexes from PPI networks.

Mapping and discrimination of networks in the complexity-entropy plane

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here we explore the possibility to classify complex networks by means of a statistical complexity measure that has formerly been successfully applied to distinguish different types of chaotic and stochastic time series. It is composed of a network's averaged per-node entropic measure characterizing the network's information content and the associated Jenson-Shannon divergence as a measure of disequilibrium. We study 29 real-world networks and show that networks of the same category tend to cluster in distinct areas of the resulting complexity-entropy plane. We demonstrate that within our framework, connectome networks exhibit among the highest complexity while, e.g., transportation and infrastructure networks display significantly lower values. Furthermore, we demonstrate the utility of our framework by applying it to families of random scale-free and Watts-Strogatz model networks. We then show in a second application that the proposed framework is useful to objectively construct threshold-based networks, such as functional climate networks or recurrence networks, by choosing the threshold such that the statistical network complexity is maximized.

Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chinthavali, Supriya

Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) andmore » the criticality index is found to be effective for one test network to identify the vulnerable nodes.« less

Stability and dynamical properties of material flow systems on random networks

NASA Astrophysics Data System (ADS)

Anand, K.; Galla, T.

2009-04-01

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.

Centralities in simplicial complexes. Applications to protein interaction networks.

PubMed

Estrada, Ernesto; Ross, Grant J

2018-02-07

Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness, betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes. We study the degree distributions of these centralities at the different levels. We also compare and describe the differences between the centralities at the different levels. Using these centralities we study a method for detecting essential proteins in PPI networks of cells and explain the varying abilities of the centrality measures at the different levels in identifying these essential proteins. Copyright © 2017 Elsevier Ltd. All rights reserved.

On the sufficiency of pairwise interactions in maximum entropy models of networks

NASA Astrophysics Data System (ADS)

Nemenman, Ilya; Merchan, Lina

Biological information processing networks consist of many components, which are coupled by an even larger number of complex multivariate interactions. However, analyses of data sets from fields as diverse as neuroscience, molecular biology, and behavior have reported that observed statistics of states of some biological networks can be approximated well by maximum entropy models with only pairwise interactions among the components. Based on simulations of random Ising spin networks with p-spin (p > 2) interactions, here we argue that this reduction in complexity can be thought of as a natural property of some densely interacting networks in certain regimes, and not necessarily as a special property of living systems. This work was supported in part by James S. McDonnell Foundation Grant No. 220020321.

Multifractal analysis and topological properties of a new family of weighted Koch networks

NASA Astrophysics Data System (ADS)

Huang, Da-Wen; Yu, Zu-Guo; Anh, Vo

2017-03-01

Weighted complex networks, especially scale-free networks, which characterize real-life systems better than non-weighted networks, have attracted considerable interest in recent years. Studies on the multifractality of weighted complex networks are still to be undertaken. In this paper, inspired by the concepts of Koch networks and Koch island, we propose a new family of weighted Koch networks, and investigate their multifractal behavior and topological properties. We find some key topological properties of the new networks: their vertex cumulative strength has a power-law distribution; there is a power-law relationship between their topological degree and weight strength; the networks have a high weighted clustering coefficient of 0.41004 (which is independent of the scaling factor c) in the limit of large generation t; the second smallest eigenvalue μ2 and the maximum eigenvalue μn are approximated by quartic polynomials of the scaling factor c for the general Laplacian operator, while μ2 is approximately a quartic polynomial of c and μn= 1.5 for the normalized Laplacian operator. Then, we find that weighted koch networks are both fractal and multifractal, their fractal dimension is influenced by the scaling factor c. We also apply these analyses to six real-world networks, and find that the multifractality in three of them are strong.

Identifying protein complexes in PPI network using non-cooperative sequential game.

PubMed

Maulik, Ujjwal; Basu, Srinka; Ray, Sumanta

2017-08-21

Identifying protein complexes from protein-protein interaction (PPI) network is an important and challenging task in computational biology as it helps in better understanding of cellular mechanisms in various organisms. In this paper we propose a noncooperative sequential game based model for protein complex detection from PPI network. The key hypothesis is that protein complex formation is driven by mechanism that eventually optimizes the number of interactions within the complex leading to dense subgraph. The hypothesis is drawn from the observed network property named small world. The proposed multi-player game model translates the hypothesis into the game strategies. The Nash equilibrium of the game corresponds to a network partition where each protein either belong to a complex or form a singleton cluster. We further propose an algorithm to find the Nash equilibrium of the sequential game. The exhaustive experiment on synthetic benchmark and real life yeast networks evaluates the structural as well as biological significance of the network partitions.

Stability and structural properties of gene regulation networks with coregulation rules.

PubMed

Warrell, Jonathan; Mhlanga, Musa

2017-05-07

Coregulation of the expression of groups of genes has been extensively demonstrated empirically in bacterial and eukaryotic systems. Such coregulation can arise through the use of shared regulatory motifs, which allow the coordinated expression of modules (and module groups) of functionally related genes across the genome. Coregulation can also arise through the physical association of multi-gene complexes through chromosomal looping, which are then transcribed together. We present a general formalism for modeling coregulation rules in the framework of Random Boolean Networks (RBN), and develop specific models for transcription factor networks with modular structure (including module groups, and multi-input modules (MIM) with autoregulation) and multi-gene complexes (including hierarchical differentiation between multi-gene complex members). We develop a mean-field approach to analyse the dynamical stability of large networks incorporating coregulation, and show that autoregulated MIM and hierarchical gene-complex models can achieve greater stability than networks without coregulation whose rules have matching activation frequency. We provide further analysis of the stability of small networks of both kinds through simulations. We also characterize several general properties of the transients and attractors in the hierarchical coregulation model, and show using simulations that the steady-state distribution factorizes hierarchically as a Bayesian network in a Markov Jump Process analogue of the RBN model. Copyright © 2017. Published by Elsevier Ltd.

Percolation and Reinforcement on Complex Networks

NASA Astrophysics Data System (ADS)

Yuan, Xin

Complex networks appear in almost every aspect of our daily life and are widely studied in the fields of physics, mathematics, finance, biology and computer science. This work utilizes percolation theory in statistical physics to explore the percolation properties of complex networks and develops a reinforcement scheme on improving network resilience. This dissertation covers two major parts of my Ph.D. research on complex networks: i) probe--in the context of both traditional percolation and k-core percolation--the resilience of complex networks with tunable degree distributions or directed dependency links under random, localized or targeted attacks; ii) develop and propose a reinforcement scheme to eradicate catastrophic collapses that occur very often in interdependent networks. We first use generating function and probabilistic methods to obtain analytical solutions to percolation properties of interest, such as the giant component size and the critical occupation probability. We study uncorrelated random networks with Poisson, bi-Poisson, power-law, and Kronecker-delta degree distributions and construct those networks which are based on the configuration model. The computer simulation results show remarkable agreement with theoretical predictions. We discover an increase of network robustness as the degree distribution broadens and a decrease of network robustness as directed dependency links come into play under random attacks. We also find that targeted attacks exert the biggest damage to the structure of both single and interdependent networks in k-core percolation. To strengthen the resilience of interdependent networks, we develop and propose a reinforcement strategy and obtain the critical amount of reinforced nodes analytically for interdependent Erdḧs-Renyi networks and numerically for scale-free and for random regular networks. Our mechanism leads to improvement of network stability of the West U.S. power grid. This dissertation provides us with a deeper understanding of the effects of structural features on network stability and fresher insights into designing resilient interdependent infrastructure networks.

Characterizing air quality data from complex network perspective.

PubMed

Fan, Xinghua; Wang, Li; Xu, Huihui; Li, Shasha; Tian, Lixin

2016-02-01

Air quality depends mainly on changes in emission of pollutants and their precursors. Understanding its characteristics is the key to predicting and controlling air quality. In this study, complex networks were built to analyze topological characteristics of air quality data by correlation coefficient method. Firstly, PM2.5 (particulate matter with aerodynamic diameter less than 2.5 μm) indexes of eight monitoring sites in Beijing were selected as samples from January 2013 to December 2014. Secondly, the C-C method was applied to determine the structure of phase space. Points in the reconstructed phase space were considered to be nodes of the network mapped. Then, edges were determined by nodes having the correlation greater than a critical threshold. Three properties of the constructed networks, degree distribution, clustering coefficient, and modularity, were used to determine the optimal value of the critical threshold. Finally, by analyzing and comparing topological properties, we pointed out that similarities and difference in the constructed complex networks revealed influence factors and their different roles on real air quality system.

Connecting Core Percolation and Controllability of Complex Networks

PubMed Central

Jia, Tao; Pósfai, Márton

2014-01-01

Core percolation is a fundamental structural transition in complex networks related to a wide range of important problems. Recent advances have provided us an analytical framework of core percolation in uncorrelated random networks with arbitrary degree distributions. Here we apply the tools in analysis of network controllability. We confirm analytically that the emergence of the bifurcation in control coincides with the formation of the core and the structure of the core determines the control mode of the network. We also derive the analytical expression related to the controllability robustness by extending the deduction in core percolation. These findings help us better understand the interesting interplay between the structural and dynamical properties of complex networks. PMID:24946797

Evolving Scale-Free Networks by Poisson Process: Modeling and Degree Distribution.

PubMed

Feng, Minyu; Qu, Hong; Yi, Zhang; Xie, Xiurui; Kurths, Jurgen

2016-05-01

Since the great mathematician Leonhard Euler initiated the study of graph theory, the network has been one of the most significant research subject in multidisciplinary. In recent years, the proposition of the small-world and scale-free properties of complex networks in statistical physics made the network science intriguing again for many researchers. One of the challenges of the network science is to propose rational models for complex networks. In this paper, in order to reveal the influence of the vertex generating mechanism of complex networks, we propose three novel models based on the homogeneous Poisson, nonhomogeneous Poisson and birth death process, respectively, which can be regarded as typical scale-free networks and utilized to simulate practical networks. The degree distribution and exponent are analyzed and explained in mathematics by different approaches. In the simulation, we display the modeling process, the degree distribution of empirical data by statistical methods, and reliability of proposed networks, results show our models follow the features of typical complex networks. Finally, some future challenges for complex systems are discussed.

CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks

NASA Astrophysics Data System (ADS)

Franke, R.

2016-11-01

In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.

Approaching human language with complex networks.

PubMed

Cong, Jin; Liu, Haitao

2014-12-01

The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics). Copyright © 2014 Elsevier B.V. All rights reserved.

Dual-phase evolution in complex adaptive systems

PubMed Central

Paperin, Greg; Green, David G.; Sadedin, Suzanne

2011-01-01

Understanding the origins of complexity is a key challenge in many sciences. Although networks are known to underlie most systems, showing how they contribute to well-known phenomena remains an issue. Here, we show that recurrent phase transitions in network connectivity underlie emergent phenomena in many systems. We identify properties that are typical of systems in different connectivity phases, as well as characteristics commonly associated with the phase transitions. We synthesize these common features into a common framework, which we term dual-phase evolution (DPE). Using this framework, we review the literature from several disciplines to show that recurrent connectivity phase transitions underlie the complex properties of many biological, physical and human systems. We argue that the DPE framework helps to explain many complex phenomena, including perpetual novelty, modularity, scale-free networks and criticality. Our review concludes with a discussion of the way DPE relates to other frameworks, in particular, self-organized criticality and the adaptive cycle. PMID:21247947

Dual-phase evolution in complex adaptive systems.

PubMed

Paperin, Greg; Green, David G; Sadedin, Suzanne

2011-05-06

Understanding the origins of complexity is a key challenge in many sciences. Although networks are known to underlie most systems, showing how they contribute to well-known phenomena remains an issue. Here, we show that recurrent phase transitions in network connectivity underlie emergent phenomena in many systems. We identify properties that are typical of systems in different connectivity phases, as well as characteristics commonly associated with the phase transitions. We synthesize these common features into a common framework, which we term dual-phase evolution (DPE). Using this framework, we review the literature from several disciplines to show that recurrent connectivity phase transitions underlie the complex properties of many biological, physical and human systems. We argue that the DPE framework helps to explain many complex phenomena, including perpetual novelty, modularity, scale-free networks and criticality. Our review concludes with a discussion of the way DPE relates to other frameworks, in particular, self-organized criticality and the adaptive cycle.

Evolution of weighted complex bus transit networks with flow

NASA Astrophysics Data System (ADS)

Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

2016-02-01

Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

Infection dynamics on spatial small-world network models

NASA Astrophysics Data System (ADS)

Iotti, Bryan; Antonioni, Alberto; Bullock, Seth; Darabos, Christian; Tomassini, Marco; Giacobini, Mario

2017-11-01

The study of complex networks, and in particular of social networks, has mostly concentrated on relational networks, abstracting the distance between nodes. Spatial networks are, however, extremely relevant in our daily lives, and a large body of research exists to show that the distances between nodes greatly influence the cost and probability of establishing and maintaining a link. A random geometric graph (RGG) is the main type of synthetic network model used to mimic the statistical properties and behavior of many social networks. We propose a model, called REDS, that extends energy-constrained RGGs to account for the synergic effect of sharing the cost of a link with our neighbors, as is observed in real relational networks. We apply both the standard Watts-Strogatz rewiring procedure and another method that conserves the degree distribution of the network. The second technique was developed to eliminate unwanted forms of spatial correlation between the degree of nodes that are affected by rewiring, limiting the effect on other properties such as clustering and assortativity. We analyze both the statistical properties of these two network types and their epidemiological behavior when used as a substrate for a standard susceptible-infected-susceptible compartmental model. We consider and discuss the differences in properties and behavior between RGGs and REDS as rewiring increases and as infection parameters are changed. We report considerable differences both between the network types and, in the case of REDS, between the two rewiring schemes. We conclude that REDS represent, with the application of these rewiring mechanisms, extremely useful and interesting tools in the study of social and epidemiological phenomena in synthetic complex networks.

Interdisciplinary and physics challenges of network theory

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

2015-09-01

Network theory has unveiled the underlying structure of complex systems such as the Internet or the biological networks in the cell. It has identified universal properties of complex networks, and the interplay between their structure and dynamics. After almost twenty years of the field, new challenges lie ahead. These challenges concern the multilayer structure of most of the networks, the formulation of a network geometry and topology, and the development of a quantum theory of networks. Making progress on these aspects of network theory can open new venues to address interdisciplinary and physics challenges including progress on brain dynamics, new insights into quantum technologies, and quantum gravity.

Exploring network operations for data and information networks

NASA Astrophysics Data System (ADS)

Yao, Bing; Su, Jing; Ma, Fei; Wang, Xiaomin; Zhao, Xiyang; Yao, Ming

2017-01-01

Barabási and Albert, in 1999, formulated scale-free models based on some real networks: World-Wide Web, Internet, metabolic and protein networks, language or sexual networks. Scale-free networks not only appear around us, but also have high qualities in the world. As known, high quality information networks can transfer feasibly and efficiently data, clearly, their topological structures are very important for data safety. We build up network operations for constructing large scale of dynamic networks from smaller scale of network models having good property and high quality. We focus on the simplest operators to formulate complex operations, and are interesting on the closeness of operations to desired network properties.

A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities

NASA Astrophysics Data System (ADS)

Muscoloni, Alessandro; Vittorio Cannistraci, Carlo

2018-05-01

The investigation of the hidden metric space behind complex network topologies is a fervid topic in current network science and the hyperbolic space is one of the most studied, because it seems associated to the structural organization of many real complex systems. The popularity-similarity-optimization (PSO) model simulates how random geometric graphs grow in the hyperbolic space, generating realistic networks with clustering, small-worldness, scale-freeness and rich-clubness. However, it misses to reproduce an important feature of real complex networks, which is the community organization. The geometrical-preferential-attachment (GPA) model was recently developed in order to confer to the PSO also a soft community structure, which is obtained by forcing different angular regions of the hyperbolic disk to have a variable level of attractiveness. However, the number and size of the communities cannot be explicitly controlled in the GPA, which is a clear limitation for real applications. Here, we introduce the nonuniform PSO (nPSO) model. Differently from GPA, the nPSO generates synthetic networks in the hyperbolic space where heterogeneous angular node attractiveness is forced by sampling the angular coordinates from a tailored nonuniform probability distribution (for instance a mixture of Gaussians). The nPSO differs from GPA in other three aspects: it allows one to explicitly fix the number and size of communities; it allows one to tune their mixing property by means of the network temperature; it is efficient to generate networks with high clustering. Several tests on the detectability of the community structure in nPSO synthetic networks and wide investigations on their structural properties confirm that the nPSO is a valid and efficient model to generate realistic complex networks with communities.

A Complex Network Approach to Stylometry

PubMed Central

Amancio, Diego Raphael

2015-01-01

Statistical methods have been widely employed to study the fundamental properties of language. In recent years, methods from complex and dynamical systems proved useful to create several language models. Despite the large amount of studies devoted to represent texts with physical models, only a limited number of studies have shown how the properties of the underlying physical systems can be employed to improve the performance of natural language processing tasks. In this paper, I address this problem by devising complex networks methods that are able to improve the performance of current statistical methods. Using a fuzzy classification strategy, I show that the topological properties extracted from texts complement the traditional textual description. In several cases, the performance obtained with hybrid approaches outperformed the results obtained when only traditional or networked methods were used. Because the proposed model is generic, the framework devised here could be straightforwardly used to study similar textual applications where the topology plays a pivotal role in the description of the interacting agents. PMID:26313921

Modeling complexity in engineered infrastructure system: Water distribution network as an example

NASA Astrophysics Data System (ADS)

Zeng, Fang; Li, Xiang; Li, Ke

2017-02-01

The complex topology and adaptive behavior of infrastructure systems are driven by both self-organization of the demand and rigid engineering solutions. Therefore, engineering complex systems requires a method balancing holism and reductionism. To model the growth of water distribution networks, a complex network model was developed following the combination of local optimization rules and engineering considerations. The demand node generation is dynamic and follows the scaling law of urban growth. The proposed model can generate a water distribution network (WDN) similar to reported real-world WDNs on some structural properties. Comparison with different modeling approaches indicates that a realistic demand node distribution and co-evolvement of demand node and network are important for the simulation of real complex networks. The simulation results indicate that the efficiency of water distribution networks is exponentially affected by the urban growth pattern. On the contrary, the improvement of efficiency by engineering optimization is limited and relatively insignificant. The redundancy and robustness, on another aspect, can be significantly improved through engineering methods.

Combinatorial complexity of pathway analysis in metabolic networks.

PubMed

Klamt, Steffen; Stelling, Jörg

2002-01-01

Elementary flux mode analysis is a promising approach for a pathway-oriented perspective of metabolic networks. However, in larger networks it is hampered by the combinatorial explosion of possible routes. In this work we give some estimations on the combinatorial complexity including theoretical upper bounds for the number of elementary flux modes in a network of a given size. In a case study, we computed the elementary modes in the central metabolism of Escherichia coli while utilizing four different substrates. Interestingly, although the number of modes occurring in this complex network can exceed half a million, it is still far below the upper bound. Hence, to a certain extent, pathway analysis of central catabolism is feasible to assess network properties such as flexibility and functionality.

Synchronization of networked chaotic oscillators under external periodic driving.

PubMed

Yang, Wenchao; Lin, Weijie; Wang, Xingang; Huang, Liang

2015-03-01

The dynamical responses of a complex system to external perturbations are of both fundamental interest and practical significance. Here, by the model of networked chaotic oscillators, we investigate how the synchronization behavior of a complex network is influenced by an externally added periodic driving. Interestingly, it is found that by a slight change of the properties of the external driving, e.g., the frequency or phase lag between its intrinsic oscillation and external driving, the network synchronizability could be significantly modified. We demonstrate this phenomenon by different network models and, based on the method of master stability function, give an analysis on the underlying mechanisms. Our studies highlight the importance of external perturbations on the collective behaviors of complex networks, and also provide an alternate approach for controlling network synchronization.

Characterization of known protein complexes using k-connectivity and other topological measures

PubMed Central

Gallagher, Suzanne R; Goldberg, Debra S

2015-01-01

Many protein complexes are densely packed, so proteins within complexes often interact with several other proteins in the complex. Steric constraints prevent most proteins from simultaneously binding more than a handful of other proteins, regardless of the number of proteins in the complex. Because of this, as complex size increases, several measures of the complex decrease within protein-protein interaction networks. However, k-connectivity, the number of vertices or edges that need to be removed in order to disconnect a graph, may be consistently high for protein complexes. The property of k-connectivity has been little used previously in the investigation of protein-protein interactions. To understand the discriminative power of k-connectivity and other topological measures for identifying unknown protein complexes, we characterized these properties in known Saccharomyces cerevisiae protein complexes in networks generated both from highly accurate X-ray crystallography experiments which give an accurate model of each complex, and also as the complexes appear in high-throughput yeast 2-hybrid studies in which new complexes may be discovered. We also computed these properties for appropriate random subgraphs.We found that clustering coefficient, mutual clustering coefficient, and k-connectivity are better indicators of known protein complexes than edge density, degree, or betweenness. This suggests new directions for future protein complex-finding algorithms. PMID:26913183

Clustering drug-drug interaction networks with energy model layouts: community analysis and drug repurposing.

PubMed

Udrescu, Lucreţia; Sbârcea, Laura; Topîrceanu, Alexandru; Iovanovici, Alexandru; Kurunczi, Ludovic; Bogdan, Paul; Udrescu, Mihai

2016-09-07

Analyzing drug-drug interactions may unravel previously unknown drug action patterns, leading to the development of new drug discovery tools. We present a new approach to analyzing drug-drug interaction networks, based on clustering and topological community detection techniques that are specific to complex network science. Our methodology uncovers functional drug categories along with the intricate relationships between them. Using modularity-based and energy-model layout community detection algorithms, we link the network clusters to 9 relevant pharmacological properties. Out of the 1141 drugs from the DrugBank 4.1 database, our extensive literature survey and cross-checking with other databases such as Drugs.com, RxList, and DrugBank 4.3 confirm the predicted properties for 85% of the drugs. As such, we argue that network analysis offers a high-level grasp on a wide area of pharmacological aspects, indicating possible unaccounted interactions and missing pharmacological properties that can lead to drug repositioning for the 15% drugs which seem to be inconsistent with the predicted property. Also, by using network centralities, we can rank drugs according to their interaction potential for both simple and complex multi-pathology therapies. Moreover, our clustering approach can be extended for applications such as analyzing drug-target interactions or phenotyping patients in personalized medicine applications.

Clustering drug-drug interaction networks with energy model layouts: community analysis and drug repurposing

PubMed Central

Udrescu, Lucreţia; Sbârcea, Laura; Topîrceanu, Alexandru; Iovanovici, Alexandru; Kurunczi, Ludovic; Bogdan, Paul; Udrescu, Mihai

2016-01-01

Analyzing drug-drug interactions may unravel previously unknown drug action patterns, leading to the development of new drug discovery tools. We present a new approach to analyzing drug-drug interaction networks, based on clustering and topological community detection techniques that are specific to complex network science. Our methodology uncovers functional drug categories along with the intricate relationships between them. Using modularity-based and energy-model layout community detection algorithms, we link the network clusters to 9 relevant pharmacological properties. Out of the 1141 drugs from the DrugBank 4.1 database, our extensive literature survey and cross-checking with other databases such as Drugs.com, RxList, and DrugBank 4.3 confirm the predicted properties for 85% of the drugs. As such, we argue that network analysis offers a high-level grasp on a wide area of pharmacological aspects, indicating possible unaccounted interactions and missing pharmacological properties that can lead to drug repositioning for the 15% drugs which seem to be inconsistent with the predicted property. Also, by using network centralities, we can rank drugs according to their interaction potential for both simple and complex multi-pathology therapies. Moreover, our clustering approach can be extended for applications such as analyzing drug-target interactions or phenotyping patients in personalized medicine applications. PMID:27599720

Spectral properties of Google matrix of Wikipedia and other networks

NASA Astrophysics Data System (ADS)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2013-05-01

We study the properties of eigenvalues and eigenvectors of the Google matrix of the Wikipedia articles hyperlink network and other real networks. With the help of the Arnoldi method, we analyze the distribution of eigenvalues in the complex plane and show that eigenstates with significant eigenvalue modulus are located on well defined network communities. We also show that the correlator between PageRank and CheiRank vectors distinguishes different organizations of information flow on BBC and Le Monde web sites.

Organization of complex networks

NASA Astrophysics Data System (ADS)

Kitsak, Maksim

Many large complex systems can be successfully analyzed using the language of graphs and networks. Interactions between the objects in a network are treated as links connecting nodes. This approach to understanding the structure of networks is an important step toward understanding the way corresponding complex systems function. Using the tools of statistical physics, we analyze the structure of networks as they are found in complex systems such as the Internet, the World Wide Web, and numerous industrial and social networks. In the first chapter we apply the concept of self-similarity to the study of transport properties in complex networks. Self-similar or fractal networks, unlike non-fractal networks, exhibit similarity on a range of scales. We find that these fractal networks have transport properties that differ from those of non-fractal networks. In non-fractal networks, transport flows primarily through the hubs. In fractal networks, the self-similar structure requires any transport to also flow through nodes that have only a few connections. We also study, in models and in real networks, the crossover from fractal to non-fractal networks that occurs when a small number of random interactions are added by means of scaling techniques. In the second chapter we use k-core techniques to study dynamic processes in networks. The k-core of a network is the network's largest component that, within itself, exhibits all nodes with at least k connections. We use this k-core analysis to estimate the relative leadership positions of firms in the Life Science (LS) and Information and Communication Technology (ICT) sectors of industry. We study the differences in the k-core structure between the LS and the ICT sectors. We find that the lead segment (highest k-core) of the LS sector, unlike that of the ICT sector, is remarkably stable over time: once a particular firm enters the lead segment, it is likely to remain there for many years. In the third chapter we study how epidemics spread though networks. Our results indicate that a virus is more likely to infect a large area of a network if it originates at a node contained within k-core of high index k.

Community detection in complex networks using proximate support vector clustering

NASA Astrophysics Data System (ADS)

Wang, Feifan; Zhang, Baihai; Chai, Senchun; Xia, Yuanqing

2018-03-01

Community structure, one of the most attention attracting properties in complex networks, has been a cornerstone in advances of various scientific branches. A number of tools have been involved in recent studies concentrating on the community detection algorithms. In this paper, we propose a support vector clustering method based on a proximity graph, owing to which the introduced algorithm surpasses the traditional support vector approach both in accuracy and complexity. Results of extensive experiments undertaken on computer generated networks and real world data sets illustrate competent performances in comparison with the other counterparts.

Towards a comprehensive understanding of emerging dynamics and function of pancreatic islets: A complex network approach. Comment on "Network science of biological systems at different scales: A review" by Gosak et al.

NASA Astrophysics Data System (ADS)

Loppini, Alessandro

2018-03-01

Complex network theory represents a comprehensive mathematical framework to investigate biological systems, ranging from sub-cellular and cellular scales up to large-scale networks describing species interactions and ecological systems. In their exhaustive and comprehensive work [1], Gosak et al. discuss several scenarios in which the network approach was able to uncover general properties and underlying mechanisms of cells organization and regulation, tissue functions and cell/tissue failure in pathology, by the study of chemical reaction networks, structural networks and functional connectivities.

Characterizing time series: when Granger causality triggers complex networks

NASA Astrophysics Data System (ADS)

Ge, Tian; Cui, Yindong; Lin, Wei; Kurths, Jürgen; Liu, Chong

2012-08-01

In this paper, we propose a new approach to characterize time series with noise perturbations in both the time and frequency domains by combining Granger causality and complex networks. We construct directed and weighted complex networks from time series and use representative network measures to describe their physical and topological properties. Through analyzing the typical dynamical behaviors of some physical models and the MIT-BIHMassachusetts Institute of Technology-Beth Israel Hospital. human electrocardiogram data sets, we show that the proposed approach is able to capture and characterize various dynamics and has much potential for analyzing real-world time series of rather short length.

Linear control theory for gene network modeling.

PubMed

Shin, Yong-Jun; Bleris, Leonidas

2010-09-16

Systems biology is an interdisciplinary field that aims at understanding complex interactions in cells. Here we demonstrate that linear control theory can provide valuable insight and practical tools for the characterization of complex biological networks. We provide the foundation for such analyses through the study of several case studies including cascade and parallel forms, feedback and feedforward loops. We reproduce experimental results and provide rational analysis of the observed behavior. We demonstrate that methods such as the transfer function (frequency domain) and linear state-space (time domain) can be used to predict reliably the properties and transient behavior of complex network topologies and point to specific design strategies for synthetic networks.

Global mean first-passage times of random walks on complex networks.

PubMed

Tejedor, V; Bénichou, O; Voituriez, R

2009-12-01

We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow, is realized under the simple condition that the random walk is transient at the target site and independently of the small-world, scale-free, or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network since the target averaged GMFPT satisfies much more restrictive bounds.

The structural role of weak and strong links in a financial market network

NASA Astrophysics Data System (ADS)

Garas, A.; Argyrakis, P.; Havlin, S.

2008-05-01

We investigate the properties of correlation based networks originating from economic complex systems, such as the network of stocks traded at the New York Stock Exchange (NYSE). The weaker links (low correlation) of the system are found to contribute to the overall connectivity of the network significantly more than the strong links (high correlation). We find that nodes connected through strong links form well defined communities. These communities are clustered together in more complex ways compared to the widely used classification according to the economic activity. We find that some companies, such as General Electric (GE), Coca Cola (KO), and others, can be involved in different communities. The communities are found to be quite stable over time. Similar results were obtained by investigating markets completely different in size and properties, such as the Athens Stock Exchange (ASE). The present method may be also useful for other networks generated through correlations.

English and Chinese languages as weighted complex networks

NASA Astrophysics Data System (ADS)

Sheng, Long; Li, Chunguang

2009-06-01

In this paper, we analyze statistical properties of English and Chinese written human language within the framework of weighted complex networks. The two language networks are based on an English novel and a Chinese biography, respectively, and both of the networks are constructed in the same way. By comparing the intensity and density of connections between the two networks, we find that high weight connections in Chinese language networks prevail more than those in English language networks. Furthermore, some of the topological and weighted quantities are compared. The results display some differences in the structural organizations between the two language networks. These observations indicate that the two languages may have different linguistic mechanisms and different combinatorial natures.

Platonic Relationships among Resistors

ERIC Educational Resources Information Center

Allen, Bradley; Liu, Tongtian

2015-01-01

Calculating the effective resistance of an electrical network is a common problem in introductory physics courses. Such calculations are typically restricted to two-dimensional networks, though even such networks can become increasingly complex, leading to several studies on their properties. Furthermore, several authors have used advanced…

Multilayer network of language: A unified framework for structural analysis of linguistic subsystems

NASA Astrophysics Data System (ADS)

Martinčić-Ipšić, Sanda; Margan, Domagoj; Meštrović, Ana

2016-09-01

Recently, the focus of complex networks' research has shifted from the analysis of isolated properties of a system toward a more realistic modeling of multiple phenomena - multilayer networks. Motivated by the prosperity of multilayer approach in social, transport or trade systems, we introduce the multilayer networks for language. The multilayer network of language is a unified framework for modeling linguistic subsystems and their structural properties enabling the exploration of their mutual interactions. Various aspects of natural language systems can be represented as complex networks, whose vertices depict linguistic units, while links model their relations. The multilayer network of language is defined by three aspects: the network construction principle, the linguistic subsystem and the language of interest. More precisely, we construct a word-level (syntax and co-occurrence) and a subword-level (syllables and graphemes) network layers, from four variations of original text (in the modeled language). The analysis and comparison of layers at the word and subword-levels are employed in order to determine the mechanism of the structural influences between linguistic units and subsystems. The obtained results suggest that there are substantial differences between the networks' structures of different language subsystems, which are hidden during the exploration of an isolated layer. The word-level layers share structural properties regardless of the language (e.g. Croatian or English), while the syllabic subword-level expresses more language dependent structural properties. The preserved weighted overlap quantifies the similarity of word-level layers in weighted and directed networks. Moreover, the analysis of motifs reveals a close topological structure of the syntactic and syllabic layers for both languages. The findings corroborate that the multilayer network framework is a powerful, consistent and systematic approach to model several linguistic subsystems simultaneously and hence to provide a more unified view on language.

Understanding characteristics in multivariate traffic flow time series from complex network structure

NASA Astrophysics Data System (ADS)

Yan, Ying; Zhang, Shen; Tang, Jinjun; Wang, Xiaofei

2017-07-01

Discovering dynamic characteristics in traffic flow is the significant step to design effective traffic managing and controlling strategy for relieving traffic congestion in urban cities. A new method based on complex network theory is proposed to study multivariate traffic flow time series. The data were collected from loop detectors on freeway during a year. In order to construct complex network from original traffic flow, a weighted Froenius norm is adopt to estimate similarity between multivariate time series, and Principal Component Analysis is implemented to determine the weights. We discuss how to select optimal critical threshold for networks at different hour in term of cumulative probability distribution of degree. Furthermore, two statistical properties of networks: normalized network structure entropy and cumulative probability of degree, are utilized to explore hourly variation in traffic flow. The results demonstrate these two statistical quantities express similar pattern to traffic flow parameters with morning and evening peak hours. Accordingly, we detect three traffic states: trough, peak and transitional hours, according to the correlation between two aforementioned properties. The classifying results of states can actually represent hourly fluctuation in traffic flow by analyzing annual average hourly values of traffic volume, occupancy and speed in corresponding hours.

Complexity of the heart rhythm after heart transplantation by entropy of transition network for RR-increments of RR time intervals between heartbeats.

PubMed

Makowiec, Danuta; Struzik, Zbigniew; Graff, Beata; Wdowczyk-Szulc, Joanna; Zarczynska-Buchnowiecka, Marta; Gruchala, Marcin; Rynkiewicz, Andrzej

2013-01-01

Network models have been used to capture, represent and analyse characteristics of living organisms and general properties of complex systems. The use of network representations in the characterization of time series complexity is a relatively new but quickly developing branch of time series analysis. In particular, beat-to-beat heart rate variability can be mapped out in a network of RR-increments, which is a directed and weighted graph with vertices representing RR-increments and the edges of which correspond to subsequent increments. We evaluate entropy measures selected from these network representations in records of healthy subjects and heart transplant patients, and provide an interpretation of the results.

A brief historical introduction to Euler's formula for polyhedra, topology, graph theory and networks

NASA Astrophysics Data System (ADS)

Debnath, Lokenath

2010-09-01

This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.

Impact of Degree Heterogeneity on Attack Vulnerability of Interdependent Networks

NASA Astrophysics Data System (ADS)

Sun, Shiwen; Wu, Yafang; Ma, Yilin; Wang, Li; Gao, Zhongke; Xia, Chengyi

2016-09-01

The study of interdependent networks has become a new research focus in recent years. We focus on one fundamental property of interdependent networks: vulnerability. Previous studies mainly focused on the impact of topological properties upon interdependent networks under random attacks, the effect of degree heterogeneity on structural vulnerability of interdependent networks under intentional attacks, however, is still unexplored. In order to deeply understand the role of degree distribution and in particular degree heterogeneity, we construct an interdependent system model which consists of two networks whose extent of degree heterogeneity can be controlled simultaneously by a tuning parameter. Meanwhile, a new quantity, which can better measure the performance of interdependent networks after attack, is proposed. Numerical simulation results demonstrate that degree heterogeneity can significantly increase the vulnerability of both single and interdependent networks. Moreover, it is found that interdependent links between two networks make the entire system much more fragile to attacks. Enhancing coupling strength between networks can greatly increase the fragility of both networks against targeted attacks, which is most evident under the case of max-max assortative coupling. Current results can help to deepen the understanding of structural complexity of complex real-world systems.

Modeling fluctuations in default-mode brain network using a spiking neural network.

PubMed

Yamanishi, Teruya; Liu, Jian-Qin; Nishimura, Haruhiko

2012-08-01

Recently, numerous attempts have been made to understand the dynamic behavior of complex brain systems using neural network models. The fluctuations in blood-oxygen-level-dependent (BOLD) brain signals at less than 0.1 Hz have been observed by functional magnetic resonance imaging (fMRI) for subjects in a resting state. This phenomenon is referred to as a "default-mode brain network." In this study, we model the default-mode brain network by functionally connecting neural communities composed of spiking neurons in a complex network. Through computational simulations of the model, including transmission delays and complex connectivity, the network dynamics of the neural system and its behavior are discussed. The results show that the power spectrum of the modeled fluctuations in the neuron firing patterns is consistent with the default-mode brain network's BOLD signals when transmission delays, a characteristic property of the brain, have finite values in a given range.

Structural Preferential Attachment: Network Organization beyond the Link

NASA Astrophysics Data System (ADS)

Hébert-Dufresne, Laurent; Allard, Antoine; Marceau, Vincent; Noël, Pierre-André; Dubé, Louis J.

2011-10-01

We introduce a mechanism which models the emergence of the universal properties of complex networks, such as scale independence, modularity and self-similarity, and unifies them under a scale-free organization beyond the link. This brings a new perspective on network organization where communities, instead of links, are the fundamental building blocks of complex systems. We show how our simple model can reproduce social and information networks by predicting their community structure and more importantly, how their nodes or communities are interconnected, often in a self-similar manner.

Characterizing complex networks through statistics of Möbius transformations

NASA Astrophysics Data System (ADS)

Jaćimović, Vladimir; Crnkić, Aladin

2017-04-01

It is well-known now that dynamics of large populations of globally (all-to-all) coupled oscillators can be reduced to low-dimensional submanifolds (WS transformation and OA ansatz). Marvel et al. (2009) described an intriguing algebraic structure standing behind this reduction: oscillators evolve by the action of the group of Möbius transformations. Of course, dynamics in complex networks of coupled oscillators is highly complex and not reducible. Still, closer look unveils that even in complex networks some (possibly overlapping) groups of oscillators evolve by Möbius transformations. In this paper, we study properties of the network by identifying Möbius transformations in the dynamics of oscillators. This enables us to introduce some new (statistical) concepts that characterize the network. In particular, the notion of coherence of the network (or subnetwork) is proposed. This conceptual approach is meaningful for the broad class of networks, including those with time-delayed, noisy or mixed interactions. In this paper, several simple (random) graphs are studied illustrating the meaning of the concepts introduced in the paper.

Node-node correlations and transport properties in scale-free networks

NASA Astrophysics Data System (ADS)

Obregon, Bibiana; Guzman, Lev

2011-03-01

We study some transport properties of complex networks. We focus our attention on transport properties of scale-free and small-world networks and compare two types of transport: Electric and max-flow cases. In particular, we construct scale-free networks, with a given degree sequence, to estimate the distribution of conductances for different values of assortative/dissortative mixing. For the electric case we find that the distributions of conductances are affect ed by the assortative mixing of the network whereas for the max-flow case, the distributions almost do not show changes when node-node correlations are altered. Finally, we compare local and global transport in terms of the average conductance for the small-world (Watts-Strogatz) model

The q-dependent detrended cross-correlation analysis of stock market

NASA Astrophysics Data System (ADS)

Zhao, Longfeng; Li, Wei; Fenu, Andrea; Podobnik, Boris; Wang, Yougui; Stanley, H. Eugene

2018-02-01

Properties of the q-dependent cross-correlation matrices of the stock market have been analyzed by using random matrix theory and complex networks. The correlation structures of the fluctuations at different magnitudes have unique properties. The cross-correlations among small fluctuations are much stronger than those among large fluctuations. The large and small fluctuations are dominated by different groups of stocks. We use complex network representation to study these q-dependent matrices and discover some new identities. By utilizing those q-dependent correlation-based networks, we are able to construct some portfolios of those more independent stocks which consistently perform better. The optimal multifractal order for portfolio optimization is around q  =  2 under the mean-variance portfolio framework, and q\\in[2, 6] under the expected shortfall criterion. These results have deepened our understanding regarding the collective behavior of the complex financial system.

Complexity and dynamics of topological and community structure in complex networks

NASA Astrophysics Data System (ADS)

Berec, Vesna

2017-07-01

Complexity is highly susceptible to variations in the network dynamics, reflected on its underlying architecture where topological organization of cohesive subsets into clusters, system's modular structure and resulting hierarchical patterns, are cross-linked with functional dynamics of the system. Here we study connection between hierarchical topological scales of the simplicial complexes and the organization of functional clusters - communities in complex networks. The analysis reveals the full dynamics of different combinatorial structures of q-th-dimensional simplicial complexes and their Laplacian spectra, presenting spectral properties of resulting symmetric and positive semidefinite matrices. The emergence of system's collective behavior from inhomogeneous statistical distribution is induced by hierarchically ordered topological structure, which is mapped to simplicial complex where local interactions between the nodes clustered into subcomplexes generate flow of information that characterizes complexity and dynamics of the full system.

Analytic method for calculating properties of random walks on networks

NASA Technical Reports Server (NTRS)

Goldhirsch, I.; Gefen, Y.

1986-01-01

A method for calculating the properties of discrete random walks on networks is presented. The method divides complex networks into simpler units whose contribution to the mean first-passage time is calculated. The simplified network is then further iterated. The method is demonstrated by calculating mean first-passage times on a segment, a segment with a single dangling bond, a segment with many dangling bonds, and a looplike structure. The results are analyzed and related to the applicability of the Einstein relation between conductance and diffusion.

Challenges in network science: Applications to infrastructures, climate, social systems and economics

NASA Astrophysics Data System (ADS)

Havlin, S.; Kenett, D. Y.; Ben-Jacob, E.; Bunde, A.; Cohen, R.; Hermann, H.; Kantelhardt, J. W.; Kertész, J.; Kirkpatrick, S.; Kurths, J.; Portugali, J.; Solomon, S.

2012-11-01

Network theory has become one of the most visible theoretical frameworks that can be applied to the description, analysis, understanding, design and repair of multi-level complex systems. Complex networks occur everywhere, in man-made and human social systems, in organic and inorganic matter, from nano to macro scales, and in natural and anthropogenic structures. New applications are developed at an ever-increasing rate and the promise for future growth is high, since increasingly we interact with one another within these vital and complex environments. Despite all the great successes of this field, crucial aspects of multi-level complex systems have been largely ignored. Important challenges of network science are to take into account many of these missing realistic features such as strong coupling between networks (networks are not isolated), the dynamics of networks (networks are not static), interrelationships between structure, dynamics and function of networks, interdependencies in given networks (and other classes of links, including different signs of interactions), and spatial properties (including geographical aspects) of networks. This aim of this paper is to introduce and discuss the challenges that future network science needs to address, and how different disciplines will be accordingly affected.

Efficient weighting strategy for enhancing synchronizability of complex networks

NASA Astrophysics Data System (ADS)

Wang, Youquan; Yu, Feng; Huang, Shucheng; Tu, Juanjuan; Chen, Yan

2018-04-01

Networks with high propensity to synchronization are desired in many applications ranging from biology to engineering. In general, there are two ways to enhance the synchronizability of a network: link rewiring and/or link weighting. In this paper, we propose a new link weighting strategy based on the concept of the neighborhood subgroup. The neighborhood subgroup of a node i through node j in a network, i.e. Gi→j, means that node u belongs to Gi→j if node u belongs to the first-order neighbors of j (not include i). Our proposed weighting schema used the local and global structural properties of the networks such as the node degree, betweenness centrality and closeness centrality measures. We applied the method on scale-free and Watts-Strogatz networks of different structural properties and show the good performance of the proposed weighting scheme. Furthermore, as model networks cannot capture all essential features of real-world complex networks, we considered a number of undirected and unweighted real-world networks. To the best of our knowledge, the proposed weighting strategy outperformed the previously published weighting methods by enhancing the synchronizability of these real-world networks.

Complex networks with scale-free nature and hierarchical modularity

NASA Astrophysics Data System (ADS)

Shekatkar, Snehal M.; Ambika, G.

2015-09-01

Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many networked systems like biological cell, human society and World Wide Web markedly deviate from that of completely random networks indicating the presence of underlying processes. Often the main process involved in their evolution is the addition of links between existing nodes having a common neighbor. In this context we introduce an important property of the nodes, which we call mediating capacity, that is generic to many networks. This capacity decreases rapidly with increase in degree, making hubs weak mediators of the process. We show that this property of nodes provides an explanation for the simultaneous occurrence of the observed scale-free structure and hierarchical modularity in many networked systems. This also explains the high clustering and small-path length seen in real networks as well as non-zero degree-correlations. Our study also provides insight into the local process which ultimately leads to emergence of preferential attachment and hence is also important in understanding robustness and control of real networks as well as processes happening on real networks.

Discovering disease-associated genes in weighted protein-protein interaction networks

NASA Astrophysics Data System (ADS)

Cui, Ying; Cai, Meng; Stanley, H. Eugene

2018-04-01

Although there have been many network-based attempts to discover disease-associated genes, most of them have not taken edge weight - which quantifies their relative strength - into consideration. We use connection weights in a protein-protein interaction (PPI) network to locate disease-related genes. We analyze the topological properties of both weighted and unweighted PPI networks and design an improved random forest classifier to distinguish disease genes from non-disease genes. We use a cross-validation test to confirm that weighted networks are better able to discover disease-associated genes than unweighted networks, which indicates that including link weight in the analysis of network properties provides a better model of complex genotype-phenotype associations.

eQTL networks unveil enriched mRNA master integrators downstream of complex disease-associated SNPs.

PubMed

Li, Haiquan; Pouladi, Nima; Achour, Ikbel; Gardeux, Vincent; Li, Jianrong; Li, Qike; Zhang, Hao Helen; Martinez, Fernando D; 'Skip' Garcia, Joe G N; Lussier, Yves A

2015-12-01

The causal and interplay mechanisms of Single Nucleotide Polymorphisms (SNPs) associated with complex diseases (complex disease SNPs) investigated in genome-wide association studies (GWAS) at the transcriptional level (mRNA) are poorly understood despite recent advancements such as discoveries reported in the Encyclopedia of DNA Elements (ENCODE) and Genotype-Tissue Expression (GTex). Protein interaction network analyses have successfully improved our understanding of both single gene diseases (Mendelian diseases) and complex diseases. Whether the mRNAs downstream of complex disease genes are central or peripheral in the genetic information flow relating DNA to mRNA remains unclear and may be disease-specific. Using expression Quantitative Trait Loci (eQTL) that provide DNA to mRNA associations and network centrality metrics, we hypothesize that we can unveil the systems properties of information flow between SNPs and the transcriptomes of complex diseases. We compare different conditions such as naïve SNP assignments and stringent linkage disequilibrium (LD) free assignments for transcripts to remove confounders from LD. Additionally, we compare the results from eQTL networks between lymphoblastoid cell lines and liver tissue. Empirical permutation resampling (p<0.001) and theoretic Mann-Whitney U test (p<10(-30)) statistics indicate that mRNAs corresponding to complex disease SNPs via eQTL associations are likely to be regulated by a larger number of SNPs than expected. We name this novel property mRNA hubness in eQTL networks, and further term mRNAs with high hubness as master integrators. mRNA master integrators receive and coordinate the perturbation signals from large numbers of polymorphisms and respond to the personal genetic architecture integratively. This genetic signal integration contrasts with the mechanism underlying some Mendelian diseases, where a genetic polymorphism affecting a single protein hub produces a divergent signal that affects a large number of downstream proteins. Indeed, we verify that this property is independent of the hubness in protein networks for which these mRNAs are transcribed. Our findings provide novel insights into the pleiotropy of mRNAs targeted by complex disease polymorphisms and the architecture of the information flow between the genetic polymorphisms and transcriptomes of complex diseases. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

Study on Incompatibility of Traditional Chinese Medicine: Evidence from Formula Network, Chemical Space, and Metabolism Room

PubMed Central

Zhang, Xiao-Dong; Wu, Hong-Ying; Jin, Jin; Yu, Guang-Yun; He, Xin; Wang, Hao; Shen, Xiu; Zhou, Ze-Wei; Liu, Pei-Xun; Fan, Sai-Jun

2013-01-01

A traditional Chinese medicine (TCM) formula network including 362 TCM formulas was built by using complex network methodologies. The properties of this network were analyzed including network diameter, average distance, clustering coefficient, and average degree. Meanwhile, we built a TCM chemical space and a TCM metabolism room under the theory of chemical space. The properties of chemical space and metabolism room were calculated and analyzed. The properties of the medicine pairs in “eighteen antagonisms and nineteen mutual inhibitors,” an ancient rule for TCM incompatibility, were studied based on the TCM formula network, chemical space, and metabolism room. The results showed that the properties of these incompatible medicine pairs are different from those of the other TCM based on the analysis of the TCM formula network, chemical space, and metabolism room. The lines of evidence derived from our work demonstrated that the ancient rule of TCM incompatibility, “eighteen antagonisms and nineteen mutual inhibitors,” is probably scientifically based. PMID:24369478

Mitochondrial network complexity emerges from fission/fusion dynamics.

PubMed

Zamponi, Nahuel; Zamponi, Emiliano; Cannas, Sergio A; Billoni, Orlando V; Helguera, Pablo R; Chialvo, Dante R

2018-01-10

Mitochondrial networks exhibit a variety of complex behaviors, including coordinated cell-wide oscillations of energy states as well as a phase transition (depolarization) in response to oxidative stress. Since functional and structural properties are often interwinded, here we characterized the structure of mitochondrial networks in mouse embryonic fibroblasts using network tools and percolation theory. Subsequently we perturbed the system either by promoting the fusion of mitochondrial segments or by inducing mitochondrial fission. Quantitative analysis of mitochondrial clusters revealed that structural parameters of healthy mitochondria laid in between the extremes of highly fragmented and completely fusioned networks. We confirmed our results by contrasting our empirical findings with the predictions of a recently described computational model of mitochondrial network emergence based on fission-fusion kinetics. Altogether these results offer not only an objective methodology to parametrize the complexity of this organelle but also support the idea that mitochondrial networks behave as critical systems and undergo structural phase transitions.

Error and attack tolerance of complex networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Jeong, Hawoong; Barabási, Albert-László

2000-07-01

Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network. Complex communication networks display a surprising degree of robustness: although key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. Here we demonstrate that error tolerance is not shared by all redundant systems: it is displayed only by a class of inhomogeneously wired networks, called scale-free networks, which include the World-Wide Web, the Internet, social networks and cells. We find that such networks display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates. However, error tolerance comes at a high price in that these networks are extremely vulnerable to attacks (that is, to the selection and removal of a few nodes that play a vital role in maintaining the network's connectivity). Such error tolerance and attack vulnerability are generic properties of communication networks.

Complex network view of evolving manifolds

NASA Astrophysics Data System (ADS)

da Silva, Diamantino C.; Bianconi, Ginestra; da Costa, Rui A.; Dorogovtsev, Sergey N.; Mendes, José F. F.

2018-03-01

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by the condition that at each step, all the faces must be triangles. Stochastic application of these operations leads to random networks with different architectures. We perform extensive numerical simulations and explore the geometries of growing and equilibrium complex networks generated by these transformations and their local structural properties. This characterization includes the Hausdorff and spectral dimensions of the resulting networks, their degree distributions, and various structural correlations. Our results reveal a rich zoo of architectures and geometries of these networks, some of which appear to be small worlds while others are finite dimensional with Hausdorff dimension equal or higher than the original dimensionality of their simplices. The range of spectral dimensions of the evolving triangulations turns out to be from about 1.4 to infinity. Our models include simplicial complexes representing manifolds with evolving topologies, for example, an h -holed torus with a progressively growing number of holes. This evolving graph demonstrates features of a small-world network and has a particularly heavy-tailed degree distribution.

Complex life cycles in a pond food web: effects of life stage structure and parasites on network properties, trophic positions and the fit of a probabilistic niche model.

PubMed

Preston, Daniel L; Jacobs, Abigail Z; Orlofske, Sarah A; Johnson, Pieter T J

2014-03-01

Most food webs use taxonomic or trophic species as building blocks, thereby collapsing variability in feeding linkages that occurs during the growth and development of individuals. This issue is particularly relevant to integrating parasites into food webs because parasites often undergo extreme ontogenetic niche shifts. Here, we used three versions of a freshwater pond food web with varying levels of node resolution (from taxonomic species to life stages) to examine how complex life cycles and parasites alter web properties, the perceived trophic position of organisms, and the fit of a probabilistic niche model. Consistent with prior studies, parasites increased most measures of web complexity in the taxonomic species web; however, when nodes were disaggregated into life stages, the effects of parasites on several network properties (e.g., connectance and nestedness) were reversed, due in part to the lower trophic generality of parasite life stages relative to free-living life stages. Disaggregation also reduced the trophic level of organisms with either complex or direct life cycles and was particularly useful when including predation on parasites, which can inflate trophic positions when life stages are collapsed. Contrary to predictions, disaggregation decreased network intervality and did not enhance the fit of a probabilistic niche model to the food webs with parasites. Although the most useful level of biological organization in food webs will vary with the questions of interest, our results suggest that disaggregating species-level nodes may refine our perception of how parasites and other complex life cycle organisms influence ecological networks.

Communication Network Analysis Methods.

ERIC Educational Resources Information Center

Farace, Richard V.; Mabee, Timothy

This paper reviews a variety of analytic procedures that can be applied to network data, discussing the assumptions and usefulness of each procedure when applied to the complexity of human communication. Special attention is paid to the network properties measured or implied by each procedure. Factor analysis and multidimensional scaling are among…

FPGA implementation of motifs-based neuronal network and synchronization analysis

NASA Astrophysics Data System (ADS)

Deng, Bin; Zhu, Zechen; Yang, Shuangming; Wei, Xile; Wang, Jiang; Yu, Haitao

2016-06-01

Motifs in complex networks play a crucial role in determining the brain functions. In this paper, 13 kinds of motifs are implemented with Field Programmable Gate Array (FPGA) to investigate the relationships between the networks properties and motifs properties. We use discretization method and pipelined architecture to construct various motifs with Hindmarsh-Rose (HR) neuron as the node model. We also build a small-world network based on these motifs and conduct the synchronization analysis of motifs as well as the constructed network. We find that the synchronization properties of motif determine that of motif-based small-world network, which demonstrates effectiveness of our proposed hardware simulation platform. By imitation of some vital nuclei in the brain to generate normal discharges, our proposed FPGA-based artificial neuronal networks have the potential to replace the injured nuclei to complete the brain function in the treatment of Parkinson's disease and epilepsy.

Application of artificial neural networks to composite ply micromechanics

NASA Technical Reports Server (NTRS)

Brown, D. A.; Murthy, P. L. N.; Berke, L.

1991-01-01

Artificial neural networks can provide improved computational efficiency relative to existing methods when an algorithmic description of functional relationships is either totally unavailable or is complex in nature. For complex calculations, significant reductions in elapsed computation time are possible. The primary goal is to demonstrate the applicability of artificial neural networks to composite material characterization. As a test case, a neural network was trained to accurately predict composite hygral, thermal, and mechanical properties when provided with basic information concerning the environment, constituent materials, and component ratios used in the creation of the composite. A brief introduction on neural networks is provided along with a description of the project itself.

Use of a three-layer distributed RC network to produce two pairs of complex conjugate zeros

NASA Technical Reports Server (NTRS)

Huelsman, L. P.

1972-01-01

The properties of a three layer distributed RC network consisting of two layers of resistive material separated by a dielectric are described. When the three layer network is used as a three terminal element by connecting conducting terminal strips across the ends of one of the resistive layers and the center of the other resistive layer, the network may be used to produce pairs of complex conjugate transmission zeros. The location of these zeros are determined by the parameters of the network. Design charts for determining the zero positions are included as part of the report.

Efficient embedding of complex networks to hyperbolic space via their Laplacian

PubMed Central

Alanis-Lobato, Gregorio; Mier, Pablo; Andrade-Navarro, Miguel A.

2016-01-01

The different factors involved in the growth process of complex networks imprint valuable information in their observable topologies. How to exploit this information to accurately predict structural network changes is the subject of active research. A recent model of network growth sustains that the emergence of properties common to most complex systems is the result of certain trade-offs between node birth-time and similarity. This model has a geometric interpretation in hyperbolic space, where distances between nodes abstract this optimisation process. Current methods for network hyperbolic embedding search for node coordinates that maximise the likelihood that the network was produced by the afore-mentioned model. Here, a different strategy is followed in the form of the Laplacian-based Network Embedding, a simple yet accurate, efficient and data driven manifold learning approach, which allows for the quick geometric analysis of big networks. Comparisons against existing embedding and prediction techniques highlight its applicability to network evolution and link prediction. PMID:27445157

Efficient embedding of complex networks to hyperbolic space via their Laplacian

NASA Astrophysics Data System (ADS)

Alanis-Lobato, Gregorio; Mier, Pablo; Andrade-Navarro, Miguel A.

2016-07-01

The different factors involved in the growth process of complex networks imprint valuable information in their observable topologies. How to exploit this information to accurately predict structural network changes is the subject of active research. A recent model of network growth sustains that the emergence of properties common to most complex systems is the result of certain trade-offs between node birth-time and similarity. This model has a geometric interpretation in hyperbolic space, where distances between nodes abstract this optimisation process. Current methods for network hyperbolic embedding search for node coordinates that maximise the likelihood that the network was produced by the afore-mentioned model. Here, a different strategy is followed in the form of the Laplacian-based Network Embedding, a simple yet accurate, efficient and data driven manifold learning approach, which allows for the quick geometric analysis of big networks. Comparisons against existing embedding and prediction techniques highlight its applicability to network evolution and link prediction.

Distributed learning automata-based algorithm for community detection in complex networks

NASA Astrophysics Data System (ADS)

Khomami, Mohammad Mehdi Daliri; Rezvanian, Alireza; Meybodi, Mohammad Reza

2016-03-01

Community structure is an important and universal topological property of many complex networks such as social and information networks. The detection of communities of a network is a significant technique for understanding the structure and function of networks. In this paper, we propose an algorithm based on distributed learning automata for community detection (DLACD) in complex networks. In the proposed algorithm, each vertex of network is equipped with a learning automation. According to the cooperation among network of learning automata and updating action probabilities of each automaton, the algorithm interactively tries to identify high-density local communities. The performance of the proposed algorithm is investigated through a number of simulations on popular synthetic and real networks. Experimental results in comparison with popular community detection algorithms such as walk trap, Danon greedy optimization, Fuzzy community detection, Multi-resolution community detection and label propagation demonstrated the superiority of DLACD in terms of modularity, NMI, performance, min-max-cut and coverage.

A novel complex networks clustering algorithm based on the core influence of nodes.

PubMed

Tong, Chao; Niu, Jianwei; Dai, Bin; Xie, Zhongyu

2014-01-01

In complex networks, cluster structure, identified by the heterogeneity of nodes, has become a common and important topological property. Network clustering methods are thus significant for the study of complex networks. Currently, many typical clustering algorithms have some weakness like inaccuracy and slow convergence. In this paper, we propose a clustering algorithm by calculating the core influence of nodes. The clustering process is a simulation of the process of cluster formation in sociology. The algorithm detects the nodes with core influence through their betweenness centrality, and builds the cluster's core structure by discriminant functions. Next, the algorithm gets the final cluster structure after clustering the rest of the nodes in the network by optimizing method. Experiments on different datasets show that the clustering accuracy of this algorithm is superior to the classical clustering algorithm (Fast-Newman algorithm). It clusters faster and plays a positive role in revealing the real cluster structure of complex networks precisely.

A Complex Network Approach to Distributional Semantic Models

PubMed Central

Utsumi, Akira

2015-01-01

A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models. PMID:26295940

Inference, simulation, modeling, and analysis of complex networks, with special emphasis on complex networks in systems biology

NASA Astrophysics Data System (ADS)

Christensen, Claire Petra

Across diverse fields ranging from physics to biology, sociology, and economics, the technological advances of the past decade have engendered an unprecedented explosion of data on highly complex systems with thousands, if not millions of interacting components. These systems exist at many scales of size and complexity, and it is becoming ever-more apparent that they are, in fact, universal, arising in every field of study. Moreover, they share fundamental properties---chief among these, that the individual interactions of their constituent parts may be well-understood, but the characteristic behaviour produced by the confluence of these interactions---by these complex networks---is unpredictable; in a nutshell, the whole is more than the sum of its parts. There is, perhaps, no better illustration of this concept than the discoveries being made regarding complex networks in the biological sciences. In particular, though the sequencing of the human genome in 2003 was a remarkable feat, scientists understand that the "cellular-level blueprints" for the human being are cellular-level parts lists, but they say nothing (explicitly) about cellular-level processes. The challenge of modern molecular biology is to understand these processes in terms of the networks of parts---in terms of the interactions among proteins, enzymes, genes, and metabolites---as it is these processes that ultimately differentiate animate from inanimate, giving rise to life! It is the goal of systems biology---an umbrella field encapsulating everything from molecular biology to epidemiology in social systems---to understand processes in terms of fundamental networks of core biological parts, be they proteins or people. By virtue of the fact that there are literally countless complex systems, not to mention tools and techniques used to infer, simulate, analyze, and model these systems, it is impossible to give a truly comprehensive account of the history and study of complex systems. The author's own publications have contributed network inference, simulation, modeling, and analysis methods to the much larger body of work in systems biology, and indeed, in network science. The aim of this thesis is therefore twofold: to present this original work in the historical context of network science, but also to provide sufficient review and reference regarding complex systems (with an emphasis on complex networks in systems biology) and tools and techniques for their inference, simulation, analysis, and modeling, such that the reader will be comfortable in seeking out further information on the subject. The review-like Chapters 1, 2, and 4 are intended to convey the co-evolution of network science and the slow but noticeable breakdown of boundaries between disciplines in academia as research and comparison of diverse systems has brought to light the shared properties of these systems. It is the author's hope that theses chapters impart some sense of the remarkable and rapid progress in complex systems research that has led to this unprecedented academic synergy. Chapters 3 and 5 detail the author's original work in the context of complex systems research. Chapter 3 presents the methods and results of a two-stage modeling process that generates candidate gene-regulatory networks of the bacterium B.subtilis from experimentally obtained, yet mathematically underdetermined microchip array data. These networks are then analyzed from a graph theoretical perspective, and their biological viability is critiqued by comparing the networks' graph theoretical properties to those of other biological systems. The results of topological perturbation analyses revealing commonalities in behavior at multiple levels of complexity are also presented, and are shown to be an invaluable means by which to ascertain the level of complexity to which the network inference process is robust to noise. Chapter 5 outlines a learning algorithm for the development of a realistic, evolving social network (a city) into which a disease is introduced. The results of simulations in populations spanning two orders of magnitude are compared to prevaccine era measles data for England and Wales and demonstrate that the simulations are able to capture the quantitative and qualitative features of epidemics in populations as small as 10,000 people. The work presented in Chapter 5 validates the utility of network simulation in concurrently probing contact network dynamics and disease dynamics.

A complex-network perspective on Alexander's wholeness

NASA Astrophysics Data System (ADS)

Jiang, Bin

2016-12-01

The wholeness, conceived and developed by Christopher Alexander, is what exists to some degree or other in space and matter, and can be described by precise mathematical language. However, it remains somehow mysterious and elusive, and therefore hard to grasp. This paper develops a complex network perspective on the wholeness to better understand the nature of order or beauty for sustainable design. I bring together a set of complexity-science subjects such as complex networks, fractal geometry, and in particular underlying scaling hierarchy derived by head/tail breaks - a classification scheme and a visualization tool for data with a heavy-tailed distribution, in order to make Alexander's profound thoughts more accessible to design practitioners and complexity-science researchers. Through several case studies (some of which Alexander studied), I demonstrate that the complex-network perspective helps reduce the mystery of wholeness and brings new insights to Alexander's thoughts on the concept of wholeness or objective beauty that exists in fine and deep structure. The complex-network perspective enables us to see things in their wholeness, and to better understand how the kind of structural beauty emerges from local actions guided by the 15 fundamental properties, and in particular by differentiation and adaptation processes. The wholeness goes beyond current complex network theory towards design or creation of living structures.

Small-world network properties in prefrontal cortex correlate with predictors of psychopathology risk in young children: a NIRS study.

PubMed

Fekete, Tomer; Beacher, Felix D C C; Cha, Jiook; Rubin, Denis; Mujica-Parodi, Lilianne R

2014-01-15

Near infrared spectroscopy (NIRS) is an emerging imaging technique that is relatively inexpensive, portable, and particularly well suited for collecting data in ecological settings. Therefore, it holds promise as a potential neurodiagnostic for young children. We set out to explore whether NIRS could be utilized in assessing the risk of developmental psychopathology in young children. A growing body of work indicates that temperament at young age is associated with vulnerability to psychopathology later on in life. In particular, it has been shown that low effortful control (EC), which includes the focusing and shifting of attention, inhibitory control, perceptual sensitivity, and a low threshold for pleasure, is linked to conditions such as anxiety, depression and attention deficit hyperactivity disorder (ADHD). Physiologically, EC has been linked to a control network spanning among other sites the prefrontal cortex. Several psychopathologies, such as depression and ADHD, have been shown to result in compromised small-world network properties. Therefore we set out to explore the relationship between EC and the small-world properties of PFC using NIRS. NIRS data were collected from 44 toddlers, ages 3-5, while watching naturalistic stimuli (movie clips). Derived complex network measures were then correlated to EC as derived from the Children's Behavior Questionnaire (CBQ). We found that reduced levels of EC were associated with compromised small-world properties of the prefrontal network. Our results suggest that the longitudinal NIRS studies of complex network properties in young children hold promise in furthering our understanding of developmental psychopathology. © 2013.

Relating the large-scale structure of time series and visibility networks.

PubMed

Rodríguez, Miguel A

2017-06-01

The structure of time series is usually characterized by means of correlations. A new proposal based on visibility networks has been considered recently. Visibility networks are complex networks mapped from surfaces or time series using visibility properties. The structures of time series and visibility networks are closely related, as shown by means of fractional time series in recent works. In these works, a simple relationship between the Hurst exponent H of fractional time series and the exponent of the distribution of edges γ of the corresponding visibility network, which exhibits a power law, is shown. To check and generalize these results, in this paper we delve into this idea of connected structures by defining both structures more properly. In addition to the exponents used before, H and γ, which take into account local properties, we consider two more exponents that, as we will show, characterize global properties. These are the exponent α for time series, which gives the scaling of the variance with the size as var∼T^{2α}, and the exponent κ of their corresponding network, which gives the scaling of the averaged maximum of the number of edges, 〈k_{M}〉∼N^{κ}. With this representation, a more precise connection between the structures of general time series and their associated visibility network is achieved. Similarities and differences are more clearly established, and new scaling forms of complex networks appear in agreement with their respective classes of time series.

System Analysis of LWDH Related Genes Based on Text Mining in Biological Networks

PubMed Central

Miao, Yingbo; Zhang, Liangcai; Wang, Yang; Feng, Rennan; Yang, Lei; Zhang, Shihua; Jiang, Yongshuai; Liu, Guiyou

2014-01-01

Liuwei-dihuang (LWDH) is widely used in traditional Chinese medicine (TCM), but its molecular mechanism about gene interactions is unclear. LWDH genes were extracted from the existing literatures based on text mining technology. To simulate the complex molecular interactions that occur in the whole body, protein-protein interaction networks (PPINs) were constructed and the topological properties of LWDH genes were analyzed. LWDH genes have higher centrality properties and may play important roles in the complex biological network environment. It was also found that the distances within LWDH genes are smaller than expected, which means that the communication of LWDH genes during the biological process is rapid and effectual. At last, a comprehensive network of LWDH genes, including the related drugs and regulatory pathways at both the transcriptional and posttranscriptional levels, was constructed and analyzed. The biological network analysis strategy used in this study may be helpful for the understanding of molecular mechanism of TCM. PMID:25243143

Right-side-stretched multifractal spectra indicate small-worldness in networks

NASA Astrophysics Data System (ADS)

Oświȩcimka, Paweł; Livi, Lorenzo; Drożdż, Stanisław

2018-04-01

Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features observed in real-world systems: i) local clustering and ii) the possibility to move across a network by means of long-range links that significantly reduce the characteristic path length. A natural question would be whether there exist several ;types; of small-world architectures, giving rise to a continuum of models with properties (partially) shared with other models belonging to different network families. Here, we take advantage of the interplay between network theory and time series analysis and propose to investigate small-world signatures in complex networks by analyzing multifractal characteristics of time series generated from such networks. In particular, we suggest that the degree of right-sided asymmetry of multifractal spectra is linked with the degree of small-worldness present in networks. This claim is supported by numerical simulations performed on several parametric models, including prototypical small-world networks, scale-free, fractal and also real-world networks describing protein molecules. Our results also indicate that right-sided asymmetry emerges with the presence of the following topological properties: low edge density, low average shortest path, and high clustering coefficient.

Recurrence Density Enhanced Complex Networks for Nonlinear Time Series Analysis

NASA Astrophysics Data System (ADS)

Costa, Diego G. De B.; Reis, Barbara M. Da F.; Zou, Yong; Quiles, Marcos G.; Macau, Elbert E. N.

We introduce a new method, which is entitled Recurrence Density Enhanced Complex Network (RDE-CN), to properly analyze nonlinear time series. Our method first transforms a recurrence plot into a figure of a reduced number of points yet preserving the main and fundamental recurrence properties of the original plot. This resulting figure is then reinterpreted as a complex network, which is further characterized by network statistical measures. We illustrate the computational power of RDE-CN approach by time series by both the logistic map and experimental fluid flows, which show that our method distinguishes different dynamics sufficiently well as the traditional recurrence analysis. Therefore, the proposed methodology characterizes the recurrence matrix adequately, while using a reduced set of points from the original recurrence plots.

Einstein Equations from Varying Complexity

NASA Astrophysics Data System (ADS)

Czech, Bartłomiej

2018-01-01

A recent proposal equates the circuit complexity of a quantum gravity state with the gravitational action of a certain patch of spacetime. Since Einstein's equations follow from varying the action, it should be possible to derive them by varying complexity. I present such a derivation for vacuum solutions of pure Einstein gravity in three-dimensional asymptotically anti-de Sitter space. The argument relies on known facts about holography and on properties of tensor network renormalization, an algorithm for coarse-graining (and optimizing) tensor networks.

A growth model for directed complex networks with power-law shape in the out-degree distribution

PubMed Central

Esquivel-Gómez, J.; Stevens-Navarro, E.; Pineda-Rico, U.; Acosta-Elias, J.

2015-01-01

Many growth models have been published to model the behavior of real complex networks. These models are able to reproduce several of the topological properties of such networks. However, in most of these growth models, the number of outgoing links (i.e., out-degree) of nodes added to the network is constant, that is all nodes in the network are born with the same number of outgoing links. In other models, the resultant out-degree distribution decays as a poisson or an exponential distribution. However, it has been found that in real complex networks, the out-degree distribution decays as a power-law. In order to obtain out-degree distribution with power-law behavior some models have been proposed. This work introduces a new model that allows to obtain out-degree distributions that decay as a power-law with an exponent in the range from 0 to 1. PMID:25567141

Chimera states in brain networks: Empirical neural vs. modular fractal connectivity

NASA Astrophysics Data System (ADS)

Chouzouris, Teresa; Omelchenko, Iryna; Zakharova, Anna; Hlinka, Jaroslav; Jiruska, Premysl; Schöll, Eckehard

2018-04-01

Complex spatiotemporal patterns, called chimera states, consist of coexisting coherent and incoherent domains and can be observed in networks of coupled oscillators. The interplay of synchrony and asynchrony in complex brain networks is an important aspect in studies of both the brain function and disease. We analyse the collective dynamics of FitzHugh-Nagumo neurons in complex networks motivated by its potential application to epileptology and epilepsy surgery. We compare two topologies: an empirical structural neural connectivity derived from diffusion-weighted magnetic resonance imaging and a mathematically constructed network with modular fractal connectivity. We analyse the properties of chimeras and partially synchronized states and obtain regions of their stability in the parameter planes. Furthermore, we qualitatively simulate the dynamics of epileptic seizures and study the influence of the removal of nodes on the network synchronizability, which can be useful for applications to epileptic surgery.

Artificial Neural Network Based Group Contribution Method for Estimating Cetane and Octane Numbers of Hydrocarbons and Oxygenated Organic Compounds

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kubic, William Louis; Jenkins, Rhodri W.; Moore, Cameron M.

Chemical pathways for converting biomass into fuels produce compounds for which key physical and chemical property data are unavailable. We developed an artificial neural network based group contribution method for estimating cetane and octane numbers that captures the complex dependence of fuel properties of pure compounds on chemical structure and is statistically superior to current methods.

Artificial Neural Network Based Group Contribution Method for Estimating Cetane and Octane Numbers of Hydrocarbons and Oxygenated Organic Compounds

DOE PAGES

Kubic, William Louis; Jenkins, Rhodri W.; Moore, Cameron M.; ...

2017-09-28

Chemical pathways for converting biomass into fuels produce compounds for which key physical and chemical property data are unavailable. We developed an artificial neural network based group contribution method for estimating cetane and octane numbers that captures the complex dependence of fuel properties of pure compounds on chemical structure and is statistically superior to current methods.

Homological scaffolds of brain functional networks

PubMed Central

Petri, G.; Expert, P.; Turkheimer, F.; Carhart-Harris, R.; Nutt, D.; Hellyer, P. J.; Vaccarino, F.

2014-01-01

Networks, as efficient representations of complex systems, have appealed to scientists for a long time and now permeate many areas of science, including neuroimaging (Bullmore and Sporns 2009 Nat. Rev. Neurosci. 10, 186–198. (doi:10.1038/nrn2618)). Traditionally, the structure of complex networks has been studied through their statistical properties and metrics concerned with node and link properties, e.g. degree-distribution, node centrality and modularity. Here, we study the characteristics of functional brain networks at the mesoscopic level from a novel perspective that highlights the role of inhomogeneities in the fabric of functional connections. This can be done by focusing on the features of a set of topological objects—homological cycles—associated with the weighted functional network. We leverage the detected topological information to define the homological scaffolds, a new set of objects designed to represent compactly the homological features of the correlation network and simultaneously make their homological properties amenable to networks theoretical methods. As a proof of principle, we apply these tools to compare resting-state functional brain activity in 15 healthy volunteers after intravenous infusion of placebo and psilocybin—the main psychoactive component of magic mushrooms. The results show that the homological structure of the brain's functional patterns undergoes a dramatic change post-psilocybin, characterized by the appearance of many transient structures of low stability and of a small number of persistent ones that are not observed in the case of placebo. PMID:25401177

Enhanced collective influence: A paradigm to optimize network disruption

NASA Astrophysics Data System (ADS)

Wu, Tao; Chen, Leiting; Zhong, Linfeng; Xian, Xingping

2017-04-01

The function of complex networks typically relies on the integrity of underlying structure. Sometimes, practical applications need to attack networks' function, namely inactivate and fragment networks' underlying structure. To effectively dismantle complex networks and regulate the function of them, a centrality measure, named CI (Morone and Makse, 2015), was proposed for node ranking. We observe that the performance of CI centrality in network disruption problem may deteriorate when it is used in networks with different topology properties. Specifically, the structural features of local network topology are overlooked in CI centrality, even though the local network topology of the nodes with a fixed CI value may have very different organization. To improve the ranking accuracy of CI, this paper proposes a variant ECI to CI by considering loop density and degree diversity of local network topology. And the proposed ECI centrality would degenerate into CI centrality with the reduction of the loop density and the degree diversity level. By comparing ECI with CI and classical centrality measures in both synthetic and real networks, the experimental results suggest that ECI can largely improve the performance of CI for network disruption. Based on the results, we analyze the correlation between the improvement and the properties of the networks. We find that the performance of ECI is positively correlated with assortative coefficient and community modularity and negatively correlated with degree inequality of networks, which can be used as guidance for practical applications.

Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison

NASA Astrophysics Data System (ADS)

De Domenico, Manlio; Biamonte, Jacob

2016-10-01

Any physical system can be viewed from the perspective that information is implicitly represented in its state. However, the quantification of this information when it comes to complex networks has remained largely elusive. In this work, we use techniques inspired by quantum statistical mechanics to define an entropy measure for complex networks and to develop a set of information-theoretic tools, based on network spectral properties, such as Rényi q entropy, generalized Kullback-Leibler and Jensen-Shannon divergences, the latter allowing us to define a natural distance measure between complex networks. First, we show that by minimizing the Kullback-Leibler divergence between an observed network and a parametric network model, inference of model parameter(s) by means of maximum-likelihood estimation can be achieved and model selection can be performed with appropriate information criteria. Second, we show that the information-theoretic metric quantifies the distance between pairs of networks and we can use it, for instance, to cluster the layers of a multilayer system. By applying this framework to networks corresponding to sites of the human microbiome, we perform hierarchical cluster analysis and recover with high accuracy existing community-based associations. Our results imply that spectral-based statistical inference in complex networks results in demonstrably superior performance as well as a conceptual backbone, filling a gap towards a network information theory.

Networks within networks: The neuronal control of breathing

PubMed Central

Garcia, Alfredo J.; Zanella, Sebastien; Koch, Henner; Doi, Atsushi; Ramirez, Jan-Marino

2013-01-01

Breathing emerges through complex network interactions involving neurons distributed throughout the nervous system. The respiratory rhythm generating network is composed of micro networks functioning within larger networks to generate distinct rhythms and patterns that characterize breathing. The pre-Bötzinger complex, a rhythm generating network located within the ventrolateral medulla assumes a core function without which respiratory rhythm generation and breathing cease altogether. It contains subnetworks with distinct synaptic and intrinsic membrane properties that give rise to different types of respiratory rhythmic activities including eupneic, sigh, and gasping activities. While critical aspects of these rhythmic activities are preserved when isolated in in vitro preparations, the pre-Bötzinger complex functions in the behaving animal as part of a larger network that receives important inputs from areas such as the pons and parafacial nucleus. The respiratory network is also an integrator of modulatory and sensory inputs that imbue the network with the important ability to adapt to changes in the behavioral, metabolic, and developmental conditions of the organism. This review summarizes our current understanding of these interactions and relates the emerging concepts to insights gained in other rhythm generating networks. PMID:21333801

Development of pacemaker properties and rhythmogenic mechanisms in the mouse embryonic respiratory network

PubMed Central

Chevalier, Marc; Toporikova, Natalia; Simmers, John; Thoby-Brisson, Muriel

2016-01-01

Breathing is a vital rhythmic behavior generated by hindbrain neuronal circuitry, including the preBötzinger complex network (preBötC) that controls inspiration. The emergence of preBötC network activity during prenatal development has been described, but little is known regarding inspiratory neurons expressing pacemaker properties at embryonic stages. Here, we combined calcium imaging and electrophysiological recordings in mouse embryo brainstem slices together with computational modeling to reveal the existence of heterogeneous pacemaker oscillatory properties relying on distinct combinations of burst-generating INaP and ICAN conductances. The respective proportion of the different inspiratory pacemaker subtypes changes during prenatal development. Concomitantly, network rhythmogenesis switches from a purely INaP/ICAN-dependent mechanism at E16.5 to a combined pacemaker/network-driven process at E18.5. Our results provide the first description of pacemaker bursting properties in embryonic preBötC neurons and indicate that network rhythmogenesis undergoes important changes during prenatal development through alterations in both circuit properties and the biophysical characteristics of pacemaker neurons. DOI: http://dx.doi.org/10.7554/eLife.16125.001 PMID:27434668

Robustness and percolation of holes in complex networks

NASA Astrophysics Data System (ADS)

Zhou, Andu; Maletić, Slobodan; Zhao, Yi

2018-07-01

Efficient robustness and fault tolerance of complex network is significantly influenced by its connectivity, commonly modeled by the structure of pairwise relations between network elements, i.e., nodes. Nevertheless, aggregations of nodes build higher-order structures embedded in complex network, which may be more vulnerable when the fraction of nodes is removed. The structure of higher-order aggregations of nodes can be naturally modeled by simplicial complexes, whereas the removal of nodes affects the values of topological invariants, like the number of higher-dimensional holes quantified with Betti numbers. Following the methodology of percolation theory, as the fraction of nodes is removed, new holes appear, which have the role of merger between already present holes. In the present article, relationship between the robustness and homological properties of complex network is studied, through relating the graph-theoretical signatures of robustness and the quantities derived from topological invariants. The simulation results of random failures and intentional attacks on networks suggest that the changes of graph-theoretical signatures of robustness are followed by differences in the distribution of number of holes per cluster under different attack strategies. In the broader sense, the results indicate the importance of topological invariants research for obtaining further insights in understanding dynamics taking place over complex networks.

Complex networks in the Euclidean space of communicability distances

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2012-06-01

We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded routes in networks where simultaneous submission of packages is taking place. We define an index Q based on communicability and shortest path distances, which allows reinterpreting the “small-world” phenomenon as the region of minimum Q in the Watts-Strogatz model. It also allows the classification and analysis of networks with different efficiency of spatial uses. Consequently, the communicability distance displays unique features for the analysis of complex networks in different scenarios.

Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects

NASA Astrophysics Data System (ADS)

Castellano, Claudio; Pastor-Satorras, Romualdo

2017-10-01

The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically grounded expression relating the value of the largest eigenvalue of a given network to the largest eigenvalue of two network subgraphs, considered as isolated: the hub with its immediate neighbors and the densely connected set of nodes with maximum K -core index. We validate this formula by showing that it predicts, with good accuracy, the largest eigenvalue of a large set of synthetic and real-world topologies. We also present evidence of the consequences of these findings for broad classes of dynamics taking place on the networks. As a by-product, we reveal that the spectral properties of heterogeneous networks built according to the linear preferential attachment model are qualitatively different from those of their static counterparts.

The effect of the neural activity on topological properties of growing neural networks.

PubMed

Gafarov, F M; Gafarova, V R

2016-09-01

The connectivity structure in cortical networks defines how information is transmitted and processed, and it is a source of the complex spatiotemporal patterns of network's development, and the process of creation and deletion of connections is continuous in the whole life of the organism. In this paper, we study how neural activity influences the growth process in neural networks. By using a two-dimensional activity-dependent growth model we demonstrated the neural network growth process from disconnected neurons to fully connected networks. For making quantitative investigation of the network's activity influence on its topological properties we compared it with the random growth network not depending on network's activity. By using the random graphs theory methods for the analysis of the network's connections structure it is shown that the growth in neural networks results in the formation of a well-known "small-world" network.

Insight to the express transport network

NASA Astrophysics Data System (ADS)

Yang, Hua; Nie, Yuchao; Zhang, Hongbin; Di, Zengru; Fan, Ying

2009-09-01

The express delivery industry is developing rapidly in recent years and has attracted attention in many fields. Express shipment service requires that parcels be delivered in a limited time with a low operation cost, which requests a high level and efficient express transport network (ETN). The ETN is constructed based on the public transport networks, especially the airline network. It is similar to the airline network in some aspects, while it has its own feature. With the complex network theory, the topological properties of the ETN are analyzed deeply. We find that the ETN has the small-world property, with disassortative mixing behavior and rich club phenomenon. It also shows difference from the airline network in some features, such as edge density and average shortest path. Analysis on the corresponding distance-weighted network shows that the distance distribution displays a truncated power-law behavior. At last, an evolving model, which takes both geographical constraint and preference attachment into account, is proposed. The model shows similar properties with the empirical results.

Physical properties of mixed dairy food proteins

USDA-ARS?s Scientific Manuscript database

Mixed food protein gels are complex systems, which changes functional behaviors such as gelling properties and viscosity depending on the miscibility of the proteins. We have noted that differences in co-solubility of mixed proteins created unique network structures and gel properties. The effects o...

Using arborescences to estimate hierarchicalness in directed complex networks

PubMed Central

2018-01-01

Complex networks are a useful tool for the understanding of complex systems. One of the emerging properties of such systems is their tendency to form hierarchies: networks can be organized in levels, with nodes in each level exerting control on the ones beneath them. In this paper, we focus on the problem of estimating how hierarchical a directed network is. We propose a structural argument: a network has a strong top-down organization if we need to delete only few edges to reduce it to a perfect hierarchy—an arborescence. In an arborescence, all edges point away from the root and there are no horizontal connections, both characteristics we desire in our idealization of what a perfect hierarchy requires. We test our arborescence score in synthetic and real-world directed networks against the current state of the art in hierarchy detection: agony, flow hierarchy and global reaching centrality. These tests highlight that our arborescence score is intuitive and we can visualize it; it is able to better distinguish between networks with and without a hierarchical structure; it agrees the most with the literature about the hierarchy of well-studied complex systems; and it is not just a score, but it provides an overall scheme of the underlying hierarchy of any directed complex network. PMID:29381761

A Comparative Analysis of Community Detection Algorithms on Artificial Networks

PubMed Central

Yang, Zhao; Algesheimer, René; Tessone, Claudio J.

2016-01-01

Many community detection algorithms have been developed to uncover the mesoscopic properties of complex networks. However how good an algorithm is, in terms of accuracy and computing time, remains still open. Testing algorithms on real-world network has certain restrictions which made their insights potentially biased: the networks are usually small, and the underlying communities are not defined objectively. In this study, we employ the Lancichinetti-Fortunato-Radicchi benchmark graph to test eight state-of-the-art algorithms. We quantify the accuracy using complementary measures and algorithms’ computing time. Based on simple network properties and the aforementioned results, we provide guidelines that help to choose the most adequate community detection algorithm for a given network. Moreover, these rules allow uncovering limitations in the use of specific algorithms given macroscopic network properties. Our contribution is threefold: firstly, we provide actual techniques to determine which is the most suited algorithm in most circumstances based on observable properties of the network under consideration. Secondly, we use the mixing parameter as an easily measurable indicator of finding the ranges of reliability of the different algorithms. Finally, we study the dependency with network size focusing on both the algorithm’s predicting power and the effective computing time. PMID:27476470

Dissortativity and duplications in oral cancer

NASA Astrophysics Data System (ADS)

Shinde, Pramod; Yadav, Alok; Rai, Aparna; Jalan, Sarika

2015-08-01

More than 300 000 new cases worldwide are being diagnosed with oral cancer annually. Complexity of oral cancer renders designing drug targets very difficult. We analyse protein-protein interaction network for the normal and oral cancer tissue and detect crucial changes in the structural properties of the networks in terms of the interactions of the hub proteins and the degree-degree correlations. Further analysis of the spectra of both the networks, while exhibiting universal statistical behaviour, manifest distinction in terms of the zero degeneracy, providing insight to the complexity of the underlying system.

Networks in Cell Biology

NASA Astrophysics Data System (ADS)

Buchanan, Mark; Caldarelli, Guido; De Los Rios, Paolo; Rao, Francesco; Vendruscolo, Michele

2010-05-01

Introduction; 1. Network views of the cell Paolo De Los Rios and Michele Vendruscolo; 2. Transcriptional regulatory networks Sarath Chandra Janga and M. Madan Babu; 3. Transcription factors and gene regulatory networks Matteo Brilli, Elissa Calistri and Pietro Lió; 4. Experimental methods for protein interaction identification Peter Uetz, Björn Titz, Seesandra V. Rajagopala and Gerard Cagney; 5. Modeling protein interaction networks Francesco Rao; 6. Dynamics and evolution of metabolic networks Daniel Segré; 7. Hierarchical modularity in biological networks: the case of metabolic networks Erzsébet Ravasz Regan; 8. Signalling networks Gian Paolo Rossini; Appendix 1. Complex networks: from local to global properties D. Garlaschelli and G. Caldarelli; Appendix 2. Modelling the local structure of networks D. Garlaschelli and G. Caldarelli; Appendix 3. Higher-order topological properties S. Ahnert, T. Fink and G. Caldarelli; Appendix 4. Elementary mathematical concepts A. Gabrielli and G. Caldarelli; References.

Inferring general relations between network characteristics from specific network ensembles.

PubMed

Cardanobile, Stefano; Pernice, Volker; Deger, Moritz; Rotter, Stefan

2012-01-01

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.

A Synthetic Biology Framework for Programming Eukaryotic Transcription Functions

PubMed Central

Khalil, Ahmad S.; Lu, Timothy K.; Bashor, Caleb J.; Ramirez, Cherie L.; Pyenson, Nora C.; Joung, J. Keith; Collins, James J.

2013-01-01

SUMMARY Eukaryotic transcription factors (TFs) perform complex and combinatorial functions within transcriptional networks. Here, we present a synthetic framework for systematically constructing eukaryotic transcription functions using artificial zinc fingers, modular DNA-binding domains found within many eukaryotic TFs. Utilizing this platform, we construct a library of orthogonal synthetic transcription factors (sTFs) and use these to wire synthetic transcriptional circuits in yeast. We engineer complex functions, such as tunable output strength and transcriptional cooperativity, by rationally adjusting a decomposed set of key component properties, e.g., DNA specificity, affinity, promoter design, protein-protein interactions. We show that subtle perturbations to these properties can transform an individual sTF between distinct roles (activator, cooperative factor, inhibitory factor) within a transcriptional complex, thus drastically altering the signal processing behavior of multi-input systems. This platform provides new genetic components for synthetic biology and enables bottom-up approaches to understanding the design principles of eukaryotic transcriptional complexes and networks. PMID:22863014

Preprogramming Complex Hydrogel Responses using Enzymatic Reaction Networks.

PubMed

Postma, Sjoerd G J; Vialshin, Ilia N; Gerritsen, Casper Y; Bao, Min; Huck, Wilhelm T S

2017-02-06

The creation of adaptive matter is heavily inspired by biological systems. However, it remains challenging to design complex material responses that are governed by reaction networks, which lie at the heart of cellular complexity. The main reason for this slow progress is the lack of a general strategy to integrate reaction networks with materials. Herein we use a systematic approach to preprogram the response of a hydrogel to a trigger, in this case the enzyme trypsin, which activates a reaction network embedded within the hydrogel. A full characterization of all the kinetic rate constants in the system enabled the construction of a computational model, which predicted different hydrogel responses depending on the input concentration of the trigger. The results of the simulation are in good agreement with experimental findings. Our methodology can be used to design new, adaptive materials of which the properties are governed by reaction networks of arbitrary complexity. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

A study of structural properties of gene network graphs for mathematical modeling of integrated mosaic gene networks.

PubMed

Petrovskaya, Olga V; Petrovskiy, Evgeny D; Lavrik, Inna N; Ivanisenko, Vladimir A

2017-04-01

Gene network modeling is one of the widely used approaches in systems biology. It allows for the study of complex genetic systems function, including so-called mosaic gene networks, which consist of functionally interacting subnetworks. We conducted a study of a mosaic gene networks modeling method based on integration of models of gene subnetworks by linear control functionals. An automatic modeling of 10,000 synthetic mosaic gene regulatory networks was carried out using computer experiments on gene knockdowns/knockouts. Structural analysis of graphs of generated mosaic gene regulatory networks has revealed that the most important factor for building accurate integrated mathematical models, among those analyzed in the study, is data on expression of genes corresponding to the vertices with high properties of centrality.

Reactive immunization on complex networks

NASA Astrophysics Data System (ADS)

Alfinito, Eleonora; Beccaria, Matteo; Fachechi, Alberto; Macorini, Guido

2017-01-01

Epidemic spreading on complex networks depends on the topological structure as well as on the dynamical properties of the infection itself. Generally speaking, highly connected individuals play the role of hubs and are crucial to channel information across the network. On the other hand, static topological quantities measuring the connectivity structure are independent of the dynamical mechanisms of the infection. A natural question is therefore how to improve the topological analysis by some kind of dynamical information that may be extracted from the ongoing infection itself. In this spirit, we propose a novel vaccination scheme that exploits information from the details of the infection pattern at the moment when the vaccination strategy is applied. Numerical simulations of the infection process show that the proposed immunization strategy is effective and robust on a wide class of complex networks.

Identifying important nodes by adaptive LeaderRank

NASA Astrophysics Data System (ADS)

Xu, Shuang; Wang, Pei

2017-03-01

Spreading process is a common phenomenon in complex networks. Identifying important nodes in complex networks is of great significance in real-world applications. Based on the spreading process on networks, a lot of measures have been proposed to evaluate the importance of nodes. However, most of the existing measures are appropriate to static networks, which are fragile to topological perturbations. Many real-world complex networks are dynamic rather than static, meaning that the nodes and edges of such networks may change with time, which challenge numerous existing centrality measures. Based on a new weighted mechanism and the newly proposed H-index and LeaderRank (LR), this paper introduces a variant of the LR measure, called adaptive LeaderRank (ALR), which is a new member of the LR-family. Simulations on six real-world networks reveal that the new measure can well balance between prediction accuracy and robustness. More interestingly, the new measure can better adapt to the adjustment or local perturbations of network topologies, as compared with the existing measures. By discussing the detailed properties of the measures from the LR-family, we illustrate that the ALR has its competitive advantages over the other measures. The proposed algorithm enriches the measures to understand complex networks, and may have potential applications in social networks and biological systems.

Self-determined mechanisms in complex networks

NASA Astrophysics Data System (ADS)

Liu, Yang; Yuan, Jian; Shan, Xiuming; Ren, Yong; Ma, Zhengxin

2008-03-01

Self-organized networks are pervasive in communication systems such as the Internet, overlay networks, peer-to-peer networks, and cluster-based services. These networks evolve into complex topologies, under specific driving forces, i.e. user demands, technological innovations, design objectives and so on. Our study focuses on the driving forces behind individual evolutions of network components, and their stimulation and domination to the self-organized networks which are defined as self-determined mechanisms in this paper. Understanding forces underlying the evolution of networks should enable informed design decisions and help to avoid unwanted surprises, such as congestion collapse. A case study on the macroscopic evolution of the Internet topology of autonomous systems under a specific driving force is then presented. Using computer simulations, it is found that the power-law degree distribution can originate from a connection preference to larger numbers of users, and that the small-world property can be caused by rapid growth in the number of users. Our results provide a new feasible perspective to understand intrinsic fundamentals in the topological evolution of complex networks.

Synchronization stability of memristor-based complex-valued neural networks with time delays.

PubMed

Liu, Dan; Zhu, Song; Ye, Er

2017-12-01

This paper focuses on the dynamical property of a class of memristor-based complex-valued neural networks (MCVNNs) with time delays. By constructing the appropriate Lyapunov functional and utilizing the inequality technique, sufficient conditions are proposed to guarantee exponential synchronization of the coupled systems based on drive-response concept. The proposed results are very easy to verify, and they also extend some previous related works on memristor-based real-valued neural networks. Meanwhile, the obtained sufficient conditions of this paper may be conducive to qualitative analysis of some complex-valued nonlinear delayed systems. A numerical example is given to demonstrate the effectiveness of our theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Influence of reciprocal edges on degree distribution and degree correlations

NASA Astrophysics Data System (ADS)

Zlatić, Vinko; Štefančić, Hrvoje

2009-07-01

Reciprocal edges represent the lowest-order cycle possible to find in directed graphs without self-loops. Representing also a measure of feedback between vertices, it is interesting to understand how reciprocal edges influence other properties of complex networks. In this paper, we focus on the influence of reciprocal edges on vertex degree distribution and degree correlations. We show that there is a fundamental difference between properties observed on the static network compared to the properties of networks, which are obtained by simple evolution mechanism driven by reciprocity. We also present a way to statistically infer the portion of reciprocal edges, which can be explained as a consequence of feedback process on the static network. In the rest of the paper, the influence of reciprocal edges on a model of growing network is also presented. It is shown that our model of growing network nicely interpolates between Barabási-Albert (BA) model for undirected and the BA model for directed networks.

Association of Structural Global Brain Network Properties with Intelligence in Normal Aging

PubMed Central

Fischer, Florian U.; Wolf, Dominik; Scheurich, Armin; Fellgiebel, Andreas

2014-01-01

Higher general intelligence attenuates age-associated cognitive decline and the risk of dementia. Thus, intelligence has been associated with cognitive reserve or resilience in normal aging. Neurophysiologically, intelligence is considered as a complex capacity that is dependent on a global cognitive network rather than isolated brain areas. An association of structural as well as functional brain network characteristics with intelligence has already been reported in young adults. We investigated the relationship between global structural brain network properties, general intelligence and age in a group of 43 cognitively healthy elderly, age 60–85 years. Individuals were assessed cross-sectionally using Wechsler Adult Intelligence Scale-Revised (WAIS-R) and diffusion-tensor imaging. Structural brain networks were reconstructed individually using deterministic tractography, global network properties (global efficiency, mean shortest path length, and clustering coefficient) were determined by graph theory and correlated to intelligence scores within both age groups. Network properties were significantly correlated to age, whereas no significant correlation to WAIS-R was observed. However, in a subgroup of 15 individuals aged 75 and above, the network properties were significantly correlated to WAIS-R. Our findings suggest that general intelligence and global properties of structural brain networks may not be generally associated in cognitively healthy elderly. However, we provide first evidence of an association between global structural brain network properties and general intelligence in advanced elderly. Intelligence might be affected by age-associated network deterioration only if a certain threshold of structural degeneration is exceeded. Thus, age-associated brain structural changes seem to be partially compensated by the network and the range of this compensation might be a surrogate of cognitive reserve or brain resilience. PMID:24465994

Complex Networks in Different Languages: A Study of an Emergent Multilingual Encyclopedia

NASA Astrophysics Data System (ADS)

Pembe, F. Canan; Bingol, Haluk

There is an increasing interest to the study of complex networks in an interdisciplinary way. Language, as a complex network, has been a part of this study due to its importance in human life. Moreover, the Internet has also been at the center of this study by making access to large amounts of information possible. With these ideas in mind, this work aims to evaluate conceptual networks in different languages with the data from a large and open source of information in the Internet, namely Wikipedia. As an evolving multilingual encyclopedia that can be edited by any Internet user, Wikipedia is a good example of an emergent complex system. In this paper, different from previous work on conceptual networks which usually concentrated on single languages, we concentrate on possible ways to compare the usages of different languages and possibly the underlying cultures. This also involves the analysis of local network properties around certain coneepts in different languages. For an initial evaluation, the concept "family" is used to compare the English and German Wikipedias. Although, the work is currently at the beginning, the results are promising.

Evaluating the Spatio-Temporal Factors that Structure Network Parameters of Plant-Herbivore Interactions

PubMed Central

López-Carretero, Antonio; Díaz-Castelazo, Cecilia; Boege, Karina; Rico-Gray, Víctor

2014-01-01

Despite the dynamic nature of ecological interactions, most studies on species networks offer static representations of their structure, constraining our understanding of the ecological mechanisms involved in their spatio-temporal stability. This is the first study to evaluate plant-herbivore interaction networks on a small spatio-temporal scale. Specifically, we simultaneously assessed the effect of host plant availability, habitat complexity and seasonality on the structure of plant-herbivore networks in a coastal tropical ecosystem. Our results revealed that changes in the host plant community resulting from seasonality and habitat structure are reflected not only in the herbivore community, but also in the emergent properties (network parameters) of the plant-herbivore interaction network such as connectance, selectiveness and modularity. Habitat conditions and periods that are most stressful favored the presence of less selective and susceptible herbivore species, resulting in increased connectance within networks. In contrast, the high degree of selectivennes (i.e. interaction specialization) and modularity of the networks under less stressful conditions was promoted by the diversification in resource use by herbivores. By analyzing networks at a small spatio-temporal scale we identified the ecological factors structuring this network such as habitat complexity and seasonality. Our research offers new evidence on the role of abiotic and biotic factors in the variation of the properties of species interaction networks. PMID:25340790

A Complex Systems Approach to Causal Discovery in Psychiatry.

PubMed

Saxe, Glenn N; Statnikov, Alexander; Fenyo, David; Ren, Jiwen; Li, Zhiguo; Prasad, Meera; Wall, Dennis; Bergman, Nora; Briggs, Ernestine C; Aliferis, Constantin

2016-01-01

Conventional research methodologies and data analytic approaches in psychiatric research are unable to reliably infer causal relations without experimental designs, or to make inferences about the functional properties of the complex systems in which psychiatric disorders are embedded. This article describes a series of studies to validate a novel hybrid computational approach--the Complex Systems-Causal Network (CS-CN) method-designed to integrate causal discovery within a complex systems framework for psychiatric research. The CS-CN method was first applied to an existing dataset on psychopathology in 163 children hospitalized with injuries (validation study). Next, it was applied to a much larger dataset of traumatized children (replication study). Finally, the CS-CN method was applied in a controlled experiment using a 'gold standard' dataset for causal discovery and compared with other methods for accurately detecting causal variables (resimulation controlled experiment). The CS-CN method successfully detected a causal network of 111 variables and 167 bivariate relations in the initial validation study. This causal network had well-defined adaptive properties and a set of variables was found that disproportionally contributed to these properties. Modeling the removal of these variables resulted in significant loss of adaptive properties. The CS-CN method was successfully applied in the replication study and performed better than traditional statistical methods, and similarly to state-of-the-art causal discovery algorithms in the causal detection experiment. The CS-CN method was validated, replicated, and yielded both novel and previously validated findings related to risk factors and potential treatments of psychiatric disorders. The novel approach yields both fine-grain (micro) and high-level (macro) insights and thus represents a promising approach for complex systems-oriented research in psychiatry.

The guitar chord-generating algorithm based on complex network

NASA Astrophysics Data System (ADS)

Ren, Tao; Wang, Yi-fan; Du, Dan; Liu, Miao-miao; Siddiqi, Awais

2016-02-01

This paper aims to generate chords for popular songs automatically based on complex network. Firstly, according to the characteristics of guitar tablature, six chord networks of popular songs by six pop singers are constructed and the properties of all networks are concluded. By analyzing the diverse chord networks, the accompaniment regulations and features are shown, with which the chords can be generated automatically. Secondly, in terms of the characteristics of popular songs, a two-tiered network containing a verse network and a chorus network is constructed. With this network, the verse and chorus can be composed respectively with the random walk algorithm. Thirdly, the musical motif is considered for generating chords, with which the bad chord progressions can be revised. This method can make the accompaniments sound more melodious. Finally, a popular song is chosen for generating chords and the new generated accompaniment sounds better than those done by the composers.

Large-scale Cortical Network Properties Predict Future Sound-to-Word Learning Success

PubMed Central

Sheppard, John Patrick; Wang, Ji-Ping; Wong, Patrick C. M.

2013-01-01

The human brain possesses a remarkable capacity to interpret and recall novel sounds as spoken language. These linguistic abilities arise from complex processing spanning a widely distributed cortical network and are characterized by marked individual variation. Recently, graph theoretical analysis has facilitated the exploration of how such aspects of large-scale brain functional organization may underlie cognitive performance. Brain functional networks are known to possess small-world topologies characterized by efficient global and local information transfer, but whether these properties relate to language learning abilities remains unknown. Here we applied graph theory to construct large-scale cortical functional networks from cerebral hemodynamic (fMRI) responses acquired during an auditory pitch discrimination task and found that such network properties were associated with participants’ future success in learning words of an artificial spoken language. Successful learners possessed networks with reduced local efficiency but increased global efficiency relative to less successful learners and had a more cost-efficient network organization. Regionally, successful and less successful learners exhibited differences in these network properties spanning bilateral prefrontal, parietal, and right temporal cortex, overlapping a core network of auditory language areas. These results suggest that efficient cortical network organization is associated with sound-to-word learning abilities among healthy, younger adults. PMID:22360625

Mechanically tunable actin networks using programmable DNA based cross-linkers

NASA Astrophysics Data System (ADS)

Schnauss, Joerg; Lorenz, Jessica; Schuldt, Carsten; Kaes, Josef; Smith, David

Cells employ multiple cross-linkers with very different properties. Studies of the entire phase space, however, were infeasible since they were restricted to naturally occurring cross-linkers. These components cannot be controllably varied and differ in many parameters. We resolve this limitation by forming artificial actin cross-linkers, which can be controllably varied. The basic building block is DNA enabling a well-defined length variation. DNA can be attached to actin binding peptides with known binding affinities. We used bulk rheology to investigate mechanical properties of these networks. We were able to reproduce mechanical features of actin networks cross-linked by fascin by using a short version of our artificial complex with a high binding affinity. Additionally, we were able to resemble findings for the cross-linker alpha-actinin by employing a long cross-linker with a low binding affinity. Between these natural limits we investigated three different cross-linker lengths each with two different binding affinities. With these controlled variations we are able to precisely screen the phase space of cross-linked actin networks by changing only one specific parameter and not the entire set of properties as in the case of naturally occurring cross-linking complexes.

PREFACE: Complex Networks: from Biology to Information Technology

NASA Astrophysics Data System (ADS)

Barrat, A.; Boccaletti, S.; Caldarelli, G.; Chessa, A.; Latora, V.; Motter, A. E.

2008-06-01

The field of complex networks is one of the most active areas in contemporary statistical physics. Ten years after seminal work initiated the modern study of networks, interest in the field is in fact still growing, as indicated by the ever increasing number of publications in network science. The reason for such a resounding success is most likely the simplicity and broad significance of the approach that, through graph theory, allows researchers to address a variety of different complex systems within a common framework. This special issue comprises a selection of contributions presented at the workshop 'Complex Networks: from Biology to Information Technology' held in July 2007 in Pula (Cagliari), Italy as a satellite of the general conference STATPHYS23. The contributions cover a wide range of problems that are currently among the most important questions in the area of complex networks and that are likely to stimulate future research. The issue is organised into four sections. The first two sections describe 'methods' to study the structure and the dynamics of complex networks, respectively. After this methodological part, the issue proceeds with a section on applications to biological systems. The issue closes with a section concentrating on applications to the study of social and technological networks. The first section, entitled Methods: The Structure, consists of six contributions focused on the characterisation and analysis of structural properties of complex networks: The paper Motif-based communities in complex networks by Arenas et al is a study of the occurrence of characteristic small subgraphs in complex networks. These subgraphs, known as motifs, are used to define general classes of nodes and their communities by extending the mathematical expression of the Newman-Girvan modularity. The same line of research, aimed at characterising network structure through the analysis of particular subgraphs, is explored by Bianconi and Gulbahce in Algorithm for counting large directed loops. This work proposes a belief-propagation algorithm for counting long loops in directed networks, which is then applied to networks of different sizes and loop structure. In The anatomy of a large query graph, Baeza-Yates and Tiberi show that scale invariance is present also in the structure of a graph derived from query logs. This graph is determined not only by the queries but also by the subsequent actions of the users. The graph analysed in this study is generated by more than twenty million queries and is less sparse than suggested by previous studies. A different class of networks is considered by Travençolo and da F Costa in Hierarchical spatial organisation of geographical networks. This work proposes a hierarchical extension of the polygonality index as a means to characterise geographical planar networks and, in particular, to obtain more complete information about the spatial order of the network at progressive spatial scales. The paper Border trees of complex networks by Villas Boas et al focuses instead on the statistical properties of the boundary of graphs, constituted by the vertices of degree one (the leaves of border trees). The authors study the local properties, the depth, and the number of leaves of these border trees, finding that in some real networks more than half of the nodes belong to the border trees. The last contribution to the first section is The generation of random directed networks with prescribed 1-node and 2-node degree correlations by Zamora-López et al. This study deals with the generation of random directed networks and shows that often a large number of links cannot be 'randomised' without altering the degree correlations. This permits fast generation of ensembles of maximally random networks. In the section Methods: The Dynamics, significant attention is given to the study of synchronisation processes on networks: Díaz-Guilera's contribution Dynamics towards synchronisation in hierarchical networks consists of an overview of recent studies on hierarchical networks of phase oscillators. By analysing the evolution of the synchronous dynamics, one can infer details about the underlying network topology. Thus a connection between the dynamical and topological properties of the system is established. The paper Network synchronisation: optimal and pessimal scale-free topologies by Donetti et al explores an optimisation algorithm to study the properties of optimally synchronisable unweighted networks with scale-free degree distribution. It is shown that optimisation leads to a tendency towards disassortativity while networks that are optimally 'un-synchronisable' have a highly assortative string-like structure. The paper Critical line in undirected Kauffman Boolean networks—the role of percolation by Fronczak and Fronczak demonstrates that the percolation underlying the process of damage spreading impacts the position of the critical line in random boolean networks. The critical line results from the fact that the ordered behaviour of small clusters shields the chaotic behaviour of the giant component. In Impact of the updating scheme on stationary states of networks, Radicchi et al explore an interpolation between synchronous and asynchronous updating in a one-dimensional chain of Ising spins to locate a phase transition between phases with an absorbing and a fluctuating stationary state. The properties of attractors in the yeast cell-cycle network are also shown to depend sensitively on the updating mode. As this last contribution shows, a large part of the theoretical activity in the field can be applied to the study of biological systems. The section Biological Applications brings together the following contributions: In Applying weighted network measures to microarray distance matrices, Ahnert et al present a new approach to the analysis of weighted networks, which provides a generalisation to any network measure defined on unweighted networks. The clustering coefficient constructed using this approach is used to identify a number of biologically significant genes in data sets from microarray experiments. The paper Quantifying the taxonomic diversity in real species communities by Caretta Cartozo et al reports on universal statistical properties in taxonomic trees. The results, which are obtained by sampling a large pool of species from all over the world, suggest that it is possible to quantitatively distinguish real species assemblage from random collections. In the contribution Insights into biological information processing: structural and dynamical analysis of a human protein signalling network, de la Fuente et al investigate the dynamical properties of a human protein signalling network while accounting for edge directionality and topological properties both at the local and global scale. The relationship between the node degrees and the distribution of signals through the network is characterised using degree correlation profiles. A study of a brain network is presented by de Vico Fallani et al in Persistent patterns of interconnection in time-varying cortical networks estimated from high-resolution EEG recordings in humans during a simple motor act. The authors introduce an approach based on the estimate of time-varying graph indexes that allows the capture of schemes of communication within the network. The method is applied to a set of high resolution EEG data recorded from a group of subjects performing a simple foot movement. The last section, devoted to Social and Technological Applications, includes nine contributions in the broad area of infrastructure, economic, and social systems: The paper Uncovering individual and collective human dynamics from mobile phone records by Cándia et al explores extensive phone records resolved in both time and space to study collective behaviour and the occurrence of anomalous events. At the individual level, it is shown that the distribution of time intervals between consecutive calls is heavy tailed, which agrees with results previously reported on other human activities. In Mining the inner structure of the Web graph, Donato et al present a series of measurements of the Web, which offer a better understanding of the individual components of its bow-tie structure. The scale-free properties permeate all bow-tie components although they do not exhibit self-similarity and their inner structure is quite distinct. Effects of network topology on wealth distributions, by Garlaschelli and Loffredo, shows that a networked economic system self-organises towards a stationary state whose associated wealth distribution depends crucially on the underlying interaction network. In particular, this study implies that first-order topological properties alone (such as the scale-free property) are not enough to explain the emergence of the empirically observed mixed form of the wealth distribution. In the paper Resource allocation pattern in infrastructure networks, Kim and Motter show that real communication and transportation networks tend to exhibit larger load-to-capacity ratio in nodes and links with larger capacities. This surprising pattern, which is a consequence of decentralised evolution and network traffic fluctuations, suggests that infrastructure networks have evolved to prevent local failures but not necessarily large-scale failures that can be caused by cascading processes. The paper Consensus formation on coevolving networks: groups' formation and structure by Kozma and Barrat addresses the effect of adaptivity on a social model of opinion dynamics and consensus formation. The authors find that on adaptive networks the rewiring process fosters group formation by enhancing communication between agents of similar opinion, though it also makes possible the division of clusters. This result is significantly different from the percolation phenomena observed to govern the process in static networks. Capocci and Caldarelli, in the paper Folksonomies and clustering in the collaborative system CiteULike, analyse an online collaborative tagging system where users bookmark and annotate scientific papers. Such a system can be naturally represented as a tripartite graph whose nodes represent papers, users and tags connected by individual tag assignments. The semantics of tags is studied in order to uncover hidden relationships between tags. The authors find that the clustering coefficient reflects the semantical patterns among tags. Lambiotte's contribution, Majority rule on heterogeneous networks, focuses on the majority rule model for opinion formation when the agents interact through a complex network. It is shown that on networks with modular structures the system may exhibit an asymmetric regime, where nodes in different communities reach opposite average opinions. In addition, the node degree heterogeneity is shown to play an important role in the emergence of collective behaviour. In Structural analysis of behavioural networks from the Internet, Meiss et al analyse the structure of the Internet. The authors present a characterisation of the properties of the behavioural networks generated by several million users of the Abilene (Internet2) network. Structural features of these networks offer new insights into scaling properties of network activity and ways of distinguishing particular patterns of traffic. The final contribution, A social network's changing statistical properties and the quality of human innovation by Uzzi, is an analysis of the collaboration network of artists that made Broadway musicals in the post World War II period. It is shown that when the clustering coefficient in this network is low or high, the financial and artistic success of the industry is low while an intermediate level of clustering is associated with successful shows. We hope that this special issue will serve as a reference of the state of the knowledge in this exciting area of interdisciplinary research and that it will appeal to both experts and newcomers to the field. Finally, we would like to thank all participants of the workshop for their very significant contributions and the IOP Publishing team, particularly Rebecca Gillan, for the careful production of this special issue.

Collaborative learning in networks.

PubMed

Mason, Winter; Watts, Duncan J

2012-01-17

Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions.

Collaborative learning in networks

PubMed Central

Mason, Winter; Watts, Duncan J.

2012-01-01

Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions. PMID:22184216

Disrupted Small-World Networks in Schizophrenia

ERIC Educational Resources Information Center

Liu, Yong; Liang, Meng; Zhou, Yuan; He, Yong; Hao, Yihui; Song, Ming; Yu, Chunshui; Liu, Haihong; Liu, Zhening; Jiang, Tianzi

2008-01-01

The human brain has been described as a large, sparse, complex network characterized by efficient small-world properties, which assure that the brain generates and integrates information with high efficiency. Many previous neuroimaging studies have provided consistent evidence of "dysfunctional connectivity" among the brain regions in…

Syntheses, crystal structures and properties of novel copper(II) complexes obtained by reactions of copper(II) sulfate pentahydrate with tripodal ligands.

PubMed

Zhao, Wei; Fan, Jian; Song, You; Kawaguchi, Hiroyuki; Okamura, Taka-aki; Sun, Wei-Yin; Ueyama, Norikazu

2005-04-21

Three novel metal-organic frameworks (MOFs), [Cu(1)SO4].H2O (4), [Cu2(2)2(SO4)2].4H2O (5) and [Cu(3)(H2O)]SO4.5.5H2O (6), were obtained by hydrothermal reactions of CuSO4.5H2O with the corresponding ligands, which have different flexibility. The structures of the synthesized complexes were determined by single-crystal X-ray diffraction analyses. Complex 4 has a 2D network structure with two types of metallacycles. Complex 5 also has a 2D network structure in which each independent 2D sheet contains two sub-layers bridged by oxygen atoms of the sulfate anions. Complex 6 has a 2D puckered structure in which the sulfate anions serve as counter anions, which are different from those in complexes 4 (terminators) and 5 (bridges). The different structures of complexes 4, 5 and 6 indicate that the nature of organic ligands affected the structures of the assemblies greatly. The magnetic behavior of complex 5 and anion-exchange properties of complex 6 were investigated.

Folding energy landscape and network dynamics of small globular proteins

PubMed Central

Hori, Naoto; Chikenji, George; Berry, R. Stephen; Takada, Shoji

2009-01-01

The folding energy landscape of proteins has been suggested to be funnel-like with some degree of ruggedness on the slope. How complex the landscape, however, is still rather unclear. Many experiments for globular proteins suggested relative simplicity, whereas molecular simulations of shorter peptides implied more complexity. Here, by using complete conformational sampling of 2 globular proteins, protein G and src SH3 domain and 2 related random peptides, we investigated their energy landscapes, topological properties of folding networks, and folding dynamics. The projected energy surfaces of globular proteins were funneled in the vicinity of the native but also have other quite deep, accessible minima, whereas the randomized peptides have many local basins, including some leading to seriously misfolded forms. Dynamics in the denatured part of the network exhibited basin-hopping itinerancy among many conformations, whereas the protein reached relatively well-defined final stages that led to their native states. We also found that the folding network has the hierarchic nature characterized by the scale-free and the small-world properties. PMID:19114654

Folding energy landscape and network dynamics of small globular proteins.

PubMed

Hori, Naoto; Chikenji, George; Berry, R Stephen; Takada, Shoji

2009-01-06

The folding energy landscape of proteins has been suggested to be funnel-like with some degree of ruggedness on the slope. How complex the landscape, however, is still rather unclear. Many experiments for globular proteins suggested relative simplicity, whereas molecular simulations of shorter peptides implied more complexity. Here, by using complete conformational sampling of 2 globular proteins, protein G and src SH3 domain and 2 related random peptides, we investigated their energy landscapes, topological properties of folding networks, and folding dynamics. The projected energy surfaces of globular proteins were funneled in the vicinity of the native but also have other quite deep, accessible minima, whereas the randomized peptides have many local basins, including some leading to seriously misfolded forms. Dynamics in the denatured part of the network exhibited basin-hopping itinerancy among many conformations, whereas the protein reached relatively well-defined final stages that led to their native states. We also found that the folding network has the hierarchic nature characterized by the scale-free and the small-world properties.

From molecular noise to behavioural variability in a single bacterium

NASA Astrophysics Data System (ADS)

Korobkova, Ekaterina; Emonet, Thierry; Vilar, Jose M. G.; Shimizu, Thomas S.; Cluzel, Philippe

2004-04-01

The chemotaxis network that governs the motion of Escherichia coli has long been studied to gain a general understanding of signal transduction. Although this pathway is composed of just a few components, it exhibits some essential characteristics of biological complexity, such as adaptation and response to environmental signals. In studying intracellular networks, most experiments and mathematical models have assumed that network properties can be inferred from population measurements. However, this approach masks underlying temporal fluctuations of intracellular signalling events. We have inferred fundamental properties of the chemotaxis network from a noise analysis of behavioural variations in individual bacteria. Here we show that certain properties established by population measurements, such as adapted states, are not conserved at the single-cell level: for timescales ranging from seconds to several minutes, the behaviour of non-stimulated cells exhibit temporal variations much larger than the expected statistical fluctuations. We find that the signalling network itself causes this noise and identify the molecular events that produce it. Small changes in the concentration of one key network component suppress temporal behavioural variability, suggesting that such variability is a selected property of this adaptive system.

On the contributions of topological features to transcriptional regulatory network robustness

PubMed Central

2012-01-01

Background Because biological networks exhibit a high-degree of robustness, a systemic understanding of their architecture and function requires an appraisal of the network design principles that confer robustness. In this project, we conduct a computational study of the contribution of three degree-based topological properties (transcription factor-target ratio, degree distribution, cross-talk suppression) and their combinations on the robustness of transcriptional regulatory networks. We seek to quantify the relative degree of robustness conferred by each property (and combination) and also to determine the extent to which these properties alone can explain the robustness observed in transcriptional networks. Results To study individual properties and their combinations, we generated synthetic, random networks that retained one or more of the three properties with values derived from either the yeast or E. coli gene regulatory networks. Robustness of these networks were estimated through simulation. Our results indicate that the combination of the three properties we considered explains the majority of the structural robustness observed in the real transcriptional networks. Surprisingly, scale-free degree distribution is, overall, a minor contributor to robustness. Instead, most robustness is gained through topological features that limit the complexity of the overall network and increase the transcription factor subnetwork sparsity. Conclusions Our work demonstrates that (i) different types of robustness are implemented by different topological aspects of the network and (ii) size and sparsity of the transcription factor subnetwork play an important role for robustness induction. Our results are conserved across yeast and E Coli, which suggests that the design principles examined are present within an array of living systems. PMID:23194062

Disrupted subject-specific gray matter network properties and cognitive dysfunction in type 1 diabetes patients with and without proliferative retinopathy.

PubMed

van Duinkerken, Eelco; Ijzerman, Richard G; Klein, Martin; Moll, Annette C; Snoek, Frank J; Scheltens, Philip; Pouwels, Petra J W; Barkhof, Frederik; Diamant, Michaela; Tijms, Betty M

2016-03-01

Type 1 diabetes mellitus (T1DM) patients, especially with concomitant microvascular disease, such as proliferative retinopathy, have an increased risk of cognitive deficits. Local cortical gray matter volume reductions only partially explain these cognitive dysfunctions, possibly because volume reductions do not take into account the complex connectivity structure of the brain. This study aimed to identify gray matter network alterations in relation to cognition in T1DM. We investigated if subject-specific structural gray matter network properties, constructed from T1-weighted MRI scans, were different between T1DM patients with (n = 51) and without (n = 53) proliferative retinopathy versus controls (n = 49), and were associated to cognitive decrements and fractional anisotropy, as measured by voxel-based TBSS. Global normalized and local (45 bilateral anatomical regions) clustering coefficient and path length were assessed. These network properties measure how the organization of connections in a network differs from that of randomly connected networks. Global gray matter network topology was more randomly organized in both T1DM patient groups versus controls, with the largest effects seen in patients with proliferative retinopathy. Lower local path length values were widely distributed throughout the brain. Lower local clustering was observed in the middle frontal, postcentral, and occipital areas. Complex network topology explained up to 20% of the variance of cognitive decrements, beyond other predictors. Exploratory analyses showed that lower fractional anisotropy was associated with a more random gray matter network organization. T1DM and proliferative retinopathy affect cortical network organization that may consequently contribute to clinically relevant changes in cognitive functioning in these patients. © 2015 Wiley Periodicals, Inc.

Transport and percolation in complex networks

NASA Astrophysics Data System (ADS)

Li, Guanliang

To design complex networks with optimal transport properties such as flow efficiency, we consider three approaches to understanding transport and percolation in complex networks. We analyze the effects of randomizing the strengths of connections, randomly adding long-range connections to regular lattices, and percolation of spatially constrained networks. Various real-world networks often have links that are differentiated in terms of their strength, intensity, or capacity. We study the distribution P(σ) of the equivalent conductance for Erdoḧs-Rényi (ER) and scale-free (SF) weighted resistor networks with N nodes, for which links are assigned with conductance σ i ≡ e-axi, where xi is a random variable with 0 < xi < 1. We find, both analytically and numerically, that P(σ) for ER networks exhibits two regimes: (i) For σ < e-apc, P(σ) is independent of N and scales as a power law P(σ) ˜ sk/a-1 . Here pc = 1/ is the critical percolation threshold of the network and is the average degree of the network. (ii) For σ > e -apc, P(σ) has strong N dependence and scales as P(σ) ˜ f(σ, apc/N1/3). Transport properties are greatly affected by the topology of networks. We investigate the transport problem in lattices with long-range connections and subject to a cost constraint, seeking design principles for optimal transport networks. Our network is built from a regular d-dimensional lattice to be improved by adding long-range connections with probability Pij ˜ r-aij , where rij is the lattice distance between site i and j. We introduce a cost constraint on the total length of the additional links and find optimal transport in the system for α = d + 1, established here for d = 1, 2 and 3 for regular lattices and df for fractals. Remarkably, this cost constraint approach remains optimal, regardless of the strategy used for transport, whether based on local or global knowledge of the network structure. To further understand the role that long-range connections play in optimizing the transport of complex systems, we study the percolation of spatially constrained networks. We now consider originally empty lattices embedded in d dimensions by adding long-range connections with the same power law probability p(r) ˜ r -α. We find that, for α ≤ d, the percolation transition belongs to the universality class of percolation in ER networks, while for α > 2d it belongs to the universality class of percolation in regular lattices (for one-dimensional linear chain, there is no percolation transition). However for d < α < 2d, the percolation properties show new intermediate behavior different from ER networks, with critical exponents that depend on α.

Complex systems dynamics in aging: new evidence, continuing questions.

PubMed

Cohen, Alan A

2016-02-01

There have long been suggestions that aging is tightly linked to the complex dynamics of the physiological systems that maintain homeostasis, and in particular to dysregulation of regulatory networks of molecules. This review synthesizes recent work that is starting to provide evidence for the importance of such complex systems dynamics in aging. There is now clear evidence that physiological dysregulation--the gradual breakdown in the capacity of complex regulatory networks to maintain homeostasis--is an emergent property of these regulatory networks, and that it plays an important role in aging. It can be measured simply using small numbers of biomarkers. Additionally, there are indications of the importance during aging of emergent physiological processes, functional processes that cannot be easily understood through clear metabolic pathways, but can nonetheless be precisely quantified and studied. The overall role of such complex systems dynamics in aging remains an important open question, and to understand it future studies will need to distinguish and integrate related aspects of aging research, including multi-factorial theories of aging, systems biology, bioinformatics, network approaches, robustness, and loss of complexity.

Complex networks as a unified framework for descriptive analysis and predictive modeling in climate

DOE Office of Scientific and Technical Information (OSTI.GOV)

Steinhaeuser, Karsten J K; Chawla, Nitesh; Ganguly, Auroop R

The analysis of climate data has relied heavily on hypothesis-driven statistical methods, while projections of future climate are based primarily on physics-based computational models. However, in recent years a wealth of new datasets has become available. Therefore, we take a more data-centric approach and propose a unified framework for studying climate, with an aim towards characterizing observed phenomena as well as discovering new knowledge in the climate domain. Specifically, we posit that complex networks are well-suited for both descriptive analysis and predictive modeling tasks. We show that the structural properties of climate networks have useful interpretation within the domain. Further,more » we extract clusters from these networks and demonstrate their predictive power as climate indices. Our experimental results establish that the network clusters are statistically significantly better predictors than clusters derived using a more traditional clustering approach. Using complex networks as data representation thus enables the unique opportunity for descriptive and predictive modeling to inform each other.« less

Computing Tutte polynomials of contact networks in classrooms

NASA Astrophysics Data System (ADS)

Hincapié, Doracelly; Ospina, Juan

2013-05-01

Objective: The topological complexity of contact networks in classrooms and the potential transmission of an infectious disease were analyzed by sex and age. Methods: The Tutte polynomials, some topological properties and the number of spanning trees were used to algebraically compute the topological complexity. Computations were made with the Maple package GraphTheory. Published data of mutually reported social contacts within a classroom taken from primary school, consisting of children in the age ranges of 4-5, 7-8 and 10-11, were used. Results: The algebraic complexity of the Tutte polynomial and the probability of disease transmission increases with age. The contact networks are not bipartite graphs, gender segregation was observed especially in younger children. Conclusion: Tutte polynomials are tools to understand the topology of the contact networks and to derive numerical indexes of such topologies. It is possible to establish relationships between the Tutte polynomial of a given contact network and the potential transmission of an infectious disease within such network

An Adaptive Complex Network Model for Brain Functional Networks

PubMed Central

Gomez Portillo, Ignacio J.; Gleiser, Pablo M.

2009-01-01

Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence) of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution. PMID:19738902

Small Modifications to Network Topology Can Induce Stochastic Bistable Spiking Dynamics in a Balanced Cortical Model

PubMed Central

McDonnell, Mark D.; Ward, Lawrence M.

2014-01-01

Abstract Directed random graph models frequently are used successfully in modeling the population dynamics of networks of cortical neurons connected by chemical synapses. Experimental results consistently reveal that neuronal network topology is complex, however, in the sense that it differs statistically from a random network, and differs for classes of neurons that are physiologically different. This suggests that complex network models whose subnetworks have distinct topological structure may be a useful, and more biologically realistic, alternative to random networks. Here we demonstrate that the balanced excitation and inhibition frequently observed in small cortical regions can transiently disappear in otherwise standard neuronal-scale models of fluctuation-driven dynamics, solely because the random network topology was replaced by a complex clustered one, whilst not changing the in-degree of any neurons. In this network, a small subset of cells whose inhibition comes only from outside their local cluster are the cause of bistable population dynamics, where different clusters of these cells irregularly switch back and forth from a sparsely firing state to a highly active state. Transitions to the highly active state occur when a cluster of these cells spikes sufficiently often to cause strong unbalanced positive feedback to each other. Transitions back to the sparsely firing state rely on occasional large fluctuations in the amount of non-local inhibition received. Neurons in the model are homogeneous in their intrinsic dynamics and in-degrees, but differ in the abundance of various directed feedback motifs in which they participate. Our findings suggest that (i) models and simulations should take into account complex structure that varies for neuron and synapse classes; (ii) differences in the dynamics of neurons with similar intrinsic properties may be caused by their membership in distinctive local networks; (iii) it is important to identify neurons that share physiological properties and location, but differ in their connectivity. PMID:24743633

Evolution of Cooperation in Social Dilemmas on Complex Networks

PubMed Central

Iyer, Swami; Killingback, Timothy

2016-01-01

Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner’s dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games. PMID:26928428

Complex networks with large numbers of labelable attractors

NASA Astrophysics Data System (ADS)

Mi, Yuanyuan; Zhang, Lisheng; Huang, Xiaodong; Qian, Yu; Hu, Gang; Liao, Xuhong

2011-09-01

Information storage in many functional subsystems of the brain is regarded by theoretical neuroscientists to be related to attractors of neural networks. The number of attractors is large and each attractor can be temporarily represented or suppressed easily by corresponding external stimulus. In this letter, we discover that complex networks consisting of excitable nodes have similar fascinating properties of coexistence of large numbers of oscillatory attractors, most of which can be labeled with a few nodes. According to a simple labeling rule, different attractors can be identified and the number of labelable attractors can be predicted from the analysis of network topology. With the cues of the labeling association, these attractors can be conveniently retrieved or suppressed on purpose.

Force feedback controls motor activity and mechanical properties of self-assembling branched actin networks

PubMed Central

Bieling, Peter; Li, Tai-De; Weichsel, Julian; McGorty, Ryan; Jreij, Pamela; Huang, Bo; Fletcher, Daniel A.; Mullins, R. Dyche

2016-01-01

Branched actin networks–created by the Arp2/3 complex, capping protein, and a nucleation promoting factor– generate and transmit forces required for many cellular processes, but their response to force is poorly understood. To address this, we assembled branched actin networks in vitro from purified components and used simultaneous fluorescence and atomic force microscopy to quantify their molecular composition and material properties under various forces. Remarkably, mechanical loading of these self-assembling materials increases their density, power, and efficiency. Microscopically, increased density reflects increased filament number and altered geometry, but no change in average length. Macroscopically, increased density enhances network stiffness and resistance to mechanical failure beyond those of isotropic actin networks. These effects endow branched actin networks with memory of their mechanical history that shapes their material properties and motor activity. This work reveals intrinsic force feedback mechanisms by which mechanical resistance makes self-assembling actin networks stiffer, stronger, and more powerful. PMID:26771487

Probing the Topological Properties of Complex Networks Modeling Short Written Texts

PubMed Central

Amancio, Diego R.

2015-01-01

In recent years, graph theory has been widely employed to probe several language properties. More specifically, the so-called word adjacency model has been proven useful for tackling several practical problems, especially those relying on textual stylistic analysis. The most common approach to treat texts as networks has simply considered either large pieces of texts or entire books. This approach has certainly worked well—many informative discoveries have been made this way—but it raises an uncomfortable question: could there be important topological patterns in small pieces of texts? To address this problem, the topological properties of subtexts sampled from entire books was probed. Statistical analyses performed on a dataset comprising 50 novels revealed that most of the traditional topological measurements are stable for short subtexts. When the performance of the authorship recognition task was analyzed, it was found that a proper sampling yields a discriminability similar to the one found with full texts. Surprisingly, the support vector machine classification based on the characterization of short texts outperformed the one performed with entire books. These findings suggest that a local topological analysis of large documents might improve its global characterization. Most importantly, it was verified, as a proof of principle, that short texts can be analyzed with the methods and concepts of complex networks. As a consequence, the techniques described here can be extended in a straightforward fashion to analyze texts as time-varying complex networks. PMID:25719799

Topological properties of complex networks in protein structures

NASA Astrophysics Data System (ADS)

Kim, Kyungsik; Jung, Jae-Won; Min, Seungsik

2014-03-01

We study topological properties of networks in structural classification of proteins. We model the native-state protein structure as a network made of its constituent amino-acids and their interactions. We treat four structural classes of proteins composed predominantly of α helices and β sheets and consider several proteins from each of these classes whose sizes range from amino acids of the Protein Data Bank. Particularly, we simulate and analyze the network metrics such as the mean degree, the probability distribution of degree, the clustering coefficient, the characteristic path length, the local efficiency, and the cost. This work was supported by the KMAR and DP under Grant WISE project (153-3100-3133-302-350).

A network of networks model to study phase synchronization using structural connection matrix of human brain

NASA Astrophysics Data System (ADS)

Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.

2018-04-01

The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.

BoolNet--an R package for generation, reconstruction and analysis of Boolean networks.

PubMed

Müssel, Christoph; Hopfensitz, Martin; Kestler, Hans A

2010-05-15

As the study of information processing in living cells moves from individual pathways to complex regulatory networks, mathematical models and simulation become indispensable tools for analyzing the complex behavior of such networks and can provide deep insights into the functioning of cells. The dynamics of gene expression, for example, can be modeled with Boolean networks (BNs). These are mathematical models of low complexity, but have the advantage of being able to capture essential properties of gene-regulatory networks. However, current implementations of BNs only focus on different sub-aspects of this model and do not allow for a seamless integration into existing preprocessing pipelines. BoolNet efficiently integrates methods for synchronous, asynchronous and probabilistic BNs. This includes reconstructing networks from time series, generating random networks, robustness analysis via perturbation, Markov chain simulations, and identification and visualization of attractors. The package BoolNet is freely available from the R project at http://cran.r-project.org/ or http://www.informatik.uni-ulm.de/ni/mitarbeiter/HKestler/boolnet/ under Artistic License 2.0. hans.kestler@uni-ulm.de Supplementary data are available at Bioinformatics online.

A low complexity visualization tool that helps to perform complex systems analysis

NASA Astrophysics Data System (ADS)

Beiró, M. G.; Alvarez-Hamelin, J. I.; Busch, J. R.

2008-12-01

In this paper, we present an extension of large network visualization (LaNet-vi), a tool to visualize large scale networks using the k-core decomposition. One of the new features is how vertices compute their angular position. While in the later version it is done using shell clusters, in this version we use the angular coordinate of vertices in higher k-shells, and arrange the highest shell according to a cliques decomposition. The time complexity goes from O(n\\sqrt n) to O(n) upon bounds on a heavy-tailed degree distribution. The tool also performs a k-core-connectivity analysis, highlighting vertices that are not k-connected; e.g. this property is useful to measure robustness or quality of service (QoS) capabilities in communication networks. Finally, the actual version of LaNet-vi can draw labels and all the edges using transparencies, yielding an accurate visualization. Based on the obtained figure, it is possible to distinguish different sources and types of complex networks at a glance, in a sort of 'network iris-print'.

Composing Music with Complex Networks

NASA Astrophysics Data System (ADS)

Liu, Xiaofan; Tse, Chi K.; Small, Michael

In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurrences. We analyze sample compositions from Bach, Mozart, Chopin, as well as other types of music including Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. Power-law exponents of degree distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be created by using a biased random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. The newly created music from complex networks will be played in the presentation.

Differential Network Analysis Reveals Evolutionary Complexity in Secondary Metabolism of Rauvolfia serpentina over Catharanthus roseus

PubMed Central

Pathania, Shivalika; Bagler, Ganesh; Ahuja, Paramvir S.

2016-01-01

Comparative co-expression analysis of multiple species using high-throughput data is an integrative approach to determine the uniformity as well as diversification in biological processes. Rauvolfia serpentina and Catharanthus roseus, both members of Apocyanacae family, are reported to have remedial properties against multiple diseases. Despite of sharing upstream of terpenoid indole alkaloid pathway, there is significant diversity in tissue-specific synthesis and accumulation of specialized metabolites in these plants. This led us to implement comparative co-expression network analysis to investigate the modules and genes responsible for differential tissue-specific expression as well as species-specific synthesis of metabolites. Toward these goals differential network analysis was implemented to identify candidate genes responsible for diversification of metabolites profile. Three genes were identified with significant difference in connectivity leading to differential regulatory behavior between these plants. These genes may be responsible for diversification of secondary metabolism, and thereby for species-specific metabolite synthesis. The network robustness of R. serpentina, determined based on topological properties, was also complemented by comparison of gene-metabolite networks of both plants, and may have evolved to have complex metabolic mechanisms as compared to C. roseus under the influence of various stimuli. This study reveals evolution of complexity in secondary metabolism of R. serpentina, and key genes that contribute toward diversification of specific metabolites. PMID:27588023

Differential Network Analysis Reveals Evolutionary Complexity in Secondary Metabolism of Rauvolfia serpentina over Catharanthus roseus.

PubMed

Pathania, Shivalika; Bagler, Ganesh; Ahuja, Paramvir S

2016-01-01

Comparative co-expression analysis of multiple species using high-throughput data is an integrative approach to determine the uniformity as well as diversification in biological processes. Rauvolfia serpentina and Catharanthus roseus, both members of Apocyanacae family, are reported to have remedial properties against multiple diseases. Despite of sharing upstream of terpenoid indole alkaloid pathway, there is significant diversity in tissue-specific synthesis and accumulation of specialized metabolites in these plants. This led us to implement comparative co-expression network analysis to investigate the modules and genes responsible for differential tissue-specific expression as well as species-specific synthesis of metabolites. Toward these goals differential network analysis was implemented to identify candidate genes responsible for diversification of metabolites profile. Three genes were identified with significant difference in connectivity leading to differential regulatory behavior between these plants. These genes may be responsible for diversification of secondary metabolism, and thereby for species-specific metabolite synthesis. The network robustness of R. serpentina, determined based on topological properties, was also complemented by comparison of gene-metabolite networks of both plants, and may have evolved to have complex metabolic mechanisms as compared to C. roseus under the influence of various stimuli. This study reveals evolution of complexity in secondary metabolism of R. serpentina, and key genes that contribute toward diversification of specific metabolites.

On the interpretation of complex network analysis of language. Comment on "Approaching human language with complex networks" by Jin Cong, Haitao Liu

NASA Astrophysics Data System (ADS)

Čech, Radek

2014-12-01

After a rapid and successful development of the theory of complex networks at the turn of the millennium [1,2], attempts to apply this theory to a language analysis emerged immediately [3,4]. The first results seemed to bring new insights to the functioning of language. Moreover, some authors assumed that this approach can even solve some fundamental problems concerning language evolution [5,6]. However, after a decade of the application of complex network theory to language analysis, the initial expectations have not been fulfilled, in my opinion, and the need for a deeper, linguistically based explanation of observed properties has been still more obvious. Cong and Liu's review [7] can be seen as a successful attempt to clarify the main aspects of this kind of research from the linguistics point of view. However, I see two problematic aspects in their study relating to the nature of the character of explanation.

Gene expression links functional networks across cortex and striatum.

PubMed

Anderson, Kevin M; Krienen, Fenna M; Choi, Eun Young; Reinen, Jenna M; Yeo, B T Thomas; Holmes, Avram J

2018-04-12

The human brain is comprised of a complex web of functional networks that link anatomically distinct regions. However, the biological mechanisms supporting network organization remain elusive, particularly across cortical and subcortical territories with vastly divergent cellular and molecular properties. Here, using human and primate brain transcriptional atlases, we demonstrate that spatial patterns of gene expression show strong correspondence with limbic and somato/motor cortico-striatal functional networks. Network-associated expression is consistent across independent human datasets and evolutionarily conserved in non-human primates. Genes preferentially expressed within the limbic network (encompassing nucleus accumbens, orbital/ventromedial prefrontal cortex, and temporal pole) relate to risk for psychiatric illness, chloride channel complexes, and markers of somatostatin neurons. Somato/motor associated genes are enriched for oligodendrocytes and markers of parvalbumin neurons. These analyses indicate that parallel cortico-striatal processing channels possess dissociable genetic signatures that recapitulate distributed functional networks, and nominate molecular mechanisms supporting cortico-striatal circuitry in health and disease.

Dynamic information routing in complex networks

PubMed Central

Kirst, Christoph; Timme, Marc; Battaglia, Demian

2016-01-01

Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function. PMID:27067257

Network Analysis: Applications for the Developing Brain

PubMed Central

Chu-Shore, Catherine J.; Kramer, Mark A.; Bianchi, Matt T.; Caviness, Verne S.; Cash, Sydney S.

2011-01-01

Development of the human brain follows a complex trajectory of age-specific anatomical and physiological changes. The application of network analysis provides an illuminating perspective on the dynamic interregional and global properties of this intricate and complex system. Here, we provide a critical synopsis of methods of network analysis with a focus on developing brain networks. After discussing basic concepts and approaches to network analysis, we explore the primary events of anatomical cortical development from gestation through adolescence. Upon this framework, we describe early work revealing the evolution of age-specific functional brain networks in normal neurodevelopment. Finally, we review how these relationships can be altered in disease and perhaps even rectified with treatment. While this method of description and inquiry remains in early form, there is already substantial evidence that the application of network models and analysis to understanding normal and abnormal human neural development holds tremendous promise for future discovery. PMID:21303762

Biomimetic oral mucin from polymer micelle networks

NASA Astrophysics Data System (ADS)

Authimoolam, Sundar Prasanth

Mucin networks are formed by the complexation of bottlebrush-like mucin glycoprotein with other small molecule glycoproteins. These glycoproteins create nanoscale strands that then arrange into a nanoporous mesh. These networks play an important role in ensuring surface hydration, lubricity and barrier protection. In order to understand the functional behavior in mucin networks, it is important to decouple their chemical and physical effects responsible for generating the fundamental property-function relationship. To achieve this goal, we propose to develop a synthetic biomimetic mucin using a layer-by-layer (LBL) deposition approach. In this work, a hierarchical 3-dimensional structures resembling natural mucin networks was generated using affinity-based interactions on synthetic and biological surfaces. Unlike conventional polyelectrolyte-based LBL methods, pre-assembled biotin-functionalized filamentous (worm-like) micelles was utilized as the network building block, which from complementary additions of streptavidin generated synthetic networks of desired thickness. The biomimetic nature in those synthetic networks are studied by evaluating its structural and bio-functional properties. Structurally, synthetic networks formed a nanoporous mesh. The networks demonstrated excellent surface hydration property and were able capable of microbial capture. Those functional properties are akin to that of natural mucin networks. Further, the role of synthetic mucin as a drug delivery vehicle, capable of providing localized and tunable release was demonstrated. By incorporating antibacterial curcumin drug loading within synthetic networks, bacterial growth inhibition was also demonstrated. Thus, such bioactive interfaces can serve as a model for independently characterizing mucin network properties and through its role as a drug carrier vehicle it presents exciting future opportunities for localized drug delivery, in regenerative applications and as bio-functional implant coats. KEYWORDS: Biomimic, Bioapplication, Drug delivery, Filomicelle, Mucin, Polymer networks.

The correlation of metrics in complex networks with applications in functional brain networks

NASA Astrophysics Data System (ADS)

Li, C.; Wang, H.; de Haan, W.; Stam, C. J.; Van Mieghem, P.

2011-11-01

An increasing number of network metrics have been applied in network analysis. If metric relations were known better, we could more effectively characterize networks by a small set of metrics to discover the association between network properties/metrics and network functioning. In this paper, we investigate the linear correlation coefficients between widely studied network metrics in three network models (Bárabasi-Albert graphs, Erdös-Rényi random graphs and Watts-Strogatz small-world graphs) as well as in functional brain networks of healthy subjects. The metric correlations, which we have observed and theoretically explained, motivate us to propose a small representative set of metrics by including only one metric from each subset of mutually strongly dependent metrics. The following contributions are considered important. (a) A network with a given degree distribution can indeed be characterized by a small representative set of metrics. (b) Unweighted networks, which are obtained from weighted functional brain networks with a fixed threshold, and Erdös-Rényi random graphs follow a similar degree distribution. Moreover, their metric correlations and the resultant representative metrics are similar as well. This verifies the influence of degree distribution on metric correlations. (c) Most metric correlations can be explained analytically. (d) Interestingly, the most studied metrics so far, the average shortest path length and the clustering coefficient, are strongly correlated and, thus, redundant. Whereas spectral metrics, though only studied recently in the context of complex networks, seem to be essential in network characterizations. This representative set of metrics tends to both sufficiently and effectively characterize networks with a given degree distribution. In the study of a specific network, however, we have to at least consider the representative set so that important network properties will not be neglected.

Symmetries and synchronization in multilayer random networks

NASA Astrophysics Data System (ADS)

Saa, Alberto

2018-04-01

In the light of the recently proposed scenario of asymmetry-induced synchronization (AISync), in which dynamical uniformity and consensus in a distributed system would demand certain asymmetries in the underlying network, we investigate here the influence of some regularities in the interlayer connection patterns on the synchronization properties of multilayer random networks. More specifically, by considering a Stuart-Landau model of complex oscillators with random frequencies, we report for multilayer networks a dynamical behavior that could be also classified as a manifestation of AISync. We show, namely, that the presence of certain symmetries in the interlayer connection pattern tends to diminish the synchronization capability of the whole network or, in other words, asymmetries in the interlayer connections would enhance synchronization in such structured networks. Our results might help the understanding not only of the AISync mechanism itself but also its possible role in the determination of the interlayer connection pattern of multilayer and other structured networks with optimal synchronization properties.

Emergent spectral properties of river network topology: an optimal channel network approach.

PubMed

Abed-Elmdoust, Armaghan; Singh, Arvind; Yang, Zong-Liang

2017-09-13

Characterization of river drainage networks has been a subject of research for many years. However, most previous studies have been limited to quantities which are loosely connected to the topological properties of these networks. In this work, through a graph-theoretic formulation of drainage river networks, we investigate the eigenvalue spectra of their adjacency matrix. First, we introduce a graph theory model for river networks and explore the properties of the network through its adjacency matrix. Next, we show that the eigenvalue spectra of such complex networks follow distinct patterns and exhibit striking features including a spectral gap in which no eigenvalue exists as well as a finite number of zero eigenvalues. We show that such spectral features are closely related to the branching topology of the associated river networks. In this regard, we find an empirical relation for the spectral gap and nullity in terms of the energy dissipation exponent of the drainage networks. In addition, the eigenvalue distribution is found to follow a finite-width probability density function with certain skewness which is related to the drainage pattern. Our results are based on optimal channel network simulations and validated through examples obtained from physical experiments on landscape evolution. These results suggest the potential of the spectral graph techniques in characterizing and modeling river networks.

Investigating Molecular Level Stress-Strain Relationships in Entangled F-Actin Networks by Combined Force-Measuring Optical Tweezers and Fluorescence Microscopy

NASA Astrophysics Data System (ADS)

Lee, Kent; Henze, Dean; Robertson-Anderson, Rae

2013-03-01

Actin is an important cytoskeletal protein involved in cell structure and motility, cancer invasion and metastasis, and muscle contraction. The intricate viscoelastic properties of filamentous actin (F-actin) networks allow for the many dynamic roles of actin, thus warranting investigation. Exploration of this unique stress-strain/strain-rate relationship in complex F-actin networks can also improve biomimetic materials engineering. Here, we use optical tweezers with fluorescence microscopy to study the viscoelastic properties of F-actin networks on the microscopic level. Optically trapped microspheres embedded in various F-actin networks are moved through the network using a nanoprecision piezoelectric stage. The force exerted on the microspheres by the F-actin network and subsequent force relaxation are measured, while a fraction of the filaments in the network are fluorescent-labeled to observe filament deformation in real-time. The dependence of the viscoelastic properties of the network on strain rates and amplitudes as well as F-actin concentration is quantified. This approach provides the much-needed link between induced force and deformation over localized regimes (tens of microns) and down to the single molecule level.

The Anatomical Distance of Functional Connections Predicts Brain Network Topology in Health and Schizophrenia

PubMed Central

Vértes, Petra E.; Stidd, Reva; Lalonde, François; Clasen, Liv; Rapoport, Judith; Giedd, Jay; Bullmore, Edward T.; Gogtay, Nitin

2013-01-01

The human brain is a topologically complex network embedded in anatomical space. Here, we systematically explored relationships between functional connectivity, complex network topology, and anatomical (Euclidean) distance between connected brain regions, in the resting-state functional magnetic resonance imaging brain networks of 20 healthy volunteers and 19 patients with childhood-onset schizophrenia (COS). Normal between-subject differences in average distance of connected edges in brain graphs were strongly associated with variation in topological properties of functional networks. In addition, a club or subset of connector hubs was identified, in lateral temporal, parietal, dorsal prefrontal, and medial prefrontal/cingulate cortical regions. In COS, there was reduced strength of functional connectivity over short distances especially, and therefore, global mean connection distance of thresholded graphs was significantly greater than normal. As predicted from relationships between spatial and topological properties of normal networks, this disorder-related proportional increase in connection distance was associated with reduced clustering and modularity and increased global efficiency of COS networks. Between-group differences in connection distance were localized specifically to connector hubs of multimodal association cortex. In relation to the neurodevelopmental pathogenesis of schizophrenia, we argue that the data are consistent with the interpretation that spatial and topological disturbances of functional network organization could arise from excessive “pruning” of short-distance functional connections in schizophrenia. PMID:22275481

Motif structure and cooperation in real-world complex networks

NASA Astrophysics Data System (ADS)

Salehi, Mostafa; Rabiee, Hamid R.; Jalili, Mahdi

2010-12-01

Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.

A complex network approach for nanoparticle agglomeration analysis in nanoscale images

NASA Astrophysics Data System (ADS)

Machado, Bruno Brandoli; Scabini, Leonardo Felipe; Margarido Orue, Jonatan Patrick; de Arruda, Mauro Santos; Goncalves, Diogo Nunes; Goncalves, Wesley Nunes; Moreira, Raphaell; Rodrigues-Jr, Jose F.

2017-02-01

Complex networks have been widely used in science and technology because of their ability to represent several systems. One of these systems is found in Biochemistry, in which the synthesis of new nanoparticles is a hot topic. However, the interpretation of experimental results in the search of new nanoparticles poses several challenges. This is due to the characteristics of nanoparticle images and due to their multiple intricate properties; one property of recurrent interest is the agglomeration of particles. Addressing this issue, this paper introduces an approach that uses complex networks to detect and describe nanoparticle agglomerates so to foster easier and more insightful analyses. In this approach, each detected particle in an image corresponds to a vertice and the distances between the particles define a criterion for creating edges. Edges are created if the distance is smaller than a radius of interest. Once this network is set, we calculate several discrete measures able to reveal the most outstanding agglomerates in a nanoparticle image. Experimental results using images of scanning tunneling microscopy (STM) of gold nanoparticles demonstrated the effectiveness of the proposed approach over several samples, as reflected by the separability between particles in three usual settings. The results also demonstrated efficacy for both convex and non-convex agglomerates.

Two novel copper(II) complexes constructed from dicarboxylate ligands with different spacer lengths and 2-phenylimidazo[4,5- f]1,10-phenanthroline (PIP): Synthesis, structures and properties

NASA Astrophysics Data System (ADS)

Wang, X.-L.; Chen, Yongqiang; Liu, Guocheng; Lin, Hongyan; Zhang, Jinxia

2009-09-01

Two novel metal-organic coordination polymers [Cu(PIP)(bpea)(H 2O)]·H 2O ( 1) and [Cu(PIP)(1,4-bdc)] ( 2) have been obtained from hydrothermal reaction of copper(II) with the mixed ligands [biphenylethene-4,4'-dicarboxylic acid (bpea) for 1, benzene-1,4-dicarboxylic acid (1,4-H 2bdc) for 2, and 2-phenylimidazo[4,5- f]1,10-phenanthroline (PIP)]. Both complexes have been structurally characterized by elemental analyses, IR and single-crystal X-ray diffraction analyses. Structural analyses reveal that complex 1 possesses infinite one-dimensional zigzag chain, 2 exhibits a two-dimensional (4,4) network, both of which are extended into three-dimensional supramolecular network by weak interactions. The different structures of the title complexes illustrate the influence of the flexibility (the spacer length of carboxyl groups and the structural rigidity of the spacer) of organic dicarboxylate ligands on the formation of such coordination architectures. Moreover, the thermal properties and the voltammetric behavior of complexes 1 and 2 have been reported.

A permutation testing framework to compare groups of brain networks.

PubMed

Simpson, Sean L; Lyday, Robert G; Hayasaka, Satoru; Marsh, Anthony P; Laurienti, Paul J

2013-01-01

Brain network analyses have moved to the forefront of neuroimaging research over the last decade. However, methods for statistically comparing groups of networks have lagged behind. These comparisons have great appeal for researchers interested in gaining further insight into complex brain function and how it changes across different mental states and disease conditions. Current comparison approaches generally either rely on a summary metric or on mass-univariate nodal or edge-based comparisons that ignore the inherent topological properties of the network, yielding little power and failing to make network level comparisons. Gleaning deeper insights into normal and abnormal changes in complex brain function demands methods that take advantage of the wealth of data present in an entire brain network. Here we propose a permutation testing framework that allows comparing groups of networks while incorporating topological features inherent in each individual network. We validate our approach using simulated data with known group differences. We then apply the method to functional brain networks derived from fMRI data.

Community Detection in Complex Networks via Clique Conductance.

PubMed

Lu, Zhenqi; Wahlström, Johan; Nehorai, Arye

2018-04-13

Network science plays a central role in understanding and modeling complex systems in many areas including physics, sociology, biology, computer science, economics, politics, and neuroscience. One of the most important features of networks is community structure, i.e., clustering of nodes that are locally densely interconnected. Communities reveal the hierarchical organization of nodes, and detecting communities is of great importance in the study of complex systems. Most existing community-detection methods consider low-order connection patterns at the level of individual links. But high-order connection patterns, at the level of small subnetworks, are generally not considered. In this paper, we develop a novel community-detection method based on cliques, i.e., local complete subnetworks. The proposed method overcomes the deficiencies of previous similar community-detection methods by considering the mathematical properties of cliques. We apply the proposed method to computer-generated graphs and real-world network datasets. When applied to networks with known community structure, the proposed method detects the structure with high fidelity and sensitivity. When applied to networks with no a priori information regarding community structure, the proposed method yields insightful results revealing the organization of these complex networks. We also show that the proposed method is guaranteed to detect near-optimal clusters in the bipartition case.

Exploring Transformations in Caribbean Indigenous Social Networks through Visibility Studies: the Case of Late Pre-Colonial Landscapes in East-Guadeloupe (French West Indies).

PubMed

Brughmans, Tom; de Waal, Maaike S; Hofman, Corinne L; Brandes, Ulrik

2018-01-01

This paper presents a study of the visual properties of natural and Amerindian cultural landscapes in late pre-colonial East-Guadeloupe and of how these visual properties affected social interactions. Through a review of descriptive and formal visibility studies in Caribbean archaeology, it reveals that the ability of visual properties to affect past human behaviour is frequently evoked but the more complex of these hypotheses are rarely studied formally. To explore such complex hypotheses, the current study applies a range of techniques: total viewsheds, cumulative viewsheds, visual neighbourhood configurations and visibility networks. Experiments were performed to explore the control of seascapes, the functioning of hypothetical smoke signalling networks, the correlation of these visual properties with stylistic similarities of material culture found at sites and the change of visual properties over time. The results of these experiments suggest that only few sites in Eastern Guadeloupe are located in areas that are particularly suitable to visually control possible sea routes for short- and long-distance exchange; that visual control over sea areas was not a factor of importance for the existence of micro-style areas; that during the early phase of the Late Ceramic Age networks per landmass are connected and dense and that they incorporate all sites, a structure that would allow hypothetical smoke signalling networks; and that the visual properties of locations of the late sites Morne Souffleur and Morne Cybèle-1 were not ideal for defensive purposes. These results led us to propose a multi-scalar hypothesis for how lines of sight between settlements in the Lesser Antilles could have structured past human behaviour: short-distance visibility networks represent the structuring of navigation and communication within landmasses, whereas the landmasses themselves served as focal points for regional navigation and interaction. We conclude by emphasising that since our archaeological theories about visual properties usually take a multi-scalar landscape perspective, there is a need for this perspective to be reflected in our formal visibility methods as is made possible by the methods used in this paper.

Trade-offs between robustness and small-world effect in complex networks

PubMed Central

Peng, Guan-Sheng; Tan, Suo-Yi; Wu, Jun; Holme, Petter

2016-01-01

Robustness and small-world effect are two crucial structural features of complex networks and have attracted increasing attention. However, little is known about the relation between them. Here we demonstrate that, there is a conflicting relation between robustness and small-world effect for a given degree sequence. We suggest that the robustness-oriented optimization will weaken the small-world effect and vice versa. Then, we propose a multi-objective trade-off optimization model and develop a heuristic algorithm to obtain the optimal trade-off topology for robustness and small-world effect. We show that the optimal network topology exhibits a pronounced core-periphery structure and investigate the structural properties of the optimized networks in detail. PMID:27853301

Living on the edge of chaos: minimally nonlinear models of genetic regulatory dynamics.

PubMed

Hanel, Rudolf; Pöchacker, Manfred; Thurner, Stefan

2010-12-28

Linearized catalytic reaction equations (modelling, for example, the dynamics of genetic regulatory networks), under the constraint that expression levels, i.e. molecular concentrations of nucleic material, are positive, exhibit non-trivial dynamical properties, which depend on the average connectivity of the reaction network. In these systems, an inflation of the edge of chaos and multi-stability have been demonstrated to exist. The positivity constraint introduces a nonlinearity, which makes chaotic dynamics possible. Despite the simplicity of such minimally nonlinear systems, their basic properties allow us to understand the fundamental dynamical properties of complex biological reaction networks. We analyse the Lyapunov spectrum, determine the probability of finding stationary oscillating solutions, demonstrate the effect of the nonlinearity on the effective in- and out-degree of the active interaction network, and study how the frequency distributions of oscillatory modes of such a system depend on the average connectivity.

Analyzing neuronal networks using discrete-time dynamics

NASA Astrophysics Data System (ADS)

Ahn, Sungwoo; Smith, Brian H.; Borisyuk, Alla; Terman, David

2010-05-01

We develop mathematical techniques for analyzing detailed Hodgkin-Huxley like models for excitatory-inhibitory neuronal networks. Our strategy for studying a given network is to first reduce it to a discrete-time dynamical system. The discrete model is considerably easier to analyze, both mathematically and computationally, and parameters in the discrete model correspond directly to parameters in the original system of differential equations. While these networks arise in many important applications, a primary focus of this paper is to better understand mechanisms that underlie temporally dynamic responses in early processing of olfactory sensory information. The models presented here exhibit several properties that have been described for olfactory codes in an insect’s Antennal Lobe. These include transient patterns of synchronization and decorrelation of sensory inputs. By reducing the model to a discrete system, we are able to systematically study how properties of the dynamics, including the complex structure of the transients and attractors, depend on factors related to connectivity and the intrinsic and synaptic properties of cells within the network.

Symbols, Relations, and Structural Complexity.

ERIC Educational Resources Information Center

Reich, Peter A.

This paper discusses an alternate formalism for context-free phrase structure grammar. The author feels that if a grammar is stated completely explicitly it can be represented in the form of a relational network of the type proposed by Lamb. He discusses some formal properties of such networks and makes some revisions to Lamb's formulation which…

Multilayer network decoding versatility and trust

NASA Astrophysics Data System (ADS)

Sarkar, Camellia; Yadav, Alok; Jalan, Sarika

2016-01-01

In the recent years, the multilayer networks have increasingly been realized as a more realistic framework to understand emergent physical phenomena in complex real-world systems. We analyze massive time-varying social data drawn from the largest film industry of the world under a multilayer network framework. The framework enables us to evaluate the versatility of actors, which turns out to be an intrinsic property of lead actors. Versatility in dimers suggests that working with different types of nodes are more beneficial than with similar ones. However, the triangles yield a different relation between type of co-actor and the success of lead nodes indicating the importance of higher-order motifs in understanding the properties of the underlying system. Furthermore, despite the degree-degree correlations of entire networks being neutral, multilayering picks up different values of correlation indicating positive connotations like trust, in the recent years. The analysis of weak ties of the industry uncovers nodes from a lower-degree regime being important in linking Bollywood clusters. The framework and the tools used herein may be used for unraveling the complexity of other real-world systems.

Spatiotemporal Dynamics and Fitness Analysis of Global Oil Market: Based on Complex Network

PubMed Central

Wang, Minggang; Fang, Guochang; Shao, Shuai

2016-01-01

We study the overall topological structure properties of global oil trade network, such as degree, strength, cumulative distribution, information entropy and weight clustering. The structural evolution of the network is investigated as well. We find the global oil import and export networks do not show typical scale-free distribution, but display disassortative property. Furthermore, based on the monthly data of oil import values during 2005.01–2014.12, by applying random matrix theory, we investigate the complex spatiotemporal dynamic from the country level and fitness evolution of the global oil market from a demand-side analysis. Abundant information about global oil market can be obtained from deviating eigenvalues. The result shows that the oil market has experienced five different periods, which is consistent with the evolution of country clusters. Moreover, we find the changing trend of fitness function agrees with that of gross domestic product (GDP), and suggest that the fitness evolution of oil market can be predicted by forecasting GDP values. To conclude, some suggestions are provided according to the results. PMID:27706147

Highly-ordered supportless three-dimensional nanowire networks with tunable complexity and interwire connectivity for device integration.

PubMed

Rauber, Markus; Alber, Ina; Müller, Sven; Neumann, Reinhard; Picht, Oliver; Roth, Christina; Schökel, Alexander; Toimil-Molares, Maria Eugenia; Ensinger, Wolfgang

2011-06-08

The fabrication of three-dimensional assemblies consisting of large quantities of nanowires is of great technological importance for various applications including (electro-)catalysis, sensitive sensing, and improvement of electronic devices. Because the spatial distribution of the nanostructured material can strongly influence the properties, architectural design is required in order to use assembled nanowires to their full potential. In addition, special effort has to be dedicated to the development of efficient methods that allow precise control over structural parameters of the nanoscale building blocks as a means of tuning their characteristics. This paper reports the direct synthesis of highly ordered large-area nanowire networks by a method based on hard templates using electrodeposition within nanochannels of ion track-etched polymer membranes. Control over the complexity of the networks and the dimensions of the integrated nanostructures are achieved by a modified template fabrication. The networks possess high surface area and excellent transport properties, turning them into a promising electrocatalyst material as demonstrated by cyclic voltammetry studies on platinum nanowire networks catalyzing methanol oxidation. Our method opens up a new general route for interconnecting nanowires to stable macroscopic network structures of very high integration level that allow easy handling of nanowires while maintaining their connectivity.

Nonlinear mechanics of hybrid polymer networks that mimic the complex mechanical environment of cells

NASA Astrophysics Data System (ADS)

Jaspers, Maarten; Vaessen, Sarah L.; van Schayik, Pim; Voerman, Dion; Rowan, Alan E.; Kouwer, Paul H. J.

2017-05-01

The mechanical properties of cells and the extracellular environment they reside in are governed by a complex interplay of biopolymers. These biopolymers, which possess a wide range of stiffnesses, self-assemble into fibrous composite networks such as the cytoskeleton and extracellular matrix. They interact with each other both physically and chemically to create a highly responsive and adaptive mechanical environment that stiffens when stressed or strained. Here we show that hybrid networks of a synthetic mimic of biological networks and either stiff, flexible and semi-flexible components, even very low concentrations of these added components, strongly affect the network stiffness and/or its strain-responsive character. The stiffness (persistence length) of the second network, its concentration and the interaction between the components are all parameters that can be used to tune the mechanics of the hybrids. The equivalence of these hybrids with biological composites is striking.

The large-scale organization of metabolic networks

NASA Astrophysics Data System (ADS)

Jeong, H.; Tombor, B.; Albert, R.; Oltvai, Z. N.; Barabási, A.-L.

2000-10-01

In a cell or microorganism, the processes that generate mass, energy, information transfer and cell-fate specification are seamlessly integrated through a complex network of cellular constituents and reactions. However, despite the key role of these networks in sustaining cellular functions, their large-scale structure is essentially unknown. Here we present a systematic comparative mathematical analysis of the metabolic networks of 43 organisms representing all three domains of life. We show that, despite significant variation in their individual constituents and pathways, these metabolic networks have the same topological scaling properties and show striking similarities to the inherent organization of complex non-biological systems. This may indicate that metabolic organization is not only identical for all living organisms, but also complies with the design principles of robust and error-tolerant scale-free networks, and may represent a common blueprint for the large-scale organization of interactions among all cellular constituents.

Characteristics of pattern formation and evolution in approximations of Physarum transport networks.

PubMed

Jones, Jeff

2010-01-01

Most studies of pattern formation place particular emphasis on its role in the development of complex multicellular body plans. In simpler organisms, however, pattern formation is intrinsic to growth and behavior. Inspired by one such organism, the true slime mold Physarum polycephalum, we present examples of complex emergent pattern formation and evolution formed by a population of simple particle-like agents. Using simple local behaviors based on chemotaxis, the mobile agent population spontaneously forms complex and dynamic transport networks. By adjusting simple model parameters, maps of characteristic patterning are obtained. Certain areas of the parameter mapping yield particularly complex long term behaviors, including the circular contraction of network lacunae and bifurcation of network paths to maintain network connectivity. We demonstrate the formation of irregular spots and labyrinthine and reticulated patterns by chemoattraction. Other Turing-like patterning schemes were obtained by using chemorepulsion behaviors, including the self-organization of regular periodic arrays of spots, and striped patterns. We show that complex pattern types can be produced without resorting to the hierarchical coupling of reaction-diffusion mechanisms. We also present network behaviors arising from simple pre-patterning cues, giving simple examples of how the emergent pattern formation processes evolve into networks with functional and quasi-physical properties including tensionlike effects, network minimization behavior, and repair to network damage. The results are interpreted in relation to classical theories of biological pattern formation in natural systems, and we suggest mechanisms by which emergent pattern formation processes may be used as a method for spatially represented unconventional computation.

High thermal stability and antiferromagnetic properties of a 3D Mn(II)-organic framework with metal carboxylate chains

NASA Astrophysics Data System (ADS)

Han, Lei; Zhou, Yan; Wang, Xiu-Teng; Li, Xing; Tong, Ming-Liang

2009-04-01

A novel three-dimensional metal-organic framework, [Mn 2(hfipbb) 2(bpy)] n ( 1) (H 2hfipbb = 4,4'-(hexafluoroisopropylidene)bis(benzoic acid), bpy = 4,4'-bipyridine), has been hydrothermally synthesized and structurally characterized. The complex consists of metal carboxylate chains, which are cross-linked to six adjacent chains through organic moieties forming extended three-dimensional networks. Complex 1 exhibits high thermal stability (450 °C) and antiferromagnetic properties.

Semantic networks based on titles of scientific papers

NASA Astrophysics Data System (ADS)

Pereira, H. B. B.; Fadigas, I. S.; Senna, V.; Moret, M. A.

2011-03-01

In this paper we study the topological structure of semantic networks based on titles of papers published in scientific journals. It discusses its properties and presents some reflections on how the use of social and complex network models can contribute to the diffusion of knowledge. The proposed method presented here is applied to scientific journals where the titles of papers are in English or in Portuguese. We show that the topology of studied semantic networks are small-world and scale-free.

Characterization of topological structure on complex networks.

PubMed

Nakamura, Ikuo

2003-10-01

Characterizing the topological structure of complex networks is a significant problem especially from the viewpoint of data mining on the World Wide Web. "Page rank" used in the commercial search engine Google is such a measure of authority to rank all the nodes matching a given query. We have investigated the page-rank distribution of the real Web and a growing network model, both of which have directed links and exhibit a power law distributions of in-degree (the number of incoming links to the node) and out-degree (the number of outgoing links from the node), respectively. We find a concentration of page rank on a small number of nodes and low page rank on high degree regimes in the real Web, which can be explained by topological properties of the network, e.g., network motifs, and connectivities of nearest neighbors.

Dynamic model of time-dependent complex networks.

PubMed

Hill, Scott A; Braha, Dan

2010-10-01

The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness against failures, vulnerability to deliberate attacks, and diffusion properties. However, recent empirical research of large dynamic networks (characterized by irregular connections that evolve rapidly) has demonstrated that there is little continuity in degree centrality of nodes over time, even when their degree distributions follow a power law. This unexpected dynamic centrality suggests that the connections in these systems are not driven by preferential attachment or other known mechanisms. We present an approach to explain real-world dynamic networks and qualitatively reproduce these dynamic centrality phenomena. This approach is based on a dynamic preferential attachment mechanism, which exhibits a sharp transition from a base pure random walk scheme.

Complex Dynamics of the Power Transmission Grid (and other Critical Infrastructures)

NASA Astrophysics Data System (ADS)

Newman, David

2015-03-01

Our modern societies depend crucially on a web of complex critical infrastructures such as power transmission networks, communication systems, transportation networks and many others. These infrastructure systems display a great number of the characteristic properties of complex systems. Important among these characteristics, they exhibit infrequent large cascading failures that often obey a power law distribution in their probability versus size. This power law behavior suggests that conventional risk analysis does not apply to these systems. It is thought that much of this behavior comes from the dynamical evolution of the system as it ages, is repaired, upgraded, and as the operational rules evolve with human decision making playing an important role in the dynamics. In this talk, infrastructure systems as complex dynamical systems will be introduced and some of their properties explored. The majority of the talk will then be focused on the electric power transmission grid though many of the results can be easily applied to other infrastructures. General properties of the grid will be discussed and results from a dynamical complex systems power transmission model will be compared with real world data. Then we will look at a variety of uses of this type of model. As examples, we will discuss the impact of size and network homogeneity on the grid robustness, the change in risk of failure as generation mix (more distributed vs centralized for example) changes, as well as the effect of operational changes such as the changing the operational risk aversion or grid upgrade strategies. One of the important outcomes from this work is the realization that ``improvements'' in the system components and operational efficiency do not always improve the system robustness, and can in fact greatly increase the risk, when measured as a risk of large failure.

Modeling complex tone perception: grouping harmonics with combination-sensitive neurons.

PubMed

Medvedev, Andrei V; Chiao, Faye; Kanwal, Jagmeet S

2002-06-01

Perception of complex communication sounds is a major function of the auditory system. To create a coherent precept of these sounds the auditory system may instantaneously group or bind multiple harmonics within complex sounds. This perception strategy simplifies further processing of complex sounds and facilitates their meaningful integration with other sensory inputs. Based on experimental data and a realistic model, we propose that associative learning of combinations of harmonic frequencies and nonlinear facilitation of responses to those combinations, also referred to as "combination-sensitivity," are important for spectral grouping. For our model, we simulated combination sensitivity using Hebbian and associative types of synaptic plasticity in auditory neurons. We also provided a parallel tonotopic input that converges and diverges within the network. Neurons in higher-order layers of the network exhibited an emergent property of multifrequency tuning that is consistent with experimental findings. Furthermore, this network had the capacity to "recognize" the pitch or fundamental frequency of a harmonic tone complex even when the fundamental frequency itself was missing.

Asymmetry of Hemispheric Network Topology Reveals Dissociable Processes between Functional and Structural Brain Connectome in Community-Living Elders

PubMed Central

Sun, Yu; Li, Junhua; Suckling, John; Feng, Lei

2017-01-01

Human brain is structurally and functionally asymmetrical and the asymmetries of brain phenotypes have been shown to change in normal aging. Recent advances in graph theoretical analysis have showed topological lateralization between hemispheric networks in the human brain throughout the lifespan. Nevertheless, apparent discrepancies of hemispheric asymmetry were reported between the structural and functional brain networks, indicating the potentially complex asymmetry patterns between structural and functional networks in aging population. In this study, using multimodal neuroimaging (resting-state fMRI and structural diffusion tensor imaging), we investigated the characteristics of hemispheric network topology in 76 (male/female = 15/61, age = 70.08 ± 5.30 years) community-dwelling older adults. Hemispheric functional and structural brain networks were obtained for each participant. Graph theoretical approaches were then employed to estimate the hemispheric topological properties. We found that the optimal small-world properties were preserved in both structural and functional hemispheric networks in older adults. Moreover, a leftward asymmetry in both global and local levels were observed in structural brain networks in comparison with a symmetric pattern in functional brain network, suggesting a dissociable process of hemispheric asymmetry between structural and functional connectome in healthy older adults. Finally, the scores of hemispheric asymmetry in both structural and functional networks were associated with behavioral performance in various cognitive domains. Taken together, these findings provide new insights into the lateralized nature of multimodal brain connectivity, highlight the potentially complex relationship between structural and functional brain network alterations, and augment our understanding of asymmetric structural and functional specializations in normal aging. PMID:29209197

Polarity-specific high-level information propagation in neural networks.

PubMed

Lin, Yen-Nan; Chang, Po-Yen; Hsiao, Pao-Yueh; Lo, Chung-Chuan

2014-01-01

Analyzing the connectome of a nervous system provides valuable information about the functions of its subsystems. Although much has been learned about the architectures of neural networks in various organisms by applying analytical tools developed for general networks, two distinct and functionally important properties of neural networks are often overlooked. First, neural networks are endowed with polarity at the circuit level: Information enters a neural network at input neurons, propagates through interneurons, and leaves via output neurons. Second, many functions of nervous systems are implemented by signal propagation through high-level pathways involving multiple and often recurrent connections rather than by the shortest paths between nodes. In the present study, we analyzed two neural networks: the somatic nervous system of Caenorhabditis elegans (C. elegans) and the partial central complex network of Drosophila, in light of these properties. Specifically, we quantified high-level propagation in the vertical and horizontal directions: the former characterizes how signals propagate from specific input nodes to specific output nodes and the latter characterizes how a signal from a specific input node is shared by all output nodes. We found that the two neural networks are characterized by very efficient vertical and horizontal propagation. In comparison, classic small-world networks show a trade-off between vertical and horizontal propagation; increasing the rewiring probability improves the efficiency of horizontal propagation but worsens the efficiency of vertical propagation. Our result provides insights into how the complex functions of natural neural networks may arise from a design that allows them to efficiently transform and combine input signals.

Polarity-specific high-level information propagation in neural networks

PubMed Central

Lin, Yen-Nan; Chang, Po-Yen; Hsiao, Pao-Yueh; Lo, Chung-Chuan

2014-01-01

Analyzing the connectome of a nervous system provides valuable information about the functions of its subsystems. Although much has been learned about the architectures of neural networks in various organisms by applying analytical tools developed for general networks, two distinct and functionally important properties of neural networks are often overlooked. First, neural networks are endowed with polarity at the circuit level: Information enters a neural network at input neurons, propagates through interneurons, and leaves via output neurons. Second, many functions of nervous systems are implemented by signal propagation through high-level pathways involving multiple and often recurrent connections rather than by the shortest paths between nodes. In the present study, we analyzed two neural networks: the somatic nervous system of Caenorhabditis elegans (C. elegans) and the partial central complex network of Drosophila, in light of these properties. Specifically, we quantified high-level propagation in the vertical and horizontal directions: the former characterizes how signals propagate from specific input nodes to specific output nodes and the latter characterizes how a signal from a specific input node is shared by all output nodes. We found that the two neural networks are characterized by very efficient vertical and horizontal propagation. In comparison, classic small-world networks show a trade-off between vertical and horizontal propagation; increasing the rewiring probability improves the efficiency of horizontal propagation but worsens the efficiency of vertical propagation. Our result provides insights into how the complex functions of natural neural networks may arise from a design that allows them to efficiently transform and combine input signals. PMID:24672472

Sexual networks: measuring sexual selection in structured, polyandrous populations.

PubMed

McDonald, Grant C; James, Richard; Krause, Jens; Pizzari, Tommaso

2013-03-05

Sexual selection is traditionally measured at the population level, assuming that populations lack structure. However, increasing evidence undermines this approach, indicating that intrasexual competition in natural populations often displays complex patterns of spatial and temporal structure. This complexity is due in part to the degree and mechanisms of polyandry within a population, which can influence the intensity and scale of both pre- and post-copulatory sexual competition. Attempts to measure selection at the local and global scale have been made through multi-level selection approaches. However, definitions of local scale are often based on physical proximity, providing a rather coarse measure of local competition, particularly in polyandrous populations where the local scale of pre- and post-copulatory competition may differ drastically from each other. These limitations can be solved by social network analysis, which allows us to define a unique sexual environment for each member of a population: 'local scale' competition, therefore, becomes an emergent property of a sexual network. Here, we first propose a novel quantitative approach to measure pre- and post-copulatory sexual selection, which integrates multi-level selection with information on local scale competition derived as an emergent property of networks of sexual interactions. We then use simple simulations to illustrate the ways in which polyandry can impact estimates of sexual selection. We show that for intermediate levels of polyandry, the proposed network-based approach provides substantially more accurate measures of sexual selection than the more traditional population-level approach. We argue that the increasing availability of fine-grained behavioural datasets provides exciting new opportunities to develop network approaches to study sexual selection in complex societies.

Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space.

PubMed

Ahnert, S E; Fink, T M A

2016-07-01

Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the 'function' of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature. © 2016 The Authors.

The topology and dynamics of complex networks

NASA Astrophysics Data System (ADS)

Dezso, Zoltan

We start with a brief introduction about the topological properties of real networks. Most real networks are scale-free, being characterized by a power-law degree distribution. The scale-free nature of real networks leads to unexpected properties such as the vanishing epidemic threshold. Traditional methods aiming to reduce the spreading rate of viruses cannot succeed on eradicating the epidemic on a scale-free network. We demonstrate that policies that discriminate between the nodes, curing mostly the highly connected nodes, can restore a finite epidemic threshold and potentially eradicate the virus. We find that the more biased a policy is towards the hubs, the more chance it has to bring the epidemic threshold above the virus' spreading rate. We continue by studying a large Web portal as a model system for a rapidly evolving network. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power law distribution, in contrast with the exponential expected for Poisson processes. We show that the exponent characterizing the individual user's browsing patterns determines the power-law decay in a document's visitation. Finally, we turn our attention to biological networks and demonstrate quantitatively that protein complexes in the yeast, Saccharomyces cerevisiae, are comprised of a core in which subunits are highly coexpressed, display the same deletion phenotype (essential or non-essential) and share identical functional classification and cellular localization. The results allow us to define the deletion phenotype and cellular task of most known complexes, and to identify with high confidence the biochemical role of hundreds of proteins with yet unassigned functionality.

Some comparisons of complexity in dictionary-based and linear computational models.

PubMed

Gnecco, Giorgio; Kůrková, Věra; Sanguineti, Marcello

2011-03-01

Neural networks provide a more flexible approximation of functions than traditional linear regression. In the latter, one can only adjust the coefficients in linear combinations of fixed sets of functions, such as orthogonal polynomials or Hermite functions, while for neural networks, one may also adjust the parameters of the functions which are being combined. However, some useful properties of linear approximators (such as uniqueness, homogeneity, and continuity of best approximation operators) are not satisfied by neural networks. Moreover, optimization of parameters in neural networks becomes more difficult than in linear regression. Experimental results suggest that these drawbacks of neural networks are offset by substantially lower model complexity, allowing accuracy of approximation even in high-dimensional cases. We give some theoretical results comparing requirements on model complexity for two types of approximators, the traditional linear ones and so called variable-basis types, which include neural networks, radial, and kernel models. We compare upper bounds on worst-case errors in variable-basis approximation with lower bounds on such errors for any linear approximator. Using methods from nonlinear approximation and integral representations tailored to computational units, we describe some cases where neural networks outperform any linear approximator. Copyright © 2010 Elsevier Ltd. All rights reserved.

Epidemic processes in complex networks

NASA Astrophysics Data System (ADS)

Pastor-Satorras, Romualdo; Castellano, Claudio; Van Mieghem, Piet; Vespignani, Alessandro

2015-07-01

In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems. The complex properties of real-world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks. The theoretical analysis of epidemic spreading in heterogeneous networks requires the development of novel analytical frameworks, and it has produced results of conceptual and practical relevance. A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear. Physicists, mathematicians, epidemiologists, computer, and social scientists share a common interest in studying epidemic spreading and rely on similar models for the description of the diffusion of pathogens, knowledge, and innovation. For this reason, while focusing on the main results and the paradigmatic models in infectious disease modeling, the major results concerning generalized social contagion processes are also presented. Finally, the research activity at the forefront in the study of epidemic spreading in coevolving, coupled, and time-varying networks is reported.

Metal-organic coordination architectures of tetrazole heterocycle ligands bearing acetate groups: Synthesis, characterization and magnetic properties

NASA Astrophysics Data System (ADS)

Hu, Bo-Wen; Zheng, Xiang-Yu; Ding, Cheng

2015-12-01

Two new coordination complexes with tetrazole heterocycle ligands bearing acetate groups, [Co(L)2]n (1) and [Co3(L)4(N3)2·2MeOH]n (2) (L=tetrazole-1-acetate) have been synthesized and structurally characterized. Single crystal structure analysis shows that the cobalt-complex 1 has the 3D 3,6-connected (42.6)2(44.62.88.10)-ant topology. By introducing azide in this system, complex 2 forms the 2D network containing the [Co3] units. And the magnetic properties of 1 and 2 have been studied.

Programmable disorder in random DNA tilings

NASA Astrophysics Data System (ADS)

Tikhomirov, Grigory; Petersen, Philip; Qian, Lulu

2017-03-01

Scaling up the complexity and diversity of synthetic molecular structures will require strategies that exploit the inherent stochasticity of molecular systems in a controlled fashion. Here we demonstrate a framework for programming random DNA tilings and show how to control the properties of global patterns through simple, local rules. We constructed three general forms of planar network—random loops, mazes and trees—on the surface of self-assembled DNA origami arrays on the micrometre scale with nanometre resolution. Using simple molecular building blocks and robust experimental conditions, we demonstrate control of a wide range of properties of the random networks, including the branching rules, the growth directions, the proximity between adjacent networks and the size distribution. Much as combinatorial approaches for generating random one-dimensional chains of polymers have been used to revolutionize chemical synthesis and the selection of functional nucleic acids, our strategy extends these principles to random two-dimensional networks of molecules and creates new opportunities for fabricating more complex molecular devices that are organized by DNA nanostructures.

Maximizing information exchange between complex networks

NASA Astrophysics Data System (ADS)

West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo

2008-10-01

Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain’s response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of modern research overarching all of the traditional scientific disciplines. The transportation networks of planes, highways and railroads; the economic networks of global finance and stock markets; the social networks of terrorism, governments, businesses and churches; the physical networks of telephones, the Internet, earthquakes and global warming and the biological networks of gene regulation, the human body, clusters of neurons and food webs, share a number of apparently universal properties as the networks become increasingly complex. Ubiquitous aspects of such complex networks are the appearance of non-stationary and non-ergodic statistical processes and inverse power-law statistical distributions. Herein we review the traditional dynamical and phase-space methods for modeling such networks as their complexity increases and focus on the limitations of these procedures in explaining complex networks. Of course we will not be able to review the entire nascent field of network science, so we limit ourselves to a review of how certain complexity barriers have been surmounted using newly applied theoretical concepts such as aging, renewal, non-ergodic statistics and the fractional calculus. One emphasis of this review is information transport between complex networks, which requires a fundamental change in perception that we express as a transition from the familiar stochastic resonance to the new concept of complexity matching.

The Dichotomy in Degree Correlation of Biological Networks

PubMed Central

Hao, Dapeng; Li, Chuanxing

2011-01-01

Most complex networks from different areas such as biology, sociology or technology, show a correlation on node degree where the possibility of a link between two nodes depends on their connectivity. It is widely believed that complex networks are either disassortative (links between hubs are systematically suppressed) or assortative (links between hubs are enhanced). In this paper, we analyze a variety of biological networks and find that they generally show a dichotomous degree correlation. We find that many properties of biological networks can be explained by this dichotomy in degree correlation, including the neighborhood connectivity, the sickle-shaped clustering coefficient distribution and the modularity structure. This dichotomy distinguishes biological networks from real disassortative networks or assortative networks such as the Internet and social networks. We suggest that the modular structure of networks accounts for the dichotomy in degree correlation and vice versa, shedding light on the source of modularity in biological networks. We further show that a robust and well connected network necessitates the dichotomy of degree correlation, suggestive of an evolutionary motivation for its existence. Finally, we suggest that a dichotomous degree correlation favors a centrally connected modular network, by which the integrity of network and specificity of modules might be reconciled. PMID:22164269

Controllability of flow-conservation networks

NASA Astrophysics Data System (ADS)

Zhao, Chen; Zeng, An; Jiang, Rui; Yuan, Zhengzhong; Wang, Wen-Xu

2017-07-01

The ultimate goal of exploring complex networks is to control them. As such, controllability of complex networks has been intensively investigated. Despite recent advances in studying the impact of a network's topology on its controllability, a comprehensive understanding of the synergistic impact of network topology and dynamics on controllability is still lacking. Here, we explore the controllability of flow-conservation networks, trying to identify the minimal number of driver nodes that can guide the network to any desirable state. We develop a method to analyze the controllability on flow-conservation networks based on exact controllability theory, transforming the original analysis on adjacency matrix to Laplacian matrix. With this framework, we systematically investigate the impact of some key factors of networks, including link density, link directionality, and link polarity, on the controllability of these networks. We also obtain the analytical equations by investigating the network's structural properties approximatively and design the efficient tools. Finally, we consider some real networks with flow dynamics, finding that their controllability is significantly different from that predicted by only considering the topology. These findings deepen our understanding of network controllability with flow-conservation dynamics and provide a general framework to incorporate real dynamics in the analysis of network controllability.

Control of epidemics on complex networks: Effectiveness of delayed isolation

NASA Astrophysics Data System (ADS)

Pereira, Tiago; Young, Lai-Sang

2015-08-01

We study isolation as a means to control epidemic outbreaks in complex networks, focusing on the consequences of delays in isolating infected nodes. Our analysis uncovers a tipping point: if infected nodes are isolated before a critical day dc, the disease is effectively controlled, whereas for longer delays the number of infected nodes climbs steeply. We show that dc can be estimated explicitly in terms of network properties and disease parameters, connecting lowered values of dc explicitly to heterogeneity in degree distribution. Our results reveal also that initial delays in the implementation of isolation protocols can have catastrophic consequences in heterogeneous networks. As our study is carried out in a general framework, it has the potential to offer insight and suggest proactive strategies for containing outbreaks of a range of serious infectious diseases.

Influence of chirality on vibrational and relaxational properties of (S)- and (R,S)-ibuprofen/methyl-β-cyclodextrin inclusion complexes: an INS and QENS study.

PubMed

Crupi, Vincenza; Guella, Graziano; Longeville, Stéphane; Majolino, Domenico; Mancini, Ines; Paciaroni, Alessandro; Rossi, Barbara; Venuti, Valentina

2013-10-03

In this paper, we analyze the internal picosecond dynamics of enantiomeric ((S)-) and racemic ((R,S)-) ibuprofen (IBP), when forming inclusion complexes, in solid state, with methyl-β-cyclodextrin (Me-β-CD), by inelastic and quasi elastic neutron scattering. The study was aimed at understanding, by the analysis of the vibrational and relaxational properties of the inclusion complexes also with respect to the single components, if and how the differences in the structural properties of the hydrogen bond (HB) network of (S)- and (R,S)-IBP can have influence on the complexation process triggered by "host-guest" interactions, whose detailed knowledge is retained as a prerequisite for enantiodiscrimination. From the results, a similar complexation mechanism for (S)- and (R,S)-IBP is argued, with a preferred penetration mode involving the isopropyl group of IBP.

Can simple rules control development of a pioneer vertebrate neuronal network generating behavior?

PubMed

Roberts, Alan; Conte, Deborah; Hull, Mike; Merrison-Hort, Robert; al Azad, Abul Kalam; Buhl, Edgar; Borisyuk, Roman; Soffe, Stephen R

2014-01-08

How do the pioneer networks in the axial core of the vertebrate nervous system first develop? Fundamental to understanding any full-scale neuronal network is knowledge of the constituent neurons, their properties, synaptic interconnections, and normal activity. Our novel strategy uses basic developmental rules to generate model networks that retain individual neuron and synapse resolution and are capable of reproducing correct, whole animal responses. We apply our developmental strategy to young Xenopus tadpoles, whose brainstem and spinal cord share a core vertebrate plan, but at a tractable complexity. Following detailed anatomical and physiological measurements to complete a descriptive library of each type of spinal neuron, we build models of their axon growth controlled by simple chemical gradients and physical barriers. By adding dendrites and allowing probabilistic formation of synaptic connections, we reconstruct network connectivity among up to 2000 neurons. When the resulting "network" is populated by model neurons and synapses, with properties based on physiology, it can respond to sensory stimulation by mimicking tadpole swimming behavior. This functioning model represents the most complete reconstruction of a vertebrate neuronal network that can reproduce the complex, rhythmic behavior of a whole animal. The findings validate our novel developmental strategy for generating realistic networks with individual neuron- and synapse-level resolution. We use it to demonstrate how early functional neuronal connectivity and behavior may in life result from simple developmental "rules," which lay out a scaffold for the vertebrate CNS without specific neuron-to-neuron recognition.

Fixed-time synchronization of complex networks with nonidentical nodes and stochastic noise perturbations

NASA Astrophysics Data System (ADS)

Zhang, Wanli; Li, Chuandong; Huang, Tingwen; Huang, Junjian

2018-02-01

This paper investigates the fixed-time synchronization of complex networks (CNs) with nonidentical nodes and stochastic noise perturbations. By designing new controllers, constructing Lyapunov functions and using the properties of Weiner process, different synchronization criteria are derived according to whether the node systems in the CNs or the goal system satisfies the corresponding conditions. Moreover, the role of the designed controllers is analyzed in great detail by constructing a suitable comparison system and a new method is presented to estimate the settling time by utilizing the comparison system. Results of this paper can be applied to both directed and undirected weighted networks. Numerical simulations are offered to verify the effectiveness of our new results.

On system behaviour using complex networks of a compression algorithm

NASA Astrophysics Data System (ADS)

Walker, David M.; Correa, Debora C.; Small, Michael

2018-01-01

We construct complex networks of scalar time series using a data compression algorithm. The structure and statistics of the resulting networks can be used to help characterize complex systems, and one property, in particular, appears to be a useful discriminating statistic in surrogate data hypothesis tests. We demonstrate these ideas on systems with known dynamical behaviour and also show that our approach is capable of identifying behavioural transitions within electroencephalogram recordings as well as changes due to a bifurcation parameter of a chaotic system. The technique we propose is dependent on a coarse grained quantization of the original time series and therefore provides potential for a spatial scale-dependent characterization of the data. Finally the method is as computationally efficient as the underlying compression algorithm and provides a compression of the salient features of long time series.

Benford’s Distribution in Complex Networks

PubMed Central

Morzy, Mikołaj; Kajdanowicz, Tomasz; Szymański, Bolesław K.

2016-01-01

Many collections of numbers do not have a uniform distribution of the leading digit, but conform to a very particular pattern known as Benford’s distribution. This distribution has been found in numerous areas such as accounting data, voting registers, census data, and even in natural phenomena. Recently it has been reported that Benford’s law applies to online social networks. Here we introduce a set of rigorous tests for adherence to Benford’s law and apply it to verification of this claim, extending the scope of the experiment to various complex networks and to artificial networks created by several popular generative models. Our findings are that neither for real nor for artificial networks there is sufficient evidence for common conformity of network structural properties with Benford’s distribution. We find very weak evidence suggesting that three measures, degree centrality, betweenness centrality and local clustering coefficient, could adhere to Benford’s law for scalefree networks but only for very narrow range of their parameters. PMID:27748398

Application of Petri net theory for modelling and validation of the sucrose breakdown pathway in the potato tuber.

PubMed

Koch, Ina; Junker, Björn H; Heiner, Monika

2005-04-01

Because of the complexity of metabolic networks and their regulation, formal modelling is a useful method to improve the understanding of these systems. An essential step in network modelling is to validate the network model. Petri net theory provides algorithms and methods, which can be applied directly to metabolic network modelling and analysis in order to validate the model. The metabolism between sucrose and starch in the potato tuber is of great research interest. Even if the metabolism is one of the best studied in sink organs, it is not yet fully understood. We provide an approach for model validation of metabolic networks using Petri net theory, which we demonstrate for the sucrose breakdown pathway in the potato tuber. We start with hierarchical modelling of the metabolic network as a Petri net and continue with the analysis of qualitative properties of the network. The results characterize the net structure and give insights into the complex net behaviour.

Role models for complex networks

NASA Astrophysics Data System (ADS)

Reichardt, J.; White, D. R.

2007-11-01

We present a framework for automatically decomposing (“block-modeling”) the functional classes of agents within a complex network. These classes are represented by the nodes of an image graph (“block model”) depicting the main patterns of connectivity and thus functional roles in the network. Using a first principles approach, we derive a measure for the fit of a network to any given image graph allowing objective hypothesis testing. From the properties of an optimal fit, we derive how to find the best fitting image graph directly from the network and present a criterion to avoid overfitting. The method can handle both two-mode and one-mode data, directed and undirected as well as weighted networks and allows for different types of links to be dealt with simultaneously. It is non-parametric and computationally efficient. The concepts of structural equivalence and modularity are found as special cases of our approach. We apply our method to the world trade network and analyze the roles individual countries play in the global economy.

Comparative analysis of two discretizations of Ricci curvature for complex networks.

PubMed

Samal, Areejit; Sreejith, R P; Gu, Jiao; Liu, Shiping; Saucan, Emil; Jost, Jürgen

2018-06-05

We have performed an empirical comparison of two distinct notions of discrete Ricci curvature for graphs or networks, namely, the Forman-Ricci curvature and Ollivier-Ricci curvature. Importantly, these two discretizations of the Ricci curvature were developed based on different properties of the classical smooth notion, and thus, the two notions shed light on different aspects of network structure and behavior. Nevertheless, our extensive computational analysis in a wide range of both model and real-world networks shows that the two discretizations of Ricci curvature are highly correlated in many networks. Moreover, we show that if one considers the augmented Forman-Ricci curvature which also accounts for the two-dimensional simplicial complexes arising in graphs, the observed correlation between the two discretizations is even higher, especially, in real networks. Besides the potential theoretical implications of these observations, the close relationship between the two discretizations has practical implications whereby Forman-Ricci curvature can be employed in place of Ollivier-Ricci curvature for faster computation in larger real-world networks whenever coarse analysis suffices.

A review of structural and functional brain networks: small world and atlas.

PubMed

Yao, Zhijun; Hu, Bin; Xie, Yuanwei; Moore, Philip; Zheng, Jiaxiang

2015-03-01

Brain networks can be divided into two categories: structural and functional networks. Many studies of neuroscience have reported that the complex brain networks are characterized by small-world or scale-free properties. The identification of nodes is the key factor in studying the properties of networks on the macro-, micro- or mesoscale in both structural and functional networks. In the study of brain networks, nodes are always determined by atlases. Therefore, the selection of atlases is critical, and appropriate atlases are helpful to combine the analyses of structural and functional networks. Currently, some problems still exist in the establishment or usage of atlases, which are often caused by the segmentation or the parcellation of the brain. We suggest that quantification of brain networks might be affected by the selection of atlases to a large extent. In the process of building atlases, the influences of single subjects and groups should be balanced. In this article, we focused on the effects of atlases on the analysis of brain networks and the improved divisions based on the tractography or connectivity in the parcellation of atlases.

Local versus global knowledge in the Barabási-Albert scale-free network model.

PubMed

Gómez-Gardeñes, Jesús; Moreno, Yamir

2004-03-01

The scale-free model of Barabási and Albert (BA) gave rise to a burst of activity in the field of complex networks. In this paper, we revisit one of the main assumptions of the model, the preferential attachment (PA) rule. We study a model in which the PA rule is applied to a neighborhood of newly created nodes and thus no global knowledge of the network is assumed. We numerically show that global properties of the BA model such as the connectivity distribution and the average shortest path length are quite robust when there is some degree of local knowledge. In contrast, other properties such as the clustering coefficient and degree-degree correlations differ and approach the values measured for real-world networks.

Multiscale complex network analysis: An approach to study spatiotemporal rainfall pattern in south Germany

NASA Astrophysics Data System (ADS)

Agarwal, Ankit; Marwan, Norbert; Rathinasamy, Maheswaran; Oeztuerk, Ugur; Merz, Bruno; Kurths, Jürgen

2017-04-01

Understanding of the climate sytems has been of tremendous importance to different branches such as agriculture, flood, drought and water resources management etc. In this regard, complex networks analysis and time series analysis attracted considerable attention, owing to their potential role in understanding the climate system through characteristic properties. One of the basic requirements in studying climate network dynamics is to identify connections in space or time or space-time, depending upon the purpose. Although a wide variety of approaches have been developed and applied to identify and analyse spatio-temporal relationships by climate networks, there is still further need for improvements in particular when considering precipitation time series or interactions on different scales. In this regard, recent developments in the area of network theory, especially complex networks, offer new avenues, both for their generality about systems and for their holistic perspective about spatio-temporal relationships. The present study has made an attempt to apply the ideas developed in the field of complex networks to examine connections in regional climate networks with particular focus on multiscale spatiotemporal connections. This paper proposes a novel multiscale understanding of regional climate networks using wavelets. The proposed approach is applied to daily precipitation records observed at 543 selected stations from south Germany for a period of 110 years (1901-2010). Further, multiscale community mining is performed on the same study region to shed more light on the underlying processes at different time scales. Various network measure and tools so far employed provide micro-level (individual station) and macro-level (community structure) information of the network. It is interesting to investigate how the result of this study can be useful for future climate predictions and for evaluating climate models on their implementation regarding heavy precipitation. Keywords: Complex network, event synchronization, wavelet, regional climate network, multiscale community mining

Effect of three bis-pyridyl-bis-amide ligands with various spacers on the structural diversity of new multifunctional cobalt(II) coordination polymers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Hong-Yan; Lu, Huizhe; Le, Mao

2015-03-15

Three new cobalt(II) coordination polymers [Co{sub 2}(1,4-NDC){sub 2}(3-bpye)(H{sub 2}O)] (1), [Co(1,4-NDC)(3-bpfp)(H{sub 2}O)] (2) and [Co(1,4-NDC)(3-bpcb)] (3) [3-bpye=N,N′-bis(3-pyridinecarboxamide)-1,2-ethane, 3-bpfp=bis(3-pyridylformyl)piperazine, 3-bpcb=N,N′-bis(3-pyridinecarboxamide)-1,4-benzene, and 1,4-H{sub 2}NDC=1,4-naphthalenedicarboxylic acid] have been hydrothermally synthesized. The structures of complexes 1–3 have been determined by X-ray single crystal diffraction analyses and further characterized by infrared spectroscopy (IR), powder X-ray diffraction (PXRD) and thermogravimetric analyses (TGA). Complex 1 is a 3D coordination structure with 8-connected (4{sup 20}.6{sup 8}) topology constructed from 3D [Co{sub 2}(1,4-NDC){sub 2}(H{sub 2}O)]{sub n} framework and bidentate 3-bpye ligands. Complex 2 shows 1D “cage+cage”-like chain formed by 1D [Co{sub 2}(1,4-NDC){sub 2}]{sub n} ribbon chains and [Co{sub 2}(3-bpfp){submore » 2}] loops, which are further linked by hydrogen bonding interactions to form a 3D supramolecular network. Complex 3 displays a 3D coordination network with a 6-connected (4{sup 12}.6{sup 3}) topology based on 2D [Co{sub 2}(1,4-NDC){sub 2}]{sub n} layers and bidentate 3-bpcb bridging ligands. The influences of different bis-pyridyl-bis-amide ligands with various spacers on the structures of title complexes are studied. Moreover, the fluorescent properties, electrochemical behaviors and magnetic properties of complexes 1–3 have been investigated. - Graphical abstract: Three multifunctional cobalt(II) complexes constructed from three bis-pyridyl-bis-amide and 1,4-naphthalenedicarboxylic acid have been hydrothermally synthesized and characterized. The fluorescent, electrochemical and magnetic properties of 1–3 have been investigated. - Highlights: • Three multifunctional cobalt(II) complexes based on various bis-pyridyl-bis-amide ligands. • Complex 1 is a 3D coordination structure with 8-connected (4{sup 20}.6{sup 8}) topology. • Complex 2 is a 1D “cage+cage”-like chain. • Complex 3 is a 3D coordination network with a 6-connected (4{sup 12}.6{sup 3}) topology. • The fluorescent, electrochemical and magnetic properties of 1–3 were reported.« less

Accelerating Chemical Discovery with Machine Learning: Simulated Evolution of Spin Crossover Complexes with an Artificial Neural Network.

PubMed

Janet, Jon Paul; Chan, Lydia; Kulik, Heather J

2018-03-01

Machine learning (ML) has emerged as a powerful complement to simulation for materials discovery by reducing time for evaluation of energies and properties at accuracy competitive with first-principles methods. We use genetic algorithm (GA) optimization to discover unconventional spin-crossover complexes in combination with efficient scoring from an artificial neural network (ANN) that predicts spin-state splitting of inorganic complexes. We explore a compound space of over 5600 candidate materials derived from eight metal/oxidation state combinations and a 32-ligand pool. We introduce a strategy for error-aware ML-driven discovery by limiting how far the GA travels away from the nearest ANN training points while maximizing property (i.e., spin-splitting) fitness, leading to discovery of 80% of the leads from full chemical space enumeration. Over a 51-complex subset, average unsigned errors (4.5 kcal/mol) are close to the ANN's baseline 3 kcal/mol error. By obtaining leads from the trained ANN within seconds rather than days from a DFT-driven GA, this strategy demonstrates the power of ML for accelerating inorganic material discovery.

Steady states and stability in metabolic networks without regulation.

PubMed

Ivanov, Oleksandr; van der Schaft, Arjan; Weissing, Franz J

2016-07-21

Metabolic networks are often extremely complex. Despite intensive efforts many details of these networks, e.g., exact kinetic rates and parameters of metabolic reactions, are not known, making it difficult to derive their properties. Considerable effort has been made to develop theory about properties of steady states in metabolic networks that are valid for any values of parameters. General results on uniqueness of steady states and their stability have been derived with specific assumptions on reaction kinetics, stoichiometry and network topology. For example, deep results have been obtained under the assumptions of mass-action reaction kinetics, continuous flow stirred tank reactors (CFSTR), concordant reaction networks and others. Nevertheless, a general theory about properties of steady states in metabolic networks is still missing. Here we make a step further in the quest for such a theory. Specifically, we study properties of steady states in metabolic networks with monotonic kinetics in relation to their stoichiometry (simple and general) and the number of metabolites participating in every reaction (single or many). Our approach is based on the investigation of properties of the Jacobian matrix. We show that stoichiometry, network topology, and the number of metabolites that participate in every reaction have a large influence on the number of steady states and their stability in metabolic networks. Specifically, metabolic networks with single-substrate-single-product reactions have disconnected steady states, whereas in metabolic networks with multiple-substrates-multiple-product reactions manifolds of steady states arise. Metabolic networks with simple stoichiometry have either a unique globally asymptotically stable steady state or asymptotically stable manifolds of steady states. In metabolic networks with general stoichiometry the steady states are not always stable and we provide conditions for their stability. In order to demonstrate the biological relevance we illustrate the results on the examples of the TCA cycle, the mevalonate pathway and the Calvin cycle. Copyright © 2016 Elsevier Ltd. All rights reserved.

Network representations of immune system complexity

PubMed Central

Subramanian, Naeha; Torabi-Parizi, Parizad; Gottschalk, Rachel A.; Germain, Ronald N.; Dutta, Bhaskar

2015-01-01

The mammalian immune system is a dynamic multi-scale system composed of a hierarchically organized set of molecular, cellular and organismal networks that act in concert to promote effective host defense. These networks range from those involving gene regulatory and protein-protein interactions underlying intracellular signaling pathways and single cell responses to increasingly complex networks of in vivo cellular interaction, positioning and migration that determine the overall immune response of an organism. Immunity is thus not the product of simple signaling events but rather non-linear behaviors arising from dynamic, feedback-regulated interactions among many components. One of the major goals of systems immunology is to quantitatively measure these complex multi-scale spatial and temporal interactions, permitting development of computational models that can be used to predict responses to perturbation. Recent technological advances permit collection of comprehensive datasets at multiple molecular and cellular levels while advances in network biology support representation of the relationships of components at each level as physical or functional interaction networks. The latter facilitate effective visualization of patterns and recognition of emergent properties arising from the many interactions of genes, molecules, and cells of the immune system. We illustrate the power of integrating ‘omics’ and network modeling approaches for unbiased reconstruction of signaling and transcriptional networks with a focus on applications involving the innate immune system. We further discuss future possibilities for reconstruction of increasingly complex cellular and organism-level networks and development of sophisticated computational tools for prediction of emergent immune behavior arising from the concerted action of these networks. PMID:25625853

Optimal navigation for characterizing the role of the nodes in complex networks

NASA Astrophysics Data System (ADS)

Cajueiro, Daniel O.

2010-05-01

In this paper, we explore how the approach of optimal navigation (Cajueiro (2009) [33]) can be used to evaluate the centrality of a node and to characterize its role in a network. Using the subway network of Boston and the London rapid transit rail as proxies for complex networks, we show that the centrality measures inherited from the approach of optimal navigation may be considered if one desires to evaluate the centrality of the nodes using other pieces of information beyond the geometric properties of the network. Furthermore, evaluating the correlations between these inherited measures and classical measures of centralities such as the degree of a node and the characteristic path length of a node, we have found two classes of results. While for the London rapid transit rail, these inherited measures can be easily explained by these classical measures of centrality, for the Boston underground transportation system we have found nontrivial results.

The spatial response of nonlinear strain propagation in response to actively driven microspheres through entangled actin networks

NASA Astrophysics Data System (ADS)

Falzone, Tobias; Blair, Savanna; Robertson-Anderson, Rae

2015-03-01

The semiflexible biopolymer actin, a ubiquitous component of nearly all biological organisms, plays an important role in many mechanically-driven processes such as muscle contraction, cancer invasion and cell motility. As such, entangled actin networks, which possess unique and complex viscoelastic properties, have been the subject of much theoretical and experimental work. However, due to this viscoelastic complexity, much is still unknown regarding the correlation of the applied stress on actin networks to the induced filament strain at the molecular and micro scale. Here, we use simultaneous optical trapping and fluorescence microscopy to characterize the link between applied microscopic forces and strain propagation as a function of strain rate and concentration. Specifically, we track fiduciary markers on entangled actin filaments before, during and after actively driving embedded microspheres through the network. These measurements provide much needed insight into the molecular-level dynamics connecting stress and strain in semiflexible polymer networks.

Followers are not enough: a multifaceted approach to community detection in online social networks.

PubMed

Darmon, David; Omodei, Elisa; Garland, Joshua

2015-01-01

In online social media networks, individuals often have hundreds or even thousands of connections, which link these users not only to friends, associates, and colleagues, but also to news outlets, celebrities, and organizations. In these complex social networks, a 'community' as studied in the social network literature, can have very different meaning depending on the property of the network under study. Taking into account the multifaceted nature of these networks, we claim that community detection in online social networks should also be multifaceted in order to capture all of the different and valuable viewpoints of 'community.' In this paper we focus on three types of communities beyond follower-based structural communities: activity-based, topic-based, and interaction-based. We analyze a Twitter dataset using three different weightings of the structural network meant to highlight these three community types, and then infer the communities associated with these weightings. We show that interesting insights can be obtained about the complex community structure present in social networks by studying when and how these four community types give rise to similar as well as completely distinct community structure.

Network structure of subway passenger flows

NASA Astrophysics Data System (ADS)

Xu, Q.; Mao, B. H.; Bai, Y.

2016-03-01

The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

Wavelet multiresolution complex network for decoding brain fatigued behavior from P300 signals

NASA Astrophysics Data System (ADS)

Gao, Zhong-Ke; Wang, Zi-Bo; Yang, Yu-Xuan; Li, Shan; Dang, Wei-Dong; Mao, Xiao-Qian

2018-09-01

Brain-computer interface (BCI) enables users to interact with the environment without relying on neural pathways and muscles. P300 based BCI systems have been extensively used to achieve human-machine interaction. However, the appearance of fatigue symptoms during operation process leads to the decline in classification accuracy of P300. Characterizing brain cognitive process underlying normal and fatigue conditions constitutes a problem of vital importance in the field of brain science. We in this paper propose a novel wavelet decomposition based complex network method to efficiently analyze the P300 signals recorded in the image stimulus test based on classical 'Oddball' paradigm. Initially, multichannel EEG signals are decomposed into wavelet coefficient series. Then we construct complex network by treating electrodes as nodes and determining the connections according to the 2-norm distances between wavelet coefficient series. The analysis of topological structure and statistical index indicates that the properties of brain network demonstrate significant distinctions between normal status and fatigue status. More specifically, the brain network reconfiguration in response to the cognitive task in fatigue status is reflected as the enhancement of the small-worldness.

Complex growing networks with intrinsic vertex fitness

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bedogne, C.; Rodgers, G. J.

2006-10-15

One of the major questions in complex network research is to identify the range of mechanisms by which a complex network can self organize into a scale-free state. In this paper we investigate the interplay between a fitness linking mechanism and both random and preferential attachment. In our models, each vertex is assigned a fitness x, drawn from a probability distribution {rho}(x). In Model A, at each time step a vertex is added and joined to an existing vertex, selected at random, with probability p and an edge is introduced between vertices with fitnesses x and y, with a ratemore » f(x,y), with probability 1-p. Model B differs from Model A in that, with probability p, edges are added with preferential attachment rather than randomly. The analysis of Model A shows that, for every fixed fitness x, the network's degree distribution decays exponentially. In Model B we recover instead a power-law degree distribution whose exponent depends only on p, and we show how this result can be generalized. The properties of a number of particular networks are examined.« less

Metal–organic coordination architectures of tetrazole heterocycle ligands bearing acetate groups: Synthesis, characterization and magnetic properties

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hu, Bo-Wen, E-mail: bowenhu@hit.edu.cn; Zheng, Xiang-Yu; Ding, Cheng

2015-12-15

Two new coordination complexes with tetrazole heterocycle ligands bearing acetate groups, [Co(L){sub 2}]{sub n} (1) and [Co{sub 3}(L){sub 4}(N{sub 3}){sub 2}·2MeOH]{sub n} (2) (L=tetrazole-1-acetate) have been synthesized and structurally characterized. Single crystal structure analysis shows that the cobalt-complex 1 has the 3D 3,6-connected (4{sup 2}.6){sub 2}(4{sup 4}.6{sup 2}.8{sup 8}.10)-ant topology. By introducing azide in this system, complex 2 forms the 2D network containing the [Co{sub 3}] units. And the magnetic properties of 1 and 2 have been studied. - Graphical abstract: The synthesis, crystal structure, and magnetic properties of the new coordination complexes with tetrazole heterocycle ligands bearing acetate groupsmore » are reported. - Highlights: • Two novel Cobalt(II) complexes with tetrazole acetate ligands were synthesized. • The magnetic properties of two complexes were studied. • Azide as co-ligand resulted in different structures and magnetic properties. • The new coordination mode of tetrazole acetate ligand was obtained.« less

Complex Networks and Critical Infrastructures

NASA Astrophysics Data System (ADS)

Setola, Roberto; de Porcellinis, Stefano

The term “Critical Infrastructures” indicates all those technological infrastructures such as: electric grids, telecommunication networks, railways, healthcare systems, financial circuits, etc. that are more and more relevant for the welfare of our countries. Each one of these infrastructures is a complex, highly non-linear, geographically dispersed cluster of systems, that interact with their human owners, operators, users and with the other infrastructures. Their augmented relevance and the actual political and technological scenarios, which have increased their exposition to accidental failure and deliberate attacks, demand for different and innovative protection strategies (generally indicate as CIP - Critical Infrastructure Protection). To this end it is mandatory to understand the mechanisms that regulate the dynamic of these infrastructures. In this framework, an interesting approach is those provided by the complex networks. In this paper we illustrate some results achieved considering structural and functional properties of the corresponding topological networks both when each infrastructure is assumed as an autonomous system and when we take into account also the dependencies existing among the different infrastructures.

A pathway-based network analysis of hypertension-related genes

NASA Astrophysics Data System (ADS)

Wang, Huan; Hu, Jing-Bo; Xu, Chuan-Yun; Zhang, De-Hai; Yan, Qian; Xu, Ming; Cao, Ke-Fei; Zhang, Xu-Sheng

2016-02-01

Complex network approach has become an effective way to describe interrelationships among large amounts of biological data, which is especially useful in finding core functions and global behavior of biological systems. Hypertension is a complex disease caused by many reasons including genetic, physiological, psychological and even social factors. In this paper, based on the information of biological pathways, we construct a network model of hypertension-related genes of the salt-sensitive rat to explore the interrelationship between genes. Statistical and topological characteristics show that the network has the small-world but not scale-free property, and exhibits a modular structure, revealing compact and complex connections among these genes. By the threshold of integrated centrality larger than 0.71, seven key hub genes are found: Jun, Rps6kb1, Cycs, Creb312, Cdk4, Actg1 and RT1-Da. These genes should play an important role in hypertension, suggesting that the treatment of hypertension should focus on the combination of drugs on multiple genes.

A multilayer network analysis of hashtags in twitter via co-occurrence and semantic links

NASA Astrophysics Data System (ADS)

Türker, Ilker; Sulak, Eyüb Ekmel

2018-02-01

Complex network studies, as an interdisciplinary framework, span a large variety of subjects including social media. In social networks, several mechanisms generate miscellaneous structures like friendship networks, mention networks, tag networks, etc. Focusing on tag networks (namely, hashtags in twitter), we made a two-layer analysis of tag networks from a massive dataset of Twitter entries. The first layer is constructed by converting the co-occurrences of these tags in a single entry (tweet) into links, while the second layer is constructed converting the semantic relations of the tags into links. We observed that the universal properties of the real networks like small-world property, clustering and power-law distributions in various network parameters are also evident in the multilayer network of hashtags. Moreover, we outlined that co-occurrences of hashtags in tweets are mostly coupled with semantic relations, whereas a small number of semantically unrelated, therefore random links reduce node separation and network diameter in the co-occurrence network layer. Together with the degree distributions, the power-law consistencies of degree difference, edge weight and cosine similarity distributions in both layers are also appealing forms of Zipf’s law evident in nature.

A mathematics for medicine: The Network Effect

PubMed Central

West, Bruce J.

2014-01-01

The theory of medicine and its complement systems biology are intended to explain the workings of the large number of mutually interdependent complex physiologic networks in the human body and to apply that understanding to maintaining the functions for which nature designed them. Therefore, when what had originally been made as a simplifying assumption or a working hypothesis becomes foundational to understanding the operation of physiologic networks it is in the best interests of science to replace or at least update that assumption. The replacement process requires, among other things, an evaluation of how the new hypothesis affects modern day understanding of medical science. This paper identifies linear dynamics and Normal statistics as being such arcane assumptions and explores some implications of their retirement. Specifically we explore replacing Normal with fractal statistics and examine how the latter are related to non-linear dynamics and chaos theory. The observed ubiquity of inverse power laws in physiology entails the need for a new calculus, one that describes the dynamics of fractional phenomena and captures the fractal properties of the statistics of physiological time series. We identify these properties as a necessary consequence of the complexity resulting from the network dynamics and refer to them collectively as The Network Effect. PMID:25538622

A network property necessary for concentration robustness

NASA Astrophysics Data System (ADS)

Eloundou-Mbebi, Jeanne M. O.; Küken, Anika; Omranian, Nooshin; Kleessen, Sabrina; Neigenfind, Jost; Basler, Georg; Nikoloski, Zoran

2016-10-01

Maintenance of functionality of complex cellular networks and entire organisms exposed to environmental perturbations often depends on concentration robustness of the underlying components. Yet, the reasons and consequences of concentration robustness in large-scale cellular networks remain largely unknown. Here, we derive a necessary condition for concentration robustness based only on the structure of networks endowed with mass action kinetics. The structural condition can be used to design targeted experiments to study concentration robustness. We show that metabolites satisfying the necessary condition are present in metabolic networks from diverse species, suggesting prevalence of this property across kingdoms of life. We also demonstrate that our predictions about concentration robustness of energy-related metabolites are in line with experimental evidence from Escherichia coli. The necessary condition is applicable to mass action biological systems of arbitrary size, and will enable understanding the implications of concentration robustness in genetic engineering strategies and medical applications.

A network property necessary for concentration robustness.

PubMed

Eloundou-Mbebi, Jeanne M O; Küken, Anika; Omranian, Nooshin; Kleessen, Sabrina; Neigenfind, Jost; Basler, Georg; Nikoloski, Zoran

2016-10-19

Maintenance of functionality of complex cellular networks and entire organisms exposed to environmental perturbations often depends on concentration robustness of the underlying components. Yet, the reasons and consequences of concentration robustness in large-scale cellular networks remain largely unknown. Here, we derive a necessary condition for concentration robustness based only on the structure of networks endowed with mass action kinetics. The structural condition can be used to design targeted experiments to study concentration robustness. We show that metabolites satisfying the necessary condition are present in metabolic networks from diverse species, suggesting prevalence of this property across kingdoms of life. We also demonstrate that our predictions about concentration robustness of energy-related metabolites are in line with experimental evidence from Escherichia coli. The necessary condition is applicable to mass action biological systems of arbitrary size, and will enable understanding the implications of concentration robustness in genetic engineering strategies and medical applications.

A network property necessary for concentration robustness

PubMed Central

Eloundou-Mbebi, Jeanne M. O.; Küken, Anika; Omranian, Nooshin; Kleessen, Sabrina; Neigenfind, Jost; Basler, Georg; Nikoloski, Zoran

2016-01-01

Maintenance of functionality of complex cellular networks and entire organisms exposed to environmental perturbations often depends on concentration robustness of the underlying components. Yet, the reasons and consequences of concentration robustness in large-scale cellular networks remain largely unknown. Here, we derive a necessary condition for concentration robustness based only on the structure of networks endowed with mass action kinetics. The structural condition can be used to design targeted experiments to study concentration robustness. We show that metabolites satisfying the necessary condition are present in metabolic networks from diverse species, suggesting prevalence of this property across kingdoms of life. We also demonstrate that our predictions about concentration robustness of energy-related metabolites are in line with experimental evidence from Escherichia coli. The necessary condition is applicable to mass action biological systems of arbitrary size, and will enable understanding the implications of concentration robustness in genetic engineering strategies and medical applications. PMID:27759015

Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations

NASA Astrophysics Data System (ADS)

Tadić, Bosiljka; Thurner, Stefan; Rodgers, G. J.

2004-03-01

We study the microscopic time fluctuations of traffic load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates R the traffic is stationary and the load time series exhibits antipersistence due to the regulatory role of the superstructure associated with two hub nodes in the network. We discuss how the superstructure affects the functioning of the network at high traffic density and at the jamming threshold. The degree of correlations systematically decreases with increasing traffic density and eventually disappears when approaching a jamming density Rc. Already before jamming we observe qualitative changes in the global network-load distributions and the particle queuing times. These changes are related to the occurrence of temporary crises in which the network-load increases dramatically, and then slowly falls back to a value characterizing free flow.

Complex networks in confined comminution

NASA Astrophysics Data System (ADS)

Walker, David M.; Tordesillas, Antoinette; Einav, Itai; Small, Michael

2011-08-01

The physical process of confined comminution is investigated within the framework of complex networks. We first characterize the topology of the unweighted contact networks as generated by the confined comminution process. We find this process gives rise to an ultimate contact network which exhibits a scale-free degree distribution and small world properties. In particular, if viewed in the context of networks through which information travels along shortest paths, we find that the global average of the node vulnerability decreases as the comminution process continues, with individual node vulnerability correlating with grain size. A possible application to the design of synthetic networks (e.g., sensor networks) is highlighted. Next we turn our attention to the physics of the granular comminution process and examine force transmission with respect to the weighted contact networks, where each link is weighted by the inverse magnitude of the normal force acting at the associated contact. We find that the strong forces (i.e., force chains) are transmitted along pathways in the network which are mainly following shortest-path routing protocols, as typically found, for example, in communication systems. Motivated by our earlier studies of the building blocks for self-organization in dense granular systems, we also explore the properties of the minimal contact cycles. The distribution of the contact strain energy intensity of 4-cycle motifs in the ultimate state of the confined comminution process is shown to be consistent with a scale-free distribution with infinite variance, thereby suggesting that 4-cycle arrangements of grains are capable of storing vast amounts of energy in their contacts without breaking.

Functional Brain Networks: Does the Choice of Dependency Estimator and Binarization Method Matter?

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2016-07-01

The human brain can be modelled as a complex networked structure with brain regions as individual nodes and their anatomical/functional links as edges. Functional brain networks are constructed by first extracting weighted connectivity matrices, and then binarizing them to minimize the noise level. Different methods have been used to estimate the dependency values between the nodes and to obtain a binary network from a weighted connectivity matrix. In this work we study topological properties of EEG-based functional networks in Alzheimer’s Disease (AD). To estimate the connectivity strength between two time series, we use Pearson correlation, coherence, phase order parameter and synchronization likelihood. In order to binarize the weighted connectivity matrices, we use Minimum Spanning Tree (MST), Minimum Connected Component (MCC), uniform threshold and density-preserving methods. We find that the detected AD-related abnormalities highly depend on the methods used for dependency estimation and binarization. Topological properties of networks constructed using coherence method and MCC binarization show more significant differences between AD and healthy subjects than the other methods. These results might explain contradictory results reported in the literature for network properties specific to AD symptoms. The analysis method should be seriously taken into account in the interpretation of network-based analysis of brain signals.

Quantification of Graph Complexity Based on the Edge Weight Distribution Balance: Application to Brain Networks.

PubMed

Gomez-Pilar, Javier; Poza, Jesús; Bachiller, Alejandro; Gómez, Carlos; Núñez, Pablo; Lubeiro, Alba; Molina, Vicente; Hornero, Roberto

2018-02-01

The aim of this study was to introduce a novel global measure of graph complexity: Shannon graph complexity (SGC). This measure was specifically developed for weighted graphs, but it can also be applied to binary graphs. The proposed complexity measure was designed to capture the interplay between two properties of a system: the 'information' (calculated by means of Shannon entropy) and the 'order' of the system (estimated by means of a disequilibrium measure). SGC is based on the concept that complex graphs should maintain an equilibrium between the aforementioned two properties, which can be measured by means of the edge weight distribution. In this study, SGC was assessed using four synthetic graph datasets and a real dataset, formed by electroencephalographic (EEG) recordings from controls and schizophrenia patients. SGC was compared with graph density (GD), a classical measure used to evaluate graph complexity. Our results showed that SGC is invariant with respect to GD and independent of node degree distribution. Furthermore, its variation with graph size [Formula: see text] is close to zero for [Formula: see text]. Results from the real dataset showed an increment in the weight distribution balance during the cognitive processing for both controls and schizophrenia patients, although these changes are more relevant for controls. Our findings revealed that SGC does not need a comparison with null-hypothesis networks constructed by a surrogate process. In addition, SGC results on the real dataset suggest that schizophrenia is associated with a deficit in the brain dynamic reorganization related to secondary pathways of the brain network.

Neuronal avalanches and learning

NASA Astrophysics Data System (ADS)

de Arcangelis, Lucilla

2011-05-01

Networks of living neurons represent one of the most fascinating systems of biology. If the physical and chemical mechanisms at the basis of the functioning of a single neuron are quite well understood, the collective behaviour of a system of many neurons is an extremely intriguing subject. Crucial ingredient of this complex behaviour is the plasticity property of the network, namely the capacity to adapt and evolve depending on the level of activity. This plastic ability is believed, nowadays, to be at the basis of learning and memory in real brains. Spontaneous neuronal activity has recently shown features in common to other complex systems. Experimental data have, in fact, shown that electrical information propagates in a cortex slice via an avalanche mode. These avalanches are characterized by a power law distribution for the size and duration, features found in other problems in the context of the physics of complex systems and successful models have been developed to describe their behaviour. In this contribution we discuss a statistical mechanical model for the complex activity in a neuronal network. The model implements the main physiological properties of living neurons and is able to reproduce recent experimental results. Then, we discuss the learning abilities of this neuronal network. Learning occurs via plastic adaptation of synaptic strengths by a non-uniform negative feedback mechanism. The system is able to learn all the tested rules, in particular the exclusive OR (XOR) and a random rule with three inputs. The learning dynamics exhibits universal features as function of the strength of plastic adaptation. Any rule could be learned provided that the plastic adaptation is sufficiently slow.

How Unstable Are Complex Financial Systems? Analyzing an Inter-bank Network of Credit Relations

NASA Astrophysics Data System (ADS)

Sinha, Sitabhra; Thess, Maximilian; Markose, Sheri

The recent worldwide economic crisis of 2007-09 has focused attention on the need to analyze systemic risk in complex financial networks. We investigate the problem of robustness of such systems in the context of the general theory of dynamical stability in complex networks and, in particular, how the topology of connections influence the risk of the failure of a single institution triggering a cascade of successive collapses propagating through the network. We use data on bilateral liabilities (or exposure) in the derivatives market between 202 financial intermediaries based in USA and Europe in the last quarter of 2009 to empirically investigate the network structure of the over-the-counter (OTC) derivatives market. We observe that the network exhibits both heterogeneity in node properties and the existence of communities. It also has a prominent core-periphery organization and can resist large-scale collapse when subjected to individual bank defaults (however, failure of any bank in the core may result in localized collapse of the innermost core with substantial loss of capital) but is vulnerable to system-wide breakdown as a result of an accompanying liquidity crisis.

Complex network description of the ionosphere

NASA Astrophysics Data System (ADS)

Lu, Shikun; Zhang, Hao; Li, Xihai; Li, Yihong; Niu, Chao; Yang, Xiaoyun; Liu, Daizhi

2018-03-01

Complex networks have emerged as an essential approach of geoscience to generate novel insights into the nature of geophysical systems. To investigate the dynamic processes in the ionosphere, a directed complex network is constructed, based on a probabilistic graph of the vertical total electron content (VTEC) from 2012. The results of the power-law hypothesis test show that both the out-degree and in-degree distribution of the ionospheric network are not scale-free. Thus, the distribution of the interactions in the ionosphere is homogenous. None of the geospatial positions play an eminently important role in the propagation of the dynamic ionospheric processes. The spatial analysis of the ionospheric network shows that the interconnections principally exist between adjacent geographical locations, indicating that the propagation of the dynamic processes primarily depends on the geospatial distance in the ionosphere. Moreover, the joint distribution of the edge distances with respect to longitude and latitude directions shows that the dynamic processes travel further along the longitude than along the latitude in the ionosphere. The analysis of small-world-ness indicates that the ionospheric network possesses the small-world property, which can make the ionosphere stable and efficient in the propagation of dynamic processes.

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

Gilson, M.; Kouvaris, N. E.; Deco, G.; Zamora-López, G.

2018-05-01

Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.

Propagation, cascades, and agreement dynamics in complex communication and social networks

NASA Astrophysics Data System (ADS)

Lu, Qiming

Many modern and important technological, social, information and infrastructure systems can be viewed as complex systems with a large number of interacting components. Models of complex networks and dynamical interactions, as well as their applications are of fundamental interests in many aspects. Here, several stylized models of multiplex propagation and opinion dynamics are investigated on complex and empirical social networks. We first investigate cascade dynamics in threshold-controlled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network's response, while keeping energy consumption at a manageable level. We also investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case. When applying the model of Naming Game on empirical social networks, this stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus.

Intrinsic Neuronal Properties Switch the Mode of Information Transmission in Networks

PubMed Central

Gjorgjieva, Julijana; Mease, Rebecca A.; Moody, William J.; Fairhall, Adrienne L.

2014-01-01

Diverse ion channels and their dynamics endow single neurons with complex biophysical properties. These properties determine the heterogeneity of cell types that make up the brain, as constituents of neural circuits tuned to perform highly specific computations. How do biophysical properties of single neurons impact network function? We study a set of biophysical properties that emerge in cortical neurons during the first week of development, eventually allowing these neurons to adaptively scale the gain of their response to the amplitude of the fluctuations they encounter. During the same time period, these same neurons participate in large-scale waves of spontaneously generated electrical activity. We investigate the potential role of experimentally observed changes in intrinsic neuronal properties in determining the ability of cortical networks to propagate waves of activity. We show that such changes can strongly affect the ability of multi-layered feedforward networks to represent and transmit information on multiple timescales. With properties modeled on those observed at early stages of development, neurons are relatively insensitive to rapid fluctuations and tend to fire synchronously in response to wave-like events of large amplitude. Following developmental changes in voltage-dependent conductances, these same neurons become efficient encoders of fast input fluctuations over few layers, but lose the ability to transmit slower, population-wide input variations across many layers. Depending on the neurons' intrinsic properties, noise plays different roles in modulating neuronal input-output curves, which can dramatically impact network transmission. The developmental change in intrinsic properties supports a transformation of a networks function from the propagation of network-wide information to one in which computations are scaled to local activity. This work underscores the significance of simple changes in conductance parameters in governing how neurons represent and propagate information, and suggests a role for background synaptic noise in switching the mode of information transmission. PMID:25474701

Towards Optimal Connectivity on Multi-layered Networks.

PubMed

Chen, Chen; He, Jingrui; Bliss, Nadya; Tong, Hanghang

2017-10-01

Networks are prevalent in many high impact domains. Moreover, cross-domain interactions are frequently observed in many applications, which naturally form the dependencies between different networks. Such kind of highly coupled network systems are referred to as multi-layered networks , and have been used to characterize various complex systems, including critical infrastructure networks, cyber-physical systems, collaboration platforms, biological systems and many more. Different from single-layered networks where the functionality of their nodes is mainly affected by within-layer connections, multi-layered networks are more vulnerable to disturbance as the impact can be amplified through cross-layer dependencies, leading to the cascade failure to the entire system. To manipulate the connectivity in multi-layered networks, some recent methods have been proposed based on two-layered networks with specific types of connectivity measures. In this paper, we address the above challenges in multiple dimensions. First, we propose a family of connectivity measures (SUBLINE) that unifies a wide range of classic network connectivity measures. Third, we reveal that the connectivity measures in SUBLINE family enjoy diminishing returns property , which guarantees a near-optimal solution with linear complexity for the connectivity optimization problem. Finally, we evaluate our proposed algorithm on real data sets to demonstrate its effectiveness and efficiency.

Divisibility patterns of natural numbers on a complex network.

PubMed

Shekatkar, Snehal M; Bhagwat, Chandrasheel; Ambika, G

2015-09-16

Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of natural numbers in the context of divisibility. In the present paper, we study the divisibility of natural numbers using the framework of a growing complex network. In particular, using tools from the field of statistical inference, we show that the network is scale-free but has a non-stationary degree distribution. Along with this, we report a new kind of similarity pattern for the local clustering, which we call "stretching similarity", in this network. We also show that the various characteristics like average degree, global clustering coefficient and assortativity coefficient of the network vary smoothly with the size of the network. Using analytical arguments we estimate the asymptotic behavior of global clustering and average degree which is validated using numerical analysis.

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks

PubMed Central

Cannistraci, Carlo Vittorio; Alanis-Lobato, Gregorio; Ravasi, Timothy

2013-01-01

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial. PMID:23563395

Complex networks untangle competitive advantage in Australian football

NASA Astrophysics Data System (ADS)

Braham, Calum; Small, Michael

2018-05-01

We construct player-based complex network models of Australian football teams for the 2014 Australian Football League season; modelling the passes between players as weighted, directed edges. We show that analysis of these measures can give an insight into the underlying structure and strategy of Australian football teams, quantitatively distinguishing different playing styles. The relationships observed between network properties and match outcomes suggest that successful teams exhibit well-connected passing networks with the passes distributed between all 22 players as evenly as possible. Linear regression models of team scores and match margins show significant improvements in R2 and Bayesian information criterion when network measures are added to models that use conventional measures, demonstrating that network analysis measures contain useful, extra information. Several measures, particularly the mean betweenness centrality, are shown to be useful in predicting the outcomes of future matches, suggesting they measure some aspect of the intrinsic strength of teams. In addition, several local centrality measures are shown to be useful in analysing individual players' differing contributions to the team's structure.

Complex networks untangle competitive advantage in Australian football.

PubMed

Braham, Calum; Small, Michael

2018-05-01

We construct player-based complex network models of Australian football teams for the 2014 Australian Football League season; modelling the passes between players as weighted, directed edges. We show that analysis of these measures can give an insight into the underlying structure and strategy of Australian football teams, quantitatively distinguishing different playing styles. The relationships observed between network properties and match outcomes suggest that successful teams exhibit well-connected passing networks with the passes distributed between all 22 players as evenly as possible. Linear regression models of team scores and match margins show significant improvements in R 2 and Bayesian information criterion when network measures are added to models that use conventional measures, demonstrating that network analysis measures contain useful, extra information. Several measures, particularly the mean betweenness centrality, are shown to be useful in predicting the outcomes of future matches, suggesting they measure some aspect of the intrinsic strength of teams. In addition, several local centrality measures are shown to be useful in analysing individual players' differing contributions to the team's structure.

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks.

PubMed

Cannistraci, Carlo Vittorio; Alanis-Lobato, Gregorio; Ravasi, Timothy

2013-01-01

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial.

Estimating topological properties of weighted networks from limited information

NASA Astrophysics Data System (ADS)

Gabrielli, Andrea; Cimini, Giulio; Garlaschelli, Diego; Squartini, Angelo

A typical problem met when studying complex systems is the limited information available on their topology, which hinders our understanding of their structural and dynamical properties. A paramount example is provided by financial networks, whose data are privacy protected. Yet, the estimation of systemic risk strongly depends on the detailed structure of the interbank network. The resulting challenge is that of using aggregate information to statistically reconstruct a network and correctly predict its higher-order properties. Standard approaches either generate unrealistically dense networks, or fail to reproduce the observed topology by assigning homogeneous link weights. Here we develop a reconstruction method, based on statistical mechanics concepts, that exploits the empirical link density in a highly non-trivial way. Technically, our approach consists in the preliminary estimation of node degrees from empirical node strengths and link density, followed by a maximum-entropy inference based on a combination of empirical strengths and estimated degrees. Our method is successfully tested on the international trade network and the interbank money market, and represents a valuable tool for gaining insights on privacy-protected or partially accessible systems. Acknoweledgement to ``Growthcom'' ICT - EC project (Grant No: 611272) and ``Crisislab'' Italian Project.

The relations between network-operation and topological-property in a scale-free and small-world network with community structure

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2017-10-01

It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

Complex network approach to fractional time series

DOE Office of Scientific and Technical Information (OSTI.GOV)

Manshour, Pouya

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacencymore » matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.« less

Empirical modeling for intelligent, real-time manufacture control

NASA Technical Reports Server (NTRS)

Xu, Xiaoshu

1994-01-01

Artificial neural systems (ANS), also known as neural networks, are an attempt to develop computer systems that emulate the neural reasoning behavior of biological neural systems (e.g. the human brain). As such, they are loosely based on biological neural networks. The ANS consists of a series of nodes (neurons) and weighted connections (axons) that, when presented with a specific input pattern, can associate specific output patterns. It is essentially a highly complex, nonlinear, mathematical relationship or transform. These constructs have two significant properties that have proven useful to the authors in signal processing and process modeling: noise tolerance and complex pattern recognition. Specifically, the authors have developed a new network learning algorithm that has resulted in the successful application of ANS's to high speed signal processing and to developing models of highly complex processes. Two of the applications, the Weld Bead Geometry Control System and the Welding Penetration Monitoring System, are discussed in the body of this paper.

A coevolving model based on preferential triadic closure for social media networks

PubMed Central

Li, Menghui; Zou, Hailin; Guan, Shuguang; Gong, Xiaofeng; Li, Kun; Di, Zengru; Lai, Choy-Heng

2013-01-01

The dynamical origin of complex networks, i.e., the underlying principles governing network evolution, is a crucial issue in network study. In this paper, by carrying out analysis to the temporal data of Flickr and Epinions–two typical social media networks, we found that the dynamical pattern in neighborhood, especially the formation of triadic links, plays a dominant role in the evolution of networks. We thus proposed a coevolving dynamical model for such networks, in which the evolution is only driven by the local dynamics–the preferential triadic closure. Numerical experiments verified that the model can reproduce global properties which are qualitatively consistent with the empirical observations. PMID:23979061

MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure

PubMed Central

2010-01-01

Background The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of the cell. Over the past few years, several independent high-throughput experiments have helped to catalogue enormous amount of physical protein interaction data from organisms such as yeast. However, these individual datasets show lack of correlation with each other and also contain substantial number of false positives (noise). Over these years, several affinity scoring schemes have also been devised to improve the qualities of these datasets. Therefore, the challenge now is to detect meaningful as well as novel complexes from protein interaction (PPI) networks derived by combining datasets from multiple sources and by making use of these affinity scoring schemes. In the attempt towards tackling this challenge, the Markov Clustering algorithm (MCL) has proved to be a popular and reasonably successful method, mainly due to its scalability, robustness, and ability to work on scored (weighted) networks. However, MCL produces many noisy clusters, which either do not match known complexes or have additional proteins that reduce the accuracies of correctly predicted complexes. Results Inspired by recent experimental observations by Gavin and colleagues on the modularity structure in yeast complexes and the distinctive properties of "core" and "attachment" proteins, we develop a core-attachment based refinement method coupled to MCL for reconstruction of yeast complexes from scored (weighted) PPI networks. We combine physical interactions from two recent "pull-down" experiments to generate an unscored PPI network. We then score this network using available affinity scoring schemes to generate multiple scored PPI networks. The evaluation of our method (called MCL-CAw) on these networks shows that: (i) MCL-CAw derives larger number of yeast complexes and with better accuracies than MCL, particularly in the presence of natural noise; (ii) Affinity scoring can effectively reduce the impact of noise on MCL-CAw and thereby improve the quality (precision and recall) of its predicted complexes; (iii) MCL-CAw responds well to most available scoring schemes. We discuss several instances where MCL-CAw was successful in deriving meaningful complexes, and where it missed a few proteins or whole complexes due to affinity scoring of the networks. We compare MCL-CAw with several recent complex detection algorithms on unscored and scored networks, and assess the relative performance of the algorithms on these networks. Further, we study the impact of augmenting physical datasets with computationally inferred interactions for complex detection. Finally, we analyse the essentiality of proteins within predicted complexes to understand a possible correlation between protein essentiality and their ability to form complexes. Conclusions We demonstrate that core-attachment based refinement in MCL-CAw improves the predictions of MCL on yeast PPI networks. We show that affinity scoring improves the performance of MCL-CAw. PMID:20939868

Ground-State Electronic Structure of RC-LH1 and LH2 Pigment Assemblies of Purple Bacteria via the EBF-MO Method.

PubMed

Shrestha, Kushal; Jakubikova, Elena

2015-08-20

Light-harvesting antennas are protein-pigment complexes that play a crucial role in natural photosynthesis. The antenna complexes absorb light and transfer energy to photosynthetic reaction centers where charge separation occurs. This work focuses on computational studies of the electronic structure of the pigment networks of light-harvesting complex I (LH1), LH1 with the reaction center (RC-LH1), and light-harvesting complex II (LH2) found in purple bacteria. As the pigment networks of LH1, RC-LH1, and LH2 contain thousands of atoms, conventional density functional theory (DFT) and ab initio calculations of these systems are not computationally feasible. Therefore, we utilize DFT in conjunction with the energy-based fragmentation with molecular orbitals method and a semiempirical approach employing the extended Hückel model Hamiltonian to determine the electronic properties of these pigment assemblies. Our calculations provide a deeper understanding of the electronic structure of natural light-harvesting complexes, especially their pigment networks, which could assist in rational design of artificial photosynthetic devices.

Network-based model of the growth of termite nests

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Perna, Andrea; Fortunato, Santo; Darrouzet, Eric; Theraulaz, Guy; Jost, Christian

2015-12-01

We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, size of the largest connected component, average path lengths, backbone link ratios, and local graph redundancy). The two pruning alternatives can be associated with different genuses in the subfamily. A sensitivity analysis on the pruning and memory parameters indicates that Termitinae networks favor fast internal transportation over efficient defense strategies against ant predators. Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.

Network analysis of mesoscale optical recordings to assess regional, functional connectivity.

PubMed

Lim, Diana H; LeDue, Jeffrey M; Murphy, Timothy H

2015-10-01

With modern optical imaging methods, it is possible to map structural and functional connectivity. Optical imaging studies that aim to describe large-scale neural connectivity often need to handle large and complex datasets. In order to interpret these datasets, new methods for analyzing structural and functional connectivity are being developed. Recently, network analysis, based on graph theory, has been used to describe and quantify brain connectivity in both experimental and clinical studies. We outline how to apply regional, functional network analysis to mesoscale optical imaging using voltage-sensitive-dye imaging and channelrhodopsin-2 stimulation in a mouse model. We include links to sample datasets and an analysis script. The analyses we employ can be applied to other types of fluorescence wide-field imaging, including genetically encoded calcium indicators, to assess network properties. We discuss the benefits and limitations of using network analysis for interpreting optical imaging data and define network properties that may be used to compare across preparations or other manipulations such as animal models of disease.

Functional network organization of the human brain

PubMed Central

Power, Jonathan D; Cohen, Alexander L; Nelson, Steven M; Wig, Gagan S; Barnes, Kelly Anne; Church, Jessica A; Vogel, Alecia C; Laumann, Timothy O; Miezin, Fran M; Schlaggar, Bradley L; Petersen, Steven E

2011-01-01

Summary Real-world complex systems may be mathematically modeled as graphs, revealing properties of the system. Here we study graphs of functional brain organization in healthy adults using resting state functional connectivity MRI. We propose two novel brain-wide graphs, one of 264 putative functional areas, the other a modification of voxelwise networks that eliminates potentially artificial short-distance relationships. These graphs contain many subgraphs in good agreement with known functional brain systems. Other subgraphs lack established functional identities; we suggest possible functional characteristics for these subgraphs. Further, graph measures of the areal network indicate that the default mode subgraph shares network properties with sensory and motor subgraphs: it is internally integrated but isolated from other subgraphs, much like a “processing” system. The modified voxelwise graph also reveals spatial motifs in the patterning of systems across the cortex. PMID:22099467

A method to integrate patterned electrospun fibers with microfluidic systems to generate complex microenvironments for cell culture applications

PubMed Central

Wallin, Patric; Zandén, Carl; Carlberg, Björn; Hellström Erkenstam, Nina; Liu, Johan; Gold, Julie

2012-01-01

The properties of a cell’s microenvironment are one of the main driving forces in cellular fate processes and phenotype expression invivo. The ability to create controlled cell microenvironments invitro becomes increasingly important for studying or controlling phenotype expression in tissue engineering and drug discovery applications. This includes the capability to modify material surface properties within well-defined liquid environments in cell culture systems. One successful approach to mimic extra cellular matrix is with porous electrospun polymer fiber scaffolds, while microfluidic networks have been shown to efficiently generate spatially and temporally defined liquid microenvironments. Here, a method to integrate electrospun fibers with microfluidic networks was developed in order to form complex cell microenvironments with the capability to vary relevant parameters. Spatially defined regions of electrospun fibers of both aligned and random orientation were patterned on glass substrates that were irreversibly bonded to microfluidic networks produced in poly-dimethyl-siloxane. Concentration gradients obtained in the fiber containing channels were characterized experimentally and compared with values obtained by computational fluid dynamic simulations. Velocity and shear stress profiles, as well as vortex formation, were calculated to evaluate the influence of fiber pads on fluidic properties. The suitability of the system to support cell attachment and growth was demonstrated with a fibroblast cell line. The potential of the platform was further verified by a functional investigation of neural stem cell alignment in response to orientation of electrospun fibers versus a microfluidic generated chemoattractant gradient of stromal cell-derived factor 1 alpha. The described method is a competitive strategy to create complex microenvironments invitro that allow detailed studies on the interplay of topography, substrate surface properties, and soluble microenvironment on cellular fate processes. PMID:23781291

Synchronization properties of heterogeneous neuronal networks with mixed excitability type

NASA Astrophysics Data System (ADS)

Leone, Michael J.; Schurter, Brandon N.; Letson, Benjamin; Booth, Victoria; Zochowski, Michal; Fink, Christian G.

2015-03-01

We study the synchronization of neuronal networks with dynamical heterogeneity, showing that network structures with the same propensity for synchronization (as quantified by master stability function analysis) may develop dramatically different synchronization properties when heterogeneity is introduced with respect to neuronal excitability type. Specifically, we investigate networks composed of neurons with different types of phase response curves (PRCs), which characterize how oscillating neurons respond to excitatory perturbations. Neurons exhibiting type 1 PRC respond exclusively with phase advances, while neurons exhibiting type 2 PRC respond with either phase delays or phase advances, depending on when the perturbation occurs. We find that Watts-Strogatz small world networks transition to synchronization gradually as the proportion of type 2 neurons increases, whereas scale-free networks may transition gradually or rapidly, depending upon local correlations between node degree and excitability type. Random placement of type 2 neurons results in gradual transition to synchronization, whereas placement of type 2 neurons as hubs leads to a much more rapid transition, showing that type 2 hub cells easily "hijack" neuronal networks to synchronization. These results underscore the fact that the degree of synchronization observed in neuronal networks is determined by a complex interplay between network structure and the dynamical properties of individual neurons, indicating that efforts to recover structural connectivity from dynamical correlations must in general take both factors into account.

2-(hydroxymethyl)-1H-benzo[d]imidazole-5-carboxylic acid as linker for Co(II)/Ni(II)/Cu(II) coordination polymers: Synthesis, structures and properties

NASA Astrophysics Data System (ADS)

Wang, Duo-Zhi; Wang, Xin-Fang; Du, Jia-Qiang; Dong, Jun-Liang; Xie, Fei

2018-02-01

We report the synthesis and characterization of five transition metal coordination polymers (CPs) based on M(II) (M: Co, Ni and Cu), 2-(hydroxymethyl)-1H-benzo[d]imidazole-5-carboxylic acid (H2L) ligand. They are formulated as {[Co2(HL)2(H2O)3(SO4)]·H2O}n (1), {[Co2(HL)2(H2O)2]·SiF6}n (2), {[Ni2(HL)2(H2O)3(SO4)]·2H2O}n (3), {[Ni2(HL)2(H2O)4]·H2O·SiF6}n (4), {[Cu2(HL)2(H2O)2]·SiF6}n (5). The complexes 1-5 structure were characterized by single-crystal X-ray diffraction, elemental analyses, infrared spectroscopy (IR), powder X-ray diffraction (PXRD), and thermogravimetric analyses (TGA). Complexes 1-5 are two-dimensional (2D) network type coordination polymers that 1-3, 5 crystallize in monoclinic system within the centrosymmetric space group P2(1)/c, and 4 in triclinic system P-1 space group, they show the same coordination modes (κ1-κ1)-(κ1)-(κ1)-μ3 in coordination polymers. Complexes 1 and 3 expand to three-dimensional framework by means of hydrogen bond interactions, and can be rationalized to be three-connected {63} topological network, while 2, 4, 5 exhibit the topological network with a four-connected {44·62} topological sql network. The luminescent properties (for complexes 1, 2) and UV diffuse reflectance (for complexes 1-5) in the solid state at room temperature were also investigated and discussed. Complexes 1-5 act as effective heterogeneous catalysts, under mild conditions, for the homocoupling reaction of 4-substituted aryl iodides bearing electron-donating groups (-CH3, -OCH3).

Modelling DC responses of 3D complex fracture networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beskardes, Gungor Didem; Weiss, Chester Joseph

Here, the determination of the geometrical properties of fractures plays a critical role in many engineering problems to assess the current hydrological and mechanical states of geological media and to predict their future states. However, numerical modeling of geoelectrical responses in realistic fractured media has been challenging due to the explosive computational cost imposed by the explicit discretizations of fractures at multiple length scales, which often brings about a tradeoff between computational efficiency and geologic realism. Here, we use the hierarchical finite element method to model electrostatic response of realistically complex 3D conductive fracture networks with minimal computational cost.

Modelling DC responses of 3D complex fracture networks

DOE PAGES

Beskardes, Gungor Didem; Weiss, Chester Joseph

2018-03-01

Here, the determination of the geometrical properties of fractures plays a critical role in many engineering problems to assess the current hydrological and mechanical states of geological media and to predict their future states. However, numerical modeling of geoelectrical responses in realistic fractured media has been challenging due to the explosive computational cost imposed by the explicit discretizations of fractures at multiple length scales, which often brings about a tradeoff between computational efficiency and geologic realism. Here, we use the hierarchical finite element method to model electrostatic response of realistically complex 3D conductive fracture networks with minimal computational cost.

Comprehensive risk assessment method of catastrophic accident based on complex network properties

NASA Astrophysics Data System (ADS)

Cui, Zhen; Pang, Jun; Shen, Xiaohong

2017-09-01

On the macro level, the structural properties of the network and the electrical characteristics of the micro components determine the risk of cascading failures. And the cascading failures, as a process with dynamic development, not only the direct risk but also potential risk should be considered. In this paper, comprehensively considered the direct risk and potential risk of failures based on uncertain risk analysis theory and connection number theory, quantified uncertain correlation by the node degree and node clustering coefficient, then established a comprehensive risk indicator of failure. The proposed method has been proved by simulation on the actual power grid. Modeling a network according to the actual power grid, and verified the rationality of the proposed method.

The P/N (Positive-to-Negative Links) Ratio in Complex Networks-A Promising In Silico Biomarker for Detecting Changes Occurring in the Human Microbiome.

PubMed

Ma, Zhanshan Sam

2018-05-01

Relatively little progress in the methodology for differentiating between the healthy and diseased microbiomes, beyond comparing microbial community diversities with traditional species richness or Shannon index, has been made. Network analysis has increasingly been called for the task, but most currently available microbiome datasets only allows for the construction of simple species correlation networks (SCNs). The main results from SCN analysis are a series of network properties such as network degree and modularity, but the metrics for these network properties often produce inconsistent evidence. We propose a simple new network property, the P/N ratio, defined as the ratio of positive links to the number of negative links in the microbial SCN. We postulate that the P/N ratio should reflect the balance between facilitative and inhibitive interactions among microbial species, possibly one of the most important changes occurring in diseased microbiome. We tested our hypothesis with five datasets representing five major human microbiome sites and discovered that the P/N ratio exhibits contrasting differences between healthy and diseased microbiomes and may be harnessed as an in silico biomarker for detecting disease-associated changes in the human microbiome, and may play an important role in personalized diagnosis of the human microbiome-associated diseases.

Hydraulic tomography of discrete networks of conduits and fractures in a karstic aquifer by using a deterministic inversion algorithm

NASA Astrophysics Data System (ADS)

Fischer, P.; Jardani, A.; Lecoq, N.

2018-02-01

In this paper, we present a novel inverse modeling method called Discrete Network Deterministic Inversion (DNDI) for mapping the geometry and property of the discrete network of conduits and fractures in the karstified aquifers. The DNDI algorithm is based on a coupled discrete-continuum concept to simulate numerically water flows in a model and a deterministic optimization algorithm to invert a set of observed piezometric data recorded during multiple pumping tests. In this method, the model is partioned in subspaces piloted by a set of parameters (matrix transmissivity, and geometry and equivalent transmissivity of the conduits) that are considered as unknown. In this way, the deterministic optimization process can iteratively correct the geometry of the network and the values of the properties, until it converges to a global network geometry in a solution model able to reproduce the set of data. An uncertainty analysis of this result can be performed from the maps of posterior uncertainties on the network geometry or on the property values. This method has been successfully tested for three different theoretical and simplified study cases with hydraulic responses data generated from hypothetical karstic models with an increasing complexity of the network geometry, and of the matrix heterogeneity.

Drug release control and system understanding of sucrose esters matrix tablets by artificial neural networks.

PubMed

Chansanroj, Krisanin; Petrović, Jelena; Ibrić, Svetlana; Betz, Gabriele

2011-10-09

Artificial neural networks (ANNs) were applied for system understanding and prediction of drug release properties from direct compacted matrix tablets using sucrose esters (SEs) as matrix-forming agents for controlled release of a highly water soluble drug, metoprolol tartrate. Complexity of the system was presented through the effects of SE concentration and tablet porosity at various hydrophilic-lipophilic balance (HLB) values of SEs ranging from 0 to 16. Both effects contributed to release behaviors especially in the system containing hydrophilic SEs where swelling phenomena occurred. A self-organizing map neural network (SOM) was applied for visualizing interrelation among the variables and multilayer perceptron neural networks (MLPs) were employed to generalize the system and predict the drug release properties based on HLB value and concentration of SEs and tablet properties, i.e., tablet porosity, volume and tensile strength. Accurate prediction was obtained after systematically optimizing network performance based on learning algorithm of MLP. Drug release was mainly attributed to the effects of SEs, tablet volume and tensile strength in multi-dimensional interrelation whereas tablet porosity gave a small impact. Ability of system generalization and accurate prediction of the drug release properties proves the validity of SOM and MLPs for the formulation modeling of direct compacted matrix tablets containing controlled release agents of different material properties. Copyright © 2011 Elsevier B.V. All rights reserved.

Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs

NASA Astrophysics Data System (ADS)

Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J. B.

2010-10-01

The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.

Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs.

PubMed

Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J B

2010-10-01

The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.

A unifying view of synchronization for data assimilation in complex nonlinear networks

NASA Astrophysics Data System (ADS)

Abarbanel, Henry D. I.; Shirman, Sasha; Breen, Daniel; Kadakia, Nirag; Rey, Daniel; Armstrong, Eve; Margoliash, Daniel

2017-12-01

Networks of nonlinear systems contain unknown parameters and dynamical degrees of freedom that may not be observable with existing instruments. From observable state variables, we want to estimate the connectivity of a model of such a network and determine the full state of the model at the termination of a temporal observation window during which measurements transfer information to a model of the network. The model state at the termination of a measurement window acts as an initial condition for predicting the future behavior of the network. This allows the validation (or invalidation) of the model as a representation of the dynamical processes producing the observations. Once the model has been tested against new data, it may be utilized as a predictor of responses to innovative stimuli or forcing. We describe a general framework for the tasks involved in the "inverse" problem of determining properties of a model built to represent measured output from physical, biological, or other processes when the measurements are noisy, the model has errors, and the state of the model is unknown when measurements begin. This framework is called statistical data assimilation and is the best one can do in estimating model properties through the use of the conditional probability distributions of the model state variables, conditioned on observations. There is a very broad arena of applications of the methods described. These include numerical weather prediction, properties of nonlinear electrical circuitry, and determining the biophysical properties of functional networks of neurons. Illustrative examples will be given of (1) estimating the connectivity among neurons with known dynamics in a network of unknown connectivity, and (2) estimating the biophysical properties of individual neurons in vitro taken from a functional network underlying vocalization in songbirds.

What does the structure of its visibility graph tell us about the nature of the time series?

NASA Astrophysics Data System (ADS)

Franke, Jasper G.; Donner, Reik V.

2017-04-01

Visibility graphs are a recently introduced method to construct complex network representations based upon univariate time series in order to study their dynamical characteristics [1]. In the last years, this approach has been successfully applied to studying a considerable variety of geoscientific research questions and data sets, including non-trivial temporal patterns in complex earthquake catalogs [2] or time-reversibility in climate time series [3]. It has been shown that several characteristic features of the thus constructed networks differ between stochastic and deterministic (possibly chaotic) processes, which is, however, relatively hard to exploit in the case of real-world applications. In this study, we propose studying two new measures related with the network complexity of visibility graphs constructed from time series, one being a special type of network entropy [4] and the other a recently introduced measure of the heterogeneity of the network's degree distribution [5]. For paradigmatic model systems exhibiting bifurcation sequences between regular and chaotic dynamics, both properties clearly trace the transitions between both types of regimes and exhibit marked quantitative differences for regular and chaotic dynamics. Moreover, for dynamical systems with a small amount of additive noise, the considered properties demonstrate gradual changes prior to the bifurcation point. This finding appears closely related to the subsequent loss of stability of the current state known to lead to a critical slowing down as the transition point is approaches. In this spirit, both considered visibility graph characteristics provide alternative tracers of dynamical early warning signals consistent with classical indicators. Our results demonstrate that measures of visibility graph complexity (i) provide a potentially useful means to tracing changes in the dynamical patterns encoded in a univariate time series that originate from increasing autocorrelation and (ii) allow to systematically distinguish regular from deterministic-chaotic dynamics. We demonstrate the application of our method for different model systems as well as selected paleoclimate time series from the North Atlantic region. Notably, visibility graph based methods are particularly suited for studying the latter type of geoscientific data, since they do not impose intrinsic restrictions or assumptions on the nature of the time series under investigation in terms of noise process, linearity and sampling homogeneity. [1] Lacasa, Lucas, et al. "From time series to complex networks: The visibility graph." Proceedings of the National Academy of Sciences 105.13 (2008): 4972-4975. [2] Telesca, Luciano, and Michele Lovallo. "Analysis of seismic sequences by using the method of visibility graph." EPL (Europhysics Letters) 97.5 (2012): 50002. [3] Donges, Jonathan F., Reik V. Donner, and Jürgen Kurths. "Testing time series irreversibility using complex network methods." EPL (Europhysics Letters) 102.1 (2013): 10004. [4] Small, Michael. "Complex networks from time series: capturing dynamics." 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013), Beijing (2013): 2509-2512. [5] Jacob, Rinku, K.P. Harikrishnan, Ranjeev Misra, and G. Ambika. "Measure for degree heterogeneity in complex networks and its application to recurrence network analysis." arXiv preprint 1605.06607 (2016).

Spatial Anisotropies and Temporal Fluctuations in Extracellular Matrix Network Texture during Early Embryogenesis

PubMed Central

Loganathan, Rajprasad; Potetz, Brian R.; Rongish, Brenda J.; Little, Charles D.

2012-01-01

Early stages of vertebrate embryogenesis are characterized by a remarkable series of shape changes. The resulting morphological complexity is driven by molecular, cellular, and tissue-scale biophysical alterations. Operating at the cellular level, extracellular matrix (ECM) networks facilitate cell motility. At the tissue level, ECM networks provide material properties required to accommodate the large-scale deformations and forces that shape amniote embryos. In other words, the primordial biomaterial from which reptilian, avian, and mammalian embryos are molded is a dynamic composite comprised of cells and ECM. Despite its central importance during early morphogenesis we know little about the intrinsic micrometer-scale surface properties of primordial ECM networks. Here we computed, using avian embryos, five textural properties of fluorescently tagged ECM networks — (a) inertia, (b) correlation, (c) uniformity, (d) homogeneity, and (e) entropy. We analyzed fibronectin and fibrillin-2 as examples of fibrous ECM constituents. Our quantitative data demonstrated differences in the surface texture between the fibronectin and fibrillin-2 network in Day 1 (gastrulating) embryos, with the fibronectin network being relatively coarse compared to the fibrillin-2 network. Stage-specific regional anisotropy in fibronectin texture was also discovered. Relatively smooth fibronectin texture was exhibited in medial regions adjoining the primitive streak (PS) compared with the fibronectin network investing the lateral plate mesoderm (LPM), at embryonic stage 5. However, the texture differences had changed by embryonic stage 6, with the LPM fibronectin network exhibiting a relatively smooth texture compared with the medial PS-oriented network. Our data identify, and partially characterize, stage-specific regional anisotropy of fibronectin texture within tissues of a warm-blooded embryo. The data suggest that changes in ECM textural properties reflect orderly time-dependent rearrangements of a primordial biomaterial. We conclude that the ECM microenvironment changes markedly in time and space during the most important period of amniote morphogenesis—as determined by fluctuating textural properties. PMID:22693609

A three-layer distributed RC network with two transmission zeros

NASA Technical Reports Server (NTRS)

Huelsman, L. P.

1974-01-01

This report describes the properties of a three-layer distributed RC network consisting of two resistive layers separated by a dielectric which may be used to realize two zeros of transmission on the j-omega axis of the complex frequency plane. The relative location of the two zeros is controlled by the location of a contact placed on one of the resistive layers.

MicroRNA-mediated regulatory circuits: outlook and perspectives

NASA Astrophysics Data System (ADS)

Cora', Davide; Re, Angela; Caselle, Michele; Bussolino, Federico

2017-08-01

MicroRNAs have been found to be necessary for regulating genes implicated in almost all signaling pathways, and consequently their dysfunction influences many diseases, including cancer. Understanding of the complexity of the microRNA-mediated regulatory network has grown in terms of size, connectivity and dynamics with the development of computational and, more recently, experimental high-throughput approaches for microRNA target identification. Newly developed studies on recurrent microRNA-mediated circuits in regulatory networks, also known as network motifs, have substantially contributed to addressing this complexity, and therefore to helping understand the ways by which microRNAs achieve their regulatory role. This review provides a summarizing view of the state-of-the-art, and perspectives of research efforts on microRNA-mediated regulatory motifs. In this review, we discuss the topological properties characterizing different types of circuits, and the regulatory features theoretically enabled by such properties, with a special emphasis on examples of circuits typifying their biological significance in experimentally validated contexts. Finally, we will consider possible future developments, in particular regarding microRNA-mediated circuits involving long non-coding RNAs and epigenetic regulators.

Complex network analysis of brain functional connectivity under a multi-step cognitive task

NASA Astrophysics Data System (ADS)

Cai, Shi-Min; Chen, Wei; Liu, Dong-Bai; Tang, Ming; Chen, Xun

2017-01-01

Functional brain network has been widely studied to understand the relationship between brain organization and behavior. In this paper, we aim to explore the functional connectivity of brain network under a multi-step cognitive task involving consecutive behaviors, and further understand the effect of behaviors on the brain organization. The functional brain networks are constructed based on a high spatial and temporal resolution fMRI dataset and analyzed via complex network based approach. We find that at voxel level the functional brain network shows robust small-worldness and scale-free characteristics, while its assortativity and rich-club organization are slightly restricted to the order of behaviors performed. More interestingly, the functional connectivity of brain network in activated ROIs strongly correlates with behaviors and is obviously restricted to the order of behaviors performed. These empirical results suggest that the brain organization has the generic properties of small-worldness and scale-free characteristics, and its diverse functional connectivity emerging from activated ROIs is strongly driven by these behavioral activities via the plasticity of brain.

Resolving Structural Variability in Network Models and the Brain

PubMed Central

Klimm, Florian; Bassett, Danielle S.; Carlson, Jean M.; Mucha, Peter J.

2014-01-01

Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling—in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity) do not in general simultaneously display a second (e.g., hierarchy). This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful starting point for the statistical inference of brain network structure from neuroimaging data. PMID:24675546

Networks in cognitive science.

PubMed

Baronchelli, Andrea; Ferrer-i-Cancho, Ramon; Pastor-Satorras, Romualdo; Chater, Nick; Christiansen, Morten H

2013-07-01

Networks of interconnected nodes have long played a key role in Cognitive Science, from artificial neural networks to spreading activation models of semantic memory. Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions, and collaborations among scientists. Today, the inclusion of network theory into Cognitive Sciences, and the expansion of complex-systems science, promises to significantly change the way in which the organization and dynamics of cognitive and behavioral processes are understood. In this paper, we review recent contributions of network theory at different levels and domains within the Cognitive Sciences. Copyright © 2013 Elsevier Ltd. All rights reserved.

Syntheses, crystal structures, and properties of four complexes based on polycarboxylate and imidazole ligands

DOE Office of Scientific and Technical Information (OSTI.GOV)

Qiao, Rui; Chen, Shui-Sheng, E-mail: chenss@fync.edu.cn; Coordination Chemistry Institute, State Key Laboratory of Coordination Chemistry, Nanjing University, Nanjing 210093

2015-08-15

Four metal–organic coordination polymers [Zn(HL)(H{sub 2}O)]·4H{sub 2}O (1), [Zn(HL)(L{sub 1})]·4H{sub 2}O (2), [Cu(HL)(H{sub 2}O)]·3H{sub 2}O (3) and [Cu(HL)(L{sub 1})]·5H{sub 2}O (4) were synthesized by reactions of the corresponding metal(II) salts with semirigid polycarboxylate ligand (5-((4-carboxypiperidin-1-yl)methyl)isophthalic acid hydrochloride, H{sub 3}L·HCl) or auxiliary ligand (1,4-di(1H-imidazol-4-yl)benzene, L{sub 1}). The structures of the compounds were characterized by elemental analysis, FT-IR spectroscopy and single-crystal X-ray diffraction. The use of auxiliary ligand L{sub 1} has great influence on the structures of two pairs of complexes 1, 2 and 3, 4. Complex 1 is a uninodal 3-connected rare 2-fold interpenetrating ZnSc net with a Point (Schlafli) symbolmore » of (10{sup 3}) while 2 is a one-dimensional (1D) ladder structure. Compound 3 features a two-dimensional (2D) honeycomb network with typical 6{sup 3}-hcb topology, while 4 is 2D network with (4, 4) sql topology based on binuclear Cu{sup II} subunits. The non-covalent bonding interactions such as hydrogen bonds, π···π stacking and C–H···π exist in complexes 1–4, which contributes to stabilize crystal structure and extend the low-dimensional entities into high-dimensional frameworks. And the photoluminescent property of 1 and 2 and gas sorption property of 4 have been investigated. - Graphical abstract: Four new coordination polymers have been obtained and their photoluminescent and gas sorption properties have also been investigated. - Highlights: • Two pairs of Zn{sup II}/ Cu{sup II} compounds have been synthesized. • Auxiliary ligand-controlled assembly of the complexes is reported. • The luminescent properties of complexes 1–2 were investigated. • The gas sorption property of 4 has been investigated.« less

Mechanical properties and fibrin characteristics of endovascular coil–clot complexes: relevance to endovascular cerebral aneurysm repair paradigms

PubMed Central

Haworth, Kevin J; Weidner, Christopher R; Abruzzo, Todd A; Shearn, Jason T; Holland, Christy K

2015-01-01

Background Although coil embolization is known to prevent rebleeding from acutely ruptured cerebral aneurysms, the underlying biological and mechanical mechanisms have not been characterized. We sought to determine if microcoil-dependent interactions with thrombus induce structural and mechanical changes in the adjacent fibrin network. Such changes could play an important role in the prevention of aneurysm rebleeding. Methods The stiffness of in vitro human blood clots and coil–clot complexes implanted into aneurysm phantoms were measured immediately after formation and after retraction for 3 days using unconfined uniaxial compression assays. Scanning electron microscopy of the coil–clot complexes showed the effect of coiling on clot structure. Results The coil packing densities achieved were in the range of clinical practice. Bare platinum coils increased clot stiffness relative to clot alone (Young’s modulus 6.9 kPa and 0.83 kPa, respectively) but did not affect fibrin structure. Hydrogel-coated coils prevented formation of a clot and had no significant effect on clot stiffness (Young’s modulus 2 kPa) relative to clot alone. Clot age decreased fiber density by 0.2 fibers/µm2 but not the stiffness of the bare platinum coil–clot complex. Conclusions The stiffness of coil–clot complexes is related to the summative stiffness of the fibrin network and associated microcoils. Hydrogel-coated coils exhibit significantly less stiffness due to the mechanical properties of the hydrogel and the inhibition of fibrin network formation by the hydrogel. These findings have important implications for the design and engineering of aneurysm occlusion devices. PMID:24668257

Rich-Cores in Networks

PubMed Central

Ma, Athen; Mondragón, Raúl J.

2015-01-01

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively. PMID:25799585

Rich-cores in networks.

PubMed

Ma, Athen; Mondragón, Raúl J

2015-01-01

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively.

Resting state brain networks in the prairie vole.

PubMed

Ortiz, Juan J; Portillo, Wendy; Paredes, Raul G; Young, Larry J; Alcauter, Sarael

2018-01-19

Resting state functional magnetic resonance imaging (rsfMRI) has shown the hierarchical organization of the human brain into large-scale complex networks, referred as resting state networks. This technique has turned into a promising translational research tool after the finding of similar resting state networks in non-human primates, rodents and other animal models of great value for neuroscience. Here, we demonstrate and characterize the presence of resting states networks in Microtus ochrogaster, the prairie vole, an extraordinary animal model to study complex human-like social behavior, with potential implications for the research of normal social development, addiction and neuropsychiatric disorders. Independent component analysis of rsfMRI data from isoflurane-anestethized prairie voles resulted in cortical and subcortical networks, including primary motor and sensory networks, but also included putative salience and default mode networks. We further discuss how future research could help to close the gap between the properties of the large scale functional organization and the underlying neurobiology of several aspects of social cognition. These results contribute to the evidence of preserved resting state brain networks across species and provide the foundations to explore the use of rsfMRI in the prairie vole for basic and translational research.

Followers Are Not Enough: A Multifaceted Approach to Community Detection in Online Social Networks

PubMed Central

2015-01-01

In online social media networks, individuals often have hundreds or even thousands of connections, which link these users not only to friends, associates, and colleagues, but also to news outlets, celebrities, and organizations. In these complex social networks, a ‘community’ as studied in the social network literature, can have very different meaning depending on the property of the network under study. Taking into account the multifaceted nature of these networks, we claim that community detection in online social networks should also be multifaceted in order to capture all of the different and valuable viewpoints of ‘community.’ In this paper we focus on three types of communities beyond follower-based structural communities: activity-based, topic-based, and interaction-based. We analyze a Twitter dataset using three different weightings of the structural network meant to highlight these three community types, and then infer the communities associated with these weightings. We show that interesting insights can be obtained about the complex community structure present in social networks by studying when and how these four community types give rise to similar as well as completely distinct community structure. PMID:26267868

Complex rheological properties of a water-soluble extract from the fronds of the black tree fern, Cyathea medullaris.

PubMed

Goh, Kelvin K T; Matia-Merino, Lara; Hall, Christopher E; Moughan, Paul J; Singh, Harjinder

2007-11-01

A water-soluble extract was obtained from the fronds of a New Zealand native black tree fern (Cyathea medullaris or Mamaku in Māori). The extract exhibited complex rheological behavior. Newtonian, shear-thinning, shear-thickening, thixotropic, antithixotropic, and viscoelastic behaviors were observed depending on polymer concentration, shear rate, and shear history. The extract also displayed rod-climbing and self-siphoning properties typical of viscoelastic fluids. Such complex rheological properties have been reported in synthetic or chemically modified polymers but are less frequent in unmodified biopolymers. Although Mamaku extract obtained from the pith of the fern has been traditionally used by the Māori in New Zealand for treating wounds and diarrhea among other ailments, this material has never been characterized before. This study reports on the chemical composition of the extract and on its viscoelastic properties through rotational and oscillatory rheological measurements. Explanations of the mechanism behind the rheological properties were based on transient network models for associating polymers.

Can multilayer brain networks be a real step forward?. Comment on "Network science of biological systems at different scales: A review" by M. Gosak et al.

NASA Astrophysics Data System (ADS)

Buldú, Javier M.; Papo, David

2018-03-01

Over the last two decades Network Science has become one of the most active fields in science, whose growth has been supported by four fundamental pillars: statistical physics, nonlinear dynamics, graph theory and Big Data [1]. Initially concerned with analyzing the structure of networks, Network Science rapidly turned its attention, focused on the implications of network topology, on the dynamics of and processes unfolding on networked systems, greatly improving our understanding of diffusion, synchronization, epidemics and information transmission in complex systems [2]. The network approach typically considered complex systems as evolving in a vacuum; however real networks are generally not isolated systems, but are in continuous and evolving contact with other networks, with which they interact in multiple qualitative different and typically time-varying ways. These systems can then be represented as a collection of subsystems with connectivity layers, which are simply collapsed when considering the traditional monolayer representation. Surprisingly, such an "unpacking" of layers has proven to bear profound consequences on the structural and dynamical properties of networks, leading for instance to counter-intuitive synchronization phenomena, where maximization synchronization is achieved through strategies opposite of those maximizing synchronization in isolated networks [3].

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Yanhong; Gao, Ping; Bi, Kaifeng

Conducting pathway of percolation network was identified in resistive switching devices (RSDs) with the structure of silver/amorphous silicon/p-type silicon (Ag/a-Si/p-Si) based on its gradual RESET-process and the stochastic complex impedance spectroscopy characteristics (CIS). The formation of the percolation network is attributed to amounts of nanocrystalline Si particles as well as defect sites embedded in a-Si layer, in which the defect sites supply positions for Ag ions to nucleate and grow. The similar percolation network has been only observed in Ag-Ge-Se based RSD before. This report provides a better understanding for electric properties of RSD based on the percolation network.

Modeling of the U1 snRNP assembly pathway in alternative splicing in human cells using Petri nets.

PubMed

Kielbassa, J; Bortfeldt, R; Schuster, S; Koch, I

2009-02-01

The investigation of spliceosomal processes is currently a topic of intense research in molecular biology. In the molecular mechanism of alternative splicing, a multi-protein-RNA complex - the spliceosome - plays a crucial role. To understand the biological processes of alternative splicing, it is essential to comprehend the biogenesis of the spliceosome. In this paper, we propose the first abstract model of the regulatory assembly pathway of the human spliceosomal subunit U1. Using Petri nets, we describe its highly ordered assembly that takes place in a stepwise manner. Petri net theory represents a mathematical formalism to model and analyze systems with concurrent processes at different abstraction levels with the possibility to combine them into a uniform description language. There exist many approaches to determine static and dynamic properties of Petri nets, which can be applied to analyze biochemical systems. In addition, Petri net tools usually provide intuitively understandable graphical network representations, which facilitate the dialog between experimentalists and theoreticians. Our Petri net model covers binding, transport, signaling, and covalent modification processes. Through the computation of structural and behavioral Petri net properties and their interpretation in biological terms, we validate our model and use it to get a better understanding of the complex processes of the assembly pathway. We can explain the basic network behavior, using minimal T-invariants which represent special pathways through the network. We find linear as well as cyclic pathways. We determine the P-invariants that represent conserved moieties in a network. The simulation of the net demonstrates the importance of the stability of complexes during the maturation pathway. We can show that complexes that dissociate too fast, hinder the formation of the complete U1 snRNP.

Analysis of context dependence in social interaction networks of a massively multiplayer online role-playing game.

PubMed

Son, Seokshin; Kang, Ah Reum; Kim, Hyun-chul; Kwon, Taekyoung; Park, Juyong; Kim, Huy Kang

2012-01-01

Rapid advances in modern computing and information technology have enabled millions of people to interact online via various social network and gaming services. The widespread adoption of such online services have made possible analysis of large-scale archival data containing detailed human interactions, presenting a very promising opportunity to understand the rich and complex human behavior. In collaboration with a leading global provider of Massively Multiplayer Online Role-Playing Games (MMORPGs), here we present a network science-based analysis of the interplay between distinct types of user interaction networks in the virtual world. We find that their properties depend critically on the nature of the context-interdependence of the interactions, highlighting the complex and multilayered nature of human interactions, a robust understanding of which we believe may prove instrumental in the designing of more realistic future virtual arenas as well as provide novel insights to the science of collective human behavior.

Dissipativity and stability analysis of fractional-order complex-valued neural networks with time delay.

PubMed

Velmurugan, G; Rakkiyappan, R; Vembarasan, V; Cao, Jinde; Alsaedi, Ahmed

2017-02-01

As we know, the notion of dissipativity is an important dynamical property of neural networks. Thus, the analysis of dissipativity of neural networks with time delay is becoming more and more important in the research field. In this paper, the authors establish a class of fractional-order complex-valued neural networks (FCVNNs) with time delay, and intensively study the problem of dissipativity, as well as global asymptotic stability of the considered FCVNNs with time delay. Based on the fractional Halanay inequality and suitable Lyapunov functions, some new sufficient conditions are obtained that guarantee the dissipativity of FCVNNs with time delay. Moreover, some sufficient conditions are derived in order to ensure the global asymptotic stability of the addressed FCVNNs with time delay. Finally, two numerical simulations are posed to ensure that the attention of our main results are valuable. Copyright © 2016 Elsevier Ltd. All rights reserved.

Organization and hierarchy of the human functional brain network lead to a chain-like core.

PubMed

Mastrandrea, Rossana; Gabrielli, Andrea; Piras, Fabrizio; Spalletta, Gianfranco; Caldarelli, Guido; Gili, Tommaso

2017-07-07

The brain is a paradigmatic example of a complex system: its functionality emerges as a global property of local mesoscopic and microscopic interactions. Complex network theory allows to elicit the functional architecture of the brain in terms of links (correlations) between nodes (grey matter regions) and to extract information out of the noise. Here we present the analysis of functional magnetic resonance imaging data from forty healthy humans at rest for the investigation of the basal scaffold of the functional brain network organization. We show how brain regions tend to coordinate by forming a highly hierarchical chain-like structure of homogeneously clustered anatomical areas. A maximum spanning tree approach revealed the centrality of the occipital cortex and the peculiar aggregation of cerebellar regions to form a closed core. We also report the hierarchy of network segregation and the level of clusters integration as a function of the connectivity strength between brain regions.

Dynamic Business Networks: A Headache for Sustainable Systems Interoperability

NASA Astrophysics Data System (ADS)

Agostinho, Carlos; Jardim-Goncalves, Ricardo

Collaborative networked environments emerged with the spread of the internet, contributing to overcome past communication barriers, and identifying interoperability as an essential property. When achieved seamlessly, efficiency is increased in the entire product life cycle. Nowadays, most organizations try to attain interoperability by establishing peer-to-peer mappings with the different partners, or in optimized networks, by using international standard models as the core for information exchange. In current industrial practice, mappings are only defined once, and the morphisms that represent them, are hardcoded in the enterprise systems. This solution has been effective for static environments, where enterprise and product models are valid for decades. However, with an increasingly complex and dynamic global market, models change frequently to answer new customer requirements. This paper draws concepts from the complex systems science and proposes a framework for sustainable systems interoperability in dynamic networks, enabling different organizations to evolve at their own rate.

Mutualism supports biodiversity when the direct competition is weak

PubMed Central

Pascual-García, Alberto; Bastolla, Ugo

2017-01-01

A key question of theoretical ecology is which properties of ecosystems favour their stability and help maintaining biodiversity. This question recently reconsidered mutualistic systems, generating intense controversy about the role of mutualistic interactions and their network architecture. Here we show analytically and verify with simulations that reducing the effective interspecific competition and the propagation of perturbations positively influences structural stability against environmental perturbations, enhancing persistence. Noteworthy, mutualism reduces the effective interspecific competition only when the direct interspecific competition is weaker than a critical value. This critical competition is in almost all cases larger in pollinator networks than in random networks with the same connectance. Highly connected mutualistic networks reduce the propagation of environmental perturbations, a mechanism reminiscent of MacArthur’s proposal that ecosystem complexity enhances stability. Our analytic framework rationalizes previous contradictory results, and it gives valuable insight on the complex relationship between mutualism and biodiversity. PMID:28232740

Network Approach to Disease Diagnosis

NASA Astrophysics Data System (ADS)

Sharma, Amitabh; Bashan, Amir; Barabasi, Alber-Laszlo

2014-03-01

Human diseases could be viewed as perturbations of the underlying biological system. A thorough understanding of the topological and dynamical properties of the biological system is crucial to explain the mechanisms of many complex diseases. Recently network-based approaches have provided a framework for integrating multi-dimensional biological data that results in a better understanding of the pathophysiological state of complex diseases. Here we provide a network-based framework to improve the diagnosis of complex diseases. This framework is based on the integration of transcriptomics and the interactome. We analyze the overlap between the differentially expressed (DE) genes and disease genes (DGs) based on their locations in the molecular interaction network (''interactome''). Disease genes and their protein products tend to be much more highly connected than random, hence defining a disease sub-graph (called disease module) in the interactome. DE genes, even though different from the known set of DGs, may be significantly associated with the disease when considering their closeness to the disease module in the interactome. This new network approach holds the promise to improve the diagnosis of patients who cannot be diagnosed using conventional tools. Support was provided by HL066289 and HL105339 grants from the U.S. National Institutes of Health.

Neural coding in graphs of bidirectional associative memories.

PubMed

Bouchain, A David; Palm, Günther

2012-01-24

In the last years we have developed large neural network models for the realization of complex cognitive tasks in a neural network architecture that resembles the network of the cerebral cortex. We have used networks of several cortical modules that contain two populations of neurons (one excitatory, one inhibitory). The excitatory populations in these so-called "cortical networks" are organized as a graph of Bidirectional Associative Memories (BAMs), where edges of the graph correspond to BAMs connecting two neural modules and nodes of the graph correspond to excitatory populations with associative feedback connections (and inhibitory interneurons). The neural code in each of these modules consists essentially of the firing pattern of the excitatory population, where mainly it is the subset of active neurons that codes the contents to be represented. The overall activity can be used to distinguish different properties of the patterns that are represented which we need to distinguish and control when performing complex tasks like language understanding with these cortical networks. The most important pattern properties or situations are: exactly fitting or matching input, incomplete information or partially matching pattern, superposition of several patterns, conflicting information, and new information that is to be learned. We show simple simulations of these situations in one area or module and discuss how to distinguish these situations based on the overall internal activation of the module. This article is part of a Special Issue entitled "Neural Coding". Copyright © 2011 Elsevier B.V. All rights reserved.

A Network of Networks Perspective on Global Trade.

PubMed

Maluck, Julian; Donner, Reik V

2015-01-01

Mutually intertwined supply chains in contemporary economy result in a complex network of trade relationships with a highly non-trivial topology that varies with time. In order to understand the complex interrelationships among different countries and economic sectors, as well as their dynamics, a holistic view on the underlying structural properties of this network is necessary. This study employs multi-regional input-output data to decompose 186 national economies into 26 industry sectors and utilizes the approach of interdependent networks to analyze the substructure of the resulting international trade network for the years 1990-2011. The partition of the network into national economies is observed to be compatible with the notion of communities in the sense of complex network theory. By studying internal versus cross-subgraph contributions to established complex network metrics, new insights into the architecture of global trade are obtained, which allow to identify key elements of global economy. Specifically, financial services and business activities dominate domestic trade whereas electrical and machinery industries dominate foreign trade. In order to further specify each national sector's role individually, (cross-)clustering coefficients and cross-betweenness are obtained for different pairs of subgraphs. The corresponding analysis reveals that specific industrial sectors tend to favor distinct directionality patterns and that the cross-clustering coefficient for geographically close country pairs is remarkably high, indicating that spatial factors are still of paramount importance for the organization of trade patterns in modern economy. Regarding the evolution of the trade network's substructure, globalization is well-expressed by trends of several structural characteristics (e.g., link density and node strength) in the interacting network framework. Extreme events, such as the financial crisis 2008/2009, are manifested as anomalies superimposed to these trends. The marked reorganization of trade patterns, associated with this economic crisis in comparison to "normal" annual fluctuations in the network structure is traced and quantified by a new widely applicable generalization of the Hamming distance to weighted networks.

Mechanical properties of bulk graphene oxide/poly(acrylic acid)/poly(ethylenimine) ternary polyelectrolyte complex.

PubMed

Duan, Yipin; Wang, Chao; Zhao, Mengmeng; Vogt, Bryan D; Zacharia, Nicole S

2018-05-30

Ternary complexes formed in a single pot process through the mixing of cationic (branched polyethylenimine, BPEI) and anionic (graphene oxide, GO, and poly(acrylic acid), PAA) aqueous solutions exhibit superior mechanical performance in comparison to their binary analogs. The composition of the ternary complex can be simply tuned through the composition of the anionic solution, which influences the water content and mechanical properties of the complex. Increasing the PAA content in the complex decreases the overall water content due to improved charge compensation with the BPEI, but this change also significantly improves the toughness of the complex. Ternary complexes containing ≤32 wt% PAA were too brittle to generate samples for tensile measurements, while extension in excess of 250% could be reached with 57 wt% PAA. From this work, the influence of GO and PAA on the mechanical properties of GO/PAA/BPEI complexes were elucidated with GO sheets acting to restrain the viscous flow and improve the mechanical strength at low loading (<12.6 wt%) and PAA more efficiently complexes with BPEI than GO to generate a less swollen and stronger network. This combination overcomes the brittle nature of GO-BPEI complexes and viscous creep of PAA-BPEI complexes. Ternary nanocomposite complexes appear to provide an effective route to toughen and strengthen bulk polyelectrolyte complexes.

Unraveling spurious properties of interaction networks with tailored random networks.

PubMed

Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus

2011-01-01

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

Unraveling Spurious Properties of Interaction Networks with Tailored Random Networks

PubMed Central

Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus

2011-01-01

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures – known for their complex spatial and temporal dynamics – we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis. PMID:21850239

Effective centrality and explosive synchronization in complex networks

NASA Astrophysics Data System (ADS)

Navas, A.; Villacorta-Atienza, J. A.; Leyva, I.; Almendral, J. A.; Sendiña-Nadal, I.; Boccaletti, S.

2015-12-01

Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. We here propose an effective network whose topological properties reflect the interplay between the topology and dynamics of the original network. On that basis, we are able to introduce the effective centrality, a measure that quantifies the role and importance of each network's node in the synchronization process. In particular, in the context of explosive synchronization, we use such a measure to assess the propensity of a graph to sustain an irreversible transition to synchronization. We furthermore discuss a strategy to induce the explosive behavior in a generic network, by acting only upon a fraction of its nodes.

Crystal Graph Convolutional Neural Networks for an Accurate and Interpretable Prediction of Material Properties

NASA Astrophysics Data System (ADS)

Xie, Tian; Grossman, Jeffrey C.

2018-04-01

The use of machine learning methods for accelerating the design of crystalline materials usually requires manually constructed feature vectors or complex transformation of atom coordinates to input the crystal structure, which either constrains the model to certain crystal types or makes it difficult to provide chemical insights. Here, we develop a crystal graph convolutional neural networks framework to directly learn material properties from the connection of atoms in the crystal, providing a universal and interpretable representation of crystalline materials. Our method provides a highly accurate prediction of density functional theory calculated properties for eight different properties of crystals with various structure types and compositions after being trained with 1 04 data points. Further, our framework is interpretable because one can extract the contributions from local chemical environments to global properties. Using an example of perovskites, we show how this information can be utilized to discover empirical rules for materials design.

Inference on network statistics by restricting to the network space: applications to sexual history data.

PubMed

Goyal, Ravi; De Gruttola, Victor

2018-01-30

Analysis of sexual history data intended to describe sexual networks presents many challenges arising from the fact that most surveys collect information on only a very small fraction of the population of interest. In addition, partners are rarely identified and responses are subject to reporting biases. Typically, each network statistic of interest, such as mean number of sexual partners for men or women, is estimated independently of other network statistics. There is, however, a complex relationship among networks statistics; and knowledge of these relationships can aid in addressing concerns mentioned earlier. We develop a novel method that constrains a posterior predictive distribution of a collection of network statistics in order to leverage the relationships among network statistics in making inference about network properties of interest. The method ensures that inference on network properties is compatible with an actual network. Through extensive simulation studies, we also demonstrate that use of this method can improve estimates in settings where there is uncertainty that arises both from sampling and from systematic reporting bias compared with currently available approaches to estimation. To illustrate the method, we apply it to estimate network statistics using data from the Chicago Health and Social Life Survey. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Phase transitions in Pareto optimal complex networks

NASA Astrophysics Data System (ADS)

Seoane, Luís F.; Solé, Ricard

2015-09-01

The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their topological structure can be diverse, resulting from different mechanisms including multiplicative processes and optimization. In spatial networks or in graphs where cost constraints are at work, as it occurs in a plethora of situations from power grids to the wiring of neurons in the brain, optimization plays an important part in shaping their organization. In this paper we study network designs resulting from a Pareto optimization process, where different simultaneous constraints are the targets of selection. We analyze three variations on a problem, finding phase transitions of different kinds. Distinct phases are associated with different arrangements of the connections, but the need of drastic topological changes does not determine the presence or the nature of the phase transitions encountered. Instead, the functions under optimization do play a determinant role. This reinforces the view that phase transitions do not arise from intrinsic properties of a system alone, but from the interplay of that system with its external constraints.

Network-based integration of systems genetics data reveals pathways associated with lignocellulosic biomass accumulation and processing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mizrachi, Eshchar; Verbeke, Lieven; Christie, Nanette

As a consequence of their remarkable adaptability, fast growth, and superior wood properties, eucalypt tree plantations have emerged as key renewable feedstocks (over 20 million ha globally) for the production of pulp, paper, bioenergy, and other lignocellulosic products. However, most biomass properties such as growth, wood density, and wood chemistry are complex traits that are hard to improve in long-lived perennials. Systems genetics, a process of harnessing multiple levels of component trait information (e.g., transcript, protein, and metabolite variation) in populations that vary in complex traits, has proven effective for dissecting the genetics and biology of such traits. We havemore » applied a network-based data integration (NBDI) method for a systems-level analysis of genes, processes and pathways underlying biomass and bioenergy-related traits using a segregating Eucalyptus hybrid population. We show that the integrative approach can link biologically meaningful sets of genes to complex traits and at the same time reveal the molecular basis of trait variation. Gene sets identified for related woody biomass traits were found to share regulatory loci, cluster in network neighborhoods, and exhibit enrichment for molecular functions such as xylan metabolism and cell wall development. These findings offer a framework for identifying the molecular underpinnings of complex biomass and bioprocessing-related traits. Furthermore, a more thorough understanding of the molecular basis of plant biomass traits should provide additional opportunities for the establishment of a sustainable bio-based economy.« less

Network-based integration of systems genetics data reveals pathways associated with lignocellulosic biomass accumulation and processing

DOE PAGES

Mizrachi, Eshchar; Verbeke, Lieven; Christie, Nanette; ...

2017-01-17

As a consequence of their remarkable adaptability, fast growth, and superior wood properties, eucalypt tree plantations have emerged as key renewable feedstocks (over 20 million ha globally) for the production of pulp, paper, bioenergy, and other lignocellulosic products. However, most biomass properties such as growth, wood density, and wood chemistry are complex traits that are hard to improve in long-lived perennials. Systems genetics, a process of harnessing multiple levels of component trait information (e.g., transcript, protein, and metabolite variation) in populations that vary in complex traits, has proven effective for dissecting the genetics and biology of such traits. We havemore » applied a network-based data integration (NBDI) method for a systems-level analysis of genes, processes and pathways underlying biomass and bioenergy-related traits using a segregating Eucalyptus hybrid population. We show that the integrative approach can link biologically meaningful sets of genes to complex traits and at the same time reveal the molecular basis of trait variation. Gene sets identified for related woody biomass traits were found to share regulatory loci, cluster in network neighborhoods, and exhibit enrichment for molecular functions such as xylan metabolism and cell wall development. These findings offer a framework for identifying the molecular underpinnings of complex biomass and bioprocessing-related traits. Furthermore, a more thorough understanding of the molecular basis of plant biomass traits should provide additional opportunities for the establishment of a sustainable bio-based economy.« less

Network-based integration of systems genetics data reveals pathways associated with lignocellulosic biomass accumulation and processing.

PubMed

Mizrachi, Eshchar; Verbeke, Lieven; Christie, Nanette; Fierro, Ana C; Mansfield, Shawn D; Davis, Mark F; Gjersing, Erica; Tuskan, Gerald A; Van Montagu, Marc; Van de Peer, Yves; Marchal, Kathleen; Myburg, Alexander A

2017-01-31

As a consequence of their remarkable adaptability, fast growth, and superior wood properties, eucalypt tree plantations have emerged as key renewable feedstocks (over 20 million ha globally) for the production of pulp, paper, bioenergy, and other lignocellulosic products. However, most biomass properties such as growth, wood density, and wood chemistry are complex traits that are hard to improve in long-lived perennials. Systems genetics, a process of harnessing multiple levels of component trait information (e.g., transcript, protein, and metabolite variation) in populations that vary in complex traits, has proven effective for dissecting the genetics and biology of such traits. We have applied a network-based data integration (NBDI) method for a systems-level analysis of genes, processes and pathways underlying biomass and bioenergy-related traits using a segregating Eucalyptus hybrid population. We show that the integrative approach can link biologically meaningful sets of genes to complex traits and at the same time reveal the molecular basis of trait variation. Gene sets identified for related woody biomass traits were found to share regulatory loci, cluster in network neighborhoods, and exhibit enrichment for molecular functions such as xylan metabolism and cell wall development. These findings offer a framework for identifying the molecular underpinnings of complex biomass and bioprocessing-related traits. A more thorough understanding of the molecular basis of plant biomass traits should provide additional opportunities for the establishment of a sustainable bio-based economy.

Gene expression complex networks: synthesis, identification, and analysis.

PubMed

Lopes, Fabrício M; Cesar, Roberto M; Costa, Luciano Da F

2011-10-01

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdös-Rényi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabási-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree variation, decreasing its network recovery rate with the increase of . The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

Controllability of protein-protein interaction phosphorylation-based networks: Participation of the hub 14-3-3 protein family

PubMed Central

Uhart, Marina; Flores, Gabriel; Bustos, Diego M.

2016-01-01

Posttranslational regulation of protein function is an ubiquitous mechanism in eukaryotic cells. Here, we analyzed biological properties of nodes and edges of a human protein-protein interaction phosphorylation-based network, especially of those nodes critical for the network controllability. We found that the minimal number of critical nodes needed to control the whole network is 29%, which is considerably lower compared to other real networks. These critical nodes are more regulated by posttranslational modifications and contain more binding domains to these modifications than other kinds of nodes in the network, suggesting an intra-group fast regulation. Also, when we analyzed the edges characteristics that connect critical and non-critical nodes, we found that the former are enriched in domain-to-eukaryotic linear motif interactions, whereas the later are enriched in domain-domain interactions. Our findings suggest a possible structure for protein-protein interaction networks with a densely interconnected and self-regulated central core, composed of critical nodes with a high participation in the controllability of the full network, and less regulated peripheral nodes. Our study offers a deeper understanding of complex network control and bridges the controllability theorems for complex networks and biological protein-protein interaction phosphorylation-based networked systems. PMID:27195976

The improved degree of urban road traffic network: A case study of Xiamen, China

NASA Astrophysics Data System (ADS)

Wang, Shiguang; Zheng, Lili; Yu, Dexin

2017-03-01

The complex network theory is applied to the study of urban road traffic network topology, and we constructed a new measure to characterize an urban road network. It is inspiring to quantify the interaction more appropriately between nodes in complex networks, especially in the field of traffic. The measure takes into account properties of lanes (e.g. number of lanes, width, traffic direction). As much, it is a more comprehensive measure in comparison to previous network measures. It can be used to grasp the features of urban street network more clearly. We applied this measure to the road network in Xiamen, China. Based on a standard method from statistical physics, we examined in more detail the distribution of this new measure and found that (1) due to the limitation of space geographic attributes, traditional research conclusions acquired by using the original definition of degree to study the primal approach modeled urban street network are not very persuasive; (2) both of the direction of the network connection and the degree's odd or even classifications need to be analyzed specifically; (3) the improved degree distribution presents obvious hierarchy, and hierarchical values conform to the power-law distribution, and correlation of our new measure shows some significant segmentation of the urban road network.

Systemic Risk Analysis on Reconstructed Economic and Financial Networks

PubMed Central

Cimini, Giulio; Squartini, Tiziano; Garlaschelli, Diego; Gabrielli, Andrea

2015-01-01

We address a fundamental problem that is systematically encountered when modeling real-world complex systems of societal relevance: the limitedness of the information available. In the case of economic and financial networks, privacy issues severely limit the information that can be accessed and, as a consequence, the possibility of correctly estimating the resilience of these systems to events such as financial shocks, crises and cascade failures. Here we present an innovative method to reconstruct the structure of such partially-accessible systems, based on the knowledge of intrinsic node-specific properties and of the number of connections of only a limited subset of nodes. This information is used to calibrate an inference procedure based on fundamental concepts derived from statistical physics, which allows to generate ensembles of directed weighted networks intended to represent the real system—so that the real network properties can be estimated as their average values within the ensemble. We test the method both on synthetic and empirical networks, focusing on the properties that are commonly used to measure systemic risk. Indeed, the method shows a remarkable robustness with respect to the limitedness of the information available, thus representing a valuable tool for gaining insights on privacy-protected economic and financial systems. PMID:26507849

Systemic Risk Analysis on Reconstructed Economic and Financial Networks

NASA Astrophysics Data System (ADS)

Cimini, Giulio; Squartini, Tiziano; Garlaschelli, Diego; Gabrielli, Andrea

2015-10-01

We address a fundamental problem that is systematically encountered when modeling real-world complex systems of societal relevance: the limitedness of the information available. In the case of economic and financial networks, privacy issues severely limit the information that can be accessed and, as a consequence, the possibility of correctly estimating the resilience of these systems to events such as financial shocks, crises and cascade failures. Here we present an innovative method to reconstruct the structure of such partially-accessible systems, based on the knowledge of intrinsic node-specific properties and of the number of connections of only a limited subset of nodes. This information is used to calibrate an inference procedure based on fundamental concepts derived from statistical physics, which allows to generate ensembles of directed weighted networks intended to represent the real system—so that the real network properties can be estimated as their average values within the ensemble. We test the method both on synthetic and empirical networks, focusing on the properties that are commonly used to measure systemic risk. Indeed, the method shows a remarkable robustness with respect to the limitedness of the information available, thus representing a valuable tool for gaining insights on privacy-protected economic and financial systems.

Hydro-geomorphological characterization and classification of Chilean river networks using horizontal, vertical and climatological properties

NASA Astrophysics Data System (ADS)

Pereira, A. A.; Gironas, J. A.; Passalacqua, P.; Mejia, A.; Niemann, J. D.

2017-12-01

Previous work has shown that lithological, tectonic and climatic processes have a major influence in shaping the geomorphology of river networks. Accordingly, quantitative classification methods have been developed to identify and characterize network types (dendritic, parallel, pinnate, rectangular and trellis) based solely on the self-affinity of their planform properties, computed from available Digital Elevation Model (DEM) data. In contrast, this research aim is to include both horizontal and vertical properties to evaluate a quantitative classification method for river networks. We include vertical properties to consider the unique surficial conditions (e.g., large and steep height drops, volcanic activity, and complexity of stream networks) of the Andes Mountains. Furthermore, the goal of the research is also to explain the implications and possible relations between the hydro-geomorphological properties and climatic conditions. The classification method is applied to 42 basins in the southern Andes in Chile, ranging in size from 208 Km2 to 8,000 Km2. The planform metrics include the incremental drainage area, stream course irregularity and junction angles, while the vertical metrics include the hypsometric curve and the slope-area relationship. We introduce new network structures (Brush, Funnel and Low Sinuosity Rectangular), possibly unique to the Andes, that can be quantitatively differentiated from previous networks identified in other geographic regions. Then, this research evaluates the effect that excluding different Strahler order streams has on the horizontal properties and therefore in the classification. We found that climatic conditions are not only linked to horizontal parameters, but also to vertical ones, finding significant correlation between climatic variables (average near-surface temperature and rainfall) and vertical measures (parameters associated with the hypsometric curve and slope-area relation). The proposed classification shows differences among basins previously classified as the same type, which are not noticeable in their horizontal properties and helps reduce misclassifications within the old clusters. Additional hydro-geomorphological metrics are to be considered in the classification method to improve the effectiveness of it.

Fouling resistance prediction using artificial neural network nonlinear auto-regressive with exogenous input model based on operating conditions and fluid properties correlations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Biyanto, Totok R.

Fouling in a heat exchanger in Crude Preheat Train (CPT) refinery is an unsolved problem that reduces the plant efficiency, increases fuel consumption and CO{sub 2} emission. The fouling resistance behavior is very complex. It is difficult to develop a model using first principle equation to predict the fouling resistance due to different operating conditions and different crude blends. In this paper, Artificial Neural Networks (ANN) MultiLayer Perceptron (MLP) with input structure using Nonlinear Auto-Regressive with eXogenous (NARX) is utilized to build the fouling resistance model in shell and tube heat exchanger (STHX). The input data of the model aremore » flow rates and temperatures of the streams of the heat exchanger, physical properties of product and crude blend data. This model serves as a predicting tool to optimize operating conditions and preventive maintenance of STHX. The results show that the model can capture the complexity of fouling characteristics in heat exchanger due to thermodynamic conditions and variations in crude oil properties (blends). It was found that the Root Mean Square Error (RMSE) are suitable to capture the nonlinearity and complexity of the STHX fouling resistance during phases of training and validation.« less

Dynamic Network Analysis for Robust Uncertainty Management

DTIC Science & Technology

2010-03-01

complex networks since a set of modules could be a lot simpler than a collection of entangled individual agents (22). The simplification may be...nanomaterials and photonic crystals with desired material prop- 233 C.l. FAST GENERATION OF POTENTIALS FOR SELF-ASSEMBLY OF PARTICLES erties [14-21...prescribed geometry and structure is highly motivated by the desire to produce photonic crystals with specified optical properties. Also, we intend to

Metabolic Compartmentation – A System Level Property of Muscle Cells

PubMed Central

Saks, Valdur; Beraud, Nathalie; Wallimann, Theo

2008-01-01

Problems of quantitative investigation of intracellular diffusion and compartmentation of metabolites are analyzed. Principal controversies in recently published analyses of these problems for the living cells are discussed. It is shown that the formal theoretical analysis of diffusion of metabolites based on Fick's equation and using fixed diffusion coefficients for diluted homogenous aqueous solutions, but applied for biological systems in vivo without any comparison with experimental results, may lead to misleading conclusions, which are contradictory to most biological observations. However, if the same theoretical methods are used for analysis of actual experimental data, the apparent diffusion constants obtained are orders of magnitude lower than those in diluted aqueous solutions. Thus, it can be concluded that local restrictions of diffusion of metabolites in a cell are a system-level properties caused by complex structural organization of the cells, macromolecular crowding, cytoskeletal networks and organization of metabolic pathways into multienzyme complexes and metabolons. This results in microcompartmentation of metabolites, their channeling between enzymes and in modular organization of cellular metabolic networks. The perspectives of further studies of these complex intracellular interactions in the framework of Systems Biology are discussed. PMID:19325782

A Network of Networks Perspective on Global Trade

PubMed Central

Maluck, Julian; Donner, Reik V.

2015-01-01

Mutually intertwined supply chains in contemporary economy result in a complex network of trade relationships with a highly non-trivial topology that varies with time. In order to understand the complex interrelationships among different countries and economic sectors, as well as their dynamics, a holistic view on the underlying structural properties of this network is necessary. This study employs multi-regional input-output data to decompose 186 national economies into 26 industry sectors and utilizes the approach of interdependent networks to analyze the substructure of the resulting international trade network for the years 1990–2011. The partition of the network into national economies is observed to be compatible with the notion of communities in the sense of complex network theory. By studying internal versus cross-subgraph contributions to established complex network metrics, new insights into the architecture of global trade are obtained, which allow to identify key elements of global economy. Specifically, financial services and business activities dominate domestic trade whereas electrical and machinery industries dominate foreign trade. In order to further specify each national sector’s role individually, (cross-)clustering coefficients and cross-betweenness are obtained for different pairs of subgraphs. The corresponding analysis reveals that specific industrial sectors tend to favor distinct directionality patterns and that the cross-clustering coefficient for geographically close country pairs is remarkably high, indicating that spatial factors are still of paramount importance for the organization of trade patterns in modern economy. Regarding the evolution of the trade network’s substructure, globalization is well-expressed by trends of several structural characteristics (e.g., link density and node strength) in the interacting network framework. Extreme events, such as the financial crisis 2008/2009, are manifested as anomalies superimposed to these trends. The marked reorganization of trade patterns, associated with this economic crisis in comparison to “normal” annual fluctuations in the network structure is traced and quantified by a new widely applicable generalization of the Hamming distance to weighted networks. PMID:26197439

Genetic architecture of wood properties based on association analysis and co-expression networks in white spruce.

PubMed

Lamara, Mebarek; Raherison, Elie; Lenz, Patrick; Beaulieu, Jean; Bousquet, Jean; MacKay, John

2016-04-01

Association studies are widely utilized to analyze complex traits but their ability to disclose genetic architectures is often limited by statistical constraints, and functional insights are usually minimal in nonmodel organisms like forest trees. We developed an approach to integrate association mapping results with co-expression networks. We tested single nucleotide polymorphisms (SNPs) in 2652 candidate genes for statistical associations with wood density, stiffness, microfibril angle and ring width in a population of 1694 white spruce trees (Picea glauca). Associations mapping identified 229-292 genes per wood trait using a statistical significance level of P < 0.05 to maximize discovery. Over-representation of genes associated for nearly all traits was found in a xylem preferential co-expression group developed in independent experiments. A xylem co-expression network was reconstructed with 180 wood associated genes and several known MYB and NAC regulators were identified as network hubs. The network revealed a link between the gene PgNAC8, wood stiffness and microfibril angle, as well as considerable within-season variation for both genetic control of wood traits and gene expression. Trait associations were distributed throughout the network suggesting complex interactions and pleiotropic effects. Our findings indicate that integration of association mapping and co-expression networks enhances our understanding of complex wood traits. © 2015 The Authors. New Phytologist © 2015 New Phytologist Trust.

Replicating receptive fields of simple and complex cells in primary visual cortex in a neuronal network model with temporal and population sparseness and reliability.

PubMed

Tanaka, Takuma; Aoyagi, Toshio; Kaneko, Takeshi

2012-10-01

We propose a new principle for replicating receptive field properties of neurons in the primary visual cortex. We derive a learning rule for a feedforward network, which maintains a low firing rate for the output neurons (resulting in temporal sparseness) and allows only a small subset of the neurons in the network to fire at any given time (resulting in population sparseness). Our learning rule also sets the firing rates of the output neurons at each time step to near-maximum or near-minimum levels, resulting in neuronal reliability. The learning rule is simple enough to be written in spatially and temporally local forms. After the learning stage is performed using input image patches of natural scenes, output neurons in the model network are found to exhibit simple-cell-like receptive field properties. When the output of these simple-cell-like neurons are input to another model layer using the same learning rule, the second-layer output neurons after learning become less sensitive to the phase of gratings than the simple-cell-like input neurons. In particular, some of the second-layer output neurons become completely phase invariant, owing to the convergence of the connections from first-layer neurons with similar orientation selectivity to second-layer neurons in the model network. We examine the parameter dependencies of the receptive field properties of the model neurons after learning and discuss their biological implications. We also show that the localized learning rule is consistent with experimental results concerning neuronal plasticity and can replicate the receptive fields of simple and complex cells.

Spike-train spectra and network response functions for non-linear integrate-and-fire neurons.

PubMed

Richardson, Magnus J E

2008-11-01

Reduced models have long been used as a tool for the analysis of the complex activity taking place in neurons and their coupled networks. Recent advances in experimental and theoretical techniques have further demonstrated the usefulness of this approach. Despite the often gross simplification of the underlying biophysical properties, reduced models can still present significant difficulties in their analysis, with the majority of exact and perturbative results available only for the leaky integrate-and-fire model. Here an elementary numerical scheme is demonstrated which can be used to calculate a number of biologically important properties of the general class of non-linear integrate-and-fire models. Exact results for the first-passage-time density and spike-train spectrum are derived, as well as the linear response properties and emergent states of recurrent networks. Given that the exponential integrate-fire model has recently been shown to agree closely with the experimentally measured response of pyramidal cells, the methodology presented here promises to provide a convenient tool to facilitate the analysis of cortical-network dynamics.

Tabu Search enhances network robustness under targeted attacks

NASA Astrophysics Data System (ADS)

Sun, Shi-wen; Ma, Yi-lin; Li, Rui-qi; Wang, Li; Xia, Cheng-yi

2016-03-01

We focus on the optimization of network robustness with respect to intentional attacks on high-degree nodes. Given an existing network, this problem can be considered as a typical single-objective combinatorial optimization problem. Based on the heuristic Tabu Search optimization algorithm, a link-rewiring method is applied to reconstruct the network while keeping the degree of every node unchanged. Through numerical simulations, BA scale-free network and two real-world networks are investigated to verify the effectiveness of the proposed optimization method. Meanwhile, we analyze how the optimization affects other topological properties of the networks, including natural connectivity, clustering coefficient and degree-degree correlation. The current results can help to improve the robustness of existing complex real-world systems, as well as to provide some insights into the design of robust networks.

Social power and opinion formation in complex networks

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2013-02-01

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

Mean Green operators of deformable fiber networks embedded in a compliant matrix and property estimates

NASA Astrophysics Data System (ADS)

Franciosi, Patrick; Spagnuolo, Mario; Salman, Oguz Umut

2018-04-01

Composites comprising included phases in a continuous matrix constitute a huge class of meta-materials, whose effective properties, whether they be mechanical, physical or coupled, can be selectively optimized by using appropriate phase arrangements and architectures. An important subclass is represented by "network-reinforced matrices," say those materials in which one or more of the embedded phases are co-continuous with the matrix in one or more directions. In this article, we present a method to study effective properties of simple such structures from which more complex ones can be accessible. Effective properties are shown, in the framework of linear elasticity, estimable by using the global mean Green operator for the entire embedded fiber network which is by definition through sample spanning. This network operator is obtained from one of infinite planar alignments of infinite fibers, which the network can be seen as an interpenetrated set of, with the fiber interactions being fully accounted for in the alignments. The mean operator of such alignments is given in exact closed form for isotropic elastic-like or dielectric-like matrices. We first exemplify how these operators relevantly provide, from classic homogenization frameworks, effective properties in the case of 1D fiber bundles embedded in an isotropic elastic-like medium. It is also shown that using infinite patterns with fully interacting elements over their whole influence range at any element concentration suppresses the dilute approximation limit of these frameworks. We finally present a construction method for a global operator of fiber networks described as interpenetrated such bundles.

How actin network dynamics control the onset of actin-based motility

PubMed Central

Kawska, Agnieszka; Carvalho, Kévin; Manzi, John; Boujemaa-Paterski, Rajaa; Blanchoin, Laurent; Martiel, Jean-Louis; Sykes, Cécile

2012-01-01

Cells use their dynamic actin network to control their mechanics and motility. These networks are made of branched actin filaments generated by the Arp2/3 complex. Here we study under which conditions the microscopic organization of branched actin networks builds up a sufficient stress to trigger sustained motility. In our experimental setup, dynamic actin networks or “gels” are grown on a hard bead in a controlled minimal protein system containing actin monomers, profilin, the Arp2/3 complex and capping protein. We vary protein concentrations and follow experimentally and through simulations the shape and mechanical properties of the actin gel growing around beads. Actin gel morphology is controlled by elementary steps including “primer” contact, growth of the network, entanglement, mechanical interaction and force production. We show that varying the biochemical orchestration of these steps can lead to the loss of network cohesion and the lack of effective force production. We propose a predictive phase diagram of actin gel fate as a function of protein concentrations. This work unveils how, in growing actin networks, a tight biochemical and physical coupling smoothens initial primer-caused heterogeneities and governs force buildup and cell motility. PMID:22908255

S-curve networks and an approximate method for estimating degree distributions of complex networks

NASA Astrophysics Data System (ADS)

Guo, Jin-Li

2010-12-01

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási-Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási-Albert method commonly used in current network research.

Pectin/zein beads for potential colon-specific drug delivery: synthesis and in vitro evaluation.

PubMed

Liu, LinShu; Fishman, Marshall L; Hicks, Kevin B; Kende, Meir; Ruthel, Gordon

2006-01-01

Novel complex hydrogel beads were prepared from two edible polymers: pectin, a carbohydrate from citrus fruits, and zein, a protein from corn. The pectin/zein complex hydrogels did not swell in physiological environments, but hydrolyzed in the presence of pectinases. An in vitro study showed the capacity of the hydrogels to endure protease attack and residence time variation. The physical and biological properties of the new hydrogels were attributed to molecular entanglement of the two polymers. The pectin networks were stabilized by the bound zein molecules. In turn, the pectin networks shielded the bound zein from protease digestion.

Modeling Endoplasmic Reticulum Network Maintenance in a Plant Cell.

PubMed

Lin, Congping; White, Rhiannon R; Sparkes, Imogen; Ashwin, Peter

2017-07-11

The endoplasmic reticulum (ER) in plant cells forms a highly dynamic network of complex geometry. ER network morphology and dynamics are influenced by a number of biophysical processes, including filament/tubule tension, viscous forces, Brownian diffusion, and interactions with many other organelles and cytoskeletal elements. Previous studies have indicated that ER networks can be thought of as constrained minimal-length networks acted on by a variety of forces that perturb and/or remodel the network. Here, we study two specific biophysical processes involved in remodeling. One is the dynamic relaxation process involving a combination of tubule tension and viscous forces. The other is the rapid creation of cross-connection tubules by direct or indirect interactions with cytoskeletal elements. These processes are able to remodel the ER network: the first reduces network length and complexity whereas the second increases both. Using live cell imaging of ER network dynamics in tobacco leaf epidermal cells, we examine these processes on ER network dynamics. Away from regions of cytoplasmic streaming, we suggest that the dynamic network structure is a balance between the two processes, and we build an integrative model of the two processes for network remodeling. This model produces quantitatively similar ER networks to those observed in experiments. We use the model to explore the effect of parameter variation on statistical properties of the ER network. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Functional Genomics Assistant (FUGA): a toolbox for the analysis of complex biological networks

PubMed Central

2011-01-01

Background Cellular constituents such as proteins, DNA, and RNA form a complex web of interactions that regulate biochemical homeostasis and determine the dynamic cellular response to external stimuli. It follows that detailed understanding of these patterns is critical for the assessment of fundamental processes in cell biology and pathology. Representation and analysis of cellular constituents through network principles is a promising and popular analytical avenue towards a deeper understanding of molecular mechanisms in a system-wide context. Findings We present Functional Genomics Assistant (FUGA) - an extensible and portable MATLAB toolbox for the inference of biological relationships, graph topology analysis, random network simulation, network clustering, and functional enrichment statistics. In contrast to conventional differential expression analysis of individual genes, FUGA offers a framework for the study of system-wide properties of biological networks and highlights putative molecular targets using concepts of systems biology. Conclusion FUGA offers a simple and customizable framework for network analysis in a variety of systems biology applications. It is freely available for individual or academic use at http://code.google.com/p/fuga. PMID:22035155

Solution NMR characterization of magnetic/electronic properties of azide and cyanide-inhibited substrate complexes of human heme oxygenase: implications for steric ligand tilt.

PubMed

Peng, Dungeng; Ogura, Hiroshi; Ma, Li-Hua; Evans, John P; de Montellano, Paul R Ortiz; La Mar, Gerd N

2013-04-01

Solution 2D (1)H NMR was carried out on the azide-ligated substrate complex of human heme oxygenase, hHO, to provide information on the active site molecular structure, chromophore electronic/magnetic properties, and the distal H-bond network linked to the exogenous ligand by catalytically relevant oriented water molecules. While 2D NMR exhibited very similar patterns of two-dimensional nuclear Overhauser spectroscopy cross peaks of residues with substrate and among residues as the previously characterized cyanide complex, significant, broadly distributed chemical shift differences were observed for both labile and non-labile protons. The anisotropy and orientation of the paramagnetic susceptibility tensor, χ, were determined for both the azide and cyanide complexes. The most significant difference observed is the tilt of the major magnetic axes from the heme normal, which is only half as large for the azide than cyanide ligand, with each ligand tilted toward the catalytically cleaved α-meso position. The difference in chemical shifts is quantitatively correlated with differences in dipolar shifts in the respective complexes for all but the distal helix. The necessity of considering dipolar shifts, and hence determination of the orientation/anisotropy of χ, in comparing chemical shifts involving paramagnetic complexes, is emphasized. The analysis shows that the H-bond network cannot detect significant differences in H-bond acceptor properties of cyanide versus azide ligands. Lastly, significant retardation of distal helix labile proton exchange upon replacing cyanide with azide indicates that the dynamic stability of the distal helix is increased upon decreasing the steric interaction of the ligand with the distal helix. Copyright © 2013. Published by Elsevier Inc.

Introduction to focus issue: quantitative approaches to genetic networks.

PubMed

Albert, Réka; Collins, James J; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Introduction to Focus Issue: Quantitative Approaches to Genetic Networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Collins, James J.; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

C. elegans network biology: a beginning.

PubMed Central

Piano, Fabio; Gunsalus, Kristin C; Hill, David E; Vidal, Marc

2006-01-01

The architecture and dynamics of molecular networks can provide an understanding of complex biological processes complementary to that obtained from the in-depth study of single genes and proteins. With a completely sequenced and well-annotated genome, a fully characterized cell lineage, and powerful tools available to dissect development, Caenorhabditis elegans, among metazoans, provides an optimal system to bridge cellular and organismal biology with the global properties of macromolecular networks. This chapter considers omic technologies available for C. elegans to describe molecular networks--encompassing transcriptional and phenotypic profiling as well as physical interaction mapping--and discusses how their individual and integrated applications are paving the way for a network-level understanding of C. elegans biology. PMID:18050437

Complex network structure of musical compositions: Algorithmic generation of appealing music

NASA Astrophysics Data System (ADS)

Liu, Xiao Fan; Tse, Chi K.; Small, Michael

2010-01-01

In this paper we construct networks for music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurring connections. We analyze classical music from Bach, Mozart, Chopin, as well as other types of music such as Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. We conjecture that preserving the universal network properties is a necessary step in artificial composition of music. Power-law exponents of node degree, node strength and/or edge weight distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be composed artificially using a controlled random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. By generating a large number of compositions, we find that this algorithm generates music which has the necessary qualities to be subjectively judged as appealing.

Irregular behavior in an excitatory-inhibitory neuronal network

NASA Astrophysics Data System (ADS)

Park, Choongseok; Terman, David

2010-06-01

Excitatory-inhibitory networks arise in many regions throughout the central nervous system and display complex spatiotemporal firing patterns. These neuronal activity patterns (of individual neurons and/or the whole network) are closely related to the functional status of the system and differ between normal and pathological states. For example, neurons within the basal ganglia, a group of subcortical nuclei that are responsible for the generation of movement, display a variety of dynamic behaviors such as correlated oscillatory activity and irregular, uncorrelated spiking. Neither the origins of these firing patterns nor the mechanisms that underlie the patterns are well understood. We consider a biophysical model of an excitatory-inhibitory network in the basal ganglia and explore how specific biophysical properties of the network contribute to the generation of irregular spiking. We use geometric dynamical systems and singular perturbation methods to systematically reduce the model to a simpler set of equations, which is suitable for analysis. The results specify the dependence on the strengths of synaptic connections and the intrinsic firing properties of the cells in the irregular regime when applied to the subthalamopallidal network of the basal ganglia.

Incorporating profile information in community detection for online social networks

NASA Astrophysics Data System (ADS)

Fan, W.; Yeung, K. H.

2014-07-01

Community structure is an important feature in the study of complex networks. It is because nodes of the same community may have similar properties. In this paper we extend two popular community detection methods to partition online social networks. In our extended methods, the profile information of users is used for partitioning. We apply the extended methods in several sample networks of Facebook. Compared with the original methods, the community structures we obtain have higher modularity. Our results indicate that users' profile information is consistent with the community structure of their friendship network to some extent. To the best of our knowledge, this paper is the first to discuss how profile information can be used to improve community detection in online social networks.

Deep graphs—A general framework to represent and analyze heterogeneous complex systems across scales

NASA Astrophysics Data System (ADS)

Traxl, Dominik; Boers, Niklas; Kurths, Jürgen

2016-06-01

Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. Particularly in recent years, a great progress has been made by augmenting "traditional" network theory in order to account for the multiplex nature of many networks, multiple types of connections between objects, the time-evolution of networks, networks of networks and other intricacies. However, existing network representations still lack crucial features in order to serve as a general data analysis tool. These include, most importantly, an explicit association of information with possibly heterogeneous types of objects and relations, and a conclusive representation of the properties of groups of nodes as well as the interactions between such groups on different scales. In this paper, we introduce a collection of definitions resulting in a framework that, on the one hand, entails and unifies existing network representations (e.g., network of networks and multilayer networks), and on the other hand, generalizes and extends them by incorporating the above features. To implement these features, we first specify the nodes and edges of a finite graph as sets of properties (which are permitted to be arbitrary mathematical objects). Second, the mathematical concept of partition lattices is transferred to the network theory in order to demonstrate how partitioning the node and edge set of a graph into supernodes and superedges allows us to aggregate, compute, and allocate information on and between arbitrary groups of nodes. The derived partition lattice of a graph, which we denote by deep graph, constitutes a concise, yet comprehensive representation that enables the expression and analysis of heterogeneous properties, relations, and interactions on all scales of a complex system in a self-contained manner. Furthermore, to be able to utilize existing network-based methods and models, we derive different representations of multilayer networks from our framework and demonstrate the advantages of our representation. On the basis of the formal framework described here, we provide a rich, fully scalable (and self-explanatory) software package that integrates into the PyData ecosystem and offers interfaces to popular network packages, making it a powerful, general-purpose data analysis toolkit. We exemplify an application of deep graphs using a real world dataset, comprising 16 years of satellite-derived global precipitation measurements. We deduce a deep graph representation of these measurements in order to track and investigate local formations of spatio-temporal clusters of extreme precipitation events.

Deep graphs-A general framework to represent and analyze heterogeneous complex systems across scales.

PubMed

Traxl, Dominik; Boers, Niklas; Kurths, Jürgen

2016-06-01

Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. Particularly in recent years, a great progress has been made by augmenting "traditional" network theory in order to account for the multiplex nature of many networks, multiple types of connections between objects, the time-evolution of networks, networks of networks and other intricacies. However, existing network representations still lack crucial features in order to serve as a general data analysis tool. These include, most importantly, an explicit association of information with possibly heterogeneous types of objects and relations, and a conclusive representation of the properties of groups of nodes as well as the interactions between such groups on different scales. In this paper, we introduce a collection of definitions resulting in a framework that, on the one hand, entails and unifies existing network representations (e.g., network of networks and multilayer networks), and on the other hand, generalizes and extends them by incorporating the above features. To implement these features, we first specify the nodes and edges of a finite graph as sets of properties (which are permitted to be arbitrary mathematical objects). Second, the mathematical concept of partition lattices is transferred to the network theory in order to demonstrate how partitioning the node and edge set of a graph into supernodes and superedges allows us to aggregate, compute, and allocate information on and between arbitrary groups of nodes. The derived partition lattice of a graph, which we denote by deep graph, constitutes a concise, yet comprehensive representation that enables the expression and analysis of heterogeneous properties, relations, and interactions on all scales of a complex system in a self-contained manner. Furthermore, to be able to utilize existing network-based methods and models, we derive different representations of multilayer networks from our framework and demonstrate the advantages of our representation. On the basis of the formal framework described here, we provide a rich, fully scalable (and self-explanatory) software package that integrates into the PyData ecosystem and offers interfaces to popular network packages, making it a powerful, general-purpose data analysis toolkit. We exemplify an application of deep graphs using a real world dataset, comprising 16 years of satellite-derived global precipitation measurements. We deduce a deep graph representation of these measurements in order to track and investigate local formations of spatio-temporal clusters of extreme precipitation events.

Features and heterogeneities in growing network models

NASA Astrophysics Data System (ADS)

Ferretti, Luca; Cortelezzi, Michele; Yang, Bin; Marmorini, Giacomo; Bianconi, Ginestra

2012-06-01

Many complex networks from the World Wide Web to biological networks grow taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document such as personal page, thematic website, news, blog, search engine, social network, etc., or the classification of a gene in a functional module. Moreover the feature of a node can be a continuous variable such as the position of a node in the embedding space. In order to account for these properties, in this paper we provide a generalization of growing network models with preferential attachment that includes the effect of heterogeneous features of the nodes. The main effect of heterogeneity is the emergence of an “effective fitness” for each class of nodes, determining the rate at which nodes acquire new links. The degree distribution exhibits a multiscaling behavior analogous to the the fitness model. This property is robust with respect to variations in the model, as long as links are assigned through effective preferential attachment. Beyond the degree distribution, in this paper we give a full characterization of the other relevant properties of the model. We evaluate the clustering coefficient and show that it disappears for large network size, a property shared with the Barabási-Albert model. Negative degree correlations are also present in this class of models, along with nontrivial mixing patterns among features. We therefore conclude that both small clustering coefficients and disassortative mixing are outcomes of the preferential attachment mechanism in general growing networks.

Linking Resting-State Networks in the Prefrontal Cortex to Executive Function: A Functional Near Infrared Spectroscopy Study.

PubMed

Zhao, Jia; Liu, Jiangang; Jiang, Xin; Zhou, Guifei; Chen, Guowei; Ding, Xiao P; Fu, Genyue; Lee, Kang

2016-01-01

Executive function (EF) plays vital roles in our everyday adaptation to the ever-changing environment. However, limited existing studies have linked EF to the resting-state brain activity. The functional connectivity in the resting state between the sub-regions of the brain can reveal the intrinsic neural mechanisms involved in cognitive processing of EF without disturbance from external stimuli. The present study investigated the relations between the behavioral executive function (EF) scores and the resting-state functional network topological properties in the Prefrontal Cortex (PFC). We constructed complex brain functional networks in the PFC from 90 healthy young adults using functional near infrared spectroscopy (fNIRS). We calculated the correlations between the typical network topological properties (regional topological properties and global topological properties) and the scores of both the Total EF and components of EF measured by computer-based Cambridge Neuropsychological Test Automated Battery (CANTAB). We found that the Total EF scores were positively correlated with regional properties in the right dorsal superior frontal gyrus (SFG), whereas the opposite pattern was found in the right triangular inferior frontal gyrus (IFG). Different EF components were related to different regional properties in various PFC areas, such as planning in the right middle frontal gyrus (MFG), working memory mainly in the right MFG and triangular IFG, short-term memory in the left dorsal SFG, and task switch in the right MFG. In contrast, there were no significant findings for global topological properties. Our findings suggested that the PFC plays an important role in individuals' behavioral performance in the executive function tasks. Further, the resting-state functional network can reveal the intrinsic neural mechanisms involved in behavioral EF abilities.

Structural Properties of the Brazilian Air Transportation Network.

PubMed

Couto, Guilherme S; da Silva, Ana Paula Couto; Ruiz, Linnyer B; Benevenuto, Fabrício

2015-09-01

The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City) is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.

Two three-dimensional coordination polymers of lead(II) with iminodiacetate and naphthalene-dicarboxylate anions: Synthesis, characterization and luminescence behavior

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hazari, Debdoot; Jana, Swapan Kumar; Fleck, Michel

2014-11-15

Two lead(II) compounds [Pb{sub 3}(idiac){sub 3}(phen){sub 2}(H{sub 2}O)]·2(H{sub 2}O) (1) and [Pb(ndc)]{sub n} (2), where H{sub 2}idiac=iminodiacetic acid, phen=1,10-phenanthroline and H{sub 2}ndc=naphthalene-2,6-dicarboxylic acid, have been synthesized and structurally characterized. Single crystal X-ray diffraction analysis showed that compound 1 is a discrete trinuclear complex (of two-fold symmetry) which evolves to a supramolecular 3D network via π–π interactions, while in compound 2 the naphthalene dicarboxylate anion act as a linker to form a three dimensional architecture, where the anion adopts a bis-(bidentate bridging) coordination mode connecting four Pb(II) centers. The photoluminescence property of the two complexes has been studied. - graphical abstract:more » Two new topologically different 1D coordination polymers formed by Pb{sub 4} clusters have been synthesized and characterized by x-ray analysis. The luminescence and thermal properties have been studied. - Highlights: • 1 is a trinuclear complex of Pb(II) growing to 3D network via weak interactions. • In 1, layers of (4,4) rhomboidal topology are identified. • In 2, the ndc anion adopts interesting bis-(bidentate bridging) coordination. • In 2, network is reinforced by C–H…π-ring interactions between the ndc rings.« less

Unlocking Proteomic Heterogeneity in Complex Diseases through Visual Analytics

PubMed Central

Bhavnani, Suresh K.; Dang, Bryant; Bellala, Gowtham; Divekar, Rohit; Visweswaran, Shyam; Brasier, Allan; Kurosky, Alex

2015-01-01

Despite years of preclinical development, biological interventions designed to treat complex diseases like asthma often fail in phase III clinical trials. These failures suggest that current methods to analyze biomedical data might be missing critical aspects of biological complexity such as the assumption that cases and controls come from homogeneous distributions. Here we discuss why and how methods from the rapidly evolving field of visual analytics can help translational teams (consisting of biologists, clinicians, and bioinformaticians) to address the challenge of modeling and inferring heterogeneity in the proteomic and phenotypic profiles of patients with complex diseases. Because a primary goal of visual analytics is to amplify the cognitive capacities of humans for detecting patterns in complex data, we begin with an overview of the cognitive foundations for the field of visual analytics. Next, we organize the primary ways in which a specific form of visual analytics called networks have been used to model and infer biological mechanisms, which help to identify the properties of networks that are particularly useful for the discovery and analysis of proteomic heterogeneity in complex diseases. We describe one such approach called subject-protein networks, and demonstrate its application on two proteomic datasets. This demonstration provides insights to help translational teams overcome theoretical, practical, and pedagogical hurdles for the widespread use of subject-protein networks for analyzing molecular heterogeneities, with the translational goal of designing biomarker-based clinical trials, and accelerating the development of personalized approaches to medicine. PMID:25684269

Reducing Neuronal Networks to Discrete Dynamics

PubMed Central

Terman, David; Ahn, Sungwoo; Wang, Xueying; Just, Winfried

2008-01-01

We consider a general class of purely inhibitory and excitatory-inhibitory neuronal networks, with a general class of network architectures, and characterize the complex firing patterns that emerge. Our strategy for studying these networks is to first reduce them to a discrete model. In the discrete model, each neuron is represented as a finite number of states and there are rules for how a neuron transitions from one state to another. In this paper, we rigorously demonstrate that the continuous neuronal model can be reduced to the discrete model if the intrinsic and synaptic properties of the cells are chosen appropriately. In a companion paper [1], we analyze the discrete model. PMID:18443649

Simulation of Grouting Process in Rock Masses Under a Dam Foundation Characterized by a 3D Fracture Network

NASA Astrophysics Data System (ADS)

Deng, Shaohui; Wang, Xiaoling; Yu, Jia; Zhang, Yichi; Liu, Zhen; Zhu, Yushan

2018-06-01

Grouting plays a crucial role in dam safety. Due to the concealment of grouting activities, complexity of fracture distribution in rock masses and rheological properties of cement grout, it is difficult to analyze the effects of grouting. In this paper, a computational fluid dynamics (CFD) simulation approach of dam foundation grouting based on a 3D fracture network model is proposed. In this approach, the 3D fracture network model, which is based on an improved bootstrap sampling method and established by VisualGeo software, can provide a reliable and accurate geometric model for CFD simulation of dam foundation grouting. Based on the model, a CFD simulation is performed, in which the Papanastasiou regularized model is used to express the grout rheological properties, and the volume of fluid technique is utilized to capture the grout fronts. Two sets of tests are performed to verify the effectiveness of the Papanastasiou regularized model. When applying the CFD simulation approach for dam foundation grouting, three technical issues can be solved: (1) collapsing potential of the fracture samples, (2) inconsistencies in the geometric model in actual fractures under complex geological conditions, and (3) inappropriate method of characterizing the rheological properties of cement grout. The applicability of the proposed approach is demonstrated by an illustrative case study—a hydropower station dam foundation in southwestern China.

Nanomechanics of layer-by-layer polyelectrolyte complexes: a manifestation of ionic cross-links and fixed charges.

PubMed

Han, Biao; Chery, Daphney R; Yin, Jie; Lu, X Lucas; Lee, Daeyeon; Han, Lin

2016-01-28

This study investigates the roles of two distinct features of ionically cross-linked polyelectrolyte networks - ionic cross-links and fixed charges - in determining their nanomechanical properties. The layer-by-layer assembled poly(allylamine hydrochloride)/poly(acrylic acid) (PAH/PAA) network is used as the model material. The densities of ionic cross-links and fixed charges are modulated through solution pH and ionic strength (IS), and the swelling ratio, elastic and viscoelastic properties are quantified via an array of atomic force microscopy (AFM)-based nanomechanical tools. The roles of ionic cross-links are underscored by the distinctive elastic and viscoelastic nanomechanical characters observed here. First, as ionic cross-links are highly sensitive to solution conditions, the instantaneous modulus, E0, exhibits orders-of-magnitude changes upon pH- and IS-governed swelling, distinctive from the rubber elasticity prediction based on permanent covalent cross-links. Second, ionic cross-links can break and self-re-form, and this mechanism dominates force relaxation of PAH/PAA under a constant indentation depth. In most states, the degree of relaxation is >90%, independent of ionic cross-link density. The importance of fixed charges is highlighted by the unexpectedly more elastic nature of the network despite low ionic cross-link density at pH 2.0, IS 0.01 M. Here, the complex is a net charged, loosely cross-linked, where the degree of relaxation is attenuated to ≈50% due to increased elastic contribution arising from fixed charge-induced Donnan osmotic pressure. In addition, this study develops a new method for quantifying the thickness of highly swollen polymer hydrogel films. It also underscores important technical considerations when performing nanomechanical tests on highly rate-dependent polymer hydrogel networks. These results provide new insights into the nanomechanical characters of ionic polyelectrolyte complexes, and lay the ground for further investigation of their unique time-dependent properties.

Probing coal architecture by magnetic resonance microscopy.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Botto, R. E.; Clifford, D. J.; Gregory, D. M.

1999-02-24

Time-resolved MRM investigations of a well-characterized suite of cross-linked polymers have yielded information on the nature of the solvent transport dynamics and mechanical relaxation of the networks. Network response parameters were then used to assess the macroscopic properties and cross-link densities of polymers with the degree of curing. This new approach is presently being developed to elucidate the complex macromolecular nature of coals and the variation with coal rank.

A systems biology model of the regulatory network in Populus leaves reveals interacting regulators and conserved regulation

PubMed Central

2011-01-01

Background Green plant leaves have always fascinated biologists as hosts for photosynthesis and providers of basic energy to many food webs. Today, comprehensive databases of gene expression data enable us to apply increasingly more advanced computational methods for reverse-engineering the regulatory network of leaves, and to begin to understand the gene interactions underlying complex emergent properties related to stress-response and development. These new systems biology methods are now also being applied to organisms such as Populus, a woody perennial tree, in order to understand the specific characteristics of these species. Results We present a systems biology model of the regulatory network of Populus leaves. The network is reverse-engineered from promoter information and expression profiles of leaf-specific genes measured over a large set of conditions related to stress and developmental. The network model incorporates interactions between regulators, such as synergistic and competitive relationships, by evaluating increasingly more complex regulatory mechanisms, and is therefore able to identify new regulators of leaf development not found by traditional genomics methods based on pair-wise expression similarity. The approach is shown to explain available gene function information and to provide robust prediction of expression levels in new data. We also use the predictive capability of the model to identify condition-specific regulation as well as conserved regulation between Populus and Arabidopsis. Conclusions We outline a computationally inferred model of the regulatory network of Populus leaves, and show how treating genes as interacting, rather than individual, entities identifies new regulators compared to traditional genomics analysis. Although systems biology models should be used with care considering the complexity of regulatory programs and the limitations of current genomics data, methods describing interactions can provide hypotheses about the underlying cause of emergent properties and are needed if we are to identify target genes other than those constituting the "low hanging fruit" of genomic analysis. PMID:21232107

Rheological and structural characterization of agar/whey proteins insoluble complexes.

PubMed

Rocha, Cristina M R; Souza, Hiléia K S; Magalhães, Natália F; Andrade, Cristina T; Gonçalves, Maria Pilar

2014-09-22

Complex coacervation between whey proteins and carboxylated or highly sulphated polysaccharides has been widely studied. The aim of this work was to characterise a slightly sulphated polysaccharide (agar) and whey protein insoluble complexes in terms of yield, composition and physicochemical properties as well as to study their rheological behaviour for better understanding their structure. Unlike other sulphated polysaccharides, complexation of agar and whey protein at pH 3 in the absence of a buffering agent resulted in a coacervate that was a gel at 20°C with rheological properties and structure similar to those of simple agar gels, reinforced by proteins electrostatically aggregated to the agar network. The behaviour towards heat treatment was similar to that of agar alone, with a high thermal hysteresis and almost full reversibility. In the presence of citrate buffer, the result was a "flocculated solid", with low water content (75-81%), whose properties were governed by protein behaviour. Copyright © 2014 Elsevier Ltd. All rights reserved.

Graph-based network analysis of resting-state functional MRI.

PubMed

Wang, Jinhui; Zuo, Xinian; He, Yong

2010-01-01

In the past decade, resting-state functional MRI (R-fMRI) measures of brain activity have attracted considerable attention. Based on changes in the blood oxygen level-dependent signal, R-fMRI offers a novel way to assess the brain's spontaneous or intrinsic (i.e., task-free) activity with both high spatial and temporal resolutions. The properties of both the intra- and inter-regional connectivity of resting-state brain activity have been well documented, promoting our understanding of the brain as a complex network. Specifically, the topological organization of brain networks has been recently studied with graph theory. In this review, we will summarize the recent advances in graph-based brain network analyses of R-fMRI signals, both in typical and atypical populations. Application of these approaches to R-fMRI data has demonstrated non-trivial topological properties of functional networks in the human brain. Among these is the knowledge that the brain's intrinsic activity is organized as a small-world, highly efficient network, with significant modularity and highly connected hub regions. These network properties have also been found to change throughout normal development, aging, and in various pathological conditions. The literature reviewed here suggests that graph-based network analyses are capable of uncovering system-level changes associated with different processes in the resting brain, which could provide novel insights into the understanding of the underlying physiological mechanisms of brain function. We also highlight several potential research topics in the future.

Colloid Surface Chemistry Critically Affects Multiple Particle Tracking Measurements of Biomaterials

PubMed Central

Valentine, M. T.; Perlman, Z. E.; Gardel, M. L.; Shin, J. H.; Matsudaira, P.; Mitchison, T. J.; Weitz, D. A.

2004-01-01

Characterization of the properties of complex biomaterials using microrheological techniques has the promise of providing fundamental insights into their biomechanical functions; however, precise interpretations of such measurements are hindered by inadequate characterization of the interactions between tracers and the networks they probe. We here show that colloid surface chemistry can profoundly affect multiple particle tracking measurements of networks of fibrin, entangled F-actin solutions, and networks of cross-linked F-actin. We present a simple protocol to render the surface of colloidal probe particles protein-resistant by grafting short amine-terminated methoxy-poly(ethylene glycol) to the surface of carboxylated microspheres. We demonstrate that these poly(ethylene glycol)-coated tracers adsorb significantly less protein than particles coated with bovine serum albumin or unmodified probe particles. We establish that varying particle surface chemistry selectively tunes the sensitivity of the particles to different physical properties of their microenvironments. Specifically, particles that are weakly bound to a heterogeneous network are sensitive to changes in network stiffness, whereas protein-resistant tracers measure changes in the viscosity of the fluid and in the network microstructure. We demonstrate experimentally that two-particle microrheology analysis significantly reduces differences arising from tracer surface chemistry, indicating that modifications of network properties near the particle do not introduce large-scale heterogeneities. Our results establish that controlling colloid-protein interactions is crucial to the successful application of multiple particle tracking techniques to reconstituted protein networks, cytoplasm, and cells. PMID:15189896

Evolutionary fields can explain patterns of high-dimensional complexity in ecology

NASA Astrophysics Data System (ADS)

Wilsenach, James; Landi, Pietro; Hui, Cang

2017-04-01

One of the properties that make ecological systems so unique is the range of complex behavioral patterns that can be exhibited by even the simplest communities with only a few species. Much of this complexity is commonly attributed to stochastic factors that have very high-degrees of freedom. Orthodox study of the evolution of these simple networks has generally been limited in its ability to explain complexity, since it restricts evolutionary adaptation to an inertia-free process with few degrees of freedom in which only gradual, moderately complex behaviors are possible. We propose a model inspired by particle-mediated field phenomena in classical physics in combination with fundamental concepts in adaptation, which suggests that small but high-dimensional chaotic dynamics near to the adaptive trait optimum could help explain complex properties shared by most ecological datasets, such as aperiodicity and pink, fractal noise spectra. By examining a simple predator-prey model and appealing to real ecological data, we show that this type of complexity could be easily confused for or confounded by stochasticity, especially when spurred on or amplified by stochastic factors that share variational and spectral properties with the underlying dynamics.

Percolation dans des reseaux realistes de nanostructures de carbone

NASA Astrophysics Data System (ADS)

Simoneau, Louis-Philippe

Carbon nanotubes have very interesting mechanical and electrical properties for various applications in electronics. They are highly resistant to deformation and can be excellent conductors or semiconductors. However, manipulating individual nanotubes to build structured devices remains very difficult. There is no method for controlling all of the electrical properties, the orientation and the spatial positioning of a large number of nanotubes. The fabrication of disordered networks of nanotubes is much easier, and these systems have a good electrical conductivity which makes them very interesting, especially as materials of transparent and flexible electrodes. There are three main methods of production used to make networks of nanotubes: the solution deposition, the direct growth on substrate and the embedding in a polymer matrix. The solution deposition method can form networks of various densities on a variety of substrates, the direct growth of nanotubes allows the creation of very clean networks on substrates such as SiO2, and the embedding in a polymer matrix can give composite volumes containing varying amounts of nanotubes. Many parameters such as the length of the tubes, their orientation or their tortuosity influence the properties of these networks and the presence of structural disorder complicates the understanding of their interactions. Predicting the properties of a network, such as conductivity, from a few characteristics such as size and density of the tubes can be difficult. This task becomes even more complex if one wants to identify the parameters that will optimize the performance of a device containing the material. We chose to address the carbon nanotube networks problem by developing a series of computer simulation tools that are mainly based on the Monte Carlo method. We take into account a large number of parameters to describe the characteristics of the networks, which allows for a more reliable representation of real networks as well as versatility in the choice of network components that can be simulated. The tools we have developed, grouped together in the RPH-HPN software Reseaux percolatifs hybrides - Hybrid Percolation Networks, construct random networks, detect contact between the tubes, translate the systems to equivalent electrical circuits and calculate global properties. An infinity of networks can have the same basic characteristics (size, diameter, etc.) and therefore the properties of a particular random network are not necessarily representative of the average properties of all networks. To obtain those general properties, we simulate a large number of random networks with the same basic characteristics and the average of the quantities is determined. The network constituent elements can be spheres, rods or snakes. The use of such geometries for network elements makes contact detection simple and quick, and more faithfully reproduce the form of carbon nanotubes. We closely monitor the geometrical and electrical properties of these elements through stochastic distributions of our choice. We can choose the length, diameter, orientation, chirality, tortuosity and impenetrable nature of the elements in order to properly reproduce real networks characteristics. We have considered statistical distribution functions that are rectangular, Gaussian, and Lorentzian, but all other distributions that can be expressed mathematically can also be envisioned. During the creation of a particular network, we generate the elements one by one. Each of their properties is sampled from a preselected distribution. Efficient algorithms used in various fields were adapted to our needs to manage the detection of contacts, clusters and percolation. In addition, we model more realistic contact between rigid nanotubes using an original method used to create the network that does not require a relaxation phase. Finally, we use Kirchhoff's laws to solve the equivalent electrical circuit conventionally. First, we evaluated the impact of a simplification widely used in other nanotube networks simulations studies. Values of the contact resistance at the junction between two nanotubes that are reported in the literature vary over a wide range, while almost all the simulations use a unique value for this parameter. Therefore, we assessed the effect of the presence of various stochastic distributions of contact resistances on the electrical properties of the networks. To do this, we used the experimental results of our collaborators in order to reproduce them by simulation. Our results show that, despite the existence of a wide range of contact resistance values, the nature of the statistical distribution has little impact on the conductivity obtained by simulation. Use of a single value for all connections of a network gives a total conductivity comparable to the experimental conductivity, and similar to that obtained using Gaussian, Lorentzian and uniform rectangular distributions. In fact, the dominant factor is not the type of distribution used to represent the resistance, but the central value of the distribution. Furthermore, we showed by studying bimodal distributions that the presence of lower resistance paths, even in small proportion, can rapidly increase the conductivity of the network. However, the type of stochastic distribution used to sample the spatial orientation of the nanotubes has a significant impact. We observed different behaviors for each of the three forms of distribution of orientation angles that we studied. In each case, a different distribution width maximize the conductivity of the networks. To optimize the conductivity, this distribution width, which is actually the deviation from the main direction, should in general be narrow. The formation of conductive paths is greatly enhanced in the presence of a majority of tubes closely aligned with the conduction direction and a small portion of tubes randomly aligned. The portion of misaligned tubes strongly contributes to the connectivity of nanotubes network by linking several clusters of aligned tubes. In order to increase the realism of our simulations, we also studied the influence of the interpenetrability of nanotubes on the electrical properties of networks. To do this, we describe the nanotubes with mutually impenetrable rigid cores that are surrounded by permeable shells. Thus, by varying the radius of the rigid cores, we have shown that a decrease in the interpenetrability of the nanotubes can increase the conductivity of the networks up to five orders of magnitude. We attribute this increase in conductivity to a greater connectivity of the nanotubes in the network. The more tubes are impenetrable, the more they push back against each other, and the better is the spreading of connected clusters in space. The second parameter on which we focused to improve the realism is the tortuosity of the nanotubes. We investigated the electrical properties of networks where the nanotubes are segmented into ten sections joined end to end. The angle between two consecutive segments is sampled from a uniform rectangular distribution and the variation of the bounds of this distribution allows us to vary the general tortuosity of the network. We observe that the more the tubes are tortuous, the higher the percolation threshold is, and the lower is the total conductivity. This can be nearly two orders of magnitude lower for networks with twisted tubes. We further note that the increase of the percolation threshold is attenuated when the wavy nanotubes have rigid cores. As part of our project, we have developed tools that, to the best of our knowledge, offer the best physical representation of nanotubes in a network of carbon nanotubes to date. This allowed us to study networks of complex geometries and measure the importance of the statistical distributions of parameters in optimizing the conductivity of networks. We have also established that the rigid tube-tube contacts and the nanotube tortuosity have strong impacts on the percolation threshold and conductivity. This work has demonstrated the importance of modeling for the understanding and the adequate description of complex processes, and the development needed to accurately reproduce the behavior of real systems. These tools can now be used to guide the creation of nanotube networks with targeted properties, and also to explore even more complex systems containing for example mixtures of nanotubes and quantum dots.

Inside the Mechanics of Network Development: How Competition and Strategy Reorganize European Air Traffic

NASA Technical Reports Server (NTRS)

Huber, Hans

2006-01-01

Air transport forms complex networks that can be measured in order to understand its structural characteristics and functional properties. Recent models for network growth (i.e., preferential attachment, etc.) remain stochastic and do not seek to understand other network-specific mechanisms that may account for their development in a more microscopic way. Air traffic is made up of many constituent airlines that are either privately or publicly owned and that operate their own networks. They follow more or less similar business policies each. The way these airline networks organize among themselves into distinct traffic distributions reveals complex interaction among them, which in turn can be aggregated into larger (macro-) traffic distributions. Our approach allows for a more deterministic methodology that will assess the impact of airline strategies on the distinct distributions for air traffic, particularly inside Europe. One key question this paper is seeking to answer is whether there are distinct patterns of preferential attachment for given classes of airline networks to distinct types of European airports. Conclusions about the advancing degree of concentration in this industry and the airline operators that accelerate this process can be drawn.

Topographical maps as complex networks

NASA Astrophysics Data System (ADS)

da Fontoura Costa, Luciano; Diambra, Luis

2005-02-01

The neuronal networks in the mammalian cortex are characterized by the coexistence of hierarchy, modularity, short and long range interactions, spatial correlations, and topographical connections. Particularly interesting, the latter type of organization implies special demands on developing systems in order to achieve precise maps preserving spatial adjacencies, even at the expense of isometry. Although the object of intensive biological research, the elucidation of the main anatomic-functional purposes of the ubiquitous topographical connections in the mammalian brain remains an elusive issue. The present work reports on how recent results from complex network formalism can be used to quantify and model the effect of topographical connections between neuronal cells over the connectivity of the network. While the topographical mapping between two cortical modules is achieved by connecting nearest cells from each module, four kinds of network models are adopted for implementing intramodular connections, including random, preferential-attachment, short-range, and long-range networks. It is shown that, though spatially uniform and simple, topographical connections between modules can lead to major changes in the network properties in some specific cases, depending on intramodular connections schemes, fostering more effective intercommunication between the involved neuronal cells and modules. The possible implications of such effects on cortical operation are discussed.

A clustering algorithm for determining community structure in complex networks

NASA Astrophysics Data System (ADS)

Jin, Hong; Yu, Wei; Li, ShiJun

2018-02-01

Clustering algorithms are attractive for the task of community detection in complex networks. DENCLUE is a representative density based clustering algorithm which has a firm mathematical basis and good clustering properties allowing for arbitrarily shaped clusters in high dimensional datasets. However, this method cannot be directly applied to community discovering due to its inability to deal with network data. Moreover, it requires a careful selection of the density parameter and the noise threshold. To solve these issues, a new community detection method is proposed in this paper. First, we use a spectral analysis technique to map the network data into a low dimensional Euclidean Space which can preserve node structural characteristics. Then, DENCLUE is applied to detect the communities in the network. A mathematical method named Sheather-Jones plug-in is chosen to select the density parameter which can describe the intrinsic clustering structure accurately. Moreover, every node on the network is meaningful so there were no noise nodes as a result the noise threshold can be ignored. We test our algorithm on both benchmark and real-life networks, and the results demonstrate the effectiveness of our algorithm over other popularity density based clustering algorithms adopted to community detection.

Antagonistic Phenomena in Network Dynamics

NASA Astrophysics Data System (ADS)

Motter, Adilson E.; Timme, Marc

2018-03-01

Recent research on the network modeling of complex systems has led to a convenient representation of numerous natural, social, and engineered systems that are now recognized as networks of interacting parts. Such systems can exhibit a wealth of phenomena that not only cannot be anticipated from merely examining their parts, as per the textbook definition of complexity, but also challenge intuition even when considered in the context of what is now known in network science. Here, we review the recent literature on two major classes of such phenomena that have far-reaching implications: (a) antagonistic responses to changes of states or parameters and (b) coexistence of seemingly incongruous behaviors or properties - both deriving from the collective and inherently decentralized nature of the dynamics. They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring across transport and supply networks. They also include remote synchronization, chimera states, and the converse of symmetry breaking in brain, power-grid, and oscillator networks as well as remote control in biological and bioinspired systems. By offering a unified view of these various scenarios, we suggest that they are representative of a yet broader class of unprecedented network phenomena that ought to be revealed and explained by future research.

Google matrix analysis of directed networks

NASA Astrophysics Data System (ADS)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2015-10-01

In the past decade modern societies have developed enormous communication and social networks. Their classification and information retrieval processing has become a formidable task for the society. Because of the rapid growth of the World Wide Web, and social and communication networks, new mathematical methods have been invented to characterize the properties of these networks in a more detailed and precise way. Various search engines extensively use such methods. It is highly important to develop new tools to classify and rank a massive amount of network information in a way that is adapted to internal network structures and characteristics. This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency using various examples including the World Wide Web, Wikipedia, software architectures, world trade, social and citation networks, brain neural networks, DNA sequences, and Ulam networks. The analytical and numerical matrix methods used in this analysis originate from the fields of Markov chains, quantum chaos, and random matrix theory.

Cross over of recurrence networks to random graphs and random geometric graphs

NASA Astrophysics Data System (ADS)

Jacob, Rinku; Harikrishnan, K. P.; Misra, R.; Ambika, G.

2017-02-01

Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability density variations of the representative attractor from which it is constructed. Here we numerically investigate the properties of recurrence networks from standard low-dimensional chaotic attractors using some basic network measures and show how the recurrence networks are different from random and scale-free networks. In particular, we show that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to the time series and into the classical random graphs by increasing the range of interaction to the system size. We also highlight the effectiveness of a combined plot of characteristic path length and clustering coefficient in capturing the small changes in the network characteristics.

Network Security Validation Using Game Theory

NASA Astrophysics Data System (ADS)

Papadopoulou, Vicky; Gregoriades, Andreas

Non-functional requirements (NFR) such as network security recently gained widespread attention in distributed information systems. Despite their importance however, there is no systematic approach to validate these requirements given the complexity and uncertainty characterizing modern networks. Traditionally, network security requirements specification has been the results of a reactive process. This however, limited the immunity property of the distributed systems that depended on these networks. Security requirements specification need a proactive approach. Networks' infrastructure is constantly under attack by hackers and malicious software that aim to break into computers. To combat these threats, network designers need sophisticated security validation techniques that will guarantee the minimum level of security for their future networks. This paper presents a game-theoretic approach to security requirements validation. An introduction to game theory is presented along with an example that demonstrates the application of the approach.

Computational neural networks in chemistry: Model free mapping devices for predicting chemical reactivity from molecular structure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Elrod, D.W.

1992-01-01

Computational neural networks (CNNs) are a computational paradigm inspired by the brain's massively parallel network of highly interconnected neurons. The power of computational neural networks derives not so much from their ability to model the brain as from their ability to learn by example and to map highly complex, nonlinear functions, without the need to explicitly specify the functional relationship. Two central questions about CNNs were investigated in the context of predicting chemical reactions: (1) the mapping properties of neural networks and (2) the representation of chemical information for use in CNNs. Chemical reactivity is here considered an example ofmore » a complex, nonlinear function of molecular structure. CNN's were trained using modifications of the back propagation learning rule to map a three dimensional response surface similar to those typically observed in quantitative structure-activity and structure-property relationships. The computational neural network's mapping of the response surface was found to be robust to the effects of training sample size, noisy data and intercorrelated input variables. The investigation of chemical structure representation led to the development of a molecular structure-based connection-table representation suitable for neural network training. An extension of this work led to a BE-matrix structure representation that was found to be general for several classes of reactions. The CNN prediction of chemical reactivity and regiochemistry was investigated for electrophilic aromatic substitution reactions, Markovnikov addition to alkenes, Saytzeff elimination from haloalkanes, Diels-Alder cycloaddition, and retro Diels-Alder ring opening reactions using these connectivity-matrix derived representations. The reaction predictions made by the CNNs were more accurate than those of an expert system and were comparable to predictions made by chemists.« less

Prospects for Classifying Complex Imagery Using a Self-Organizing Neural Network

DTIC Science & Technology

1989-01-11

complex imagery. In his original re- port, Fukushima demonstrated that this system could discriminate between simple alphabetical characters...on a VAX-8600 minicomputer. Wire frame models of three different vehicles were used to test the properties which Fukushima had demonstrated. The...Table No. Page 3-1 Parameters for Training on Three Input Images 14 3-2 Trained Results 17 vn 1. INTRODUCTION The Neocognitron of Fukushima [2

Understanding the implementation of evidence-based care: a structural network approach.

PubMed

Parchman, Michael L; Scoglio, Caterina M; Schumm, Phillip

2011-02-24

Recent study of complex networks has yielded many new insights into phenomenon such as social networks, the internet, and sexually transmitted infections. The purpose of this analysis is to examine the properties of a network created by the 'co-care' of patients within one region of the Veterans Health Affairs. Data were obtained for all outpatient visits from 1 October 2006 to 30 September 2008 within one large Veterans Integrated Service Network. Types of physician within each clinic were nodes connected by shared patients, with a weighted link representing the number of shared patients between each connected pair. Network metrics calculated included edge weights, node degree, node strength, node coreness, and node betweenness. Log-log plots were used to examine the distribution of these metrics. Sizes of k-core networks were also computed under multiple conditions of node removal. There were 4,310,465 encounters by 266,710 shared patients between 722 provider types (nodes) across 41 stations or clinics resulting in 34,390 edges. The number of other nodes to which primary care provider nodes have a connection (172.7) is 42% greater than that of general surgeons and two and one-half times as high as cardiology. The log-log plot of the edge weight distribution appears to be linear in nature, revealing a 'scale-free' characteristic of the network, while the distributions of node degree and node strength are less so. The analysis of the k-core network sizes under increasing removal of primary care nodes shows that about 10 most connected primary care nodes play a critical role in keeping the k-core networks connected, because their removal disintegrates the highest k-core network. Delivery of healthcare in a large healthcare system such as that of the US Department of Veterans Affairs (VA) can be represented as a complex network. This network consists of highly connected provider nodes that serve as 'hubs' within the network, and demonstrates some 'scale-free' properties. By using currently available tools to explore its topology, we can explore how the underlying connectivity of such a system affects the behavior of providers, and perhaps leverage that understanding to improve quality and outcomes of care.

Rearrangement moves on rooted phylogenetic networks

PubMed Central

Gambette, Philippe; van Iersel, Leo; Jones, Mark; Scornavacca, Celine

2017-01-01

Phylogenetic tree reconstruction is usually done by local search heuristics that explore the space of the possible tree topologies via simple rearrangements of their structure. Tree rearrangement heuristics have been used in combination with practically all optimization criteria in use, from maximum likelihood and parsimony to distance-based principles, and in a Bayesian context. Their basic components are rearrangement moves that specify all possible ways of generating alternative phylogenies from a given one, and whose fundamental property is to be able to transform, by repeated application, any phylogeny into any other phylogeny. Despite their long tradition in tree-based phylogenetics, very little research has gone into studying similar rearrangement operations for phylogenetic network—that is, phylogenies explicitly representing scenarios that include reticulate events such as hybridization, horizontal gene transfer, population admixture, and recombination. To fill this gap, we propose “horizontal” moves that ensure that every network of a certain complexity can be reached from any other network of the same complexity, and “vertical” moves that ensure reachability between networks of different complexities. When applied to phylogenetic trees, our horizontal moves—named rNNI and rSPR—reduce to the best-known moves on rooted phylogenetic trees, nearest-neighbor interchange and rooted subtree pruning and regrafting. Besides a number of reachability results—separating the contributions of horizontal and vertical moves—we prove that rNNI moves are local versions of rSPR moves, and provide bounds on the sizes of the rNNI neighborhoods. The paper focuses on the most biologically meaningful versions of phylogenetic networks, where edges are oriented and reticulation events clearly identified. Moreover, our rearrangement moves are robust to the fact that networks with higher complexity usually allow a better fit with the data. Our goal is to provide a solid basis for practical phylogenetic network reconstruction. PMID:28763439

Extracting Communities from Complex Networks by the k-Dense Method

NASA Astrophysics Data System (ADS)

Saito, Kazumi; Yamada, Takeshi; Kazama, Kazuhiro

To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it produces only coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the three different types of networks assembled from real data, namely, from blog trackbacks, word associations and Wikipedia references, and demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Polettini, M., E-mail: matteo.polettini@uni.lu; Wachtel, A., E-mail: artur.wachtel@uni.lu; Esposito, M., E-mail: massimilano.esposito@uni.lu

We study the effect of intrinsic noise on the thermodynamic balance of complex chemical networks subtending cellular metabolism and gene regulation. A topological network property called deficiency, known to determine the possibility of complex behavior such as multistability and oscillations, is shown to also characterize the entropic balance. In particular, when deficiency is zero the average stochastic dissipation rate equals that of the corresponding deterministic model, where correlations are disregarded. In fact, dissipation can be reduced by the effect of noise, as occurs in a toy model of metabolism that we employ to illustrate our findings. This phenomenon highlights thatmore » there is a close interplay between deficiency and the activation of new dissipative pathways at low molecule numbers.« less

The development of Human Functional Brain Networks

PubMed Central

Power, Jonathan D; Fair, Damien A; Schlaggar, Bradley L

2010-01-01

Recent advances in MRI technology have enabled precise measurements of correlated activity throughout the brain, leading to the first comprehensive descriptions of functional brain networks in humans. This article reviews the growing literature on the development of functional networks, from infancy through adolescence, as measured by resting state functional connectivity MRI. We note several limitations of traditional approaches to describing brain networks, and describe a powerful framework for analyzing networks, called graph theory. We argue that characterization of the development of brain systems (e.g. the default mode network) should be comprehensive, considering not only relationships within a given system, but also how these relationships are situated within wider network contexts. We note that, despite substantial reorganization of functional connectivity, several large-scale network properties appear to be preserved across development, suggesting that functional brain networks, even in children, are organized in manners similar to other complex systems. PMID:20826306

Empirical investigation of topological and weighted properties of a bus transport network from China

NASA Astrophysics Data System (ADS)

Shu-Min, Feng; Bao-Yu, Hu; Cen, Nie; Xiang-Hao, Shen; Yu-Sheng, Ci

2016-03-01

Many bus transport networks (BTNs) have evolved into directed networks. A new representation model for BTNs is proposed, called directed-space P. The bus transport network of Harbin (BTN-H) is described as a directed and weighted complex network by the proposed representation model and by giving each node weights. The topological and weighted properties are revealed in detail. In-degree and out-degree distributions, in-weight and out-weight distributions are presented as an exponential law, respectively. There is a strong relation between in-weight and in-degree (also between out-weight and out-degree), which can be fitted by a power function. Degree-degree and weight-weight correlations are investigated to reveal that BTN-H has a disassortative behavior as the nodes have relatively high degree (or weight). The disparity distributions of out-degree and in-degree follow an approximate power-law. Besides, the node degree shows a near linear increase with the number of routes that connect to the corresponding station. These properties revealed in this paper can help public transport planners to analyze the status quo of the BTN in nature. Project supported by the National High Technology Research and Development Program of China (Grant No. 2014AA110304).

Engineering highly organized and aligned single walled carbon nanotube networks for electronic device applications: Interconnects, chemical sensor, and optoelectronics

NASA Astrophysics Data System (ADS)

Kim, Young Lae

For 20 years, single walled carbon nanotubes (SWNTs) have been studied actively due to their unique one-dimensional nanostructure and superior electrical, thermal, and mechanical properties. For these reasons, they offer the potential to serve as building blocks for future electronic devices such as field effect transistors (FETs), electromechanical devices, and various sensors. In order to realize these applications, it is crucial to develop a simple, scalable, and reliable nanomanufacturing process that controllably places aligned SWNTs in desired locations, orientations, and dimensions. Also electronic properties (semiconducting/metallic) of SWNTs and their organized networks must be controlled for the desired performance of devices and systems. These fundamental challenges are significantly limiting the use of SWNTs for future electronic device applications. Here, we demonstrate a strategy to fabricate highly controlled micro/nanoscale SWNT network structures and present the related assembly mechanism to engineer the SWNT network topology and its electrical transport properties. A method designed to evaluate the electrical reliability of such nano- and microscale SWNT networks is also presented. Moreover, we develop and investigate a robust SWNT based multifunctional selective chemical sensor and a range of multifunctional optoelectronic switches, photo-transistors, optoelectronic logic gates and complex optoelectronic digital circuits.

Learning free energy landscapes using artificial neural networks.

PubMed

Sidky, Hythem; Whitmer, Jonathan K

2018-03-14

Existing adaptive bias techniques, which seek to estimate free energies and physical properties from molecular simulations, are limited by their reliance on fixed kernels or basis sets which hinder their ability to efficiently conform to varied free energy landscapes. Further, user-specified parameters are in general non-intuitive yet significantly affect the convergence rate and accuracy of the free energy estimate. Here we propose a novel method, wherein artificial neural networks (ANNs) are used to develop an adaptive biasing potential which learns free energy landscapes. We demonstrate that this method is capable of rapidly adapting to complex free energy landscapes and is not prone to boundary or oscillation problems. The method is made robust to hyperparameters and overfitting through Bayesian regularization which penalizes network weights and auto-regulates the number of effective parameters in the network. ANN sampling represents a promising innovative approach which can resolve complex free energy landscapes in less time than conventional approaches while requiring minimal user input.

Learning free energy landscapes using artificial neural networks

NASA Astrophysics Data System (ADS)

Sidky, Hythem; Whitmer, Jonathan K.

2018-03-01

Existing adaptive bias techniques, which seek to estimate free energies and physical properties from molecular simulations, are limited by their reliance on fixed kernels or basis sets which hinder their ability to efficiently conform to varied free energy landscapes. Further, user-specified parameters are in general non-intuitive yet significantly affect the convergence rate and accuracy of the free energy estimate. Here we propose a novel method, wherein artificial neural networks (ANNs) are used to develop an adaptive biasing potential which learns free energy landscapes. We demonstrate that this method is capable of rapidly adapting to complex free energy landscapes and is not prone to boundary or oscillation problems. The method is made robust to hyperparameters and overfitting through Bayesian regularization which penalizes network weights and auto-regulates the number of effective parameters in the network. ANN sampling represents a promising innovative approach which can resolve complex free energy landscapes in less time than conventional approaches while requiring minimal user input.

Analysis of Context Dependence in Social Interaction Networks of a Massively Multiplayer Online Role-Playing Game

PubMed Central

Son, Seokshin; Kang, Ah Reum; Kim, Hyun-chul; Kwon, Taekyoung; Park, Juyong; Kim, Huy Kang

2012-01-01

Rapid advances in modern computing and information technology have enabled millions of people to interact online via various social network and gaming services. The widespread adoption of such online services have made possible analysis of large-scale archival data containing detailed human interactions, presenting a very promising opportunity to understand the rich and complex human behavior. In collaboration with a leading global provider of Massively Multiplayer Online Role-Playing Games (MMORPGs), here we present a network science-based analysis of the interplay between distinct types of user interaction networks in the virtual world. We find that their properties depend critically on the nature of the context-interdependence of the interactions, highlighting the complex and multilayered nature of human interactions, a robust understanding of which we believe may prove instrumental in the designing of more realistic future virtual arenas as well as provide novel insights to the science of collective human behavior. PMID:22496771

The diminishing role of hubs in dynamical processes on complex networks.

PubMed

Quax, Rick; Apolloni, Andrea; Sloot, Peter M A

2013-11-06

It is notoriously difficult to predict the behaviour of a complex self-organizing system, where the interactions among dynamical units form a heterogeneous topology. Even if the dynamics of each microscopic unit is known, a real understanding of their contributions to the macroscopic system behaviour is still lacking. Here, we develop information-theoretical methods to distinguish the contribution of each individual unit to the collective out-of-equilibrium dynamics. We show that for a system of units connected by a network of interaction potentials with an arbitrary degree distribution, highly connected units have less impact on the system dynamics when compared with intermediately connected units. In an equilibrium setting, the hubs are often found to dictate the long-term behaviour. However, we find both analytically and experimentally that the instantaneous states of these units have a short-lasting effect on the state trajectory of the entire system. We present qualitative evidence of this phenomenon from empirical findings about a social network of product recommendations, a protein-protein interaction network and a neural network, suggesting that it might indeed be a widespread property in nature.

Backbone of complex networks of corporations: the flow of control.

PubMed

Glattfelder, J B; Battiston, S

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Between “design” and “bricolage”: Genetic networks, levels of selection, and adaptive evolution

PubMed Central

Wilkins, Adam S.

2007-01-01

The extent to which “developmental constraints” in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a “network perspective” may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed. PMID:17494754

Between "design" and "bricolage": genetic networks, levels of selection, and adaptive evolution.

PubMed

Wilkins, Adam S

2007-05-15

The extent to which "developmental constraints" in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a "network perspective" may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed.

Steady-state distributions of probability fluxes on complex networks

NASA Astrophysics Data System (ADS)

Chełminiak, Przemysław; Kurzyński, Michał

2017-02-01

We consider a simple model of the Markovian stochastic dynamics on complex networks to examine the statistical properties of the probability fluxes. The additional transition, called hereafter a gate, powered by the external constant force breaks a detailed balance in the network. We argue, using a theoretical approach and numerical simulations, that the stationary distributions of the probability fluxes emergent under such conditions converge to the Gaussian distribution. By virtue of the stationary fluctuation theorem, its standard deviation depends directly on the square root of the mean flux. In turn, the nonlinear relation between the mean flux and the external force, which provides the key result of the present study, allows us to calculate the two parameters that entirely characterize the Gaussian distribution of the probability fluxes both close to as well as far from the equilibrium state. Also, the other effects that modify these parameters, such as the addition of shortcuts to the tree-like network, the extension and configuration of the gate and a change in the network size studied by means of computer simulations are widely discussed in terms of the rigorous theoretical predictions.

Backbone of complex networks of corporations: The flow of control

NASA Astrophysics Data System (ADS)

Glattfelder, J. B.; Battiston, S.

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Exploring the topological sources of robustness against invasion in biological and technological networks.

PubMed

Alcalde Cuesta, Fernando; González Sequeiros, Pablo; Lozano Rojo, Álvaro

2016-02-10

For a network, the accomplishment of its functions despite perturbations is called robustness. Although this property has been extensively studied, in most cases, the network is modified by removing nodes. In our approach, it is no longer perturbed by site percolation, but evolves after site invasion. The process transforming resident/healthy nodes into invader/mutant/diseased nodes is described by the Moran model. We explore the sources of robustness (or its counterpart, the propensity to spread favourable innovations) of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome. We compare them to three modular and non-modular benchmark networks, and samples of one thousand random networks with the same degree distribution. It is found that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. While community detection techniques are able to detect the existence of a central core in Internet2, they are not effective in detecting hierarchical structures whose topological complexity arises from the repetition of a few rules. Box counting dimension and Rent's rule are applied to show a subtle trade-off between topological and wiring complexity.

Emergence of communities and diversity in social networks

PubMed Central

Han, Xiao; Cao, Shinan; Shen, Zhesi; Zhang, Boyu; Wang, Wen-Xu; Cressman, Ross

2017-01-01

Communities are common in complex networks and play a significant role in the functioning of social, biological, economic, and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social networks is still lacking. Addressing this fundamental problem is of paramount importance in understanding, predicting, and controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here, we answer this question using the ultimatum game, which has been a paradigm for characterizing altruism and fairness. We experimentally show that stable local communities with different internal agreements emerge spontaneously and induce social diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community leaders. This result indicates that networks are significant in the emergence and stabilization of communities and social diversity. Our experimental results also provide valuable information about strategies for developing network models and theories of evolutionary games and social dynamics. PMID:28235785

Exploring the topological sources of robustness against invasion in biological and technological networks

PubMed Central

Alcalde Cuesta, Fernando; González Sequeiros, Pablo; Lozano Rojo, Álvaro

2016-01-01

For a network, the accomplishment of its functions despite perturbations is called robustness. Although this property has been extensively studied, in most cases, the network is modified by removing nodes. In our approach, it is no longer perturbed by site percolation, but evolves after site invasion. The process transforming resident/healthy nodes into invader/mutant/diseased nodes is described by the Moran model. We explore the sources of robustness (or its counterpart, the propensity to spread favourable innovations) of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome. We compare them to three modular and non-modular benchmark networks, and samples of one thousand random networks with the same degree distribution. It is found that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. While community detection techniques are able to detect the existence of a central core in Internet2, they are not effective in detecting hierarchical structures whose topological complexity arises from the repetition of a few rules. Box counting dimension and Rent’s rule are applied to show a subtle trade-off between topological and wiring complexity. PMID:26861189

Modeling the diffusion of complex innovations as a process of opinion formation through social networks.

PubMed

Assenova, Valentina A

2018-01-01

Complex innovations- ideas, practices, and technologies that hold uncertain benefits for potential adopters-often vary in their ability to diffuse in different communities over time. To explain why, I develop a model of innovation adoption in which agents engage in naïve (DeGroot) learning about the value of an innovation within their social networks. Using simulations on Bernoulli random graphs, I examine how adoption varies with network properties and with the distribution of initial opinions and adoption thresholds. The results show that: (i) low-density and high-asymmetry networks produce polarization in influence to adopt an innovation over time, (ii) increasing network density and asymmetry promote adoption under a variety of opinion and threshold distributions, and (iii) the optimal levels of density and asymmetry in networks depend on the distribution of thresholds: networks with high density (>0.25) and high asymmetry (>0.50) are optimal for maximizing diffusion when adoption thresholds are right-skewed (i.e., barriers to adoption are low), but networks with low density (<0.01) and low asymmetry (<0.25) are optimal when thresholds are left-skewed. I draw on data from a diffusion field experiment to predict adoption over time and compare the results to observed outcomes.

Machine learning framework for analysis of transport through complex networks in porous, granular media: A focus on permeability

NASA Astrophysics Data System (ADS)

van der Linden, Joost H.; Narsilio, Guillermo A.; Tordesillas, Antoinette

2016-08-01

We present a data-driven framework to study the relationship between fluid flow at the macroscale and the internal pore structure, across the micro- and mesoscales, in porous, granular media. Sphere packings with varying particle size distribution and confining pressure are generated using the discrete element method. For each sample, a finite element analysis of the fluid flow is performed to compute the permeability. We construct a pore network and a particle contact network to quantify the connectivity of the pores and particles across the mesoscopic spatial scales. Machine learning techniques for feature selection are employed to identify sets of microstructural properties and multiscale complex network features that optimally characterize permeability. We find a linear correlation (in log-log scale) between permeability and the average closeness centrality of the weighted pore network. With the pore network links weighted by the local conductance, the average closeness centrality represents a multiscale measure of efficiency of flow through the pore network in terms of the mean geodesic distance (or shortest path) between all pore bodies in the pore network. Specifically, this study objectively quantifies a hypothesized link between high permeability and efficient shortest paths that thread through relatively large pore bodies connected to each other by high conductance pore throats, embodying connectivity and pore structure.

Emergence of communities and diversity in social networks.

PubMed

Han, Xiao; Cao, Shinan; Shen, Zhesi; Zhang, Boyu; Wang, Wen-Xu; Cressman, Ross; Stanley, H Eugene

2017-03-14

Communities are common in complex networks and play a significant role in the functioning of social, biological, economic, and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social networks is still lacking. Addressing this fundamental problem is of paramount importance in understanding, predicting, and controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here, we answer this question using the ultimatum game, which has been a paradigm for characterizing altruism and fairness. We experimentally show that stable local communities with different internal agreements emerge spontaneously and induce social diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community leaders. This result indicates that networks are significant in the emergence and stabilization of communities and social diversity. Our experimental results also provide valuable information about strategies for developing network models and theories of evolutionary games and social dynamics.

Topological Principles of Control in Dynamical Networks

NASA Astrophysics Data System (ADS)

Kim, Jason; Pasqualetti, Fabio; Bassett, Danielle

Networked biological systems, such as the brain, feature complex patterns of interactions. To predict and correct the dynamic behavior of such systems, it is imperative to understand how the underlying topological structure affects and limits the function of the system. Here, we use network control theory to extract topological features that favor or prevent network controllability, and to understand the network-wide effect of external stimuli on large-scale brain systems. Specifically, we treat each brain region as a dynamic entity with real-valued state, and model the time evolution of all interconnected regions using linear, time-invariant dynamics. We propose a simplified feed-forward scheme where the effect of upstream regions (drivers) on the connected downstream regions (non-drivers) is characterized in closed-form. Leveraging this characterization of the simplified model, we derive topological features that predict the controllability properties of non-simplified networks. We show analytically and numerically that these predictors are accurate across a large range of parameters. Among other contributions, our analysis shows that heterogeneity in the network weights facilitate controllability, and allows us to implement targeted interventions that profoundly improve controllability. By assuming an underlying dynamical mechanism, we are able to understand the complex topology of networked biological systems in a functionally meaningful way.

Network topology analysis approach on China's QFII stock investment behavior

NASA Astrophysics Data System (ADS)

Zhang, Yongjie; Cao, Xing; He, Feng; Zhang, Wei

2017-05-01

In this paper, the investment behavior of QFII in China stock market from 2004 to 2015 is studied with the network topology method. Based on the nodes topological characteristics, stock holding fluctuations correlation is studied from the micro network level. We conclude that the QFII mutual stock holding network have both scale free and small world properties, which presented mainly small world characteristics from 2005 to 2011, and scale free characteristics from 2012 to 2015. Moreover, fluctuations correlation is different with different nodes topological characteristics. In different economic periods, QFII represented different connection patterns and they reacted to the market crash spontaneously. Thus, this paper provides the first evidence of complex network research on QFII' investment behavior in China as an emerging market.

Neural network potential for Al-Mg-Si alloys

NASA Astrophysics Data System (ADS)

Kobayashi, Ryo; Giofré, Daniele; Junge, Till; Ceriotti, Michele; Curtin, William A.

2017-10-01

The 6000 series Al alloys, which include a few percent of Mg and Si, are important in automotive and aviation industries because of their low weight, as compared to steels, and the fact their strength can be greatly improved through engineered precipitation. To enable atomistic-level simulations of both the processing and performance of this important alloy system, a neural network (NN) potential for the ternary Al-Mg-Si has been created. Training of the NN uses an extensive database of properties computed using first-principles density functional theory, including complex precipitate phases in this alloy. The NN potential accurately reproduces most of the pure Al properties relevant to the mechanical behavior as well as heat of solution, solute-solute, and solute-vacancy interaction energies, and formation energies of small solute clusters and precipitates that are required for modeling the early stage of precipitation and mechanical strengthening. This success not only enables future detailed studies of Al-Mg-Si but also highlights the ability of NN methods to generate useful potentials in complex alloy systems.

Single Sublattice Endotaxial Phase Separation Driven by Charge Frustration in a Complex Oxide

PubMed Central

2013-01-01

Complex transition-metal oxides are important functional materials in areas such as energy and information storage. The cubic ABO3 perovskite is an archetypal example of this class, formed by the occupation of small octahedral B-sites within an AO3 network defined by larger A cations. We show that introduction of chemically mismatched octahedral cations into a cubic perovskite oxide parent phase modifies structure and composition beyond the unit cell length scale on the B sublattice alone. This affords an endotaxial nanocomposite of two cubic perovskite phases with distinct properties. These locally B-site cation-ordered and -disordered phases share a single AO3 network and have enhanced stability against the formation of a competing hexagonal structure over the single-phase parent. Synergic integration of the distinct properties of these phases by the coherent interfaces of the composite produces solid oxide fuel cell cathode performance superior to that expected from the component phases in isolation. PMID:23750709

Understanding the complexity of human gait dynamics

NASA Astrophysics Data System (ADS)

Scafetta, Nicola; Marchi, Damiano; West, Bruce J.

2009-06-01

Time series of human gait stride intervals exhibit fractal and multifractal properties under several conditions. Records from subjects walking at normal, slow, and fast pace speed are analyzed to determine changes in the fractal scalings as a function of the stress condition of the system. Records from subjects with different age from children to elderly and patients suffering from neurodegenerative disease are analyzed to determine changes in the fractal scalings as a function of the physical maturation or degeneration of the system. A supercentral pattern generator model is presented to simulate the above two properties that are typically found in dynamical network performance: that is, how a dynamical network responds to stress and to evolution.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Visweswara Sathanur, Arun; Choudhury, Sutanay; Joslyn, Cliff A.

Property graphs can be used to represent heterogeneous networks with attributed vertices and edges. Given one property graph, simulating another graph with same or greater size with identical statistical properties with respect to the attributes and connectivity is critical for privacy preservation and benchmarking purposes. In this work we tackle the problem of capturing the statistical dependence of the edge connectivity on the vertex labels and using the same distribution to regenerate property graphs of the same or expanded size in a scalable manner. However, accurate simulation becomes a challenge when the attributes do not completely explain the network structure.more » We propose the Property Graph Model (PGM) approach that uses an attribute (or label) augmentation strategy to mitigate the problem and preserve the graph connectivity as measured via degree distribution, vertex label distributions and edge connectivity. Our proposed algorithm is scalable with a linear complexity in the number of edges in the target graph. We illustrate the efficacy of the PGM approach in regenerating and expanding the datasets by leveraging two distinct illustrations.« less

Mandala Networks: ultra-small-world and highly sparse graphs

PubMed Central

Sampaio Filho, Cesar I. N.; Moreira, André A.; Andrade, Roberto F. S.; Herrmann, Hans J.; Andrade, José S.

2015-01-01

The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks. PMID:25765450

Differential network entropy reveals cancer system hallmarks

PubMed Central

West, James; Bianconi, Ginestra; Severini, Simone; Teschendorff, Andrew E.

2012-01-01

The cellular phenotype is described by a complex network of molecular interactions. Elucidating network properties that distinguish disease from the healthy cellular state is therefore of critical importance for gaining systems-level insights into disease mechanisms and ultimately for developing improved therapies. By integrating gene expression data with a protein interaction network we here demonstrate that cancer cells are characterised by an increase in network entropy. In addition, we formally demonstrate that gene expression differences between normal and cancer tissue are anticorrelated with local network entropy changes, thus providing a systemic link between gene expression changes at the nodes and their local correlation patterns. In particular, we find that genes which drive cell-proliferation in cancer cells and which often encode oncogenes are associated with reductions in network entropy. These findings may have potential implications for identifying novel drug targets. PMID:23150773

Epigenetics and Why Biological Networks are More Controllable than Expected

NASA Astrophysics Data System (ADS)

Motter, Adilson

2013-03-01

A fundamental property of networks is that perturbations to one node can affect other nodes, potentially causing the entire system to change behavior or fail. In this talk, I will show that it is possible to exploit this same principle to control network behavior. This approach takes advantage of the nonlinear dynamics inherent to real networks, and allows bringing the system to a desired target state even when this state is not directly accessible or the linear counterpart is not controllable. Applications show that this framework permits both reprogramming a network to a desired task as well as rescuing networks from the brink of failure, which I will illustrate through various biological problems. I will also briefly review the progress our group has made over the past 5 years on related control of complex networks in non-biological domains.

Chinese Mainland Movie Network

NASA Astrophysics Data System (ADS)

Liu, Ai-Fen; Xue, Yu-Hua; He, Da-Ren

2008-03-01

We propose describing a large kind of cooperation-competition networks by bipartite graphs and their unipartite projections. In the graphs the topological structure describe the cooperation-competition configuration of the basic elements, and the vertex weight describe their different roles in cooperation or results of competition. This complex network description may be helpful for finding and understanding common properties of cooperation-competition systems. In order to show an example, we performed an empirical investigation on the movie cooperation-competition network within recent 80 years in the Chinese mainland. In the net the movies are defined as nodes, and two nodes are connected by a link if a common main movie actor performs in them. The edge represents the competition relationship between two movies for more audience among a special audience colony. We obtained the statistical properties, such as the degree distribution, act degree distribution, act size distribution, and distribution of the total node weight, and explored the influence factors of Chinese mainland movie competition intensity.

Flow networks for Ocean currents

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Molkenthin, Nora; Marwan, Norbert; Kurths, Jürgen

2014-05-01

Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e., by its high computational complexity, we here introduce a new, discrete construction of flow-networks, which is then applied to static and dynamic velocity fields. Analyzing the flow-networks of prototypical flows we find that our approach can highlight the zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. We also apply the method to time series data of the Equatorial Pacific Ocean Current and the Gulf Stream ocean current for the changing velocity fields, which could not been done before, and analyse the properties of the dynamical system. Flow-networks can be powerful tools to theoretically understand the step from system's dynamics to network's topology that can be analyzed using network measures and is used for shading light on different climatic phenomena.

Network Analysis of Protein Adaptation: Modeling the Functional Impact of Multiple Mutations

PubMed Central

Beleva Guthrie, Violeta; Masica, David L; Fraser, Andrew; Federico, Joseph; Fan, Yunfan; Camps, Manel; Karchin, Rachel

2018-01-01

Abstract The evolution of new biochemical activities frequently involves complex dependencies between mutations and rapid evolutionary radiation. Mutation co-occurrence and covariation have previously been used to identify compensating mutations that are the result of physical contacts and preserve protein function and fold. Here, we model pairwise functional dependencies and higher order interactions that enable evolution of new protein functions. We use a network model to find complex dependencies between mutations resulting from evolutionary trade-offs and pleiotropic effects. We present a method to construct these networks and to identify functionally interacting mutations in both extant and reconstructed ancestral sequences (Network Analysis of Protein Adaptation). The time ordering of mutations can be incorporated into the networks through phylogenetic reconstruction. We apply NAPA to three distantly homologous β-lactamase protein clusters (TEM, CTX-M-3, and OXA-51), each of which has experienced recent evolutionary radiation under substantially different selective pressures. By analyzing the network properties of each protein cluster, we identify key adaptive mutations, positive pairwise interactions, different adaptive solutions to the same selective pressure, and complex evolutionary trajectories likely to increase protein fitness. We also present evidence that incorporating information from phylogenetic reconstruction and ancestral sequence inference can reduce the number of spurious links in the network, whereas preserving overall network community structure. The analysis does not require structural or biochemical data. In contrast to function-preserving mutation dependencies, which are frequently from structural contacts, gain-of-function mutation dependencies are most commonly between residues distal in protein structure. PMID:29522102

Topological and statistical analyses of gene regulatory networks reveal unifying yet quantitatively different emergent properties.

PubMed

Ouma, Wilberforce Zachary; Pogacar, Katja; Grotewold, Erich

2018-04-01

Understanding complexity in physical, biological, social and information systems is predicated on describing interactions amongst different components. Advances in genomics are facilitating the high-throughput identification of molecular interactions, and graphs are emerging as indispensable tools in explaining how the connections in the network drive organismal phenotypic plasticity. Here, we describe the architectural organization and associated emergent topological properties of gene regulatory networks (GRNs) that describe protein-DNA interactions (PDIs) in several model eukaryotes. By analyzing GRN connectivity, our results show that the anticipated scale-free network architectures are characterized by organism-specific power law scaling exponents. These exponents are independent of the fraction of the GRN experimentally sampled, enabling prediction of properties of the complete GRN for an organism. We further demonstrate that the exponents describe inequalities in transcription factor (TF)-target gene recognition across GRNs. These observations have the important biological implication that they predict the existence of an intrinsic organism-specific trans and/or cis regulatory landscape that constrains GRN topologies. Consequently, architectural GRN organization drives not only phenotypic plasticity within a species, but is also likely implicated in species-specific phenotype.

Multi-equilibrium property of metabolic networks: SSI module.

PubMed

Lei, Hong-Bo; Zhang, Ji-Feng; Chen, Luonan

2011-06-20

Revealing the multi-equilibrium property of a metabolic network is a fundamental and important topic in systems biology. Due to the complexity of the metabolic network, it is generally a difficult task to study the problem as a whole from both analytical and numerical viewpoint. On the other hand, the structure-oriented modularization idea is a good choice to overcome such a difficulty, i.e. decomposing the network into several basic building blocks and then studying the whole network through investigating the dynamical characteristics of the basic building blocks and their interactions. Single substrate and single product with inhibition (SSI) metabolic module is one type of the basic building blocks of metabolic networks, and its multi-equilibrium property has important influence on that of the whole metabolic networks. In this paper, we describe what the SSI metabolic module is, characterize the rates of the metabolic reactions by Hill kinetics and give a unified model for SSI modules by using a set of nonlinear ordinary differential equations with multi-variables. Specifically, a sufficient and necessary condition is first given to describe the injectivity of a class of nonlinear systems, and then, the sufficient condition is used to study the multi-equilibrium property of SSI modules. As a main theoretical result, for the SSI modules in which each reaction has no more than one inhibitor, a sufficient condition is derived to rule out multiple equilibria, i.e. the Jacobian matrix of its rate function is nonsingular everywhere. In summary, we describe SSI modules and give a general modeling framework based on Hill kinetics, and provide a sufficient condition for ruling out multiple equilibria of a key type of SSI module.

Multi-equilibrium property of metabolic networks: SSI module

PubMed Central

2011-01-01

Background Revealing the multi-equilibrium property of a metabolic network is a fundamental and important topic in systems biology. Due to the complexity of the metabolic network, it is generally a difficult task to study the problem as a whole from both analytical and numerical viewpoint. On the other hand, the structure-oriented modularization idea is a good choice to overcome such a difficulty, i.e. decomposing the network into several basic building blocks and then studying the whole network through investigating the dynamical characteristics of the basic building blocks and their interactions. Single substrate and single product with inhibition (SSI) metabolic module is one type of the basic building blocks of metabolic networks, and its multi-equilibrium property has important influence on that of the whole metabolic networks. Results In this paper, we describe what the SSI metabolic module is, characterize the rates of the metabolic reactions by Hill kinetics and give a unified model for SSI modules by using a set of nonlinear ordinary differential equations with multi-variables. Specifically, a sufficient and necessary condition is first given to describe the injectivity of a class of nonlinear systems, and then, the sufficient condition is used to study the multi-equilibrium property of SSI modules. As a main theoretical result, for the SSI modules in which each reaction has no more than one inhibitor, a sufficient condition is derived to rule out multiple equilibria, i.e. the Jacobian matrix of its rate function is nonsingular everywhere. Conclusions In summary, we describe SSI modules and give a general modeling framework based on Hill kinetics, and provide a sufficient condition for ruling out multiple equilibria of a key type of SSI module. PMID:21689474

Analysis of the main active ingredients and bioactivities of essential oil from Osmanthus fragrans Var. thunbergii using a complex network approach.

PubMed

Wang, Le; Tan, Nana; Hu, Jiayao; Wang, Huan; Duan, Dongzhu; Ma, Lin; Xiao, Jian; Wang, Xiaoling

2017-12-28

Osmanthus fragrans has been used as folk medicine for thousands of years. The extracts of Osmanthus fragrans flowers were reported to have various bioactivities including free radical scavenging, anti-inflammation, neuroprotection and antitumor effects. However, there is still lack of knowledge about its essential oil. In this work, we analyzed the chemical composition of the essential oil from Osmanthus fragrans var. thunbergii by GC-MS. A complex network approach was applied to investigate the interrelationships between the ingredients, target proteins, and related pathways for the essential oil. Statistical characteristics of the networks were further studied to explore the main active ingredients and potential bioactivities of O. fragrans var. thunbergii essential oil. A total of 44 ingredients were selected from the chemical composition of O. fragrans var. thunbergii essential oil, and that 191 potential target proteins together with 70 pathways were collected for these compounds. An ingredient-target-pathway network was constructed based on these data and showed scale-free property as well as power-law degree distribution. Eugenol and geraniol were screened as main active ingredients with much higher degree values. Potential neuroprotective and anti-tumor effect of the essential oil were also found. A core subnetwork was extracted from the ingredient-target-pathway network, and indicated that eugenol and geraniol contributed most to the neuroprotection of this essential oil. Furthermore, a pathway-based protein association network was built and exhibited small-world property. MAPK1 and MAPK3 were considered as key proteins with highest scores of centrality indices, which might play an important role in the anti-tumor effect of the essential oil. This work predicted the main active ingredients and bioactivities of O. fragrans var. thunbergii essential oil, which would benefit the development and utilization of Osmanthus fragrans flowers. The application of complex network theory was proved to be effective in bioactivities studies of essential oil. Moreover, it provides a novel strategy for exploring the molecular mechanisms of traditional medicines.

Thermodynamics of random reaction networks.

PubMed

Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

2015-01-01

Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

Thermodynamics of Random Reaction Networks

PubMed Central

Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

2015-01-01

Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa −1.5 for linear and −1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks. PMID:25723751

Challenges for modeling global gene regulatory networks during development: insights from Drosophila.

PubMed

Wilczynski, Bartek; Furlong, Eileen E M

2010-04-15

Development is regulated by dynamic patterns of gene expression, which are orchestrated through the action of complex gene regulatory networks (GRNs). Substantial progress has been made in modeling transcriptional regulation in recent years, including qualitative "coarse-grain" models operating at the gene level to very "fine-grain" quantitative models operating at the biophysical "transcription factor-DNA level". Recent advances in genome-wide studies have revealed an enormous increase in the size and complexity or GRNs. Even relatively simple developmental processes can involve hundreds of regulatory molecules, with extensive interconnectivity and cooperative regulation. This leads to an explosion in the number of regulatory functions, effectively impeding Boolean-based qualitative modeling approaches. At the same time, the lack of information on the biophysical properties for the majority of transcription factors within a global network restricts quantitative approaches. In this review, we explore the current challenges in moving from modeling medium scale well-characterized networks to more poorly characterized global networks. We suggest to integrate coarse- and find-grain approaches to model gene regulatory networks in cis. We focus on two very well-studied examples from Drosophila, which likely represent typical developmental regulatory modules across metazoans. Copyright (c) 2009 Elsevier Inc. All rights reserved.

Interplay between Graph Topology and Correlations of Third Order in Spiking Neuronal Networks.

PubMed

Jovanović, Stojan; Rotter, Stefan

2016-06-01

The study of processes evolving on networks has recently become a very popular research field, not only because of the rich mathematical theory that underpins it, but also because of its many possible applications, a number of them in the field of biology. Indeed, molecular signaling pathways, gene regulation, predator-prey interactions and the communication between neurons in the brain can be seen as examples of networks with complex dynamics. The properties of such dynamics depend largely on the topology of the underlying network graph. In this work, we want to answer the following question: Knowing network connectivity, what can be said about the level of third-order correlations that will characterize the network dynamics? We consider a linear point process as a model for pulse-coded, or spiking activity in a neuronal network. Using recent results from theory of such processes, we study third-order correlations between spike trains in such a system and explain which features of the network graph (i.e. which topological motifs) are responsible for their emergence. Comparing two different models of network topology-random networks of Erdős-Rényi type and networks with highly interconnected hubs-we find that, in random networks, the average measure of third-order correlations does not depend on the local connectivity properties, but rather on global parameters, such as the connection probability. This, however, ceases to be the case in networks with a geometric out-degree distribution, where topological specificities have a strong impact on average correlations.

Consensus between Pipelines in Structural Brain Networks

PubMed Central

Parker, Christopher S.; Deligianni, Fani; Cardoso, M. Jorge; Daga, Pankaj; Modat, Marc; Dayan, Michael; Clark, Chris A.

2014-01-01

Structural brain networks may be reconstructed from diffusion MRI tractography data and have great potential to further our understanding of the topological organisation of brain structure in health and disease. Network reconstruction is complex and involves a series of processesing methods including anatomical parcellation, registration, fiber orientation estimation and whole-brain fiber tractography. Methodological choices at each stage can affect the anatomical accuracy and graph theoretical properties of the reconstructed networks, meaning applying different combinations in a network reconstruction pipeline may produce substantially different networks. Furthermore, the choice of which connections are considered important is unclear. In this study, we assessed the similarity between structural networks obtained using two independent state-of-the-art reconstruction pipelines. We aimed to quantify network similarity and identify the core connections emerging most robustly in both pipelines. Similarity of network connections was compared between pipelines employing different atlases by merging parcels to a common and equivalent node scale. We found a high agreement between the networks across a range of fiber density thresholds. In addition, we identified a robust core of highly connected regions coinciding with a peak in similarity across network density thresholds, and replicated these results with atlases at different node scales. The binary network properties of these core connections were similar between pipelines but showed some differences in atlases across node scales. This study demonstrates the utility of applying multiple structural network reconstrution pipelines to diffusion data in order to identify the most important connections for further study. PMID:25356977

Chaos in a neural network circuit

NASA Astrophysics Data System (ADS)

Kepler, Thomas B.; Datt, Sumeet; Meyer, Robert B.; Abott, L. F.

1990-12-01

We have constructed a neural network circuit of four clipped, high-grain, integrating operational amplifiers coupled to each other through an array of digitally programmable resistor ladders (MDACs). In addition to fixed-point and cyclic behavior, the circuit exhibits chaotic behavior with complex strange attractors which are approached through period doubling, intermittent attractor expansion and/or quasiperiodic pathways. Couplings between the nonlinear circuit elements are controlled by a computer which can automatically search through the space of couplings for interesting phenomena. We report some initial statistical results relating the behavior of the network to properties of its coupling matrix. Through these results and further research the circuit should help resolve fundamental issues concerning chaos in neural networks.

Scale-Free Distribution of Avian Influenza Outbreaks

NASA Astrophysics Data System (ADS)

Small, Michael; Walker, David M.; Tse, Chi Kong

2007-11-01

Using global case data for the period from 25 November 2003 to 10 March 2007, we construct a network of plausible transmission pathways for the spread of avian influenza among domestic and wild birds. The network structure we obtain is complex and exhibits scale-free (although not necessarily small-world) properties. Communities within this network are connected with a distribution of links with infinite variance. Hence, the disease transmission model does not exhibit a threshold and so the infection will continue to propagate even with very low transmissibility. Consequentially, eradication with methods applicable to locally homogeneous populations is not possible. Any control measure needs to focus explicitly on the hubs within this network structure.

Spatial networks

NASA Astrophysics Data System (ADS)

Barthélemy, Marc

2011-02-01

Complex systems are very often organized under the form of networks where nodes and edges are embedded in space. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks, and neural networks, are all examples where space is relevant and where topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. An important consequence of space on networks is that there is a cost associated with the length of edges which in turn has dramatic effects on the topological structure of these networks. We will thoroughly explain the current state of our understanding of how the spatial constraints affect the structure and properties of these networks. We will review the most recent empirical observations and the most important models of spatial networks. We will also discuss various processes which take place on these spatial networks, such as phase transitions, random walks, synchronization, navigation, resilience, and disease spread.

Root Systems Biology: Integrative Modeling across Scales, from Gene Regulatory Networks to the Rhizosphere1

PubMed Central

Hill, Kristine; Porco, Silvana; Lobet, Guillaume; Zappala, Susan; Mooney, Sacha; Draye, Xavier; Bennett, Malcolm J.

2013-01-01

Genetic and genomic approaches in model organisms have advanced our understanding of root biology over the last decade. Recently, however, systems biology and modeling have emerged as important approaches, as our understanding of root regulatory pathways has become more complex and interpreting pathway outputs has become less intuitive. To relate root genotype to phenotype, we must move beyond the examination of interactions at the genetic network scale and employ multiscale modeling approaches to predict emergent properties at the tissue, organ, organism, and rhizosphere scales. Understanding the underlying biological mechanisms and the complex interplay between systems at these different scales requires an integrative approach. Here, we describe examples of such approaches and discuss the merits of developing models to span multiple scales, from network to population levels, and to address dynamic interactions between plants and their environment. PMID:24143806

A Novel Framework for the Comparative Analysis of Biological Networks

PubMed Central

Pache, Roland A.; Aloy, Patrick

2012-01-01

Genome sequencing projects provide nearly complete lists of the individual components present in an organism, but reveal little about how they work together. Follow-up initiatives have deciphered thousands of dynamic and context-dependent interrelationships between gene products that need to be analyzed with novel bioinformatics approaches able to capture their complex emerging properties. Here, we present a novel framework for the alignment and comparative analysis of biological networks of arbitrary topology. Our strategy includes the prediction of likely conserved interactions, based on evolutionary distances, to counter the high number of missing interactions in the current interactome networks, and a fast assessment of the statistical significance of individual alignment solutions, which vastly increases its performance with respect to existing tools. Finally, we illustrate the biological significance of the results through the identification of novel complex components and potential cases of cross-talk between pathways and alternative signaling routes. PMID:22363585

Shadows of complexity: what biological networks reveal about epistasis and pleiotropy

PubMed Central

Tyler, Anna L.; Asselbergs, Folkert W.; Williams, Scott M.; Moore, Jason H.

2011-01-01

Pleiotropy, in which one mutation causes multiple phenotypes, has traditionally been seen as a deviation from the conventional observation in which one gene affects one phenotype. Epistasis, or gene-gene interaction, has also been treated as an exception to the Mendelian one gene-one phenotype paradigm. This simplified perspective belies the pervasive complexity of biology and hinders progress toward a deeper understanding of biological systems. We assert that epistasis and pleiotropy are not isolated occurrences, but ubiquitous and inherent properties of biomolecular networks. These phenomena should not be treated as exceptions, but rather as fundamental components of genetic analyses. A systems level understanding of epistasis and pleiotropy is, therefore, critical to furthering our understanding of human genetics and its contribution to common human disease. Finally, graph theory offers an intuitive and powerful set of tools with which to study the network bases of these important genetic phenomena. PMID:19204994

Introducing ab initio based neural networks for transition-rate prediction in kinetic Monte Carlo simulations

NASA Astrophysics Data System (ADS)

Messina, Luca; Castin, Nicolas; Domain, Christophe; Olsson, Pär

2017-02-01

The quality of kinetic Monte Carlo (KMC) simulations of microstructure evolution in alloys relies on the parametrization of point-defect migration rates, which are complex functions of the local chemical composition and can be calculated accurately with ab initio methods. However, constructing reliable models that ensure the best possible transfer of physical information from ab initio to KMC is a challenging task. This work presents an innovative approach, where the transition rates are predicted by artificial neural networks trained on a database of 2000 migration barriers, obtained with density functional theory (DFT) in place of interatomic potentials. The method is tested on copper precipitation in thermally aged iron alloys, by means of a hybrid atomistic-object KMC model. For the object part of the model, the stability and mobility properties of copper-vacancy clusters are analyzed by means of independent atomistic KMC simulations, driven by the same neural networks. The cluster diffusion coefficients and mean free paths are found to increase with size, confirming the dominant role of coarsening of medium- and large-sized clusters in the precipitation kinetics. The evolution under thermal aging is in better agreement with experiments with respect to a previous interatomic-potential model, especially concerning the experiment time scales. However, the model underestimates the solubility of copper in iron due to the excessively high solution energy predicted by the chosen DFT method. Nevertheless, this work proves the capability of neural networks to transfer complex ab initio physical properties to higher-scale models, and facilitates the extension to systems with increasing chemical complexity, setting the ground for reliable microstructure evolution simulations in a wide range of alloys and applications.

Syntheses, crystal structures, and properties of four complexes based on polycarboxylate and imidazole ligands

NASA Astrophysics Data System (ADS)

Qiao, Rui; Chen, Shui-Sheng; Sheng, Liang-Quan; Yang, Song; Li, Wei-Dong

2015-08-01

Four metal-organic coordination polymers [Zn(HL)(H2O)]·4H2O (1), [Zn(HL)(L1)]·4H2O (2), [Cu(HL)(H2O)]·3H2O (3) and [Cu(HL)(L1)]·5H2O (4) were synthesized by reactions of the corresponding metal(II) salts with semirigid polycarboxylate ligand (5-((4-carboxypiperidin-1-yl)methyl)isophthalic acid hydrochloride, H3L·HCl) or auxiliary ligand (1,4-di(1H-imidazol-4-yl)benzene, L1). The structures of the compounds were characterized by elemental analysis, FT-IR spectroscopy and single-crystal X-ray diffraction. The use of auxiliary ligand L1 has great influence on the structures of two pairs of complexes 1, 2 and 3, 4. Complex 1 is a uninodal 3-connected rare 2-fold interpenetrating ZnSc net with a Point (Schlafli) symbol of (103) while 2 is a one-dimensional (1D) ladder structure. Compound 3 features a two-dimensional (2D) honeycomb network with typical 63-hcb topology, while 4 is 2D network with (4, 4) sql topology based on binuclear CuII subunits. The non-covalent bonding interactions such as hydrogen bonds, π···π stacking and C-H···π exist in complexes 1-4, which contributes to stabilize crystal structure and extend the low-dimensional entities into high-dimensional frameworks. And the photoluminescent property of 1 and 2 and gas sorption property of 4 have been investigated.

Diet shifts provoke complex and variable changes in the metabolic networks of the ruminal microbiome.

PubMed

Wolff, Sara M; Ellison, Melinda J; Hao, Yue; Cockrum, Rebecca R; Austin, Kathy J; Baraboo, Michael; Burch, Katherine; Lee, Hyuk Jin; Maurer, Taylor; Patil, Rocky; Ravelo, Andrea; Taxis, Tasia M; Truong, Huan; Lamberson, William R; Cammack, Kristi M; Conant, Gavin C

2017-06-08

Grazing mammals rely on their ruminal microbial symbionts to convert plant structural biomass into metabolites they can assimilate. To explore how this complex metabolic system adapts to the host animal's diet, we inferred a microbiome-level metabolic network from shotgun metagenomic data. Using comparative genomics, we then linked this microbial network to that of the host animal using a set of interface metabolites likely to be transferred to the host. When the host sheep were fed a grain-based diet, the induced microbial metabolic network showed several critical differences from those seen on the evolved forage-based diet. Grain-based (e.g., concentrate) diets tend to be dominated by a smaller set of reactions that employ metabolites that are nearer in network space to the host's metabolism. In addition, these reactions are more central in the network and employ substrates with shorter carbon backbones. Despite this apparent lower complexity, the concentrate-associated metabolic networks are actually more dissimilar from each other than are those of forage-fed animals. Because both groups of animals were initially fed on a forage diet, we propose that the diet switch drove the appearance of a number of different microbial networks, including a degenerate network characterized by an inefficient use of dietary nutrients. We used network simulations to show that such disparate networks are not an unexpected result of a diet shift. We argue that network approaches, particularly those that link the microbial network with that of the host, illuminate aspects of the structure of the microbiome not seen from a strictly taxonomic perspective. In particular, different diets induce predictable and significant differences in the enzymes used by the microbiome. Nonetheless, there are clearly a number of microbiomes of differing structure that show similar functional properties. Changes such as a diet shift uncover more of this type of diversity.

Network dynamics in nanofilled polymers

NASA Astrophysics Data System (ADS)

Baeza, Guilhem P.; Dessi, Claudia; Costanzo, Salvatore; Zhao, Dan; Gong, Shushan; Alegria, Angel; Colby, Ralph H.; Rubinstein, Michael; Vlassopoulos, Dimitris; Kumar, Sanat K.

2016-04-01

It is well accepted that adding nanoparticles (NPs) to polymer melts can result in significant property improvements. Here we focus on the causes of mechanical reinforcement and present rheological measurements on favourably interacting mixtures of spherical silica NPs and poly(2-vinylpyridine), complemented by several dynamic and structural probes. While the system dynamics are polymer-like with increased friction for low silica loadings, they turn network-like when the mean face-to-face separation between NPs becomes smaller than the entanglement tube diameter. Gel-like dynamics with a Williams-Landel-Ferry temperature dependence then result. This dependence turns particle dominated, that is, Arrhenius-like, when the silica loading increases to ~31 vol%, namely, when the average nearest distance between NP faces becomes comparable to the polymer's Kuhn length. Our results demonstrate that the flow properties of nanocomposites are complex and can be tuned via changes in filler loading, that is, the character of polymer bridges which `tie' NPs together into a network.

Influence of Chirality in Ordered Block Copolymer Phases

NASA Astrophysics Data System (ADS)

Prasad, Ishan; Grason, Gregory

2015-03-01

Block copolymers are known to assemble into rich spectrum of ordered phases, with many complex phases driven by asymmetry in copolymer architecture. Despite decades of study, the influence of intrinsic chirality on equilibrium mesophase assembly of block copolymers is not well understood and largely unexplored. Self-consistent field theory has played a major role in prediction of physical properties of polymeric systems. Only recently, a polar orientational self-consistent field (oSCF) approach was adopted to model chiral BCP having a thermodynamic preference for cholesteric ordering in chiral segments. We implement oSCF theory for chiral nematic copolymers, where segment orientations are characterized by quadrupolar chiral interactions, and focus our study on the thermodynamic stability of bi-continuous network morphologies, and the transfer of molecular chirality to mesoscale chirality of networks. Unique photonic properties observed in butterfly wings have been attributed to presence of chiral single-gyroid networks, this has made it an attractive target for chiral metamaterial design.

Deep Vadose Zone Flow and Transport Behavior at T-Tunnel Complex, Rainier Mesa, Nevada National Security Site

NASA Astrophysics Data System (ADS)

Parashar, R.; Reeves, D. M.

2010-12-01

Rainier Mesa, a tuffaceous plateau on the Nevada National Security Site, has been the location of numerous subsurface nuclear tests conducted in a series of tunnel complexes located approximately 450 m below the top of the mesa and 500 m above the regional groundwater flow system. The tunnels were constructed near the middle of an 800 m Tertiary sequence of faulted, low-permeability welded and non-welded bedded, vitric, and zeolitized tuff units. Water levels from wells in the vicinity of the T-tunnel complex indicate the presence of a perched saturation zone located approximately 100 m above the T-tunnel complex. This upper zone of saturation extends downward through most of the Tertiary sequence. The groundwater table is located at an elevation of 1300 m within a thrust sheet of Paleozoic carbonates, corresponding to the lower carbonate aquifer hydrostratigraphic unit (LCA3). The LCA3 is considered to be hydraulically connected to the Death Valley regional flow system. The objective of this project is to simulate complex downward patterns of fluid flow and radionuclide transport from the T-tunnel complex through the matrix and fault networks of the Tertiary tuff units to the water table. We developed an improved fracture characterization and mapping methodology consisting of displacement-length scaling relationships, simulation of realistic fault networks based on site-specific data, and the development of novel fracture network upscaling techniques that preserves fracture network flow and transport properties on coarse continuum grid. Development of upscaling method for fracture continua is based on the concepts of discrete fracture network modeling approach which performs better at honoring network connectivity and anisotropy of sparse networks in comparison to other established methods such as a tensor approach. Extensive flow simulations in the dual-continuum framework demonstrate that the characteristics of fault networks strongly influences the saturation profile and formation of perched zones, although they may not conduct a large amount of flow when compared to the matrix continua. The simulated results are found to be very sensitive to distribution of fracture aperture, density of the network, and spatial pattern of fracture clustering. The faults provide rapid pathways for radionuclide transport and the conceptual modeling of diffusional mass transfer between matrix and fracture continua plays a vital role in prediction of the overall behavior of the breakthrough curve.

The complexity of classical music networks

NASA Astrophysics Data System (ADS)

Rolla, Vitor; Kestenberg, Juliano; Velho, Luiz

2018-02-01

Previous works suggest that musical networks often present the scale-free and the small-world properties. From a musician's perspective, the most important aspect missing in those studies was harmony. In addition to that, the previous works made use of outdated statistical methods. Traditionally, least-squares linear regression is utilised to fit a power law to a given data set. However, according to Clauset et al. such a traditional method can produce inaccurate estimates for the power law exponent. In this paper, we present an analysis of musical networks which considers the existence of chords (an essential element of harmony). Here we show that only 52.5% of music in our database presents the scale-free property, while 62.5% of those pieces present the small-world property. Previous works argue that music is highly scale-free; consequently, it sounds appealing and coherent. In contrast, our results show that not all pieces of music present the scale-free and the small-world properties. In summary, this research is focused on the relationship between musical notes (Do, Re, Mi, Fa, Sol, La, Si, and their sharps) and accompaniment in classical music compositions. More information about this research project is available at https://eden.dei.uc.pt/~vitorgr/MS.html.

The Role of Temporal Trends in Growing Networks

PubMed Central

Ruppin, Eytan; Shavitt, Yuval

2016-01-01

The rich get richer principle, manifested by the Preferential attachment (PA) mechanism, is widely considered one of the major factors in the growth of real-world networks. PA stipulates that popular nodes are bound to be more attractive than less popular nodes; for example, highly cited papers are more likely to garner further citations. However, it overlooks the transient nature of popularity, which is often governed by trends. Here, we show that in a wide range of real-world networks the recent popularity of a node, i.e., the extent by which it accumulated links recently, significantly influences its attractiveness and ability to accumulate further links. We proceed to model this observation with a natural extension to PA, named Trending Preferential Attachment (TPA), in which edges become less influential as they age. TPA quantitatively parametrizes a fundamental network property, namely the network’s tendency to trends. Through TPA, we find that real-world networks tend to be moderately to highly trendy. Networks are characterized by different susceptibilities to trends, which determine their structure to a large extent. Trendy networks display complex structural traits, such as modular community structure and degree-assortativity, occurring regularly in real-world networks. In summary, this work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment. PMID:27486847

Influence maximization based on partial network structure information: A comparative analysis on seed selection heuristics

NASA Astrophysics Data System (ADS)

Erkol, Şirag; Yücel, Gönenç

In this study, the problem of seed selection is investigated. This problem is mainly treated as an optimization problem, which is proved to be NP-hard. There are several heuristic approaches in the literature which mostly use algorithmic heuristics. These approaches mainly focus on the trade-off between computational complexity and accuracy. Although the accuracy of algorithmic heuristics are high, they also have high computational complexity. Furthermore, in the literature, it is generally assumed that complete information on the structure and features of a network is available, which is not the case in most of the times. For the study, a simulation model is constructed, which is capable of creating networks, performing seed selection heuristics, and simulating diffusion models. Novel metric-based seed selection heuristics that rely only on partial information are proposed and tested using the simulation model. These heuristics use local information available from nodes in the synthetically created networks. The performances of heuristics are comparatively analyzed on three different network types. The results clearly show that the performance of a heuristic depends on the structure of a network. A heuristic to be used should be selected after investigating the properties of the network at hand. More importantly, the approach of partial information provided promising results. In certain cases, selection heuristics that rely only on partial network information perform very close to similar heuristics that require complete network data.

Atmospheric reaction systems as null-models to identify structural traces of evolution in metabolism.

PubMed

Holme, Petter; Huss, Mikael; Lee, Sang Hoon

2011-05-06

The metabolism is the motor behind the biological complexity of an organism. One problem of characterizing its large-scale structure is that it is hard to know what to compare it to. All chemical reaction systems are shaped by the same physics that gives molecules their stability and affinity to react. These fundamental factors cannot be captured by standard null-models based on randomization. The unique property of organismal metabolism is that it is controlled, to some extent, by an enzymatic machinery that is subject to evolution. In this paper, we explore the possibility that reaction systems of planetary atmospheres can serve as a null-model against which we can define metabolic structure and trace the influence of evolution. We find that the two types of data can be distinguished by their respective degree distributions. This is especially clear when looking at the degree distribution of the reaction network (of reaction connected to each other if they involve the same molecular species). For the Earth's atmospheric network and the human metabolic network, we look into more detail for an underlying explanation of this deviation. However, we cannot pinpoint a single cause of the difference, rather there are several concurrent factors. By examining quantities relating to the modular-functional organization of the metabolism, we confirm that metabolic networks have a more complex modular organization than the atmospheric networks, but not much more. We interpret the more variegated modular arrangement of metabolism as a trace of evolved functionality. On the other hand, it is quite remarkable how similar the structures of these two types of networks are, which emphasizes that the constraints from the chemical properties of the molecules has a larger influence in shaping the reaction system than does natural selection.

A hybrid framework for reservoir characterization using fuzzy ranking and an artificial neural network

NASA Astrophysics Data System (ADS)

Wang, Baijie; Wang, Xin; Chen, Zhangxin

2013-08-01

Reservoir characterization refers to the process of quantitatively assigning reservoir properties using all available field data. Artificial neural networks (ANN) have recently been introduced to solve reservoir characterization problems dealing with the complex underlying relationships inherent in well log data. Despite the utility of ANNs, the current limitation is that most existing applications simply focus on directly implementing existing ANN models instead of improving/customizing them to fit the specific reservoir characterization tasks at hand. In this paper, we propose a novel intelligent framework that integrates fuzzy ranking (FR) and multilayer perceptron (MLP) neural networks for reservoir characterization. FR can automatically identify a minimum subset of well log data as neural inputs, and the MLP is trained to learn the complex correlations from the selected well log data to a target reservoir property. FR guarantees the selection of the optimal subset of representative data from the overall well log data set for the characterization of a specific reservoir property; and, this implicitly improves the modeling and predication accuracy of the MLP. In addition, a growing number of industrial agencies are implementing geographic information systems (GIS) in field data management; and, we have designed the GFAR solution (GIS-based FR ANN Reservoir characterization solution) system, which integrates the proposed framework into a GIS system that provides an efficient characterization solution. Three separate petroleum wells from southwestern Alberta, Canada, were used in the presented case study of reservoir porosity characterization. Our experiments demonstrate that our method can generate reliable results.

Visibility graph analysis on heartbeat dynamics of meditation training

NASA Astrophysics Data System (ADS)

Jiang, Sen; Bian, Chunhua; Ning, Xinbao; Ma, Qianli D. Y.

2013-06-01

We apply the visibility graph analysis to human heartbeat dynamics by constructing the complex networks of heartbeat interval time series and investigating the statistical properties of the network before and during chi and yoga meditation. The experiment results show that visibility graph analysis can reveal the dynamical changes caused by meditation training manifested as regular heartbeat, which is closely related to the adjustment of autonomous neural system, and visibility graph analysis is effective to evaluate the effect of meditation.

A Visual Evaluation Study of Graph Sampling Techniques

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Fangyan; Zhang, Song; Wong, Pak C.

2017-01-29

We evaluate a dozen prevailing graph-sampling techniques with an ultimate goal to better visualize and understand big and complex graphs that exhibit different properties and structures. The evaluation uses eight benchmark datasets with four different graph types collected from Stanford Network Analysis Platform and NetworkX to give a comprehensive comparison of various types of graphs. The study provides a practical guideline for visualizing big graphs of different sizes and structures. The paper discusses results and important observations from the study.

Percolation Theory and Modern Hydraulic Fracturing

NASA Astrophysics Data System (ADS)

Norris, J. Q.; Turcotte, D. L.; Rundle, J. B.

2015-12-01

During the past few years, we have been developing a percolation model for fracking. This model provides a powerful tool for understanding the growth and properties of the complex fracture networks generated during a modern high volume hydraulic fracture stimulations of tight shale reservoirs. The model can also be used to understand the interaction between the growing fracture network and natural reservoir features such as joint sets and faults. Additionally, the model produces a power-law distribution of bursts which can easily be compared to observed microseismicity.

Unveiling relationships between crime and property in England and Wales via density scale-adjusted metrics and network tools.

PubMed

Ribeiro, Haroldo V; Hanley, Quentin S; Lewis, Dan

2018-01-01

Scale-adjusted metrics (SAMs) are a significant achievement of the urban scaling hypothesis. SAMs remove the inherent biases of per capita measures computed in the absence of isometric allometries. However, this approach is limited to urban areas, while a large portion of the world's population still lives outside cities and rural areas dominate land use worldwide. Here, we extend the concept of SAMs to population density scale-adjusted metrics (DSAMs) to reveal relationships among different types of crime and property metrics. Our approach allows all human environments to be considered, avoids problems in the definition of urban areas, and accounts for the heterogeneity of population distributions within urban regions. By combining DSAMs, cross-correlation, and complex network analysis, we find that crime and property types have intricate and hierarchically organized relationships leading to some striking conclusions. Drugs and burglary had uncorrelated DSAMs and, to the extent property transaction values are indicators of affluence, twelve out of fourteen crime metrics showed no evidence of specifically targeting affluence. Burglary and robbery were the most connected in our network analysis and the modular structures suggest an alternative to "zero-tolerance" policies by unveiling the crime and/or property types most likely to affect each other.

Unveiling relationships between crime and property in England and Wales via density scale-adjusted metrics and network tools

PubMed Central

Hanley, Quentin S.; Lewis, Dan

2018-01-01

Scale-adjusted metrics (SAMs) are a significant achievement of the urban scaling hypothesis. SAMs remove the inherent biases of per capita measures computed in the absence of isometric allometries. However, this approach is limited to urban areas, while a large portion of the world’s population still lives outside cities and rural areas dominate land use worldwide. Here, we extend the concept of SAMs to population density scale-adjusted metrics (DSAMs) to reveal relationships among different types of crime and property metrics. Our approach allows all human environments to be considered, avoids problems in the definition of urban areas, and accounts for the heterogeneity of population distributions within urban regions. By combining DSAMs, cross-correlation, and complex network analysis, we find that crime and property types have intricate and hierarchically organized relationships leading to some striking conclusions. Drugs and burglary had uncorrelated DSAMs and, to the extent property transaction values are indicators of affluence, twelve out of fourteen crime metrics showed no evidence of specifically targeting affluence. Burglary and robbery were the most connected in our network analysis and the modular structures suggest an alternative to “zero-tolerance” policies by unveiling the crime and/or property types most likely to affect each other. PMID:29470499

What's in a Name?

NASA Astrophysics Data System (ADS)

da Fontoura Costa, Luciano

Among the several findings deriving from the application of complex network formalism to the investigation of natural phenomena, the fact that linguistic constructions follow power laws presents special interest for its potential implications for psychology and brain science. By corresponding to one of the most essentially human manifestations, such language-related properties suggest that similar dynamics may also be inherent to the brain areas related to language and associative memory, and perhaps even consciousness. The present work reports a preliminary experimental investigation aimed at characterizing and modeling the flow of sequentially induced associations between words from the English language in terms of complex networks. The data is produced through a psychophysical experiment where a word is presented to the subject, who is requested to associate another word. Complex network and graph theory formalism and measurements are applied in order to characterize the experimental data. Several interesting results are identified, including the characterization of attraction basins, association asymmetries, context biasing, as well as a possible power-law underlying word associations, which could be explained by the appearance of strange loops along the hierarchical structure underlying word categories.

Leveraging percolation theory to single out influential spreaders in networks

NASA Astrophysics Data System (ADS)

Radicchi, Filippo; Castellano, Claudio

2016-06-01

Among the consequences of the disordered interaction topology underlying many social, technological, and biological systems, a particularly important one is that some nodes, just because of their position in the network, may have a disproportionate effect on dynamical processes mediated by the complex interaction pattern. For example, the early adoption of a commercial product by an opinion leader in a social network may change its fate or just a few superspreaders may determine the virality of a meme in social media. Despite many recent efforts, the formulation of an accurate method to optimally identify influential nodes in complex network topologies remains an unsolved challenge. Here, we present the exact solution of the problem for the specific, but highly relevant, case of the susceptible-infected-removed (SIR) model for epidemic spreading at criticality. By exploiting the mapping between bond percolation and the static properties of the SIR model, we prove that the recently introduced nonbacktracking centrality is the optimal criterion for the identification of influential spreaders in locally tree-like networks at criticality. By means of simulations on synthetic networks and on a very extensive set of real-world networks, we show that the nonbacktracking centrality is a highly reliable metric to identify top influential spreaders also in generic graphs not embedded in space and for noncritical spreading.

Synthesis and photoluminescence properties of silver(I) complexes based on N-benzoyl-L-glutamic acid and N-donor ligands with different flexibility

NASA Astrophysics Data System (ADS)

Yan, Ming-Jie; Feng, Qi; Song, Hui-Hua

2016-05-01

By changing the N-donor ancillary ligand, three novel silver (I) complexes {[Ag(HbzgluO) (4,4‧-bipy)]·H2O}n (1), {[Ag2(HbzgluO)2 (bpe)2]·2H2O}n (2) and {[Ag(HbzgluO)(bpp)]·2H2O}n (3) (H2bzgluO = N-benzoyl-L-glutamic acid, 4,4‧-bipy = 4,4ˊ-bipyridine, bpe = 1,2-di(4-pyridyl)ethane, bpp = 1,3-di(4-pyridyl)propane) were synthesized. Their structures have been determined by single-crystal X-ray diffraction analyses and further characterized by elemental analyses, IR spectra, powder X-ray diffraction (PXRD), and thermogravimetric analyses (TGA). In this study, the N-donor ligands are changed from rigidity (4,4‧-bipy), quasi-flexibility (bpe) to flexibility (bpp), the structures of complexes also change. Complex 1 features a 1D chain structure which is further linked together to construct a 2D supramolecular structure through hydrogen bonds. Complex 2 is a 1D double-chains configuration which eventually forms a 3D supramolecular network via hydrogen bonding interactions. Whereas, complex 3 exhibits a 2D pleated grid structure which is linked by hydrogen bonding interactions into a 3D supramolecular network. The present observations demonstrate that the modulation of coordination polymers with different structures can accomplish by changing the spacer length of N-donor ligands. In addition, the solid-state circular dichroism (CD) spectra indicated that compound 2 exhibited negative cotton effect which originated from the chiral ligands H2bzgluO and the solid-state fluorescence spectra of the three complexes demonstrated the auxiliary ligands have influence on the photoluminescence properties of the complexes.

Lead(II) coordination polymers based on rigid-flexible 3,5-bis-oxyacetate-benzoic acid: Structural transition driven by temperature control

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Yong-Qiang, E-mail: chenjzxy@126.com; Tian, Yuan

2017-03-15

Three Pb(II) complexes ([Pb{sub 3}(BOABA){sub 2}(H{sub 2}O)]·H{sub 2}O){sub n} (1), ([Pb{sub 4}(BOABA){sub 2}(µ{sub 4}-O)(H{sub 2}O){sub 2}]·H{sub 2}O){sub n} (2), and [Pb{sub 3}(BOABA){sub 2}(H{sub 2}O)]{sub n} (3) (H{sub 3}BOABA=3,5-bis-oxyacetate-benzoic acid) were obtained under the same reaction systems with different temperatures. Complexes 1 and 2 are two dimensional (2D) networks based on Pb-BOABA chains and Pb{sub 4}(µ{sub 4}-O)(COO){sub 6} SBUs, respectively. Complex 3 presents an interesting three dimensional (3D) framework, was obtained by increasing the reaction temperature. Structural transition of the crystallization products is largely dependent on the reaction temperature. Moreover, the fluorescence properties of complexes 1–3 have been investigated. - Graphicalmore » abstract: Three Pb(II) coordination polymers were obtained under the same reaction systems with different temperatures. Both of complexes 1 and 2 are 2D network. 3 presents a 3D framework based on Pb–O–C rods SBUs. The 2D to 3D structures transition between three complexes was achieved successfully by temperature control. - Highlights: • Three Pb(II) complexes were obtained under the same reaction systems with different temperatures. • Structural transition of the crystallization products is largely dependent on the reaction temperature. • The luminescence properties studies reveal that three complexes exhibit yellow fluorescence emission behavior, which might be good candidates for obtaining photoluminescent materials.« less

Computational Models and Emergent Properties of Respiratory Neural Networks

PubMed Central

Lindsey, Bruce G.; Rybak, Ilya A.; Smith, Jeffrey C.

2012-01-01

Computational models of the neural control system for breathing in mammals provide a theoretical and computational framework bringing together experimental data obtained from different animal preparations under various experimental conditions. Many of these models were developed in parallel and iteratively with experimental studies and provided predictions guiding new experiments. This data-driven modeling approach has advanced our understanding of respiratory network architecture and neural mechanisms underlying generation of the respiratory rhythm and pattern, including their functional reorganization under different physiological conditions. Models reviewed here vary in neurobiological details and computational complexity and span multiple spatiotemporal scales of respiratory control mechanisms. Recent models describe interacting populations of respiratory neurons spatially distributed within the Bötzinger and pre-Bötzinger complexes and rostral ventrolateral medulla that contain core circuits of the respiratory central pattern generator (CPG). Network interactions within these circuits along with intrinsic rhythmogenic properties of neurons form a hierarchy of multiple rhythm generation mechanisms. The functional expression of these mechanisms is controlled by input drives from other brainstem components, including the retrotrapezoid nucleus and pons, which regulate the dynamic behavior of the core circuitry. The emerging view is that the brainstem respiratory network has rhythmogenic capabilities at multiple levels of circuit organization. This allows flexible, state-dependent expression of different neural pattern-generation mechanisms under various physiological conditions, enabling a wide repertoire of respiratory behaviors. Some models consider control of the respiratory CPG by pulmonary feedback and network reconfiguration during defensive behaviors such as cough. Future directions in modeling of the respiratory CPG are considered. PMID:23687564

Quantum statistics in complex networks

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

The Barabasi-Albert (BA) model for a complex network shows a characteristic power law connectivity distribution typical of scale free systems. The Ising model on the BA network shows that the ferromagnetic phase transition temperature depends logarithmically on its size. We have introduced a fitness parameter for the BA network which describes the different abilities of nodes to compete for links. This model predicts the formation of a scale free network where each node increases its connectivity in time as a power-law with an exponent depending on its fitness. This model includes the fact that the node connectivity and growth rate do not depend on the node age alone and it reproduces non trivial correlation properties of the Internet. We have proposed a model of bosonic networks by a generalization of the BA model where the properties of quantum statistics can be applied. We have introduced a fitness eta i = e-bei where the temperature T = 1/ b is determined by the noise in the system and the energy ei accounts for qualitative differences of each node for acquiring links. The results of this work show that a power law network with exponent gamma = 2 can give a Bose condensation where a single node grabs a finite fraction of all the links. In order to address the connection with self-organized processes we have introduced a model for a growing Cayley tree that generalizes the dynamics of invasion percolation. At each node we associate a parameter ei (called energy) such that the probability to grow for each node is given by pii ∝ ebei where T = 1/ b is a statistical parameter of the system determined by the noise called the temperature. This model has been solved analytically with a similar mathematical technique as the bosonic scale-free networks and it shows the self organization of the low energy nodes at the interface. In the thermodynamic limit the Fermi distribution describes the probability of the energy distribution at the interface.

Classification of complex networks based on similarity of topological network features

NASA Astrophysics Data System (ADS)

Attar, Niousha; Aliakbary, Sadegh

2017-09-01

Over the past few decades, networks have been widely used to model real-world phenomena. Real-world networks exhibit nontrivial topological characteristics and therefore, many network models are proposed in the literature for generating graphs that are similar to real networks. Network models reproduce nontrivial properties such as long-tail degree distributions or high clustering coefficients. In this context, we encounter the problem of selecting the network model that best fits a given real-world network. The need for a model selection method reveals the network classification problem, in which a target-network is classified into one of the candidate network models. In this paper, we propose a novel network classification method which is independent of the network size and employs an alignment-free metric of network comparison. The proposed method is based on supervised machine learning algorithms and utilizes the topological similarities of networks for the classification task. The experiments show that the proposed method outperforms state-of-the-art methods with respect to classification accuracy, time efficiency, and robustness to noise.

International migration network: Topology and modeling

NASA Astrophysics Data System (ADS)

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

International migration network: topology and modeling.

PubMed

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

Comparing species interaction networks along environmental gradients.

PubMed

Pellissier, Loïc; Albouy, Camille; Bascompte, Jordi; Farwig, Nina; Graham, Catherine; Loreau, Michel; Maglianesi, Maria Alejandra; Melián, Carlos J; Pitteloud, Camille; Roslin, Tomas; Rohr, Rudolf; Saavedra, Serguei; Thuiller, Wilfried; Woodward, Guy; Zimmermann, Niklaus E; Gravel, Dominique

2018-05-01

Knowledge of species composition and their interactions, in the form of interaction networks, is required to understand processes shaping their distribution over time and space. As such, comparing ecological networks along environmental gradients represents a promising new research avenue to understand the organization of life. Variation in the position and intensity of links within networks along environmental gradients may be driven by turnover in species composition, by variation in species abundances and by abiotic influences on species interactions. While investigating changes in species composition has a long tradition, so far only a limited number of studies have examined changes in species interactions between networks, often with differing approaches. Here, we review studies investigating variation in network structures along environmental gradients, highlighting how methodological decisions about standardization can influence their conclusions. Due to their complexity, variation among ecological networks is frequently studied using properties that summarize the distribution or topology of interactions such as number of links, connectance, or modularity. These properties can either be compared directly or using a procedure of standardization. While measures of network structure can be directly related to changes along environmental gradients, standardization is frequently used to facilitate interpretation of variation in network properties by controlling for some co-variables, or via null models. Null models allow comparing the deviation of empirical networks from random expectations and are expected to provide a more mechanistic understanding of the factors shaping ecological networks when they are coupled with functional traits. As an illustration, we compare approaches to quantify the role of trait matching in driving the structure of plant-hummingbird mutualistic networks, i.e. a direct comparison, standardized by null models and hypothesis-based metaweb. Overall, our analysis warns against a comparison of studies that rely on distinct forms of standardization, as they are likely to highlight different signals. Fostering a better understanding of the analytical tools available and the signal they detect will help produce deeper insights into how and why ecological networks vary along environmental gradients. © 2017 Cambridge Philosophical Society.

The statistical mechanics of complex signaling networks: nerve growth factor signaling

NASA Astrophysics Data System (ADS)

Brown, K. S.; Hill, C. C.; Calero, G. A.; Myers, C. R.; Lee, K. H.; Sethna, J. P.; Cerione, R. A.

2004-10-01

The inherent complexity of cellular signaling networks and their importance to a wide range of cellular functions necessitates the development of modeling methods that can be applied toward making predictions and highlighting the appropriate experiments to test our understanding of how these systems are designed and function. We use methods of statistical mechanics to extract useful predictions for complex cellular signaling networks. A key difficulty with signaling models is that, while significant effort is being made to experimentally measure the rate constants for individual steps in these networks, many of the parameters required to describe their behavior remain unknown or at best represent estimates. To establish the usefulness of our approach, we have applied our methods toward modeling the nerve growth factor (NGF)-induced differentiation of neuronal cells. In particular, we study the actions of NGF and mitogenic epidermal growth factor (EGF) in rat pheochromocytoma (PC12) cells. Through a network of intermediate signaling proteins, each of these growth factors stimulates extracellular regulated kinase (Erk) phosphorylation with distinct dynamical profiles. Using our modeling approach, we are able to predict the influence of specific signaling modules in determining the integrated cellular response to the two growth factors. Our methods also raise some interesting insights into the design and possible evolution of cellular systems, highlighting an inherent property of these systems that we call 'sloppiness.'

Brain functional networks in syndromic and non-syndromic autism: a graph theoretical study of EEG connectivity

PubMed Central

2013-01-01

Background Graph theory has been recently introduced to characterize complex brain networks, making it highly suitable to investigate altered connectivity in neurologic disorders. A current model proposes autism spectrum disorder (ASD) as a developmental disconnection syndrome, supported by converging evidence in both non-syndromic and syndromic ASD. However, the effects of abnormal connectivity on network properties have not been well studied, particularly in syndromic ASD. To close this gap, brain functional networks of electroencephalographic (EEG) connectivity were studied through graph measures in patients with Tuberous Sclerosis Complex (TSC), a disorder with a high prevalence of ASD, as well as in patients with non-syndromic ASD. Methods EEG data were collected from TSC patients with ASD (n = 14) and without ASD (n = 29), from patients with non-syndromic ASD (n = 16), and from controls (n = 46). First, EEG connectivity was characterized by the mean coherence, the ratio of inter- over intra-hemispheric coherence and the ratio of long- over short-range coherence. Next, graph measures of the functional networks were computed and a resilience analysis was conducted. To distinguish effects related to ASD from those related to TSC, a two-way analysis of covariance (ANCOVA) was applied, using age as a covariate. Results Analysis of network properties revealed differences specific to TSC and ASD, and these differences were very consistent across subgroups. In TSC, both with and without a concurrent diagnosis of ASD, mean coherence, global efficiency, and clustering coefficient were decreased and the average path length was increased. These findings indicate an altered network topology. In ASD, both with and without a concurrent diagnosis of TSC, decreased long- over short-range coherence and markedly increased network resilience were found. Conclusions The altered network topology in TSC represents a functional correlate of structural abnormalities and may play a role in the pathogenesis of neurological deficits. The increased resilience in ASD may reflect an excessively degenerate network with local overconnection and decreased functional specialization. This joint study of TSC and ASD networks provides a unique window to common neurobiological mechanisms in autism. PMID:23445896

[Dynamic paradigm in psychopathology: "chaos theory", from physics to psychiatry].

PubMed

Pezard, L; Nandrino, J L

2001-01-01

For the last thirty years, progress in the field of physics, known as "Chaos theory"--or more precisely: non-linear dynamical systems theory--has increased our understanding of complex systems dynamics. This framework's formalism is general enough to be applied in other domains, such as biology or psychology, where complex systems are the rule rather than the exception. Our goal is to show here that this framework can become a valuable tool in scientific fields such as neuroscience and psychiatry where objects possess natural time dependency (i.e. dynamical properties) and non-linear characteristics. The application of non-linear dynamics concepts on these topics is more precise than a loose metaphor and can throw a new light on mental functioning and dysfunctioning. A class of neural networks (recurrent neural networks) constitutes an example of the implementation of the dynamical system concept and provides models of cognitive processes (15). The state of activity of the network is represented in its state space and the time evolution of this state is a trajectory in this space. After a period of time those networks settle on an equilibrium (a kind of attractor). The strength of connections between neurons define the number and relations between those attractors. The attractors of the network are usually interpreted as "mental representations". When an initial condition is imposed to the network, the evolution towards an attractor is considered as a model of information processing (27). This information processing is not defined in a symbolic manner but is a result of the interaction between distributed elements. Several properties of dynamical models can be used to define a way where the symbolic properties emerge from physical and dynamical properties (28) and thus they can be candidates for the definition of the emergence of mental properties on the basis of neuronal dynamics (42). Nevertheless, mental properties can also be considered as the result of an underlying dynamics without explicit mention of the neuronal one (47). In that case, dynamical tools can be used to elucidate the Freudian psychodynamics (34, 35). Recurrent neuronal networks have been used to propose interpretation of several mental dysfunctions (12). For example in the case of schizophrenia, it has been proposed that troubles in the cortical pruning during development (13) may cause a decrease in neural network storage ability and lead to the creation of spurious attractors. Those attractors do not correspond to stored memories and attract a large amount of initial conditions: they were thus associated to reality distorsion observed in schizophrenia (14). Nevertheless, the behavior of these models are too simple to be directly compared with real physiological data. In fact, equilibrium attractors are hardly met in biological dynamics. More complex behaviors (such as oscillations or chaos) should thus to be taken into account. The study of chaotic behavior have lead to the development of numerical methods devoted to the analysis of complex time series (17). These methods may be used to characterise the dynamical processes at the time-scales of both the cerebral dynamics and the clinical symptoms variations. The application of these methods to physiological signals have shown that complex behaviors are related to healthy states whereas simple dynamics are related to pathology (8). These studies have thus confirmed the notion of "dynamical disease" (20, 21) which denotes pathological conditions characterised by changes in physiological rhythms. Depression has been studied within this framework (25, 32) in order to define possible changes in brain electrical rhythms related to this trouble and its evolution. It has been shown that controls' brain dynamics is more complex than depressive one and that the recovery of a complex brain activity depends on the number of previous episodes. In the case of the symptoms time evolution, several studies have demonstrated that non-linear dynamical process may be involved in the recurrence of symptoms in troubles such as manic-depressive illness (9) or schizophrenia (51). These observations can contribute to more parcimonious interpretation of the time course of these illnesses than usual theories. In the search of a relationship between brain dynamics and mental troubles, it has been shown in three depressed patients an important correlation between the characteristics of brain dynamics and the intensity of depressive mood (49). This preliminary observation is in accordance with the emergence hypothesis according which changes in neuronal dynamics should be related to changes in mental processes. We reviewed here some theoretical and experimental results related to the use of "physical" dynamical theory in the field of psychopathology. It has been argued that these applications go beyond metaphor and that they are empirically founded. Nevertheless, these studies only constitute first steps on the way of a cautious development and definition of a "dynamical paradigm" in psychopathology. The introduction of concepts from dynamics such as complexity and dynamical changes (i.e. bifurcations) permits a new perspective on function and dysfunction of the mind/brain and the time evolution of symptoms. Moreover, it offers a ground for the hypothesis of the emergence of mental properties on the basis of neuronal dynamics (42). Since this theory can help to throw light on classical problems in psychopathology, we consider that a precise examination of both its theoretical and empirical consequences is requested to define its validity on this topic.

What HR-CT imaging can teach us about xylem structure and function

USDA-ARS?s Scientific Manuscript database

It is well established that plant xylem is composed of a complex and interconnected system of vascular elements, but little is known about how the three-dimensional (3D) organization of this network influences properties such as plant hydraulics (Tyree & Zimmermann, 2002), and few studies have measu...

Lattice Boltzmann simulation of CO2 reactive transport in network fractured media

NASA Astrophysics Data System (ADS)

Tian, Zhiwei; Wang, Junye

2017-08-01

Carbon dioxide (CO2) geological sequestration plays an important role in mitigating CO2 emissions for climate change. Understanding interactions of the injected CO2 with network fractures and hydrocarbons is key for optimizing and controlling CO2 geological sequestration and evaluating its risks to ground water. However, there is a well-known, difficult process in simulating the dynamic interaction of fracture-matrix, such as dynamic change of matrix porosity, unsaturated processes in rock matrix, and effect of rock mineral properties. In this paper, we develop an explicit model of the fracture-matrix interactions using multilayer bounce-back treatment as a first attempt to simulate CO2 reactive transport in network fractured media through coupling the Dardis's LBM porous model for a new interface treatment. Two kinds of typical fracture networks in porous media are simulated: straight cross network fractures and interleaving network fractures. The reaction rate and porosity distribution are illustrated and well-matched patterns are found. The species concentration distribution and evolution with time steps are also analyzed and compared with different transport properties. The results demonstrate the capability of this model to investigate the complex processes of CO2 geological injection and reactive transport in network fractured media, such as dynamic change of matrix porosity.

Smad Signaling Dynamics: Insights from a Parsimonious Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wiley, H. S.; Shankaran, Harish

2008-09-09

The molecular mechanisms that transmit information from cell surface receptors to the nucleus are exceedingly complex; thus, much effort has been expended in developing computational models to understand these processes. A recent study on modeling the nuclear-cytoplasmic shuttling of Smad2-Smad4 complexes in response to transforming growth factor β (TGF-β) receptor activation has provided substantial insight into how this signaling network translates the degree of TGF-β receptor activation (input) into the amount of nuclear Smad2-Smad4 complexes (output). The study addressed this question by combining a simple, mechanistic model with targeted experiments, an approach that proved particularly powerful for exploring the fundamentalmore » properties of a complex signaling network. The mathematical model revealed that Smad nuclear-cytoplasmic dynamics enables a proportional, but time-delayed coupling between the input and the output. As a result, the output can faithfully track gradual changes in the input, while the rapid input fluctuations that constitute signaling noise are dampened out.« less

Oscillations and Multiple Equilibria in Microvascular Blood Flow.

PubMed

Karst, Nathaniel J; Storey, Brian D; Geddes, John B

2015-07-01

We investigate the existence of oscillatory dynamics and multiple steady-state flow rates in a network with a simple topology and in vivo microvascular blood flow constitutive laws. Unlike many previous analytic studies, we employ the most biologically relevant models of the physical properties of whole blood. Through a combination of analytic and numeric techniques, we predict in a series of two-parameter bifurcation diagrams a range of dynamical behaviors, including multiple equilibria flow configurations, simple oscillations in volumetric flow rate, and multiple coexistent limit cycles at physically realizable parameters. We show that complexity in network topology is not necessary for complex behaviors to arise and that nonlinear rheology, in particular the plasma skimming effect, is sufficient to support oscillatory dynamics similar to those observed in vivo.

Dynamic range in small-world networks of Hodgkin-Huxley neurons with chemical synapses

NASA Astrophysics Data System (ADS)

Batista, C. A. S.; Viana, R. L.; Lopes, S. R.; Batista, A. M.

2014-09-01

According to Stevens' law the relationship between stimulus and response is a power-law within an interval called the dynamic range. The dynamic range of sensory organs is found to be larger than that of a single neuron, suggesting that the network structure plays a key role in the behavior of both the scaling exponent and the dynamic range of neuron assemblies. In order to verify computationally the relationships between stimulus and response for spiking neurons, we investigate small-world networks of neurons described by the Hodgkin-Huxley equations connected by chemical synapses. We found that the dynamic range increases with the network size, suggesting that the enhancement of the dynamic range observed in sensory organs, with respect to single neurons, is an emergent property of complex network dynamics.

Supercooperation in evolutionary games on correlated weighted networks.

PubMed

Buesser, Pierre; Tomassini, Marco

2012-01-01

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barabási-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link end points leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help us to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.

Reconstructing networks from dynamics with correlated noise

NASA Astrophysics Data System (ADS)

Tam, H. C.; Ching, Emily S. C.; Lai, Pik-Yin

2018-07-01

Reconstructing the structure of complex networks from measurements of the nodes is a challenge in many branches of science. External influences are always present and act as a noise to the networks of interest. In this paper, we present a method for reconstructing networks from measured dynamics of the nodes subjected to correlated noise that cannot be approximated by a white noise. This method can reconstruct the links of both bidirectional and directed networks, the correlation time and strength of the noise, and also the relative coupling strength of the links when the coupling functions have certain properties. Our method is built upon theoretical relations between network structure and measurable quantities from the dynamics that we have derived for systems that have fixed point dynamics in the noise-free limit. Using these theoretical results, we can further explain the shortcomings of two common practices of inferring links for bidirectional networks using the Pearson correlation coefficient and the partial correlation coefficient.

Humans use compression heuristics to improve the recall of social networks.

PubMed

Brashears, Matthew E

2013-01-01

The ability of primates, including humans, to maintain large social networks appears to depend on the ratio of the neocortex to the rest of the brain. However, observed human network size frequently exceeds predictions based on this ratio (e.g., "Dunbar's Number"), implying that human networks are too large to be cognitively managed. Here I show that humans adaptively use compression heuristics to allow larger amounts of social information to be stored in the same brain volume. I find that human adults can remember larger numbers of relationships in greater detail when a network exhibits triadic closure and kin labels than when it does not. These findings help to explain how humans manage large and complex social networks with finite cognitive resources and suggest that many of the unusual properties of human social networks are rooted in the strategies necessary to cope with cognitive limitations.

Ubiquitousness of link-density and link-pattern communities in real-world networks

NASA Astrophysics Data System (ADS)

Šubelj, L.; Bajec, M.

2012-01-01

Community structure appears to be an intrinsic property of many complex real-world networks. However, recent work shows that real-world networks reveal even more sophisticated modules than classical cohesive (link-density) communities. In particular, networks can also be naturally partitioned according to similar patterns of connectedness among the nodes, revealing link-pattern communities. We here propose a propagation based algorithm that can extract both link-density and link-pattern communities, without any prior knowledge of the true structure. The algorithm was first validated on different classes of synthetic benchmark networks with community structure, and also on random networks. We have further applied the algorithm to different social, information, technological and biological networks, where it indeed reveals meaningful (composites of) link-density and link-pattern communities. The results thus seem to imply that, similarly as link-density counterparts, link-pattern communities appear ubiquitous in nature and design.

Nonlinear network model analysis of vibrational energy transfer and localisation in the Fenna-Matthews-Olson complex

NASA Astrophysics Data System (ADS)

Morgan, Sarah E.; Cole, Daniel J.; Chin, Alex W.

2016-11-01

Collective protein modes are expected to be important for facilitating energy transfer in the Fenna-Matthews-Olson (FMO) complex of photosynthetic green sulphur bacteria, however to date little work has focussed on the microscopic details of these vibrations. The nonlinear network model (NNM) provides a computationally inexpensive approach to studying vibrational modes at the microscopic level in large protein structures, whilst incorporating anharmonicity in the inter-residue interactions which can influence protein dynamics. We apply the NNM to the entire trimeric FMO complex and find evidence for the existence of nonlinear discrete breather modes. These modes tend to transfer energy to the highly connected core pigments, potentially opening up alternative excitation energy transfer routes through their influence on pigment properties. Incorporating localised modes based on these discrete breathers in the optical spectra calculations for FMO using ab initio site energies and excitonic couplings can substantially improve their agreement with experimental results.

A Topological Criterion for Filtering Information in Complex Brain Networks

PubMed Central

Latora, Vito; Chavez, Mario

2017-01-01

In many biological systems, the network of interactions between the elements can only be inferred from experimental measurements. In neuroscience, non-invasive imaging tools are extensively used to derive either structural or functional brain networks in-vivo. As a result of the inference process, we obtain a matrix of values corresponding to a fully connected and weighted network. To turn this into a useful sparse network, thresholding is typically adopted to cancel a percentage of the weakest connections. The structural properties of the resulting network depend on how much of the inferred connectivity is eventually retained. However, how to objectively fix this threshold is still an open issue. We introduce a criterion, the efficiency cost optimization (ECO), to select a threshold based on the optimization of the trade-off between the efficiency of a network and its wiring cost. We prove analytically and we confirm through numerical simulations that the connection density maximizing this trade-off emphasizes the intrinsic properties of a given network, while preserving its sparsity. Moreover, this density threshold can be determined a-priori, since the number of connections to filter only depends on the network size according to a power-law. We validate this result on several brain networks, from micro- to macro-scales, obtained with different imaging modalities. Finally, we test the potential of ECO in discriminating brain states with respect to alternative filtering methods. ECO advances our ability to analyze and compare biological networks, inferred from experimental data, in a fast and principled way. PMID:28076353

The Laplacian spectrum of neural networks

PubMed Central

de Lange, Siemon C.; de Reus, Marcel A.; van den Heuvel, Martijn P.

2014-01-01

The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these “conventional” graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks. PMID:24454286

Soil organic carbon dynamics jointly controlled by climate, carbon inputs, soil properties and soil carbon fractions.

PubMed

Luo, Zhongkui; Feng, Wenting; Luo, Yiqi; Baldock, Jeff; Wang, Enli

2017-10-01

Soil organic carbon (SOC) dynamics are regulated by the complex interplay of climatic, edaphic and biotic conditions. However, the interrelation of SOC and these drivers and their potential connection networks are rarely assessed quantitatively. Using observations of SOC dynamics with detailed soil properties from 90 field trials at 28 sites under different agroecosystems across the Australian cropping regions, we investigated the direct and indirect effects of climate, soil properties, carbon (C) inputs and soil C pools (a total of 17 variables) on SOC change rate (r C , Mg C ha -1  yr -1 ). Among these variables, we found that the most influential variables on r C were the average C input amount and annual precipitation, and the total SOC stock at the beginning of the trials. Overall, C inputs (including C input amount and pasture frequency in the crop rotation system) accounted for 27% of the relative influence on r C , followed by climate 25% (including precipitation and temperature), soil C pools 24% (including pool size and composition) and soil properties (such as cation exchange capacity, clay content, bulk density) 24%. Path analysis identified a network of intercorrelations of climate, soil properties, C inputs and soil C pools in determining r C . The direct correlation of r C with climate was significantly weakened if removing the effects of soil properties and C pools, and vice versa. These results reveal the relative importance of climate, soil properties, C inputs and C pools and their complex interconnections in regulating SOC dynamics. Ignorance of the impact of changes in soil properties, C pool composition and C input (quantity and quality) on SOC dynamics is likely one of the main sources of uncertainty in SOC predictions from the process-based SOC models. © 2017 John Wiley & Sons Ltd.

Inferring the background traffic arrival process in the Internet.

PubMed

Hága, Péter; Csabai, István; Vattay, Gábor

2009-12-01

Phase transition has been found in many complex interactivity systems. Complex networks are not exception either but there are quite few real systems where we can directly understand the emergence of this nontrivial behavior from the microscopic view. In this paper, we present the emergence of the phase transition between the congested and uncongested phases of a network link. We demonstrate a method to infer the background traffic arrival process, which is one of the key state parameters of the Internet traffic. The traffic arrival process in the Internet has been investigated in several studies, since the recognition of its self-similar nature. The statistical properties of the traffic arrival process are very important since they are fundamental in modeling the dynamical behavior. Here, we demonstrate how the widely used packet train technique can be used to determine the main properties of the traffic arrival process. We show that the packet train dispersion is sensitive to the congestion on the network path. We introduce the packet train stretch as an order parameter to describe the phase transition between the congested and uncongested phases of the bottleneck link in the path. We find that the distribution of the background traffic arrival process can be determined from the average packet train dispersion at the critical point of the system.

Structure-property-glass transition relationships in non-isocyanate polyurethanes investigated by dynamic nanoindentation

NASA Astrophysics Data System (ADS)

Weyand, Stephan; Blattmann, Hannes; Schimpf, Vitalij; Mülhaupt, Rolf; Schwaiger, Ruth

2016-07-01

Newly developed green-chemistry approaches towards the synthesis of non-isocyanate polyurethane (NIPU) systems represent a promising alternative to polyurethanes (PU) eliminating the need for harmful ingredients. A series of NIPU systems were studied using different nanoindentation techniques in order to understand the influence of molecular parameters on the mechanical behavior. Nanoindentation revealed a unique characteristic feature of those materials, i.e. stiffening with increasing deformation. It is argued that the origin of this observed stiffening is a consequence of the thermodynamic state of the polymer network, the molecular characteristics of the chemical building blocks and resulting anisotropic elastic response of the network structure. Flat-punch nanoindentation was applied in order to characterize the constitutive viscoelastic nature of the materials. The complex modulus shows distinct changes as a function of the NIPU network topology illustrating the influence of the chemical building blocks. The reproducibility of the data indicates that the materials are homogeneous over the volumes sampled by nanoindentation. Our study demonstrates that nanoindentation is very well-suited to investigate the molecular characteristics of NIPU materials that cannot be quantified in conventional experiments. Moreover, the technique provides insight into the functional significance of complex molecular architectures thereby supporting the development of NIPU materials with tailored properties.

Small Worldness in Dense and Weighted Connectomes

NASA Astrophysics Data System (ADS)

Colon-Perez, Luis; Couret, Michelle; Triplett, William; Price, Catherine; Mareci, Thomas

2016-05-01

The human brain is a heterogeneous network of connected functional regions; however, most brain network studies assume that all brain connections can be described in a framework of binary connections. The brain is a complex structure of white matter tracts connected by a wide range of tract sizes, which suggests a broad range of connection strengths. Therefore, the assumption that the connections are binary yields an incomplete picture of the brain. Various thresholding methods have been used to remove spurious connections and reduce the graph density in binary networks. But these thresholds are arbitrary and make problematic the comparison of networks created at different thresholds. The heterogeneity of connection strengths can be represented in graph theory by applying weights to the network edges. Using our recently introduced edge weight parameter, we estimated the topological brain network organization using a complimentary weighted connectivity framework to the traditional framework of a binary network. To examine the reproducibility of brain networks in a controlled condition, we studied the topological network organization of a single healthy individual by acquiring 10 repeated diffusion-weighted magnetic resonance image datasets, over a one-month period on the same scanner, and analyzing these networks with deterministic tractography. We applied a threshold to both the binary and weighted networks and determined that the extra degree of freedom that comes with the framework of weighting network connectivity provides a robust result as any threshold level. The proposed weighted connectivity framework provides a stable result and is able to demonstrate the small world property of brain networks in situations where the binary framework is inadequate and unable to demonstrate this network property.

Design Constraints on a Synthetic Metabolism

PubMed Central

Bilgin, Tugce; Wagner, Andreas

2012-01-01

A metabolism is a complex network of chemical reactions that converts sources of energy and chemical elements into biomass and other molecules. To design a metabolism from scratch and to implement it in a synthetic genome is almost within technological reach. Ideally, a synthetic metabolism should be able to synthesize a desired spectrum of molecules at a high rate, from multiple different nutrients, while using few chemical reactions, and producing little or no waste. Not all of these properties are achievable simultaneously. We here use a recently developed technique to create random metabolic networks with pre-specified properties to quantify trade-offs between these and other properties. We find that for every additional molecule to be synthesized a network needs on average three additional reactions. For every additional carbon source to be utilized, it needs on average two additional reactions. Networks able to synthesize 20 biomass molecules from each of 20 alternative sole carbon sources need to have at least 260 reactions. This number increases to 518 reactions for networks that can synthesize more than 60 molecules from each of 80 carbon sources. The maximally achievable rate of biosynthesis decreases by approximately 5 percent for every additional molecule to be synthesized. Biochemically related molecules can be synthesized at higher rates, because their synthesis produces less waste. Overall, the variables we study can explain 87 percent of variation in network size and 84 percent of the variation in synthesis rate. The constraints we identify prescribe broad boundary conditions that can help to guide synthetic metabolism design. PMID:22768162

Functional brain networks in Alzheimer's disease: EEG analysis based on limited penetrable visibility graph and phase space method

NASA Astrophysics Data System (ADS)

Wang, Jiang; Yang, Chen; Wang, Ruofan; Yu, Haitao; Cao, Yibin; Liu, Jing

2016-10-01

In this paper, EEG series are applied to construct functional connections with the correlation between different regions in order to investigate the nonlinear characteristic and the cognitive function of the brain with Alzheimer's disease (AD). First, limited penetrable visibility graph (LPVG) and phase space method map single EEG series into networks, and investigate the underlying chaotic system dynamics of AD brain. Topological properties of the networks are extracted, such as average path length and clustering coefficient. It is found that the network topology of AD in several local brain regions are different from that of the control group with no statistically significant difference existing all over the brain. Furthermore, in order to detect the abnormality of AD brain as a whole, functional connections among different brain regions are reconstructed based on similarity of clustering coefficient sequence (CCSS) of EEG series in the four frequency bands (delta, theta, alpha, and beta), which exhibit obvious small-world properties. Graph analysis demonstrates that for both methodologies, the functional connections between regions of AD brain decrease, particularly in the alpha frequency band. AD causes the graph index complexity of the functional network decreased, the small-world properties weakened, and the vulnerability increased. The obtained results show that the brain functional network constructed by LPVG and phase space method might be more effective to distinguish AD from the normal control than the analysis of single series, which is helpful for revealing the underlying pathological mechanism of the disease.

Light scattering optimization of chitin random network in ultrawhite beetle scales

NASA Astrophysics Data System (ADS)

Utel, Francesco; Cortese, Lorenzo; Pattelli, Lorenzo; Burresi, Matteo; Vignolini, Silvia; Wiersma, Diederik

2017-09-01

Among the natural white colored photonics structures, a bio-system has become of great interest in the field of disordered optical media: the scale of the white beetle Chyphochilus. Despite its low thickness, on average 7 μm, and low refractive index, this beetle exhibits extreme high brightness and unique whiteness. These properties arise from the interaction of light with a complex network of chitin nano filaments embedded in the interior of the scales. As it's been recently claimed, this could be a consequence of the peculiar morphology of the filaments network that, by means of high filling fraction (0.61) and structural anisotropy, optimizes the multiple scattering of light. We therefore performed a numerical analysis on the structural properties of the chitin network in order to understand their role in the enhancement of the scale scattering intensity. Modeling the filaments as interconnected rod shaped scattering centers, we numerically generated the spatial coordinates of the network components. Controlling the quantities that are claimed to play a fundamental role in the brightness and whiteness properties of the investigated system (filling fraction and average rods orientation, i.e. the anisotropy of the ensemble of scattering centers), we obtained a set of customized random networks. FDTD simulations of light transport have been performed on these systems, observing high reflectance for all the visible frequencies and proving the implemented algorithm to numerically generate the structures is suitable to investigate the dependence of reflectance by anisotropy.

Tandem Repeat Proteins Inspired By Squid Ring Teeth

NASA Astrophysics Data System (ADS)

Pena-Francesch, Abdon

Proteins are large biomolecules consisting of long chains of amino acids that hierarchically assemble into complex structures, and provide a variety of building blocks for biological materials. The repetition of structural building blocks is a natural evolutionary strategy for increasing the complexity and stability of protein structures. However, the relationship between amino acid sequence, structure, and material properties of protein systems remains unclear due to the lack of control over the protein sequence and the intricacies of the assembly process. In order to investigate the repetition of protein building blocks, a recently discovered protein from squids is examined as an ideal protein system. Squid ring teeth are predatory appendages located inside the suction cups that provide a strong grasp of prey, and are solely composed of a group of proteins with tandem repetition of building blocks. The objective of this thesis is the understanding of sequence, structure and property relationship in repetitive protein materials inspired in squid ring teeth for the first time. Specifically, this work focuses on squid-inspired structural proteins with tandem repeat units in their sequence (i.e., repetition of alternating building blocks) that are physically cross-linked via beta-sheet structures. The research work presented here tests the hypothesis that, in these systems, increasing the number of building blocks in the polypeptide chain decreases the protein network defects and improves the material properties. Hence, the sequence, nanostructure, and properties (thermal, mechanical, and conducting) of tandem repeat squid-inspired protein materials are examined. Spectroscopic structural analysis, advanced materials characterization, and entropic elasticity theory are combined to elucidate the structure and material properties of these repetitive proteins. This approach is applied not only to native squid proteins but also to squid-inspired synthetic polypeptides that allow for a fine control of the sequence and network morphology. The results provided in this work establish a clear dependence between the repetitive building blocks, the network morphology, and the properties of squid-inspired repetitive protein materials. Increasing the number of tandem repeat units in SRT-inspired proteins led to more effective protein networks with superior properties. Through increasing tandem repetition and optimization of network morphology, highly efficient protein materials capable of withstanding deformations up to 400% of their original length, with MPa-GPa modulus, high energy absorption (50 MJ m-3), peak proton conductivity of 3.7 mS cm-1 (at pH 7, highest reported to date for biological materials), and peak thermal conductivity of 1.4 W m-1 K -1 (which exceeds that of most polymer materials) were developed. These findings introduce new design rules in the engineering of proteins based on tandem repetition and morphology control, and provide a novel framework for tailoring and optimizing the properties of protein-based materials.

Characterizing the evolution of climate networks

NASA Astrophysics Data System (ADS)

Tupikina, L.; Rehfeld, K.; Molkenthin, N.; Stolbova, V.; Marwan, N.; Kurths, J.

2014-06-01

Complex network theory has been successfully applied to understand the structural and functional topology of many dynamical systems from nature, society and technology. Many properties of these systems change over time, and, consequently, networks reconstructed from them will, too. However, although static and temporally changing networks have been studied extensively, methods to quantify their robustness as they evolve in time are lacking. In this paper we develop a theory to investigate how networks are changing within time based on the quantitative analysis of dissimilarities in the network structure. Our main result is the common component evolution function (CCEF) which characterizes network development over time. To test our approach we apply it to several model systems, Erdős-Rényi networks, analytically derived flow-based networks, and transient simulations from the START model for which we control the change of single parameters over time. Then we construct annual climate networks from NCEP/NCAR reanalysis data for the Asian monsoon domain for the time period of 1970-2011 CE and use the CCEF to characterize the temporal evolution in this region. While this real-world CCEF displays a high degree of network persistence over large time lags, there are distinct time periods when common links break down. This phasing of these events coincides with years of strong El Niño/Southern Oscillation phenomena, confirming previous studies. The proposed method can be applied for any type of evolving network where the link but not the node set is changing, and may be particularly useful to characterize nonstationary evolving systems using complex networks.

Generalized memory associativity in a network model for the neuroses

NASA Astrophysics Data System (ADS)

Wedemann, Roseli S.; Donangelo, Raul; de Carvalho, Luís A. V.

2009-03-01

We review concepts introduced in earlier work, where a neural network mechanism describes some mental processes in neurotic pathology and psychoanalytic working-through, as associative memory functioning, according to the findings of Freud. We developed a complex network model, where modules corresponding to sensorial and symbolic memories interact, representing unconscious and conscious mental processes. The model illustrates Freud's idea that consciousness is related to symbolic and linguistic memory activity in the brain. We have introduced a generalization of the Boltzmann machine to model memory associativity. Model behavior is illustrated with simulations and some of its properties are analyzed with methods from statistical mechanics.