General Dynamics of Topology and Traffic on Weighted Technological Networks

NASA Astrophysics Data System (ADS)

Wang, Wen-Xu; Wang, Bing-Hong; Hu, Bo; Yan, Gang; Ou, Qing

2005-05-01

For most technical networks, the interplay of dynamics, traffic, and topology is assumed crucial to their evolution. In this Letter, we propose a traffic-driven evolution model of weighted technological networks. By introducing a general strength-coupling mechanism under which the traffic and topology mutually interact, the model gives power-law distributions of degree, weight, and strength, as confirmed in many real networks. Particularly, depending on a parameter W that controls the total weight growth of the system, the nontrivial clustering coefficient C, degree assortativity coefficient r, and degree-strength correlation are all consistent with empirical evidence.

Interaction Control to Synchronize Non-synchronizable Networks.

PubMed

Schröder, Malte; Chakraborty, Sagar; Witthaut, Dirk; Nagler, Jan; Timme, Marc

2016-11-17

Synchronization constitutes one of the most fundamental collective dynamics across networked systems and often underlies their function. Whether a system may synchronize depends on the internal unit dynamics as well as the topology and strength of their interactions. For chaotic units with certain interaction topologies synchronization might be impossible across all interaction strengths, meaning that these networks are non-synchronizable. Here we propose the concept of interaction control, generalizing transient uncoupling, to induce desired collective dynamics in complex networks and apply it to synchronize even such non-synchronizable systems. After highlighting that non-synchronizability prevails for a wide range of networks of arbitrary size, we explain how a simple binary control may localize interactions in state space and thereby synchronize networks. Intriguingly, localizing interactions by a fixed control scheme enables stable synchronization across all connected networks regardless of topological constraints. Interaction control may thus ease the design of desired collective dynamics even without knowledge of the networks' exact interaction topology and consequently have implications for biological and self-organizing technical systems.

Real-space mapping of topological invariants using artificial neural networks

NASA Astrophysics Data System (ADS)

Carvalho, D.; García-Martínez, N. A.; Lado, J. L.; Fernández-Rossier, J.

2018-03-01

Topological invariants allow one to characterize Hamiltonians, predicting the existence of topologically protected in-gap modes. Those invariants can be computed by tracing the evolution of the occupied wave functions under twisted boundary conditions. However, those procedures do not allow one to calculate a topological invariant by evaluating the system locally, and thus require information about the wave functions in the whole system. Here we show that artificial neural networks can be trained to identify the topological order by evaluating a local projection of the density matrix. We demonstrate this for two different models, a one-dimensional topological superconductor and a two-dimensional quantum anomalous Hall state, both with spatially modulated parameters. Our neural network correctly identifies the different topological domains in real space, predicting the location of in-gap states. By combining a neural network with a calculation of the electronic states that uses the kernel polynomial method, we show that the local evaluation of the invariant can be carried out by evaluating a local quantity, in particular for systems without translational symmetry consisting of tens of thousands of atoms. Our results show that supervised learning is an efficient methodology to characterize the local topology of a system.

Bribery games on interdependent complex networks.

PubMed

Verma, Prateek; Nandi, Anjan K; Sengupta, Supratim

2018-08-07

Bribe demands present a social conflict scenario where decisions have wide-ranging economic and ethical consequences. Nevertheless, such incidents occur daily in many countries across the globe. Harassment bribery constitute a significant sub-set of such bribery incidents where a government official demands a bribe for providing a service to a citizen legally entitled to it. We employ an evolutionary game-theoretic framework to analyse the evolution of corrupt and honest strategies in structured populations characterized by an interdependent complex network. The effects of changing network topology, average number of links and asymmetry in size of the citizen and officer population on the proliferation of incidents of bribery are explored. A complex network topology is found to be beneficial for the dominance of corrupt strategies over a larger region of phase space when compared with the outcome for a regular network, for equal citizen and officer population sizes. However, the extent of the advantage depends critically on the network degree and topology. A different trend is observed when there is a difference between the citizen and officer population sizes. Under those circumstances, increasing randomness of the underlying citizen network can be beneficial to the fixation of honest officers up to a certain value of the network degree. Our analysis reveals how the interplay between network topology, connectivity and strategy update rules can affect population level outcomes in such asymmetric games. Copyright © 2018 Elsevier Ltd. All rights reserved.

Interaction Control to Synchronize Non-synchronizable Networks

PubMed Central

Schröder, Malte; Chakraborty, Sagar; Witthaut, Dirk; Nagler, Jan; Timme, Marc

2016-01-01

Synchronization constitutes one of the most fundamental collective dynamics across networked systems and often underlies their function. Whether a system may synchronize depends on the internal unit dynamics as well as the topology and strength of their interactions. For chaotic units with certain interaction topologies synchronization might be impossible across all interaction strengths, meaning that these networks are non-synchronizable. Here we propose the concept of interaction control, generalizing transient uncoupling, to induce desired collective dynamics in complex networks and apply it to synchronize even such non-synchronizable systems. After highlighting that non-synchronizability prevails for a wide range of networks of arbitrary size, we explain how a simple binary control may localize interactions in state space and thereby synchronize networks. Intriguingly, localizing interactions by a fixed control scheme enables stable synchronization across all connected networks regardless of topological constraints. Interaction control may thus ease the design of desired collective dynamics even without knowledge of the networks’ exact interaction topology and consequently have implications for biological and self-organizing technical systems. PMID:27853266

Topological relationships between brain and social networks.

PubMed

Sakata, Shuzo; Yamamori, Tetsuo

2007-01-01

Brains are complex networks. Previously, we revealed that specific connected structures are either significantly abundant or rare in cortical networks. However, it remains unknown whether systems from other disciplines have similar architectures to brains. By applying network-theoretical methods, here we show topological similarities between brain and social networks. We found that the statistical relevance of specific tied structures differs between social "friendship" and "disliking" networks, suggesting relation-type-specific topology of social networks. Surprisingly, overrepresented connected structures in brain networks are more similar to those in the friendship networks than to those in other networks. We found that balanced and imbalanced reciprocal connections between nodes are significantly abundant and rare, respectively, whereas these results are unpredictable by simply counting mutual connections. We interpret these results as evidence of positive selection of balanced mutuality between nodes. These results also imply the existence of underlying common principles behind the organization of brain and social networks.

Output synchronization of discrete-time dynamical networks based on geometrically incremental dissipativity.

PubMed

Li, Chensong; Zhao, Jun

2017-01-01

In this work, we investigate the output synchronization problem for discrete-time dynamical networks with identical nodes. Firstly, if each node of a network is geometrically incrementally dissipative, the entire network can be viewed as a geometrically dissipative nonlinear system by choosing a particular input-output pair. Then, based on the geometrical dissipativity property, we consider two cases: output synchronization under arbitrary topology and switching topology, respectively. For the first case, we establish several criteria of output synchronization under arbitrary switching between a set of connection topologies by employing a common Lyapunov function. For the other case, we give the design method of a switching signal to achieve output synchronization even if all subnetworks are not synchronous. Finally, an example is provided to illustrate the effectiveness of the main results. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Maximum likelihood: Extracting unbiased information from complex networks

NASA Astrophysics Data System (ADS)

Garlaschelli, Diego; Loffredo, Maria I.

2008-07-01

The choice of free parameters in network models is subjective, since it depends on what topological properties are being monitored. However, we show that the maximum likelihood (ML) principle indicates a unique, statistically rigorous parameter choice, associated with a well-defined topological feature. We then find that, if the ML condition is incompatible with the built-in parameter choice, network models turn out to be intrinsically ill defined or biased. To overcome this problem, we construct a class of safely unbiased models. We also propose an extension of these results that leads to the fascinating possibility to extract, only from topological data, the “hidden variables” underlying network organization, making them “no longer hidden.” We test our method on World Trade Web data, where we recover the empirical gross domestic product using only topological information.

Topology of molecular interaction networks.

PubMed

Winterbach, Wynand; Van Mieghem, Piet; Reinders, Marcel; Wang, Huijuan; de Ridder, Dick

2013-09-16

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that they share underlying design principles with many other types of networks.Initial studies suggested that molecular interaction network topology is related to biological function and evolution. However, further whole-network analyses did not lead to a unified view on what this relation may look like, with conclusions highly dependent on the type of molecular interactions considered and the metrics used to study them. It is unclear whether global network topology drives function, as suggested by some researchers, or whether it is simply a byproduct of evolution or even an artefact of representing complex molecular interaction networks as graphs.Nevertheless, network biology has progressed significantly over the last years. We review the literature, focusing on two major developments. First, realizing that molecular interaction networks can be naturally decomposed into subsystems (such as modules and pathways), topology is increasingly studied locally rather than globally. Second, there is a move from a descriptive approach to a predictive one: rather than correlating biological network topology to generic properties such as robustness, it is used to predict specific functions or phenotypes.Taken together, this change in focus from globally descriptive to locally predictive points to new avenues of research. In particular, multi-scale approaches are developments promising to drive the study of molecular interaction networks further.

Topology of molecular interaction networks

PubMed Central

2013-01-01

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that they share underlying design principles with many other types of networks. Initial studies suggested that molecular interaction network topology is related to biological function and evolution. However, further whole-network analyses did not lead to a unified view on what this relation may look like, with conclusions highly dependent on the type of molecular interactions considered and the metrics used to study them. It is unclear whether global network topology drives function, as suggested by some researchers, or whether it is simply a byproduct of evolution or even an artefact of representing complex molecular interaction networks as graphs. Nevertheless, network biology has progressed significantly over the last years. We review the literature, focusing on two major developments. First, realizing that molecular interaction networks can be naturally decomposed into subsystems (such as modules and pathways), topology is increasingly studied locally rather than globally. Second, there is a move from a descriptive approach to a predictive one: rather than correlating biological network topology to generic properties such as robustness, it is used to predict specific functions or phenotypes. Taken together, this change in focus from globally descriptive to locally predictive points to new avenues of research. In particular, multi-scale approaches are developments promising to drive the study of molecular interaction networks further. PMID:24041013

The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference

PubMed Central

Deng, Changjian

2013-01-01

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613

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.

Topology of foreign exchange markets using hierarchical structure methods

NASA Astrophysics Data System (ADS)

Naylor, Michael J.; Rose, Lawrence C.; Moyle, Brendan J.

2007-08-01

This paper uses two physics derived hierarchical techniques, a minimal spanning tree and an ultrametric hierarchical tree, to extract a topological influence map for major currencies from the ultrametric distance matrix for 1995-2001. We find that these two techniques generate a defined and robust scale free network with meaningful taxonomy. The topology is shown to be robust with respect to method, to time horizon and is stable during market crises. This topology, appropriately used, gives a useful guide to determining the underlying economic or regional causal relationships for individual currencies and to understanding the dynamics of exchange rate price determination as part of a complex network.

A hybrid network-based method for the detection of disease-related genes

NASA Astrophysics Data System (ADS)

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

2018-02-01

Detecting disease-related genes is crucial in disease diagnosis and drug design. The accepted view is that neighbors of a disease-causing gene in a molecular network tend to cause the same or similar diseases, and network-based methods have been recently developed to identify novel hereditary disease-genes in available biomedical networks. Despite the steady increase in the discovery of disease-associated genes, there is still a large fraction of disease genes that remains under the tip of the iceberg. In this paper we exploit the topological properties of the protein-protein interaction (PPI) network to detect disease-related genes. We compute, analyze, and compare the topological properties of disease genes with non-disease genes in PPI networks. We also design an improved random forest classifier based on these network topological features, and a cross-validation test confirms that our method performs better than previous similar studies.

Fermionic topological quantum states as tensor networks

NASA Astrophysics Data System (ADS)

Wille, C.; Buerschaper, O.; Eisert, J.

2017-06-01

Tensor network states, and in particular projected entangled pair states, play an important role in the description of strongly correlated quantum lattice systems. They do not only serve as variational states in numerical simulation methods, but also provide a framework for classifying phases of quantum matter and capture notions of topological order in a stringent and rigorous language. The rapid development in this field for spin models and bosonic systems has not yet been mirrored by an analogous development for fermionic models. In this work, we introduce a tensor network formalism capable of capturing notions of topological order for quantum systems with fermionic components. At the heart of the formalism are axioms of fermionic matrix-product operator injectivity, stable under concatenation. Building upon that, we formulate a Grassmann number tensor network ansatz for the ground state of fermionic twisted quantum double models. A specific focus is put on the paradigmatic example of the fermionic toric code. This work shows that the program of describing topologically ordered systems using tensor networks carries over to fermionic models.

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.

Determining Regulatory Networks Governing the Differentiation of Embryonic Stem Cells to Pancreatic Lineage

NASA Astrophysics Data System (ADS)

Banerjee, Ipsita

2009-03-01

Knowledge of pathways governing cellular differentiation to specific phenotype will enable generation of desired cell fates by careful alteration of the governing network by adequate manipulation of the cellular environment. With this aim, we have developed a novel method to reconstruct the underlying regulatory architecture of a differentiating cell population from discrete temporal gene expression data. We utilize an inherent feature of biological networks, that of sparsity, in formulating the network reconstruction problem as a bi-level mixed-integer programming problem. The formulation optimizes the network topology at the upper level and the network connectivity strength at the lower level. The method is first validated by in-silico data, before applying it to the complex system of embryonic stem (ES) cell differentiation. This formulation enables efficient identification of the underlying network topology which could accurately predict steps necessary for directing differentiation to subsequent stages. Concurrent experimental verification demonstrated excellent agreement with model prediction.

Visibility in the topology of complex networks

NASA Astrophysics Data System (ADS)

Tsiotas, Dimitrios; Charakopoulos, Avraam

2018-09-01

Taking its inspiration from the visibility algorithm, which was proposed by Lacasa et al. (2008) to convert a time-series into a complex network, this paper develops and proposes a novel expansion of this algorithm that allows generating a visibility graph from a complex network instead of a time-series that is currently applicable. The purpose of this approach is to apply the idea of visibility from the field of time-series to complex networks in order to interpret the network topology as a landscape. Visibility in complex networks is a multivariate property producing an associated visibility graph that maps the ability of a node "to see" other nodes in the network that lie beyond the range of its neighborhood, in terms of a control-attribute. Within this context, this paper examines the visibility topology produced by connectivity (degree) in comparison with the original (source) network, in order to detect what patterns or forces describe the mechanism under which a network is converted to a visibility graph. The overall analysis shows that visibility is a property that increases the connectivity in networks, it may contribute to pattern recognition (among which the detection of the scale-free topology) and it is worth to be applied to complex networks in order to reveal the potential of signal processing beyond the range of its neighborhood. Generally, this paper promotes interdisciplinary research in complex networks providing new insights to network science.

Regulatory network rewiring for secondary metabolism in Arabidopsis thaliana under various conditions

PubMed Central

2014-01-01

Background Plant secondary metabolites are critical to various biological processes. However, the regulations of these metabolites are complex because of regulatory rewiring or crosstalk. To unveil how regulatory behaviors on secondary metabolism reshape biological processes, we constructed and analyzed a dynamic regulatory network of secondary metabolic pathways in Arabidopsis. Results The dynamic regulatory network was constructed through integrating co-expressed gene pairs and regulatory interactions. Regulatory interactions were either predicted by conserved transcription factor binding sites (TFBSs) or proved by experiments. We found that integrating two data (co-expression and predicted regulatory interactions) enhanced the number of highly confident regulatory interactions by over 10% compared with using single data. The dynamic changes of regulatory network systematically manifested regulatory rewiring to explain the mechanism of regulation, such as in terpenoids metabolism, the regulatory crosstalk of RAV1 (AT1G13260) and ATHB1 (AT3G01470) on HMG1 (hydroxymethylglutaryl-CoA reductase, AT1G76490); and regulation of RAV1 on epoxysqualene biosynthesis and sterol biosynthesis. Besides, we investigated regulatory rewiring with expression, network topology and upstream signaling pathways. Regulatory rewiring was revealed by the variability of genes’ expression: pathway genes and transcription factors (TFs) were significantly differentially expressed under different conditions (such as terpenoids biosynthetic genes in tissue experiments and E2F/DP family members in genotype experiments). Both network topology and signaling pathways supported regulatory rewiring. For example, we discovered correlation among the numbers of pathway genes, TFs and network topology: one-gene pathways (such as δ-carotene biosynthesis) were regulated by a fewer TFs, and were not critical to metabolic network because of their low degrees in topology. Upstream signaling pathways of 50 TFs were identified to comprehend the underlying mechanism of TFs’ regulatory rewiring. Conclusion Overall, this dynamic regulatory network largely improves the understanding of perplexed regulatory rewiring in secondary metabolism in Arabidopsis. PMID:24993737

Network topology and parameter estimation: from experimental design methods to gene regulatory network kinetics using a community based approach

PubMed Central

2014-01-01

Background Accurate estimation of parameters of biochemical models is required to characterize the dynamics of molecular processes. This problem is intimately linked to identifying the most informative experiments for accomplishing such tasks. While significant progress has been made, effective experimental strategies for parameter identification and for distinguishing among alternative network topologies remain unclear. We approached these questions in an unbiased manner using a unique community-based approach in the context of the DREAM initiative (Dialogue for Reverse Engineering Assessment of Methods). We created an in silico test framework under which participants could probe a network with hidden parameters by requesting a range of experimental assays; results of these experiments were simulated according to a model of network dynamics only partially revealed to participants. Results We proposed two challenges; in the first, participants were given the topology and underlying biochemical structure of a 9-gene regulatory network and were asked to determine its parameter values. In the second challenge, participants were given an incomplete topology with 11 genes and asked to find three missing links in the model. In both challenges, a budget was provided to buy experimental data generated in silico with the model and mimicking the features of different common experimental techniques, such as microarrays and fluorescence microscopy. Data could be bought at any stage, allowing participants to implement an iterative loop of experiments and computation. Conclusions A total of 19 teams participated in this competition. The results suggest that the combination of state-of-the-art parameter estimation and a varied set of experimental methods using a few datasets, mostly fluorescence imaging data, can accurately determine parameters of biochemical models of gene regulation. However, the task is considerably more difficult if the gene network topology is not completely defined, as in challenge 2. Importantly, we found that aggregating independent parameter predictions and network topology across submissions creates a solution that can be better than the one from the best-performing submission. PMID:24507381

The topological requirements for robust perfect adaptation in networks of any size.

PubMed

Araujo, Robyn P; Liotta, Lance A

2018-05-01

Robustness, and the ability to function and thrive amid changing and unfavorable environments, is a fundamental requirement for living systems. Until now it has been an open question how large and complex biological networks can exhibit robust behaviors, such as perfect adaptation to a variable stimulus, since complexity is generally associated with fragility. Here we report that all networks that exhibit robust perfect adaptation (RPA) to a persistent change in stimulus are decomposable into well-defined modules, of which there exist two distinct classes. These two modular classes represent a topological basis for all RPA-capable networks, and generate the full set of topological realizations of the internal model principle for RPA in complex, self-organizing, evolvable bionetworks. This unexpected result supports the notion that evolutionary processes are empowered by simple and scalable modular design principles that promote robust performance no matter how large or complex the underlying networks become.

The geometric nature of weights in real complex networks

NASA Astrophysics Data System (ADS)

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

2017-01-01

The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of their complex topologies, this hypothesis yields the recipe for sustainable Internet's routing protocols, sheds light on the hierarchical organization of biochemical pathways in cells, and allows for a rich characterization of the evolution of international trade. Here we present empirical evidence that this geometric interpretation also applies to the weighted organization of real complex networks. We introduce a very general and versatile model and use it to quantify the level of coupling between their topology, their weights and an underlying metric space. Our model accurately reproduces both their topology and their weights, and our results suggest that the formation of connections and the assignment of their magnitude are ruled by different processes.

Network structure, topology, and dynamics in generalized models of synchronization

NASA Astrophysics Data System (ADS)

Lerman, Kristina; Ghosh, Rumi

2012-08-01

Network structure is a product of both its topology and interactions between its nodes. We explore this claim using the paradigm of distributed synchronization in a network of coupled oscillators. As the network evolves to a global steady state, nodes synchronize in stages, revealing the network's underlying community structure. Traditional models of synchronization assume that interactions between nodes are mediated by a conservative process similar to diffusion. However, social and biological processes are often nonconservative. We propose a model of synchronization in a network of oscillators coupled via nonconservative processes. We study the dynamics of synchronization of a synthetic and real-world networks and show that the traditional and nonconservative models of synchronization reveal different structures within the same network.

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

PubMed Central

Ye, Ye; Cheong, Kang Hao; Cen, Yu-wan; Xie, Neng-gang

2016-01-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed. PMID:27845430

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

NASA Astrophysics Data System (ADS)

Ye, Ye; Cheong, Kang Hao; Cen, Yu-Wan; Xie, Neng-Gang

2016-11-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

NASA Astrophysics Data System (ADS)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

PubMed

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Artificial Epigenetic Networks: Automatic Decomposition of Dynamical Control Tasks Using Topological Self-Modification.

PubMed

Turner, Alexander P; Caves, Leo S D; Stepney, Susan; Tyrrell, Andy M; Lones, Michael A

2017-01-01

This paper describes the artificial epigenetic network, a recurrent connectionist architecture that is able to dynamically modify its topology in order to automatically decompose and solve dynamical problems. The approach is motivated by the behavior of gene regulatory networks, particularly the epigenetic process of chromatin remodeling that leads to topological change and which underlies the differentiation of cells within complex biological organisms. We expected this approach to be useful in situations where there is a need to switch between different dynamical behaviors, and do so in a sensitive and robust manner in the absence of a priori information about problem structure. This hypothesis was tested using a series of dynamical control tasks, each requiring solutions that could express different dynamical behaviors at different stages within the task. In each case, the addition of topological self-modification was shown to improve the performance and robustness of controllers. We believe this is due to the ability of topological changes to stabilize attractors, promoting stability within a dynamical regime while allowing rapid switching between different regimes. Post hoc analysis of the controllers also demonstrated how the partitioning of the networks could provide new insights into problem structure.

Distributed fault detection over sensor networks with Markovian switching topologies

NASA Astrophysics Data System (ADS)

Ge, Xiaohua; Han, Qing-Long

2014-05-01

This paper deals with the distributed fault detection for discrete-time Markov jump linear systems over sensor networks with Markovian switching topologies. The sensors are scatteredly deployed in the sensor field and the fault detectors are physically distributed via a communication network. The system dynamics changes and sensing topology variations are modeled by a discrete-time Markov chain with incomplete mode transition probabilities. Each of these sensor nodes firstly collects measurement outputs from its all underlying neighboring nodes, processes these data in accordance with the Markovian switching topologies, and then transmits the processed data to the remote fault detector node. Network-induced delays and accumulated data packet dropouts are incorporated in the data transmission between the sensor nodes and the distributed fault detector nodes through the communication network. To generate localized residual signals, mode-independent distributed fault detection filters are proposed. By means of the stochastic Lyapunov functional approach, the residual system performance analysis is carried out such that the overall residual system is stochastically stable and the error between each residual signal and the fault signal is made as small as possible. Furthermore, a sufficient condition on the existence of the mode-independent distributed fault detection filters is derived in the simultaneous presence of incomplete mode transition probabilities, Markovian switching topologies, network-induced delays, and accumulated data packed dropouts. Finally, a stirred-tank reactor system is given to show the effectiveness of the developed theoretical results.

Spectrum-Based and Collaborative Network Topology Analysis and Visualization

ERIC Educational Resources Information Center

Hu, Xianlin

2013-01-01

Networks are of significant importance in many application domains, such as World Wide Web and social networks, which often embed rich topological information. Since network topology captures the organization of network nodes and links, studying network topology is very important to network analysis. In this dissertation, we study networks by…

Pathways of topological rank analysis (PoTRA): a novel method to detect pathways involved in hepatocellular carcinoma

PubMed Central

Liu, Li; Dinu, Valentin

2018-01-01

Complex diseases such as cancer are usually the result of a combination of environmental factors and one or several biological pathways consisting of sets of genes. Each biological pathway exerts its function by delivering signaling through the gene network. Theoretically, a pathway is supposed to have a robust topological structure under normal physiological conditions. However, the pathway’s topological structure could be altered under some pathological condition. It is well known that a normal biological network includes a small number of well-connected hub nodes and a large number of nodes that are non-hubs. In addition, it is reported that the loss of connectivity is a common topological trait of cancer networks, which is an assumption of our method. Hence, from normal to cancer, the process of the network losing connectivity might be the process of disrupting the structure of the network, namely, the number of hub genes might be altered in cancer compared to that in normal or the distribution of topological ranks of genes might be altered. Based on this, we propose a new PageRank-based method called Pathways of Topological Rank Analysis (PoTRA) to detect pathways involved in cancer. We use PageRank to measure the relative topological ranks of genes in each biological pathway, then select hub genes for each pathway, and use Fisher’s exact test to test if the number of hub genes in each pathway is altered from normal to cancer. Alternatively, if the distribution of topological ranks of gene in a pathway is altered between normal and cancer, this pathway might also be involved in cancer. Hence, we use the Kolmogorov–Smirnov test to detect pathways that have an altered distribution of topological ranks of genes between two phenotypes. We apply PoTRA to study hepatocellular carcinoma (HCC) and several subtypes of HCC. Very interestingly, we discover that all significant pathways in HCC are cancer-associated generally, while several significant pathways in subtypes of HCC are HCC subtype-associated specifically. In conclusion, PoTRA is a new approach to explore and discover pathways involved in cancer. PoTRA can be used as a complement to other existing methods to broaden our understanding of the biological mechanisms behind cancer at the system-level. PMID:29666752

Pathways of topological rank analysis (PoTRA): a novel method to detect pathways involved in hepatocellular carcinoma.

PubMed

Li, Chaoxing; Liu, Li; Dinu, Valentin

2018-01-01

Complex diseases such as cancer are usually the result of a combination of environmental factors and one or several biological pathways consisting of sets of genes. Each biological pathway exerts its function by delivering signaling through the gene network. Theoretically, a pathway is supposed to have a robust topological structure under normal physiological conditions. However, the pathway's topological structure could be altered under some pathological condition. It is well known that a normal biological network includes a small number of well-connected hub nodes and a large number of nodes that are non-hubs. In addition, it is reported that the loss of connectivity is a common topological trait of cancer networks, which is an assumption of our method. Hence, from normal to cancer, the process of the network losing connectivity might be the process of disrupting the structure of the network, namely, the number of hub genes might be altered in cancer compared to that in normal or the distribution of topological ranks of genes might be altered. Based on this, we propose a new PageRank-based method called Pathways of Topological Rank Analysis (PoTRA) to detect pathways involved in cancer. We use PageRank to measure the relative topological ranks of genes in each biological pathway, then select hub genes for each pathway, and use Fisher's exact test to test if the number of hub genes in each pathway is altered from normal to cancer. Alternatively, if the distribution of topological ranks of gene in a pathway is altered between normal and cancer, this pathway might also be involved in cancer. Hence, we use the Kolmogorov-Smirnov test to detect pathways that have an altered distribution of topological ranks of genes between two phenotypes. We apply PoTRA to study hepatocellular carcinoma (HCC) and several subtypes of HCC. Very interestingly, we discover that all significant pathways in HCC are cancer-associated generally, while several significant pathways in subtypes of HCC are HCC subtype-associated specifically. In conclusion, PoTRA is a new approach to explore and discover pathways involved in cancer. PoTRA can be used as a complement to other existing methods to broaden our understanding of the biological mechanisms behind cancer at the system-level.

Resonant UPS topologies for the emerging hybrid fiber-coaxial networks

NASA Astrophysics Data System (ADS)

Pinheiro, Humberto

Uninterruptible power supply (UPS) systems have been extensively applied to feed critical loads in many areas. Typical examples of critical loads include life-support equipment, computers and telecommunication systems. Although all UPS systems have a common purpose to provide continuous power-to critical loads, the emerging hybrid fiber-coaxial networks have created the need for specific types of UPS topologies. For example, galvanic isolation for the load and the battery, small size, high input power factor, and trapezoidal output voltage waveforms are among the required features of UPS topologies for hybrid fiber-coaxial networks. None of the conventional UPS topologies meet all these requirements. Consequently. this thesis is directed towards the design and analysis of UPS topologies for this new application. Novel UPS topologies are proposed and control techniques are developed to allow operation at high switching frequencies without penalizing the converter efficiency. By the use of resonant converters in the proposed UPS topologies. a high input power factor is achieved without requiring a dedicated power factor correction stage. In addition, a self-sustained oscillation control method is proposed to ensure soft switching under all operating conditions. A detailed analytical treatment of the resonant converters in the proposed UPS topologies is presented and design procedures illustrated. Simulation and experimental results are presented to validate the analyses and to demonstrate the feasibility of the proposed schemes.

GraphCrunch 2: Software tool for network modeling, alignment and clustering.

PubMed

Kuchaiev, Oleksii; Stevanović, Aleksandar; Hayes, Wayne; Pržulj, Nataša

2011-01-19

Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an algorithm for clustering nodes within a network based solely on their topological similarities. Using GraphCrunch 2, we demonstrate that eukaryotic and viral PPI networks may belong to different graph model families and show that topology-based clustering can reveal important functional similarities between proteins within yeast and human PPI networks. GraphCrunch 2 is a software tool that implements the latest research on biological network analysis. It parallelizes computationally intensive tasks to fully utilize the potential of modern multi-core CPUs. It is open-source and freely available for research use. It runs under the Windows and Linux platforms.

Fronto-Parietal Subnetworks Flexibility Compensates For Cognitive Decline Due To Mental Fatigue.

PubMed

Taya, Fumihiko; Dimitriadis, Stavros I; Dragomir, Andrei; Lim, Julian; Sun, Yu; Wong, Kian Foong; Thakor, Nitish V; Bezerianos, Anastasios

2018-04-24

Fronto-parietal subnetworks were revealed to compensate for cognitive decline due to mental fatigue by community structure analysis. Here, we investigate changes in topology of subnetworks of resting-state fMRI networks due to mental fatigue induced by prolonged performance of a cognitively demanding task, and their associations with cognitive decline. As it is well established that brain networks have modular organization, community structure analyses can provide valuable information about mesoscale network organization and serve as a bridge between standard fMRI approaches and brain connectomics that quantify the topology of whole brain networks. We developed inter- and intramodule network metrics to quantify topological characteristics of subnetworks, based on our hypothesis that mental fatigue would impact on functional relationships of subnetworks. Functional networks were constructed with wavelet correlation and a data-driven thresholding scheme based on orthogonal minimum spanning trees, which allowed detection of communities with weak connections. A change from pre- to posttask runs was found for the intermodule density between the frontal and the temporal subnetworks. Seven inter- or intramodule network metrics, mostly at the frontal or the parietal subnetworks, showed significant predictive power of individual cognitive decline, while the network metrics for the whole network were less effective in the predictions. Our results suggest that the control-type fronto-parietal networks have a flexible topological architecture to compensate for declining cognitive ability due to mental fatigue. This community structure analysis provides valuable insight into connectivity dynamics under different cognitive states including mental fatigue. © 2018 Wiley Periodicals, Inc.

Development of Human Brain Structural Networks Through Infancy and Childhood

PubMed Central

Huang, Hao; Shu, Ni; Mishra, Virendra; Jeon, Tina; Chalak, Lina; Wang, Zhiyue J.; Rollins, Nancy; Gong, Gaolang; Cheng, Hua; Peng, Yun; Dong, Qi; He, Yong

2015-01-01

During human brain development through infancy and childhood, microstructural and macrostructural changes take place to reshape the brain's structural networks and better adapt them to sophisticated functional and cognitive requirements. However, structural topological configuration of the human brain during this specific development period is not well understood. In this study, diffusion magnetic resonance image (dMRI) of 25 neonates, 13 toddlers, and 25 preadolescents were acquired to characterize network dynamics at these 3 landmark cross-sectional ages during early childhood. dMRI tractography was used to construct human brain structural networks, and the underlying topological properties were quantified by graph-theory approaches. Modular organization and small-world attributes are evident at birth with several important topological metrics increasing monotonically during development. Most significant increases of regional nodes occur in the posterior cingulate cortex, which plays a pivotal role in the functional default mode network. Positive correlations exist between nodal efficiencies and fractional anisotropy of the white matter traced from these nodes, while correlation slopes vary among the brain regions. These results reveal substantial topological reorganization of human brain structural networks through infancy and childhood, which is likely to be the outcome of both heterogeneous strengthening of the major white matter tracts and pruning of other axonal fibers. PMID:24335033

Identification of functional modules that correlate with phenotypic difference: the influence of network topology

PubMed Central

2010-01-01

One of the important challenges to post-genomic biology is relating observed phenotypic alterations to the underlying collective alterations in genes. Current inferential methods, however, invariably omit large bodies of information on the relationships between genes. We present a method that takes account of such information - expressed in terms of the topology of a correlation network - and we apply the method in the context of current procedures for gene set enrichment analysis. PMID:20187943

Counting motifs in dynamic networks.

PubMed

Mukherjee, Kingshuk; Hasan, Md Mahmudul; Boucher, Christina; Kahveci, Tamer

2018-04-11

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks. In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network's topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases. We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥ 96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.

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).

Resiliently evolving supply-demand networks

NASA Astrophysics Data System (ADS)

Rubido, Nicolás; Grebogi, Celso; Baptista, Murilo S.

2014-01-01

The ability to design a transport network such that commodities are brought from suppliers to consumers in a steady, optimal, and stable way is of great importance for distribution systems nowadays. In this work, by using the circuit laws of Kirchhoff and Ohm, we provide the exact capacities of the edges that an optimal supply-demand network should have to operate stably under perturbations, i.e., without overloading. The perturbations we consider are the evolution of the connecting topology, the decentralization of hub sources or sinks, and the intermittence of supplier and consumer characteristics. We analyze these conditions and the impact of our results, both on the current United Kingdom power-grid structure and on numerically generated evolving archetypal network topologies.

Comparison of topological clustering within protein networks using edge metrics that evaluate full sequence, full structure, and active site microenvironment similarity.

PubMed

Leuthaeuser, Janelle B; Knutson, Stacy T; Kumar, Kiran; Babbitt, Patricia C; Fetrow, Jacquelyn S

2015-09-01

The development of accurate protein function annotation methods has emerged as a major unsolved biological problem. Protein similarity networks, one approach to function annotation via annotation transfer, group proteins into similarity-based clusters. An underlying assumption is that the edge metric used to identify such clusters correlates with functional information. In this contribution, this assumption is evaluated by observing topologies in similarity networks using three different edge metrics: sequence (BLAST), structure (TM-Align), and active site similarity (active site profiling, implemented in DASP). Network topologies for four well-studied protein superfamilies (enolase, peroxiredoxin (Prx), glutathione transferase (GST), and crotonase) were compared with curated functional hierarchies and structure. As expected, network topology differs, depending on edge metric; comparison of topologies provides valuable information on structure/function relationships. Subnetworks based on active site similarity correlate with known functional hierarchies at a single edge threshold more often than sequence- or structure-based networks. Sequence- and structure-based networks are useful for identifying sequence and domain similarities and differences; therefore, it is important to consider the clustering goal before deciding appropriate edge metric. Further, conserved active site residues identified in enolase and GST active site subnetworks correspond with published functionally important residues. Extension of this analysis yields predictions of functionally determinant residues for GST subgroups. These results support the hypothesis that active site similarity-based networks reveal clusters that share functional details and lay the foundation for capturing functionally relevant hierarchies using an approach that is both automatable and can deliver greater precision in function annotation than current similarity-based methods. © 2015 The Authors Protein Science published by Wiley Periodicals, Inc. on behalf of The Protein Society.

Comparison of topological clustering within protein networks using edge metrics that evaluate full sequence, full structure, and active site microenvironment similarity

PubMed Central

Leuthaeuser, Janelle B; Knutson, Stacy T; Kumar, Kiran; Babbitt, Patricia C; Fetrow, Jacquelyn S

2015-01-01

The development of accurate protein function annotation methods has emerged as a major unsolved biological problem. Protein similarity networks, one approach to function annotation via annotation transfer, group proteins into similarity-based clusters. An underlying assumption is that the edge metric used to identify such clusters correlates with functional information. In this contribution, this assumption is evaluated by observing topologies in similarity networks using three different edge metrics: sequence (BLAST), structure (TM-Align), and active site similarity (active site profiling, implemented in DASP). Network topologies for four well-studied protein superfamilies (enolase, peroxiredoxin (Prx), glutathione transferase (GST), and crotonase) were compared with curated functional hierarchies and structure. As expected, network topology differs, depending on edge metric; comparison of topologies provides valuable information on structure/function relationships. Subnetworks based on active site similarity correlate with known functional hierarchies at a single edge threshold more often than sequence- or structure-based networks. Sequence- and structure-based networks are useful for identifying sequence and domain similarities and differences; therefore, it is important to consider the clustering goal before deciding appropriate edge metric. Further, conserved active site residues identified in enolase and GST active site subnetworks correspond with published functionally important residues. Extension of this analysis yields predictions of functionally determinant residues for GST subgroups. These results support the hypothesis that active site similarity-based networks reveal clusters that share functional details and lay the foundation for capturing functionally relevant hierarchies using an approach that is both automatable and can deliver greater precision in function annotation than current similarity-based methods. PMID:26073648

Cognitive performance in mid-stage Parkinson's disease: functional connectivity under chronic antiparkinson treatment.

PubMed

Vancea, Roxana; Simonyan, Kristina; Petracca, Maria; Brys, Miroslaw; Di Rocco, Alessandro; Ghilardi, Maria Felice; Inglese, Matilde

2017-09-23

Cognitive impairment in Parkinson's disease (PD) is related to the reorganization of brain topology. Although drug challenge studies have proven how levodopa treatment can modulate functional connectivity in brain circuits, the role of chronic dopaminergic therapy on cognitive status and functional connectivity has never been investigated. We sought to characterize brain functional topology in mid-stage PD patients under chronic antiparkinson treatment and explore the presence of correlation between reorganization of brain architecture and specific cognitive deficits. We explored networks topology and functional connectivity in 16 patients with PD and 16 matched controls through a graph theoretical analysis of resting state-functional MRI data, and evaluated the relationships between network metrics and cognitive performance. PD patients showed a preserved small-world network topology but a lower clustering coefficient in comparison with healthy controls. Locally, PD patients showed lower degree of connectivity and local efficiency in many hubs corresponding to functionally relevant areas. Four disconnected subnetworks were also identified in regions responsible for executive control, sensory-motor control and planning, motor coordination and visual elaboration. Executive functions and information processing speed were directly correlated with degree of connectivity and local efficiency in frontal, parietal and occipital areas. While functional reorganization appears in both motor and cognitive areas, the clinical expression of network imbalance seems to be partially compensated by the chronic levodopa treatment with regards to the motor but not to the cognitive performance. In a context of reduced network segregation, the presence of higher local efficiency in hubs regions correlates with a better cognitive performance.

Predicting perturbation patterns from the topology of biological networks.

PubMed

Santolini, Marc; Barabási, Albert-László

2018-06-20

High-throughput technologies, offering an unprecedented wealth of quantitative data underlying the makeup of living systems, are changing biology. Notably, the systematic mapping of the relationships between biochemical entities has fueled the rapid development of network biology, offering a suitable framework to describe disease phenotypes and predict potential drug targets. However, our ability to develop accurate dynamical models remains limited, due in part to the limited knowledge of the kinetic parameters underlying these interactions. Here, we explore the degree to which we can make reasonably accurate predictions in the absence of the kinetic parameters. We find that simple dynamically agnostic models are sufficient to recover the strength and sign of the biochemical perturbation patterns observed in 87 biological models for which the underlying kinetics are known. Surprisingly, a simple distance-based model achieves 65% accuracy. We show that this predictive power is robust to topological and kinetic parameter perturbations, and we identify key network properties that can increase up to 80% the recovery rate of the true perturbation patterns. We validate our approach using experimental data on the chemotactic pathway in bacteria, finding that a network model of perturbation spreading predicts with ∼80% accuracy the directionality of gene expression and phenotype changes in knock-out and overproduction experiments. These findings show that the steady advances in mapping out the topology of biochemical interaction networks opens avenues for accurate perturbation spread modeling, with direct implications for medicine and drug development.

Underlying role of mechanical rigidity and topological constraints in physical sputtering and reactive ion etching of amorphous materials

NASA Astrophysics Data System (ADS)

Bhattarai, Gyanendra; Dhungana, Shailesh; Nordell, Bradley J.; Caruso, Anthony N.; Paquette, Michelle M.; Lanford, William A.; King, Sean W.

2018-05-01

Analytical expressions describing ion-induced sputter or etch processes generally relate the sputter yield to the surface atomic binding energy (Usb) for the target material. While straightforward to measure for the crystalline elemental solids, Usb is more complicated to establish for amorphous and multielement materials due to composition-driven variations and incongruent sublimation. In this regard, we show that for amorphous multielement materials, the ion-driven yield can instead be better understood via a consideration of mechanical rigidity and network topology. We first demonstrate a direct relationship between Usb, bulk modulus, and ion sputter yield for the elements, and then subsequently prove our hypothesis for amorphous multielement compounds by demonstrating that the same relationships exist between the reactive ion etch (RIE) rate and nanoindentation Young's modulus for a series of a -Si Nx :H and a -Si OxCy :H thin films. The impact of network topology is further revealed via application of the Phillips-Thorpe theory of topological constraints, which directly relates the Young's modulus to the mean atomic coordination () for an amorphous solid. The combined analysis allows the trends and plateaus in the RIE rate to be ultimately reinterpreted in terms of the atomic structure of the target material through a consideration of . These findings establish the important underlying role of mechanical rigidity and network topology in ion-solid interactions and provide additional considerations for the design and optimization of radiation-hard materials in nuclear and outer space environments.

Network Metamodeling: The Effect of Correlation Metric Choice on Phylogenomic and Transcriptomic Network Topology

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

Weighill, Deborah A; Jacobson, Daniel A

We explore the use of a network meta-modeling approach to compare the effects of similarity metrics used to construct biological networks on the topology of the resulting networks. This work reviews various similarity metrics for the construction of networks and various topology measures for the characterization of resulting network topology, demonstrating the use of these metrics in the construction and comparison of phylogenomic and transcriptomic networks.

The architecture of dynamic reservoir in the echo state network

NASA Astrophysics Data System (ADS)

Cui, Hongyan; Liu, Xiang; Li, Lixiang

2012-09-01

Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.

Effects of the underlying topology on perturbation spreading in the Axelrod model for cultural dissemination

NASA Astrophysics Data System (ADS)

Kim, Yup; Cho, Minsoo; Yook, Soon-Hyung

2011-10-01

We study the effects of the underlying topologies on a single feature perturbation imposed to the Axelrod model of consensus formation. From the numerical simulations we show that there are successive updates which are similar to avalanches in many self-organized criticality systems when a perturbation is imposed. We find that the distribution of avalanche size satisfies the finite-size scaling (FSS) ansatz on two-dimensional lattices and random networks. However, on scale-free networks with the degree exponent γ≤3 we show that the avalanche size distribution does not satisfy the FSS ansatz. The results indicate that the disordered configurations on two-dimensional lattices or on random networks are still stable against the perturbation in the limit N (network size) →∞. However, on scale-free networks with γ≤3 the perturbation always drives the disordered phase into an ordered phase. The possible relationship between the properties of phase transition of the Axelrod model and the avalanche distribution is also discussed.

A toolbox model of evolution of metabolic pathways on networks of arbitrary topology.

PubMed

Pang, Tin Yau; Maslov, Sergei

2011-05-01

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger "universal" network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of "small-world" topology, real-life metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

Origin of hyperbolicity in brain-to-brain coordination networks

NASA Astrophysics Data System (ADS)

Tadić, Bosiljka; Andjelković, Miroslav; Šuvakov, Milovan

2018-02-01

Hyperbolicity or negative curvature of complex networks is the intrinsic geometric proximity of nodes in the graph metric space, which implies an improved network function. Here, we investigate hidden combinatorial geometries in brain-to-brain coordination networks arising through social communications. The networks originate from correlations among EEG signals previously recorded during spoken communications comprising of 14 individuals with 24 speaker-listener pairs. We find that the corresponding networks are delta-hyperbolic with delta_max=1 and the graph diameter D=3 in each brain. While the emergent hyperbolicity in the two-brain networks satisfies delta_max/D/2 < 1 and can be attributed to the topology of the subgraph formed around the cross-brains linking channels. We identify these subgraphs in each studied two-brain network and decompose their structure into simple geometric descriptors (triangles, tetrahedra and cliques of higher orders) that contribute to hyperbolicity. Considering topologies that exceed two separate brain networks as a measure of coordination synergy between the brains, we identify different neuronal correlation patterns ranging from weak coordination to super-brain structure. These topology features are in qualitative agreement with the listener’s self-reported ratings of own experience and quality of the speaker, suggesting that studies of the cross-brain connector networks can reveal new insight into the neural mechanisms underlying human social behavior.

Connectomic Insights into Topologically Centralized Network Edges and Relevant Motifs in the Human Brain

PubMed Central

Xia, Mingrui; Lin, Qixiang; Bi, Yanchao; He, Yong

2016-01-01

White matter (WM) tracts serve as important material substrates for information transfer across brain regions. However, the topological roles of WM tracts in global brain communications and their underlying microstructural basis remain poorly understood. Here, we employed diffusion magnetic resonance imaging and graph-theoretical approaches to identify the pivotal WM connections in human whole-brain networks and further investigated their wiring substrates (including WM microstructural organization and physical consumption) and topological contributions to the brain's network backbone. We found that the pivotal WM connections with highly topological-edge centrality were primarily distributed in several long-range cortico-cortical connections (including the corpus callosum, cingulum and inferior fronto-occipital fasciculus) and some projection tracts linking subcortical regions. These pivotal WM connections exhibited high levels of microstructural organization indicated by diffusion measures (the fractional anisotropy, the mean diffusivity and the axial diffusivity) and greater physical consumption indicated by streamline lengths, and contributed significantly to the brain's hubs and the rich-club structure. Network motif analysis further revealed their heavy participations in the organization of communication blocks, especially in routes involving inter-hemispheric heterotopic and extremely remote intra-hemispheric systems. Computational simulation models indicated the sharp decrease of global network integrity when attacking these highly centralized edges. Together, our results demonstrated high building-cost consumption and substantial communication capacity contributions for pivotal WM connections, which deepens our understanding of the topological mechanisms that govern the organization of human connectomes. PMID:27148015

Connectomic Insights into Topologically Centralized Network Edges and Relevant Motifs in the Human Brain.

PubMed

Xia, Mingrui; Lin, Qixiang; Bi, Yanchao; He, Yong

2016-01-01

White matter (WM) tracts serve as important material substrates for information transfer across brain regions. However, the topological roles of WM tracts in global brain communications and their underlying microstructural basis remain poorly understood. Here, we employed diffusion magnetic resonance imaging and graph-theoretical approaches to identify the pivotal WM connections in human whole-brain networks and further investigated their wiring substrates (including WM microstructural organization and physical consumption) and topological contributions to the brain's network backbone. We found that the pivotal WM connections with highly topological-edge centrality were primarily distributed in several long-range cortico-cortical connections (including the corpus callosum, cingulum and inferior fronto-occipital fasciculus) and some projection tracts linking subcortical regions. These pivotal WM connections exhibited high levels of microstructural organization indicated by diffusion measures (the fractional anisotropy, the mean diffusivity and the axial diffusivity) and greater physical consumption indicated by streamline lengths, and contributed significantly to the brain's hubs and the rich-club structure. Network motif analysis further revealed their heavy participations in the organization of communication blocks, especially in routes involving inter-hemispheric heterotopic and extremely remote intra-hemispheric systems. Computational simulation models indicated the sharp decrease of global network integrity when attacking these highly centralized edges. Together, our results demonstrated high building-cost consumption and substantial communication capacity contributions for pivotal WM connections, which deepens our understanding of the topological mechanisms that govern the organization of human connectomes.

Development of human brain structural networks through infancy and childhood.

PubMed

Huang, Hao; Shu, Ni; Mishra, Virendra; Jeon, Tina; Chalak, Lina; Wang, Zhiyue J; Rollins, Nancy; Gong, Gaolang; Cheng, Hua; Peng, Yun; Dong, Qi; He, Yong

2015-05-01

During human brain development through infancy and childhood, microstructural and macrostructural changes take place to reshape the brain's structural networks and better adapt them to sophisticated functional and cognitive requirements. However, structural topological configuration of the human brain during this specific development period is not well understood. In this study, diffusion magnetic resonance image (dMRI) of 25 neonates, 13 toddlers, and 25 preadolescents were acquired to characterize network dynamics at these 3 landmark cross-sectional ages during early childhood. dMRI tractography was used to construct human brain structural networks, and the underlying topological properties were quantified by graph-theory approaches. Modular organization and small-world attributes are evident at birth with several important topological metrics increasing monotonically during development. Most significant increases of regional nodes occur in the posterior cingulate cortex, which plays a pivotal role in the functional default mode network. Positive correlations exist between nodal efficiencies and fractional anisotropy of the white matter traced from these nodes, while correlation slopes vary among the brain regions. These results reveal substantial topological reorganization of human brain structural networks through infancy and childhood, which is likely to be the outcome of both heterogeneous strengthening of the major white matter tracts and pruning of other axonal fibers. © The Author 2013. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A topology visualization early warning distribution algorithm for large-scale network security incidents.

PubMed

He, Hui; Fan, Guotao; Ye, Jianwei; Zhang, Weizhe

2013-01-01

It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system's emergency response capabilities, alleviate the cyber attacks' damage, and strengthen the system's counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system's plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks' topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.

GAT: a graph-theoretical analysis toolbox for analyzing between-group differences in large-scale structural and functional brain networks.

PubMed

Hosseini, S M Hadi; Hoeft, Fumiko; Kesler, Shelli R

2012-01-01

In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI) that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC) and functional data analyses (FDA), in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL) and healthy matched Controls (CON). The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.

Tensor Network Wavefunctions for Topological Phases

NASA Astrophysics Data System (ADS)

Ware, Brayden Alexander

The combination of quantum effects and interactions in quantum many-body systems can result in exotic phases with fundamentally entangled ground state wavefunctions--topological phases. Topological phases come in two types, both of which will be studied in this thesis. In topologically ordered phases, the pattern of entanglement in the ground state wavefunction encodes the statistics of exotic emergent excitations, a universal indicator of a phase that is robust to all types of perturbations. In symmetry protected topological phases, the entanglement instead encodes a universal response of the system to symmetry defects, an indicator that is robust only to perturbations respecting the protecting symmetry. Finding and creating these phases in physical systems is a motivating challenge that tests all aspects--analytical, numerical, and experimental--of our understanding of the quantum many-body problem. Nearly three decades ago, the creation of simple ansatz wavefunctions--such as the Laughlin fractional quantum hall state, the AKLT state, and the resonating valence bond state--spurred analytical understanding of both the role of entanglement in topological physics and physical mechanisms by which it can arise. However, quantitative understanding of the relevant phase diagrams is still challenging. For this purpose, tensor networks provide a toolbox for systematically improving wavefunction ansatz while still capturing the relevant entanglement properties. In this thesis, we use the tools of entanglement and tensor networks to analyze ansatz states for several proposed new phases. In the first part, we study a featureless phase of bosons on the honeycomb lattice and argue that this phase can be topologically protected under any one of several distinct subsets of the crystalline lattice symmetries. We discuss methods of detecting such phases with entanglement and without. In the second part, we consider the problem of constructing fixed-point wavefunctions for intrinsically fermionic topological phases, i.e. topological phases contructed out of fermions with a nontrivial response to fermion parity defects. A zero correlation length wavefunction and a commuting projector Hamiltonian that realizes this wavefunction as its ground state are constructed. Using an appropriate generalization of the minimally entangled states method for extraction of topological order from the ground states on a torus to the intrinsically fermionic case, we fully characterize the corresponding topological order as Ising x (px - ipy). We argue that this phase can be captured using fermionic tensor networks, expanding the applicability of tensor network methods.

Structural and functional networks in complex systems with delay.

PubMed

Eguíluz, Víctor M; Pérez, Toni; Borge-Holthoefer, Javier; Arenas, Alex

2011-05-01

Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in a system of diffusively delay-coupled elements in complex networks. We solve exactly the resulting equations in motifs (directed structures of three nodes) and in directed networks. The mean-field solution for directed uncorrelated networks shows that the clusterization of the activity is dominated by the in-degree of the nodes, and that the locking frequency decreases with increasing average degree. We find that the exponent of a power law degree distribution of the structural topology γ is related to the exponent of the associated functional network as α=(2-γ)(-1) for γ<2. © 2011 American Physical Society

Sampled-data consensus in switching networks of integrators based on edge events

NASA Astrophysics Data System (ADS)

Xiao, Feng; Meng, Xiangyu; Chen, Tongwen

2015-02-01

This paper investigates the event-driven sampled-data consensus in switching networks of multiple integrators and studies both the bidirectional interaction and leader-following passive reaction topologies in a unified framework. In these topologies, each information link is modelled by an edge of the information graph and assigned a sequence of edge events, which activate the mutual data sampling and controller updates of the two linked agents. Two kinds of edge-event-detecting rules are proposed for the general asynchronous data-sampling case and the synchronous periodic event-detecting case. They are implemented in a distributed fashion, and their effectiveness in reducing communication costs and solving consensus problems under a jointly connected topology condition is shown by both theoretical analysis and simulation examples.

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.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY Trajectory Control of Scale-Free Dynamical Networks with Exogenous Disturbances

NASA Astrophysics Data System (ADS)

Yang, Hong-Yong; Zhang, Shun; Zong, Guang-Deng

2011-01-01

In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents' states to an expected consensus track. Then, the influence of the disturbances is considered by developing disturbance observers, and disturbance observers based control (DOBC) are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the low degree node pinned.

On implementation of DCTCP on three-tier and fat-tree data center network topologies.

PubMed

Zafar, Saima; Bashir, Abeer; Chaudhry, Shafique Ahmad

2016-01-01

A data center is a facility for housing computational and storage systems interconnected through a communication network called data center network (DCN). Due to a tremendous growth in the computational power, storage capacity and the number of inter-connected servers, the DCN faces challenges concerning efficiency, reliability and scalability. Although transmission control protocol (TCP) is a time-tested transport protocol in the Internet, DCN challenges such as inadequate buffer space in switches and bandwidth limitations have prompted the researchers to propose techniques to improve TCP performance or design new transport protocols for DCN. Data center TCP (DCTCP) emerge as one of the most promising solutions in this domain which employs the explicit congestion notification feature of TCP to enhance the TCP congestion control algorithm. While DCTCP has been analyzed for two-tier tree-based DCN topology for traffic between servers in the same rack which is common in cloud applications, it remains oblivious to the traffic patterns common in university and private enterprise networks which traverse the complete network interconnect spanning upper tier layers. We also recognize that DCTCP performance cannot remain unaffected by the underlying DCN architecture hence there is a need to test and compare DCTCP performance when implemented over diverse DCN architectures. Some of the most notable DCN architectures are the legacy three-tier, fat-tree, BCube, DCell, VL2, and CamCube. In this research, we simulate the two switch-centric DCN architectures; the widely deployed legacy three-tier architecture and the promising fat-tree architecture using network simulator and analyze the performance of DCTCP in terms of throughput and delay for realistic traffic patterns. We also examine how DCTCP prevents incast and outcast congestion when realistic DCN traffic patterns are employed in above mentioned topologies. Our results show that the underlying DCN architecture significantly impacts DCTCP performance. We find that DCTCP gives optimal performance in fat-tree topology and is most suitable for large networks.

Impact of network topology on self-organized criticality

NASA Astrophysics Data System (ADS)

Hoffmann, Heiko

2018-02-01

The general mechanisms behind self-organized criticality (SOC) are still unknown. Several microscopic and mean-field theory approaches have been suggested, but they do not explain the dependence of the exponents on the underlying network topology of the SOC system. Here, we first report the phenomena that in the Bak-Tang-Wiesenfeld (BTW) model, sites inside an avalanche area largely return to their original state after the passing of an avalanche, forming, effectively, critically arranged clusters of sites. Then, we hypothesize that SOC relies on the formation process of these clusters, and present a model of such formation. For low-dimensional networks, we show theoretically and in simulation that the exponent of the cluster-size distribution is proportional to the ratio of the fractal dimension of the cluster boundary and the dimensionality of the network. For the BTW model, in our simulations, the exponent of the avalanche-area distribution matched approximately our prediction based on this ratio for two-dimensional networks, but deviated for higher dimensions. We hypothesize a transition from cluster formation to the mean-field theory process with increasing dimensionality. This work sheds light onto the mechanisms behind SOC, particularly, the impact of the network topology.

Amorphous topological insulators constructed from random point sets

NASA Astrophysics Data System (ADS)

Mitchell, Noah P.; Nash, Lisa M.; Hexner, Daniel; Turner, Ari M.; Irvine, William T. M.

2018-04-01

The discovery that the band structure of electronic insulators may be topologically non-trivial has revealed distinct phases of electronic matter with novel properties1,2. Recently, mechanical lattices have been found to have similarly rich structure in their phononic excitations3,4, giving rise to protected unidirectional edge modes5-7. In all of these cases, however, as well as in other topological metamaterials3,8, the underlying structure was finely tuned, be it through periodicity, quasi-periodicity or isostaticity. Here we show that amorphous Chern insulators can be readily constructed from arbitrary underlying structures, including hyperuniform, jammed, quasi-crystalline and uniformly random point sets. While our findings apply to mechanical and electronic systems alike, we focus on networks of interacting gyroscopes as a model system. Local decorations control the topology of the vibrational spectrum, endowing amorphous structures with protected edge modes—with a chirality of choice. Using a real-space generalization of the Chern number, we investigate the topology of our structures numerically, analytically and experimentally. The robustness of our approach enables the topological design and self-assembly of non-crystalline topological metamaterials on the micro and macro scale.

Brain Network Analysis: Separating Cost from Topology Using Cost-Integration

PubMed Central

Ginestet, Cedric E.; Nichols, Thomas E.; Bullmore, Ed T.; Simmons, Andrew

2011-01-01

A statistically principled way of conducting brain network analysis is still lacking. Comparison of different populations of brain networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the number of edges in an unweighted graph. In this paper, we evaluate the benefits and limitations associated with using cost-integrated topological metrics. Our focus is on comparing populations of weighted undirected graphs that differ in mean association weight, using global efficiency. Our key result shows that integrating over cost is equivalent to controlling for any monotonic transformation of the weight set of a weighted graph. That is, when integrating over cost, we eliminate the differences in topology that may be due to a monotonic transformation of the weight set. Our result holds for any unweighted topological measure, and for any choice of distribution over cost levels. Cost-integration is therefore helpful in disentangling differences in cost from differences in topology. By contrast, we show that the use of the weighted version of a topological metric is generally not a valid approach to this problem. Indeed, we prove that, under weak conditions, the use of the weighted version of global efficiency is equivalent to simply comparing weighted costs. Thus, we recommend the reporting of (i) differences in weighted costs and (ii) differences in cost-integrated topological measures with respect to different distributions over the cost domain. We demonstrate the application of these techniques in a re-analysis of an fMRI working memory task. We also provide a Monte Carlo method for approximating cost-integrated topological measures. Finally, we discuss the limitations of integrating topology over cost, which may pose problems when some weights are zero, when multiplicities exist in the ranks of the weights, and when one expects subtle cost-dependent topological differences, which could be masked by cost-integration. PMID:21829437

Inferring topologies via driving-based generalized synchronization of two-layer networks

NASA Astrophysics Data System (ADS)

Wang, Yingfei; Wu, Xiaoqun; Feng, Hui; Lu, Jun-an; Xu, Yuhua

2016-05-01

The interaction topology among the constituents of a complex network plays a crucial role in the network’s evolutionary mechanisms and functional behaviors. However, some network topologies are usually unknown or uncertain. Meanwhile, coupling delays are ubiquitous in various man-made and natural networks. Hence, it is necessary to gain knowledge of the whole or partial topology of a complex dynamical network by taking into consideration communication delay. In this paper, topology identification of complex dynamical networks is investigated via generalized synchronization of a two-layer network. Particularly, based on the LaSalle-type invariance principle of stochastic differential delay equations, an adaptive control technique is proposed by constructing an auxiliary layer and designing proper control input and updating laws so that the unknown topology can be recovered upon successful generalized synchronization. Numerical simulations are provided to illustrate the effectiveness of the proposed method. The technique provides a certain theoretical basis for topology inference of complex networks. In particular, when the considered network is composed of systems with high-dimension or complicated dynamics, a simpler response layer can be constructed, which is conducive to circuit design. Moreover, it is practical to take into consideration perturbations caused by control input. Finally, the method is applicable to infer topology of a subnetwork embedded within a complex system and locate hidden sources. We hope the results can provide basic insight into further research endeavors on understanding practical and economical topology inference of networks.

Complex social contagion makes networks more vulnerable to disease outbreaks.

PubMed

Campbell, Ellsworth; Salathé, Marcel

2013-01-01

Social network analysis is now widely used to investigate the dynamics of infectious disease spread. Vaccination dramatically disrupts disease transmission on a contact network, and indeed, high vaccination rates can potentially halt disease transmission altogether. Here, we build on mounting evidence that health behaviors - such as vaccination, and refusal thereof - can spread across social networks through a process of complex contagion that requires social reinforcement. Using network simulations that model health behavior and infectious disease spread, we find that under otherwise identical conditions, the process by which the health behavior spreads has a very strong effect on disease outbreak dynamics. This dynamic variability results from differences in the topology within susceptible communities that arise during the health behavior spreading process, which in turn depends on the topology of the overall social network. Our findings point to the importance of health behavior spread in predicting and controlling disease outbreaks.

Optimal network alignment with graphlet degree vectors.

PubMed

Milenković, Tijana; Ng, Weng Leong; Hayes, Wayne; Przulj, Natasa

2010-06-30

Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology.

Cooperative learning neural network output feedback control of uncertain nonlinear multi-agent systems under directed topologies

NASA Astrophysics Data System (ADS)

Wang, W.; Wang, D.; Peng, Z. H.

2017-09-01

Without assuming that the communication topologies among the neural network (NN) weights are to be undirected and the states of each agent are measurable, the cooperative learning NN output feedback control is addressed for uncertain nonlinear multi-agent systems with identical structures in strict-feedback form. By establishing directed communication topologies among NN weights to share their learned knowledge, NNs with cooperative learning laws are employed to identify the uncertainties. By designing NN-based κ-filter observers to estimate the unmeasurable states, a new cooperative learning output feedback control scheme is proposed to guarantee that the system outputs can track nonidentical reference signals with bounded tracking errors. A simulation example is given to demonstrate the effectiveness of the theoretical results.

Research on social communication network evolution based on topology potential distribution

NASA Astrophysics Data System (ADS)

Zhao, Dongjie; Jiang, Jian; Li, Deyi; Zhang, Haisu; Chen, Guisheng

2011-12-01

Aiming at the problem of social communication network evolution, first, topology potential is introduced to measure the local influence among nodes in networks. Second, from the perspective of topology potential distribution the method of network evolution description based on topology potential distribution is presented, which takes the artificial intelligence with uncertainty as basic theory and local influence among nodes as essentiality. Then, a social communication network is constructed by enron email dataset, the method presented is used to analyze the characteristic of the social communication network evolution and some useful conclusions are got, implying that the method is effective, which shows that topology potential distribution can effectively describe the characteristic of sociology and detect the local changes in social communication network.

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.

Machine learning topological states

NASA Astrophysics Data System (ADS)

Deng, Dong-Ling; Li, Xiaopeng; Das Sarma, S.

2017-11-01

Artificial neural networks and machine learning have now reached a new era after several decades of improvement where applications are to explode in many fields of science, industry, and technology. Here, we use artificial neural networks to study an intriguing phenomenon in quantum physics—the topological phases of matter. We find that certain topological states, either symmetry-protected or with intrinsic topological order, can be represented with classical artificial neural networks. This is demonstrated by using three concrete spin systems, the one-dimensional (1D) symmetry-protected topological cluster state and the 2D and 3D toric code states with intrinsic topological orders. For all three cases, we show rigorously that the topological ground states can be represented by short-range neural networks in an exact and efficient fashion—the required number of hidden neurons is as small as the number of physical spins and the number of parameters scales only linearly with the system size. For the 2D toric-code model, we find that the proposed short-range neural networks can describe the excited states with Abelian anyons and their nontrivial mutual statistics as well. In addition, by using reinforcement learning we show that neural networks are capable of finding the topological ground states of nonintegrable Hamiltonians with strong interactions and studying their topological phase transitions. Our results demonstrate explicitly the exceptional power of neural networks in describing topological quantum states, and at the same time provide valuable guidance to machine learning of topological phases in generic lattice models.

Energy efficiency evaluation of tree-topology 10 gigabit ethernet passive optical network and ring-topology time- and wavelength-division-multiplexed passive optical network

NASA Astrophysics Data System (ADS)

Song, Jingjing; Yang, Chuanchuan; Zhang, Qingxiang; Ma, Zhuang; Huang, Xingang; Geng, Dan; Wang, Ziyu

2015-09-01

Higher capacity and larger scales have always been the top targets for the evolution of optical access networks, driven by the ever-increasing demand from the end users. One thing that started to attract wide attention not long ago, but with at least equal importance as capacity and scale, is energy efficiency, a metric essential nowadays as human beings are confronted with severe environmental issues like global warming, air pollution, and so on. Here, different from the conventional energy consumption analysis of tree-topology networks, we propose an effective energy consumption calculation method to compare the energy efficiency of the tree-topology 10 gigabit ethernet passive optical network (10G-EPON) and ring-topology time- and wavelength-division-multiplexed passive optical network (TWDM-PON), two experimental networks deployed in China. Numerical results show that the ring-topology TWDM-PON networks with 2, 4, 8, and 16 wavelengths are more energy efficient than the tree-topology 10G-EPON, although 10G-EPON consumes less energy. Also, TWDM-PON with four wavelengths is the most energy-efficient network candidate and saves 58.7% more energy than 10G-EPON when fully loaded.

The effect of the topology on the spatial ultimatum game

NASA Astrophysics Data System (ADS)

Kuperman, M. N.; Risau-Gusman, S.

2008-03-01

In this work we present an analysis of a spatially non homogeneous ultimatum game. By considering different underlying topologies as substrates on top of which the game takes place we obtain nontrivial behaviors for the evolution of the strategies of the players. We analyze separately the effect of the size of the neighborhood and the spatial structure. Whereas this last effect is the most significant one, we show that even for disordered networks and provided the neighborhood of each site is small, the results can be significantly different from those obtained in the case of fully connected networks.

A scoring mechanism for the rank aggregation of network robustness

NASA Astrophysics Data System (ADS)

Yazdani, Alireza; Dueñas-Osorio, Leonardo; Li, Qilin

2013-10-01

To date, a number of metrics have been proposed to quantify inherent robustness of network topology against failures. However, each single metric usually only offers a limited view of network vulnerability to different types of random failures and targeted attacks. When applied to certain network configurations, different metrics rank network topology robustness in different orders which is rather inconsistent, and no single metric fully characterizes network robustness against different modes of failure. To overcome such inconsistency, this work proposes a multi-metric approach as the basis of evaluating aggregate ranking of network topology robustness. This is based on simultaneous utilization of a minimal set of distinct robustness metrics that are standardized so to give way to a direct comparison of vulnerability across networks with different sizes and configurations, hence leading to an initial scoring of inherent topology robustness. Subsequently, based on the inputs of initial scoring a rank aggregation method is employed to allocate an overall ranking of robustness to each network topology. A discussion is presented in support of the presented multi-metric approach and its applications to more realistically assess and rank network topology robustness.

3D Architecture of Trabecular Bone in the Pig Mandible and Femur: Inter-Trabecular Angle Distributions.

NASA Astrophysics Data System (ADS)

Ben-Zvi, Yehonatan; Reznikov, Natalie; Shahar, Ron; Weiner, Steve

2017-09-01

Cancellous bone is an intricate network of interconnected trabeculae, to which analysis of network topology can be applied. The inter-trabecular angle (ITA) analysis - an analysis of network topological parameters and regularity of network-forming nodes, was previously carried out on human proximal femora and showed that trabecular bone follows two main principles: sparsity of the network connectedness (prevalence of nodes with low connectivity in the network) and maximal space spanning (angular offset of connected elements is maximal for their number and approximates the values of geometrically symmetric shapes). These observations suggest that 3D organization of trabecular bone, irrespective of size and shape of individual elements, reflects a tradeoff between minimal metabolic cost of maintenance and maximal network stability under conditions of multidirectional loading. In this study we validate the ITA application using additional 3D structures (cork and 3D-printed metal lattices), analyze the ITA parameters in porcine proximal femora and mandibles and carry out a spatial analysis of the most common node type in the porcine mandibular condyle. The validation shows that the ITA application reliably detects designed or evolved topological parameters. The ITA parameters of porcine trabecular bones are similar to those of human bones. We demonstrate functional adaptation in the pig mandibular condyle by showing that the planar nodes with 3 edges are preferentially aligned in relation to the muscle forces that are applied to the condyle. We conclude that the ITA topological parameters are remarkable conserved, but locally do adapt to applied stresses.

Extension algorithm for generic low-voltage networks

NASA Astrophysics Data System (ADS)

Marwitz, S.; Olk, C.

2018-02-01

Distributed energy resources (DERs) are increasingly penetrating the energy system which is driven by climate and sustainability goals. These technologies are mostly connected to low- voltage electrical networks and change the demand and supply situation in these networks. This can cause critical network states. Network topologies vary significantly and depend on several conditions including geography, historical development, network design or number of network connections. In the past, only some of these aspects were taken into account when estimating the network investment needs for Germany on the low-voltage level. Typically, fixed network topologies are examined or a Monte Carlo approach is used to quantify the investment needs at this voltage level. Recent research has revealed that DERs differ substantially between rural, suburban and urban regions. The low-voltage network topologies have different design concepts in these regions, so that different network topologies have to be considered when assessing the need for network extensions and investments due to DERs. An extension algorithm is needed to calculate network extensions and investment needs for the different typologies of generic low-voltage networks. We therefore present a new algorithm, which is capable of calculating the extension for generic low-voltage networks of any given topology based on voltage range deviations and thermal overloads. The algorithm requires information about line and cable lengths, their topology and the network state only. We test the algorithm on a radial, a loop, and a heavily meshed network. Here we show that the algorithm functions for electrical networks with these topologies. We found that the algorithm is able to extend different networks efficiently by placing cables between network nodes. The main value of the algorithm is that it does not require any information about routes for additional cables or positions for additional substations when it comes to estimating network extension needs.

Cultural propagation on social networks

NASA Astrophysics Data System (ADS)

Kuperman, M. N.

2006-04-01

In this work we present a model for the propagation of culture on networks of different topology and by considering different underlying dynamics. We extend a previous model proposed by Axelrod by letting a majority govern the dynamics of changes. This in turn allows us to define a Lyapunov functional for the system.

The Probability of a Gene Tree Topology within a Phylogenetic Network with Applications to Hybridization Detection

PubMed Central

Yu, Yun; Degnan, James H.; Nakhleh, Luay

2012-01-01

Gene tree topologies have proven a powerful data source for various tasks, including species tree inference and species delimitation. Consequently, methods for computing probabilities of gene trees within species trees have been developed and widely used in probabilistic inference frameworks. All these methods assume an underlying multispecies coalescent model. However, when reticulate evolutionary events such as hybridization occur, these methods are inadequate, as they do not account for such events. Methods that account for both hybridization and deep coalescence in computing the probability of a gene tree topology currently exist for very limited cases. However, no such methods exist for general cases, owing primarily to the fact that it is currently unknown how to compute the probability of a gene tree topology within the branches of a phylogenetic network. Here we present a novel method for computing the probability of gene tree topologies on phylogenetic networks and demonstrate its application to the inference of hybridization in the presence of incomplete lineage sorting. We reanalyze a Saccharomyces species data set for which multiple analyses had converged on a species tree candidate. Using our method, though, we show that an evolutionary hypothesis involving hybridization in this group has better support than one of strict divergence. A similar reanalysis on a group of three Drosophila species shows that the data is consistent with hybridization. Further, using extensive simulation studies, we demonstrate the power of gene tree topologies at obtaining accurate estimates of branch lengths and hybridization probabilities of a given phylogenetic network. Finally, we discuss identifiability issues with detecting hybridization, particularly in cases that involve extinction or incomplete sampling of taxa. PMID:22536161

Complex dynamics of memristive circuits: Analytical results and universal slow relaxation

NASA Astrophysics Data System (ADS)

Caravelli, F.; Traversa, F. L.; Di Ventra, M.

2017-02-01

Networks with memristive elements (resistors with memory) are being explored for a variety of applications ranging from unconventional computing to models of the brain. However, analytical results that highlight the role of the graph connectivity on the memory dynamics are still few, thus limiting our understanding of these important dynamical systems. In this paper, we derive an exact matrix equation of motion that takes into account all the network constraints of a purely memristive circuit, and we employ it to derive analytical results regarding its relaxation properties. We are able to describe the memory evolution in terms of orthogonal projection operators onto the subspace of fundamental loop space of the underlying circuit. This orthogonal projection explicitly reveals the coupling between the spatial and temporal sectors of the memristive circuits and compactly describes the circuit topology. For the case of disordered graphs, we are able to explain the emergence of a power-law relaxation as a superposition of exponential relaxation times with a broad range of scales using random matrices. This power law is also universal, namely independent of the topology of the underlying graph but dependent only on the density of loops. In the case of circuits subject to alternating voltage instead, we are able to obtain an approximate solution of the dynamics, which is tested against a specific network topology. These results suggest a much richer dynamics of memristive networks than previously considered.

Different Topological Properties of EEG-Derived Networks Describe Working Memory Phases as Revealed by Graph Theoretical Analysis

PubMed Central

Toppi, Jlenia; Astolfi, Laura; Risetti, Monica; Anzolin, Alessandra; Kober, Silvia E.; Wood, Guilherme; Mattia, Donatella

2018-01-01

Several non-invasive imaging methods have contributed to shed light on the brain mechanisms underlying working memory (WM). The aim of the present study was to depict the topology of the relevant EEG-derived brain networks associated to distinct operations of WM function elicited by the Sternberg Item Recognition Task (SIRT) such as encoding, storage, and retrieval in healthy, middle age (46 ± 5 years) adults. High density EEG recordings were performed in 17 participants whilst attending a visual SIRT. Neural correlates of WM were assessed by means of a combination of EEG signal processing methods (i.e., time-varying connectivity estimation and graph theory), in order to extract synthetic descriptors of the complex networks underlying the encoding, storage, and retrieval phases of WM construct. The group analysis revealed that the encoding phase exhibited a significantly higher small-world topology of EEG networks with respect to storage and retrieval in all EEG frequency oscillations, thus indicating that during the encoding of items the global network organization could “optimally” promote the information flow between WM sub-networks. We also found that the magnitude of such configuration could predict subject behavioral performance when memory load increases as indicated by the negative correlation between Reaction Time and the local efficiency values estimated during the encoding in the alpha band in both 4 and 6 digits conditions. At the local scale, the values of the degree index which measures the degree of in- and out- information flow between scalp areas were found to specifically distinguish the hubs within the relevant sub-networks associated to each of the three different WM phases, according to the different role of the sub-network of regions in the different WM phases. Our findings indicate that the use of EEG-derived connectivity measures and their related topological indices might offer a reliable and yet affordable approach to monitor WM components and thus theoretically support the clinical assessment of cognitive functions in presence of WM decline/impairment, as it occurs after stroke. PMID:29379425

Frequency specific brain networks in Parkinson's disease and comorbid depression.

PubMed

Qian, Long; Zhang, Yi; Zheng, Li; Fu, Xuemei; Liu, Weiguo; Shang, Yuqing; Zhang, Yaoyu; Xu, Yuanyuan; Liu, Yijun; Zhu, Huaiqiu; Gao, Jia-Hong

2017-02-01

The topological organization underlying the human brain was extensively investigated using resting-state functional magnetic resonance imaging, focusing on a low frequency of signal oscillation from 0.01 to 0.1 Hz. However, the frequency specificities with regard to the topological properties of the brain networks have not been fully revealed. In this study, a novel complementary ensemble empirical mode decomposition (CEEMD) method was used to separate the fMRI time series into five characteristic oscillations with distinct frequencies. Then, the small world properties of brain networks were analyzed for each of these five oscillations in patients (n = 67) with depressed Parkinson's disease (DPD, n = 20) , non-depressed Parkinson's disease (NDPD, n = 47) and healthy controls (HC, n = 46). Compared with HC, the results showed decreased network efficiency in characteristic oscillations from 0.05 to 0.12 Hz and from 0.02 to 0.05 Hz for the DPD and NDPD patients, respectively. Furthermore, compared with HC, the most significant inter-group difference across five brain oscillations was found in the basal ganglia (0.01 to 0.05 Hz) and paralimbic-limbic network (0.02 to 0.22 Hz) for the DPD patients, and in the visual cortex (0.02 to 0.05 Hz) for the NDPD patients. Compared with NDPD, the DPD patients showed reduced efficiency of nodes in the basal ganglia network (0.01 to 0.05 Hz). Our results demonstrated that DPD is characterized by a disrupted topological organization in large-scale brain functional networks. Moreover, the CEEMD analysis suggested a prominent dissociation in the topological organization of brain networks between DPD and NDPD in both space and frequency domains. Our findings indicated that these characteristic oscillatory activities in different functional circuits may contribute to distinct motor and non-motor components of clinical impairments in Parkinson's disease.

Robust quantum network architectures and topologies for entanglement distribution

NASA Astrophysics Data System (ADS)

Das, Siddhartha; Khatri, Sumeet; Dowling, Jonathan P.

2018-01-01

Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.

Functional organization of intrinsic connectivity networks in Chinese-chess experts.

PubMed

Duan, Xujun; Long, Zhiliang; Chen, Huafu; Liang, Dongmei; Qiu, Lihua; Huang, Xiaoqi; Liu, Timon Cheng-Yi; Gong, Qiyong

2014-04-16

The functional architecture of the human brain has been extensively described in terms of functional connectivity networks, detected from the low-frequency coherent neuronal fluctuations during a resting state condition. Accumulating evidence suggests that the overall organization of functional connectivity networks is associated with individual differences in cognitive performance and prior experience. Such an association raises the question of how cognitive expertise exerts an influence on the topological properties of large-scale functional networks. To address this question, we examined the overall organization of brain functional networks in 20 grandmaster and master level Chinese-chess players (GM/M) and twenty novice players, by means of resting-state functional connectivity and graph theoretical analyses. We found that, relative to novices, functional connectivity was increased in GM/Ms between basal ganglia, thalamus, hippocampus, and several parietal and temporal areas, suggesting the influence of cognitive expertise on intrinsic connectivity networks associated with learning and memory. Furthermore, we observed economical small-world topology in the whole-brain functional connectivity networks in both groups, but GM/Ms exhibited significantly increased values of normalized clustering coefficient which resulted in increased small-world topology. These findings suggest an association between the functional organization of brain networks and individual differences in cognitive expertise, which might provide further evidence of the mechanisms underlying expert behavior. Copyright © 2014 Elsevier B.V. All rights reserved.

Decentralised fixed modes of networked MIMO systems

NASA Astrophysics Data System (ADS)

Hao, Yuqing; Duan, Zhisheng; Chen, Guanrong

2018-04-01

In this paper, decentralised fixed modes (DFMs) of a networked system are studied. The network topology is directed and weighted and the nodes are higher-dimensional linear time-invariant (LTI) dynamical systems. The effects of the network topology, the node-system dynamics, the external control inputs, and the inner interactions on the existence of DFMs for the whole networked system are investigated. A necessary and sufficient condition for networked multi-input/multi-output (MIMO) systems in a general topology to possess no DFMs is derived. For networked single-input/single-output (SISO) LTI systems in general as well as some typical topologies, some specific conditions for having no DFMs are established. It is shown that the existence of DFMs is an integrated result of the aforementioned relevant factors which cannot be decoupled into individual DFMs of the node-systems and the properties solely determined by the network topology.

Observations and analysis of self-similar branching topology in glacier networks

USGS Publications Warehouse

Bahr, D.B.; Peckham, S.D.

1996-01-01

Glaciers, like rivers, have a branching structure which can be characterized by topological trees or networks. Probability distributions of various topological quantities in the networks are shown to satisfy the criterion for self-similarity, a symmetry structure which might be used to simplify future models of glacier dynamics. Two analytical methods of describing river networks, Shreve's random topology model and deterministic self-similar trees, are applied to the six glaciers of south central Alaska studied in this analysis. Self-similar trees capture the topological behavior observed for all of the glaciers, and most of the networks are also reasonably approximated by Shreve's theory. Copyright 1996 by the American Geophysical Union.

Inferring Network Controls from Topology Using the Chomp Database

DTIC Science & Technology

2015-12-03

AFRL-AFOSR-VA-TR-2016-0033 INFERRING NETWORK CONTROLS FROM TOPOLOGY USING THE CHOMP DATABASE John Harer DUKE UNIVERSITY Final Report 12/03/2015...INFERRING NETWORK CONTROLS FROM TOPOLOGY USING THE CHOMP DATABASE 5a. CONTRACT NUMBER 5b. GRANT NUMBER FA9550-10-1-0436 5c. PROGRAM ELEMENT NUMBER 6...area of Topological Data Analysis (TDA) and it’s application to dynamical systems. The role of this work in the Complex Networks program is based on

Temperature-controlled two new Co(II) compounds with distinct topological networks: Syntheses, crystal structures and catalytic properties

NASA Astrophysics Data System (ADS)

Meng, Qing-Hua; Long, Xu; Liu, Jing-Li; Zhang, Shuan; Zhang, Guang-Hui

2018-04-01

Two new Co(II) coordination compounds, namely [Co2(bptc)(bpp)2]n (1) and [Co(bptc)0.5(bpp)]n (2) (H4bptc = biphenyl-3,3‧,5,5‧-tetracarboxylic acid, bpp = 1,3-di(4-pyridyl)propane), have been hydrothermally synthesized from the same reactants via tuning the reaction temperature. Single crystal X-ray diffraction analyses revealed that both 1 and 2 feature 2D sheet motifs. Topological analyses revealed that compounds 1 and 2 show distinct topological networks. Under the weak Van der Waals interactions, the 2D sheet motifs of compounds 1 and 2 are further packed into 2D→3D interdigitated supramolecular frameworks. Moreover, the two Co(II) compounds show high catalytic activities for degradation of methyl orange (MO) in a Fenten-like process.

Machine Learning Topological Invariants with Neural Networks

NASA Astrophysics Data System (ADS)

Zhang, Pengfei; Shen, Huitao; Zhai, Hui

2018-02-01

In this Letter we supervisedly train neural networks to distinguish different topological phases in the context of topological band insulators. After training with Hamiltonians of one-dimensional insulators with chiral symmetry, the neural network can predict their topological winding numbers with nearly 100% accuracy, even for Hamiltonians with larger winding numbers that are not included in the training data. These results show a remarkable success that the neural network can capture the global and nonlinear topological features of quantum phases from local inputs. By opening up the neural network, we confirm that the network does learn the discrete version of the winding number formula. We also make a couple of remarks regarding the role of the symmetry and the opposite effect of regularization techniques when applying machine learning to physical systems.

Neural network topology in ADHD; evidence for maturational delay and default-mode network alterations.

PubMed

Janssen, T W P; Hillebrand, A; Gouw, A; Geladé, K; Van Mourik, R; Maras, A; Oosterlaan, J

2017-11-01

Attention-deficit/hyperactivity disorder (ADHD) has been associated with widespread brain abnormalities in white and grey matter, affecting not only local, but global functional networks as well. In this study, we explored these functional networks using source-reconstructed electroencephalography in ADHD and typically developing (TD) children. We expected evidence for maturational delay, with underlying abnormalities in the default mode network. Electroencephalograms were recorded in ADHD (n=42) and TD (n=43) during rest, and functional connectivity (phase lag index) and graph (minimum spanning tree) parameters were derived. Dependent variables were global and local network metrics in theta, alpha and beta bands. We found evidence for a more centralized functional network in ADHD compared to TD children, with decreased diameter in the alpha band (η p 2 =0.06) and increased leaf fraction (η p 2 =0.11 and 0.08) in the alpha and beta bands, with underlying abnormalities in hub regions of the brain, including default mode network. The finding of a more centralized network is in line with maturational delay models of ADHD and should be replicated in longitudinal designs. This study contributes to the literature by combining high temporal and spatial resolution to construct EEG network topology, and associates maturational-delay and default-mode interference hypotheses of ADHD. Copyright © 2017 International Federation of Clinical Neurophysiology. Published by Elsevier B.V. All rights reserved.

Sequential defense against random and intentional attacks in complex networks.

PubMed

Chen, Pin-Yu; Cheng, Shin-Ming

2015-02-01

Network robustness against attacks is one of the most fundamental researches in network science as it is closely associated with the reliability and functionality of various networking paradigms. However, despite the study on intrinsic topological vulnerabilities to node removals, little is known on the network robustness when network defense mechanisms are implemented, especially for networked engineering systems equipped with detection capabilities. In this paper, a sequential defense mechanism is first proposed in complex networks for attack inference and vulnerability assessment, where the data fusion center sequentially infers the presence of an attack based on the binary attack status reported from the nodes in the network. The network robustness is evaluated in terms of the ability to identify the attack prior to network disruption under two major attack schemes, i.e., random and intentional attacks. We provide a parametric plug-in model for performance evaluation on the proposed mechanism and validate its effectiveness and reliability via canonical complex network models and real-world large-scale network topology. The results show that the sequential defense mechanism greatly improves the network robustness and mitigates the possibility of network disruption by acquiring limited attack status information from a small subset of nodes in the network.

A New Cross-By-Pass-Torus Architecture Based on CBP-Mesh and Torus Interconnection for On-Chip Communication.

PubMed

Gulzari, Usman Ali; Sajid, Muhammad; Anjum, Sheraz; Agha, Shahrukh; Torres, Frank Sill

2016-01-01

A Mesh topology is one of the most promising architecture due to its regular and simple structure for on-chip communication. Performance of mesh topology degraded greatly by increasing the network size due to small bisection width and large network diameter. In order to overcome this limitation, many researchers presented modified Mesh design by adding some extra links to improve its performance in terms of network latency and power consumption. The Cross-By-Pass-Mesh was presented by us as an improved version of Mesh topology by intelligent addition of extra links. This paper presents an efficient topology named Cross-By-Pass-Torus for further increase in the performance of the Cross-By-Pass-Mesh topology. The proposed design merges the best features of the Cross-By-Pass-Mesh and Torus, to reduce the network diameter, minimize the average number of hops between nodes, increase the bisection width and to enhance the overall performance of the network. In this paper, the architectural design of the topology is presented and analyzed against similar kind of 2D topologies in terms of average latency, throughput and power consumption. In order to certify the actual behavior of proposed topology, the synthetic traffic trace and five different real embedded application workloads are applied to the proposed as well as other competitor network topologies. The simulation results indicate that Cross-By-Pass-Torus is an efficient candidate among its predecessor's and competitor topologies due to its less average latency and increased throughput at a slight cost in network power and energy for on-chip communication.

Topological and Historical Considerations for Infectious Disease Transmission among Injecting Drug Users in Bushwick, Brooklyn (USA)

PubMed Central

Dombrowski, Kirk; Curtis, Richard; Friedman, Samuel; Khan, Bilal

2014-01-01

Recent interest by physicists in social networks and disease transmission factors has prompted debate over the topology of degree distributions in sexual networks. Social network researchers have been critical of “scale-free” Barabasi-Albert approaches, and largely rejected the preferential attachment, “rich-get-richer” assumptions that underlie that model. Instead, research on sexual networks has pointed to the importance of homophily and local sexual norms in dictating degree distributions, and thus disease transmission thresholds. Injecting Drug User (IDU) network topologies may differ from the emerging models of sexual networks, however. Degree distribution analysis of a Brooklyn, NY, IDU network indicates a different topology than the spanning tree configurations discussed for sexual networks, instead featuring comparatively short cycles and high concurrency. Our findings suggest that IDU networks do in some ways conform to a “scale-free” topology, and thus may represent “reservoirs” of potential infection despite seemingly low transmission thresholds. PMID:24672745

A study of topologies and protocols for fiber optic local area network

NASA Technical Reports Server (NTRS)

Yeh, C.; Gerla, M.; Rodrigues, P.

1985-01-01

The emergence of new applications requiring high data traffic necessitates the development of high speed local area networks. Optical fiber is selected as the transmission medium due to its inherent advantages over other possible media and the dual optical bus architecture is shown to be the most suitable topology. Asynchronous access protocols, including token, random, hybrid random/token, and virtual token schemes, are developed and analyzed. Exact expressions for insertion delay and utilization at light and heavy load are derived, and intermediate load behavior is investigated by simulation. A new tokenless adaptive scheme whose control depends only on the detection of activity on the channel is shown to outperform round-robin schemes under uneven loads and multipacket traffic and to perform optimally at light load. An approximate solution to the queueing delay for an oscillating polling scheme under chaining is obtained and results are compared with simulation. Solutions to the problem of building systems with a large number of stations are presented, including maximization of the number of optical couplers, and the use of passive star/bus topologies, bridges and gateways.

State criminal justice telecommunications (STACOM). Volume 4: Network design software user's guide

NASA Technical Reports Server (NTRS)

Lee, J. J.

1977-01-01

A user's guide to the network design program is presented. The program is written in FORTRAN V and implemented on a UNIVAC 1108 computer under the EXEC-8 operating system which enables the user to construct least-cost network topologies for criminal justice digital telecommunications networks. A complete description of program features, inputs, processing logic, and outputs is presented, and a sample run and a program listing are included.

Method and system for mesh network embedded devices

NASA Technical Reports Server (NTRS)

Wang, Ray (Inventor)

2009-01-01

A method and system for managing mesh network devices. A mesh network device with integrated features creates an N-way mesh network with a full mesh network topology or a partial mesh network topology.

Modeling the Propagation of Mobile Phone Virus under Complex Network

PubMed Central

Yang, Wei; Wei, Xi-liang; Guo, Hao; An, Gang; Guo, Lei

2014-01-01

Mobile phone virus is a rogue program written to propagate from one phone to another, which can take control of a mobile device by exploiting its vulnerabilities. In this paper the propagation model of mobile phone virus is tackled to understand how particular factors can affect its propagation and design effective containment strategies to suppress mobile phone virus. Two different propagation models of mobile phone viruses under the complex network are proposed in this paper. One is intended to describe the propagation of user-tricking virus, and the other is to describe the propagation of the vulnerability-exploiting virus. Based on the traditional epidemic models, the characteristics of mobile phone viruses and the network topology structure are incorporated into our models. A detailed analysis is conducted to analyze the propagation models. Through analysis, the stable infection-free equilibrium point and the stability condition are derived. Finally, considering the network topology, the numerical and simulation experiments are carried out. Results indicate that both models are correct and suitable for describing the spread of two different mobile phone viruses, respectively. PMID:25133209

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.

Spreading dynamics of a SIQRS epidemic model on scale-free networks

NASA Astrophysics Data System (ADS)

Li, Tao; Wang, Yuanmei; Guan, Zhi-Hong

2014-03-01

In order to investigate the influence of heterogeneity of the underlying networks and quarantine strategy on epidemic spreading, a SIQRS epidemic model on the scale-free networks is presented. Using the mean field theory the spreading dynamics of the virus is analyzed. The spreading critical threshold and equilibria are derived. Theoretical results indicate that the critical threshold value is significantly dependent on the topology of the underlying networks and quarantine rate. The existence of equilibria is determined by threshold value. The stability of disease-free equilibrium and the permanence of the disease are proved. Numerical simulations confirmed the analytical results.

The Effect of Angle Restriction on the Topological Characteristics of Minicircle Networks

NASA Astrophysics Data System (ADS)

Arsuaga, J.; Diao, Y.; Hinson, K.

2012-01-01

Networks of topologically linked minicircle polymers are found in diverse natural systems and are a subject of intense research in nanotechonology. In a recent report the authors introduced a new theoretical model to study the effects of polymer density on the formation and on the topological properties of minicircle networks. Three key topological characteristics were identified in the formation and characterization of a network: the critical percolation density, the average saturation density and the mean valence of the network. In this work we report how these characteristics change when an orientation bias is imposed on the minicircles forming the network. We observe that such restrictions have significant effects on the key topological characteristics of the network. In particular while the effects of restriction of the tilting angle can be predicted we find that those of the azimuthal angle can have somewhat unexpected results.

A Collaborative Recommend Algorithm Based on Bipartite Community

PubMed Central

Fu, Yuchen; Liu, Quan; Cui, Zhiming

2014-01-01

The recommendation algorithm based on bipartite network is superior to traditional methods on accuracy and diversity, which proves that considering the network topology of recommendation systems could help us to improve recommendation results. However, existing algorithms mainly focus on the overall topology structure and those local characteristics could also play an important role in collaborative recommend processing. Therefore, on account of data characteristics and application requirements of collaborative recommend systems, we proposed a link community partitioning algorithm based on the label propagation and a collaborative recommendation algorithm based on the bipartite community. Then we designed numerical experiments to verify the algorithm validity under benchmark and real database. PMID:24955393

Genomic analysis of regulatory network dynamics reveals large topological changes

NASA Astrophysics Data System (ADS)

Luscombe, Nicholas M.; Madan Babu, M.; Yu, Haiyuan; Snyder, Michael; Teichmann, Sarah A.; Gerstein, Mark

2004-09-01

Network analysis has been applied widely, providing a unifying language to describe disparate systems ranging from social interactions to power grids. It has recently been used in molecular biology, but so far the resulting networks have only been analysed statically. Here we present the dynamics of a biological network on a genomic scale, by integrating transcriptional regulatory information and gene-expression data for multiple conditions in Saccharomyces cerevisiae. We develop an approach for the statistical analysis of network dynamics, called SANDY, combining well-known global topological measures, local motifs and newly derived statistics. We uncover large changes in underlying network architecture that are unexpected given current viewpoints and random simulations. In response to diverse stimuli, transcription factors alter their interactions to varying degrees, thereby rewiring the network. A few transcription factors serve as permanent hubs, but most act transiently only during certain conditions. By studying sub-network structures, we show that environmental responses facilitate fast signal propagation (for example, with short regulatory cascades), whereas the cell cycle and sporulation direct temporal progression through multiple stages (for example, with highly inter-connected transcription factors). Indeed, to drive the latter processes forward, phase-specific transcription factors inter-regulate serially, and ubiquitously active transcription factors layer above them in a two-tiered hierarchy. We anticipate that many of the concepts presented here-particularly the large-scale topological changes and hub transience-will apply to other biological networks, including complex sub-systems in higher eukaryotes.

Social network analysis of character interaction in the Stargate and Star Trek television series

NASA Astrophysics Data System (ADS)

Tan, Melody Shi Ai; Ujum, Ephrance Abu; Ratnavelu, Kuru

This paper undertakes a social network analysis of two science fiction television series, Stargate and Star Trek. Television series convey stories in the form of character interaction, which can be represented as “character networks”. We connect each pair of characters that exchanged spoken dialogue in any given scene demarcated in the television series transcripts. These networks are then used to characterize the overall structure and topology of each series. We find that the character networks of both series have similar structure and topology to that found in previous work on mythological and fictional networks. The character networks exhibit the small-world effects but found no significant support for power-law. Since the progression of an episode depends to a large extent on the interaction between each of its characters, the underlying network structure tells us something about the complexity of that episode’s storyline. We assessed the complexity using techniques from spectral graph theory. We found that the episode networks are structured either as (1) closed networks, (2) those containing bottlenecks that connect otherwise disconnected clusters or (3) a mixture of both.

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

Chen, Dong; Heidelberger, Philip; Sugawara, Yutaka

An apparatus and method for extending the scalability and improving the partitionability of networks that contain all-to-all links for transporting packet traffic from a source endpoint to a destination endpoint with low per-endpoint (per-server) cost and a small number of hops. An all-to-all wiring in the baseline topology is decomposed into smaller all-to-all components in which each smaller all-to-all connection is replaced with star topology by using global switches. Stacking multiple copies of the star topology baseline network creates a multi-planed switching topology for transporting packet traffic. Point-to-point unified stacking method using global switch wiring methods connects multiple planes ofmore » a baseline topology by using the global switches to create a large network size with a low number of hops, i.e., low network latency. Grouped unified stacking method increases the scalability (network size) of a stacked topology.« less

Measuring the value of accurate link prediction for network seeding.

PubMed

Wei, Yijin; Spencer, Gwen

2017-01-01

The influence-maximization literature seeks small sets of individuals whose structural placement in the social network can drive large cascades of behavior. Optimization efforts to find the best seed set often assume perfect knowledge of the network topology. Unfortunately, social network links are rarely known in an exact way. When do seeding strategies based on less-than-accurate link prediction provide valuable insight? We introduce optimized-against-a-sample ([Formula: see text]) performance to measure the value of optimizing seeding based on a noisy observation of a network. Our computational study investigates [Formula: see text] under several threshold-spread models in synthetic and real-world networks. Our focus is on measuring the value of imprecise link information. The level of investment in link prediction that is strategic appears to depend closely on spread model: in some parameter ranges investments in improving link prediction can pay substantial premiums in cascade size. For other ranges, such investments would be wasted. Several trends were remarkably consistent across topologies.

Evolution of cooperation under social pressure in multiplex networks

NASA Astrophysics Data System (ADS)

Pereda, María

2016-09-01

In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.

Evolution of cooperation under social pressure in multiplex networks.

PubMed

Pereda, María

2016-09-01

In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.

Topological Mechanics of Origami and Kirigami

NASA Astrophysics Data System (ADS)

Chen, Bryan Gin-ge; Liu, Bin; Evans, Arthur A.; Paulose, Jayson; Cohen, Itai; Vitelli, Vincenzo; Santangelo, C. D.

2016-04-01

Origami and kirigami have emerged as potential tools for the design of mechanical metamaterials whose properties such as curvature, Poisson ratio, and existence of metastable states can be tuned using purely geometric criteria. A major obstacle to exploiting this property is the scarcity of tools to identify and program the flexibility of fold patterns. We exploit a recent connection between spring networks and quantum topological states to design origami with localized folding motions at boundaries and study them both experimentally and theoretically. These folding motions exist due to an underlying topological invariant rather than a local imbalance between constraints and degrees of freedom. We give a simple example of a quasi-1D folding pattern that realizes such topological states. We also demonstrate how to generalize these topological design principles to two dimensions. A striking consequence is that a domain wall between two topologically distinct, mechanically rigid structures is deformable even when constraints locally match the degrees of freedom.

Human Dopamine Receptors Interaction Network (DRIN): a systems biology perspective on topology, stability and functionality of the network.

PubMed

Podder, Avijit; Jatana, Nidhi; Latha, N

2014-09-21

Dopamine receptors (DR) are one of the major neurotransmitter receptors present in human brain. Malfunctioning of these receptors is well established to trigger many neurological and psychiatric disorders. Taking into consideration that proteins function collectively in a network for most of the biological processes, the present study is aimed to depict the interactions between all dopamine receptors following a systems biology approach. To capture comprehensive interactions of candidate proteins associated with human dopamine receptors, we performed a protein-protein interaction network (PPIN) analysis of all five receptors and their protein partners by mapping them into human interactome and constructed a human Dopamine Receptors Interaction Network (DRIN). We explored the topology of dopamine receptors as molecular network, revealing their characteristics and the role of central network elements. More to the point, a sub-network analysis was done to determine major functional clusters in human DRIN that govern key neurological pathways. Besides, interacting proteins in a pathway were characterized and prioritized based on their affinity for utmost drug molecules. The vulnerability of different networks to the dysfunction of diverse combination of components was estimated under random and direct attack scenarios. To the best of our knowledge, the current study is unique to put all five dopamine receptors together in a common interaction network and to understand the functionality of interacting proteins collectively. Our study pinpointed distinctive topological and functional properties of human dopamine receptors that have helped in identifying potential therapeutic drug targets in the dopamine interaction network. Copyright © 2014 Elsevier Ltd. All rights reserved.

Characterization of emergent synaptic topologies in noisy neural networks

NASA Astrophysics Data System (ADS)

Miller, Aaron James

Learned behaviors are one of the key contributors to an animal's ultimate survival. It is widely believed that the brain's microcircuitry undergoes structural changes when a new behavior is learned. In particular, motor learning, during which an animal learns a sequence of muscular movements, often requires precisely-timed coordination between muscles and becomes very natural once ingrained. Experiments show that neurons in the motor cortex exhibit precisely-timed spike activity when performing a learned motor behavior, and constituent stereotypical elements of the behavior can last several hundred milliseconds. The subject of this manuscript concerns how organized synaptic structures that produce stereotypical spike sequences emerge from random, dynamical networks. After a brief introduction in Chapter 1, we begin Chapter 2 by introducing a spike-timing-dependent plasticity (STDP) rule that defines how the activity of the network drives changes in network topology. The rule is then applied to idealized networks of leaky integrate-and-fire neurons (LIF). These neurons are not subjected to the variability that typically characterize neurons in vivo. In noiseless networks, synapses develop closed loops of strong connectivity that reproduce stereotypical, precisely-timed spike patterns from an initially random network. We demonstrate the characteristics of the asymptotic synaptic configuration are dependent on the statistics of the initial random network. The spike timings of the neurons simulated in Chapter 2 are generated exactly by a computationally economical, nonlinear mapping which is extended to LIF neurons injected with fluctuating current in Chapter 3. Development of an economical mapping that incorporates noise provides a practical solution to the long simulation times required to produce asymptotic synaptic topologies in networks with STDP in the presence of realistic neuronal variability. The mapping relies on generating numerical solutions to the dynamics of a LIF neuron subjected to Gaussian white noise (GWN). The system reduces to the Ornstein-Uhlenbeck first passage time problem, the solution of which we build into the mapping method of Chapter 2. We demonstrate that simulations using the stochastic mapping have reduced computation time compared to traditional Runge-Kutta methods by more than a factor of 150. In Chapter 4, we use the stochastic mapping to study the dynamics of emerging synaptic topologies in noisy networks. With the addition of membrane noise, networks with dynamical synapses can admit states in which the distribution of the synaptic weights is static under spontaneous activity, but the random connectivity between neurons is dynamical. The widely cited problem of instabilities in networks with STDP is avoided with the implementation of a synaptic decay and an activation threshold on each synapse. When such networks are presented with stimulus modeled by a focused excitatory current, chain-like networks can emerge with the addition of an axon-remodeling plasticity rule, a topological constraint on the connectivity modeling the finite resources available to each neuron. The emergent topologies are the result of an iterative stochastic process. The dynamics of the growth process suggest a strong interplay between the network topology and the spike sequences they produce during development. Namely, the existence of an embedded spike sequence alters the distribution of synaptic weights through the entire network. The roles of model parameters that affect the interplay between network structure and activity are elucidated. Finally, we propose two mathematical growth models, which are complementary, that capture the essence of the growth dynamics observed in simulations. In Chapter 5, we present an extension of the stochastic mapping that allows the possibility of neuronal cooperation. We demonstrate that synaptic topologies admitting stereotypical sequences can emerge in yet higher, biologically realistic levels of membrane potential variability when neurons cooperate to innervate shared targets. The structure that is most robust to the variability is that of a synfire chain. The principles of growth dynamics detailed in Chapter 4 are the same that sculpt the emergent synfire topologies. We conclude by discussing avenues for extensions of these results.

Interplay of ICP and IXP over the Internet with power-law features

NASA Astrophysics Data System (ADS)

Fan, Zhongyan; Tang, Wallace Kit-Sang

The Internet is the largest artificial network consisting of billions of IP devices, managed by tens of thousands of autonomous systems (ASes). Due to its importance, the Internet has received much attention and its topological features, mainly in AS-level, have been widely explored from the complex network perspective. However, most of the previous studies assume a homogeneous model in which nodes are indistinguishable in nature. It may be good for a general study of topological structure, but unfortunately it fails to reflect the functionality. The Internet ecology is in fact heterogeneous and highly complex. It consists of various elements such as Internet Exchange Points (IXPs), Internet Content Providers (ICPs), and normal Autonomous System (ASes), realizing different roles in the Internet. In this paper, we propose level-structured network models for investigating how ICP performs under the AS-topology with power-law features and how IXP enhances its performance from a complex network perspective. Based on real data, our results reveal that the power-law nature of the Internet facilitates content delivery not only in efficiency but also in path redundancy. Moreover, the proposed multi-level framework is able to clearly illustrate the significant benefits gained by ICP from IXP peerings.

A random spatial network model based on elementary postulates

USGS Publications Warehouse

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

OPTIMAL NETWORK TOPOLOGY DESIGN

NASA Technical Reports Server (NTRS)

Yuen, J. H.

1994-01-01

This program was developed as part of a research study on the topology design and performance analysis for the Space Station Information System (SSIS) network. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. It is intended that this new design technique consider all important performance measures explicitly and take into account the constraints due to various technical feasibilities. In the current program, technical constraints are taken care of by the user properly forming the starting set of candidate components (e.g. nonfeasible links are not included). As subsets are generated, they are tested to see if they form an acceptable network by checking that all requirements are satisfied. Thus the first acceptable subset encountered gives the cost-optimal topology satisfying all given constraints. The user must sort the set of "feasible" link elements in increasing order of their costs. The program prompts the user for the following information for each link: 1) cost, 2) connectivity (number of stations connected by the link), and 3) the stations connected by that link. Unless instructed to stop, the program generates all possible acceptable networks in increasing order of their total costs. The program is written only to generate topologies that are simply connected. Tests on reliability, delay, and other performance measures are discussed in the documentation, but have not been incorporated into the program. This program is written in PASCAL for interactive execution and has been implemented on an IBM PC series computer operating under PC DOS. The disk contains source code only. This program was developed in 1985.

Propagation of kinetic uncertainties through a canonical topology of the TLR4 signaling network in different regions of biochemical reaction space

PubMed Central

2010-01-01

Background Signal transduction networks represent the information processing systems that dictate which dynamical regimes of biochemical activity can be accessible to a cell under certain circumstances. One of the major concerns in molecular systems biology is centered on the elucidation of the robustness properties and information processing capabilities of signal transduction networks. Achieving this goal requires the establishment of causal relations between the design principle of biochemical reaction systems and their emergent dynamical behaviors. Methods In this study, efforts were focused in the construction of a relatively well informed, deterministic, non-linear dynamic model, accounting for reaction mechanisms grounded on standard mass action and Hill saturation kinetics, of the canonical reaction topology underlying Toll-like receptor 4 (TLR4)-mediated signaling events. This signaling mechanism has been shown to be deployed in macrophages during a relatively short time window in response to lypopolysaccharyde (LPS) stimulation, which leads to a rapidly mounted innate immune response. An extensive computational exploration of the biochemical reaction space inhabited by this signal transduction network was performed via local and global perturbation strategies. Importantly, a broad spectrum of biologically plausible dynamical regimes accessible to the network in widely scattered regions of parameter space was reconstructed computationally. Additionally, experimentally reported transcriptional readouts of target pro-inflammatory genes, which are actively modulated by the network in response to LPS stimulation, were also simulated. This was done with the main goal of carrying out an unbiased statistical assessment of the intrinsic robustness properties of this canonical reaction topology. Results Our simulation results provide convincing numerical evidence supporting the idea that a canonical reaction mechanism of the TLR4 signaling network is capable of performing information processing in a robust manner, a functional property that is independent of the signaling task required to be executed. Nevertheless, it was found that the robust performance of the network is not solely determined by its design principle (topology), but this may be heavily dependent on the network's current position in biochemical reaction space. Ultimately, our results enabled us the identification of key rate limiting steps which most effectively control the performance of the system under diverse dynamical regimes. Conclusions Overall, our in silico study suggests that biologically relevant and non-intuitive aspects on the general behavior of a complex biomolecular network can be elucidated only when taking into account a wide spectrum of dynamical regimes attainable by the system. Most importantly, this strategy provides the means for a suitable assessment of the inherent variational constraints imposed by the structure of the system when systematically probing its parameter space. PMID:20230643

Highly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output.

PubMed

Nochomovitz, Yigal D; Li, Hao

2006-03-14

Deciphering the design principles for regulatory networks is fundamental to an understanding of biological systems. We have explored the mapping from the space of network topologies to the space of dynamical phenotypes for small networks. Using exhaustive enumeration of a simple model of three- and four-node networks, we demonstrate that certain dynamical phenotypes can be generated by an atypically broad spectrum of network topologies. Such dynamical outputs are highly designable, much like certain protein structures can be designed by an unusually broad spectrum of sequences. The network topologies that encode a highly designable dynamical phenotype possess two classes of connections: a fully conserved core of dedicated connections that encodes the stable dynamical phenotype and a partially conserved set of variable connections that controls the transient dynamical flow. By comparing the topologies and dynamics of the three- and four-node network ensembles, we observe a large number of instances of the phenomenon of "mutational buffering," whereby addition of a fourth node suppresses phenotypic variation amongst a set of three-node networks.

Disrupted topological organization in whole-brain functional networks of heroin-dependent individuals: a resting-state FMRI study.

PubMed

Jiang, Guihua; Wen, Xue; Qiu, Yingwei; Zhang, Ruibin; Wang, Junjing; Li, Meng; Ma, Xiaofen; Tian, Junzhang; Huang, Ruiwang

2013-01-01

Neuroimaging studies have shown that heroin addiction is related to abnormalities in widespread local regions and in the functional connectivity of the brain. However, little is known about whether heroin addiction changes the topological organization of whole-brain functional networks. Seventeen heroin-dependent individuals (HDIs) and 15 age-, gender-matched normal controls (NCs) were enrolled, and the resting-state functional magnetic resonance images (RS-fMRI) were acquired from these subjects. We constructed the brain functional networks of HDIs and NCs, and compared the between-group differences in network topological properties using graph theory method. We found that the HDIs showed decreases in the normalized clustering coefficient and in small-worldness compared to the NCs. Furthermore, the HDIs exhibited significantly decreased nodal centralities primarily in regions of cognitive control network, including the bilateral middle cingulate gyrus, left middle frontal gyrus, and right precuneus, but significantly increased nodal centralities primarily in the left hippocampus. The between-group differences in nodal centralities were not corrected by multiple comparisons suggesting these should be considered as an exploratory analysis. Moreover, nodal centralities in the left hippocampus were positively correlated with the duration of heroin addiction. Overall, our results indicated that disruptions occur in the whole-brain functional networks of HDIs, findings which may be helpful in further understanding the mechanisms underlying heroin addiction.

Efficient Transmission of Subthreshold Signals in Complex Networks of Spiking Neurons

PubMed Central

Torres, Joaquin J.; Elices, Irene; Marro, J.

2015-01-01

We investigate the efficient transmission and processing of weak, subthreshold signals in a realistic neural medium in the presence of different levels of the underlying noise. Assuming Hebbian weights for maximal synaptic conductances—that naturally balances the network with excitatory and inhibitory synapses—and considering short-term synaptic plasticity affecting such conductances, we found different dynamic phases in the system. This includes a memory phase where population of neurons remain synchronized, an oscillatory phase where transitions between different synchronized populations of neurons appears and an asynchronous or noisy phase. When a weak stimulus input is applied to each neuron, increasing the level of noise in the medium we found an efficient transmission of such stimuli around the transition and critical points separating different phases for well-defined different levels of stochasticity in the system. We proved that this intriguing phenomenon is quite robust, as it occurs in different situations including several types of synaptic plasticity, different type and number of stored patterns and diverse network topologies, namely, diluted networks and complex topologies such as scale-free and small-world networks. We conclude that the robustness of the phenomenon in different realistic scenarios, including spiking neurons, short-term synaptic plasticity and complex networks topologies, make very likely that it could also occur in actual neural systems as recent psycho-physical experiments suggest. PMID:25799449

Statistics of premixed flame cells

NASA Technical Reports Server (NTRS)

Noever, David A.

1991-01-01

The statistics of random cellular patterns in premixed flames are analyzed. Agreement is found with a variety of topological relations previously found for other networks, namely, Lewis's law and Aboav's law. Despite the diverse underlying physics, flame cells are shown to share a broad class of geometric properties with other random networks-metal grains, soap foams, bioconvection, and Langmuir monolayers.

Will electrical cyber-physical interdependent networks undergo first-order transition under random attacks?

NASA Astrophysics Data System (ADS)

Ji, Xingpei; Wang, Bo; Liu, Dichen; Dong, Zhaoyang; Chen, Guo; Zhu, Zhenshan; Zhu, Xuedong; Wang, Xunting

2016-10-01

Whether the realistic electrical cyber-physical interdependent networks will undergo first-order transition under random failures still remains a question. To reflect the reality of Chinese electrical cyber-physical system, the "partial one-to-one correspondence" interdependent networks model is proposed and the connectivity vulnerabilities of three realistic electrical cyber-physical interdependent networks are analyzed. The simulation results show that due to the service demands of power system the topologies of power grid and its cyber network are highly inter-similar which can effectively avoid the first-order transition. By comparing the vulnerability curves between electrical cyber-physical interdependent networks and its single-layer network, we find that complex network theory is still useful in the vulnerability analysis of electrical cyber-physical interdependent networks.

Calibration of CORSIM models under saturated traffic flow conditions.

DOT National Transportation Integrated Search

2013-09-01

This study proposes a methodology to calibrate microscopic traffic flow simulation models. : The proposed methodology has the capability to calibrate simultaneously all the calibration : parameters as well as demand patterns for any network topology....

Analysis of topological relationships and network properties in the interactions of human beings

PubMed Central

Chen, Xuebo; Sun, Qiubai; Huang, Tianyun

2017-01-01

In the animal world, various kinds of collective motions have been found and proven to be efficient ways of carrying out some activities such as searching for food and avoiding predators. Many scholars research the interactions of collective behaviors of human beings according to the rules of collective behaviors of animals. Based on the Lennard-Jones potential function and a self-organization process, our paper proposes a topological communication model to simulate the collective behaviors of human beings. In the results of simulations, we find various types of collective behavior and fission behavior and discover the threshold for the emergence of collective behavior, which is the range five to seven for the number of topology K. According to the analysis of network properties of the model, the in-degree of individuals is always equal to the number of topology. In the stable state, the out-degrees of individuals distribute around the value of the number of topology K, except that the out-degree of a single individual is approximately double the out-degrees of the other individuals. In addition, under different initial conditions, some features of different kinds of networks emerge from the model. We also find the leader and herd mentality effects in the characteristics of the behaviors of human beings in our model. Thus, this work could be used to discover how to promote the emergence of beneficial group behaviors and prevent the emergence of harmful behaviors. PMID:28832629

Complexity of generic biochemical circuits: topology versus strength of interactions.

PubMed

Tikhonov, Mikhail; Bialek, William

2016-12-06

The historical focus on network topology as a determinant of biological function is still largely maintained today, illustrated by the rise of structure-only approaches to network analysis. However, biochemical circuits and genetic regulatory networks are defined both by their topology and by a multitude of continuously adjustable parameters, such as the strength of interactions between nodes, also recognized as important. Here we present a class of simple perceptron-based Boolean models within which comparing the relative importance of topology versus interaction strengths becomes a quantitatively well-posed problem. We quantify the intuition that for generic networks, optimization of interaction strengths is a crucial ingredient of achieving high complexity, defined here as the number of fixed points the network can accommodate. We propose a new methodology for characterizing the relative role of parameter optimization for topologies of a given class.

Experiments with arbitrary networks in time-multiplexed delay systems

NASA Astrophysics Data System (ADS)

Hart, Joseph D.; Schmadel, Don C.; Murphy, Thomas E.; Roy, Rajarshi

2017-12-01

We report a new experimental approach using an optoelectronic feedback loop to investigate the dynamics of oscillators coupled on large complex networks with arbitrary topology. Our implementation is based on a single optoelectronic feedback loop with time delays. We use the space-time interpretation of systems with time delay to create large networks of coupled maps. Others have performed similar experiments using high-pass filters to implement the coupling; this restricts the network topology to the coupling of only a few nearest neighbors. In our experiment, the time delays and coupling are implemented on a field-programmable gate array, allowing the creation of networks with arbitrary coupling topology. This system has many advantages: the network nodes are truly identical, the network is easily reconfigurable, and the network dynamics occur at high speeds. We use this system to study cluster synchronization and chimera states in both small and large networks of different topologies.

Latency-Efficient Communication in Wireless Mesh Networks under Consideration of Large Interference Range

NASA Astrophysics Data System (ADS)

Xin, Qin; Yao, Xiaolan; Engelstad, Paal E.

2010-09-01

Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study here the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc Wireless Mesh Networks (WMNs). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is well known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency-efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad-hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad-hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad-hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility-related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes.

On Wiener polarity index of bicyclic networks.

PubMed

Ma, Jing; Shi, Yongtang; Wang, Zhen; Yue, Jun

2016-01-11

Complex networks are ubiquitous in biological, physical and social sciences. Network robustness research aims at finding a measure to quantify network robustness. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks. Wiener type indices are known to depend both on the network's number of nodes and topology. The Wiener polarity index is also related to the cluster coefficient of networks. In this paper, based on some graph transformations, we determine the sharp upper bound of the Wiener polarity index among all bicyclic networks. These bounds help to understand the underlying quantitative graph measures in depth.

Default cascades in complex networks: topology and systemic risk.

PubMed

Roukny, Tarik; Bersini, Hugues; Pirotte, Hugues; Caldarelli, Guido; Battiston, Stefano

2013-09-26

The recent crisis has brought to the fore a crucial question that remains still open: what would be the optimal architecture of financial systems? We investigate the stability of several benchmark topologies in a simple default cascading dynamics in bank networks. We analyze the interplay of several crucial drivers, i.e., network topology, banks' capital ratios, market illiquidity, and random vs targeted shocks. We find that, in general, topology matters only--but substantially--when the market is illiquid. No single topology is always superior to others. In particular, scale-free networks can be both more robust and more fragile than homogeneous architectures. This finding has important policy implications. We also apply our methodology to a comprehensive dataset of an interbank market from 1999 to 2011.

Modes of Interaction between Individuals Dominate the Topologies of Real World Networks

PubMed Central

Lee, Insuk; Kim, Eiru; Marcotte, Edward M.

2015-01-01

We find that the topologies of real world networks, such as those formed within human societies, by the Internet, or among cellular proteins, are dominated by the mode of the interactions considered among the individuals. Specifically, a major dichotomy in previously studied networks arises from modeling networks in terms of pairwise versus group tasks. The former often intrinsically give rise to scale-free, disassortative, hierarchical networks, whereas the latter often give rise to single- or broad-scale, assortative, nonhierarchical networks. These dependencies explain contrasting observations among previous topological analyses of real world complex systems. We also observe this trend in systems with natural hierarchies, in which alternate representations of the same networks, but which capture different levels of the hierarchy, manifest these signature topological differences. For example, in both the Internet and cellular proteomes, networks of lower-level system components (routers within domains or proteins within biological processes) are assortative and nonhierarchical, whereas networks of upper-level system components (internet domains or biological processes) are disassortative and hierarchical. Our results demonstrate that network topologies of complex systems must be interpreted in light of their hierarchical natures and interaction types. PMID:25793969

Scheduling and Topology Design in Networks with Directional Antennas

DTIC Science & Technology

2017-05-19

emergency response networks was recently studied in [14] and [15]. This work examines the topology control problem in group - based wireless networks that...Broadcast Fig. 7: Max-min throughput ⇢ versus number of nodes for non -uniform edge capacities [14] T. Suzuki, et al. “Directional Antenna Control based...Scheduling and Topology Design in Networks with Directional Antennas Thomas Stahlbuhk, Nathaniel M. Jones, Brooke Shrader Lincoln Laboratory

Scale-space measures for graph topology link protein network architecture to function.

PubMed

Hulsman, Marc; Dimitrakopoulos, Christos; de Ridder, Jeroen

2014-06-15

The network architecture of physical protein interactions is an important determinant for the molecular functions that are carried out within each cell. To study this relation, the network architecture can be characterized by graph topological characteristics such as shortest paths and network hubs. These characteristics have an important shortcoming: they do not take into account that interactions occur across different scales. This is important because some cellular functions may involve a single direct protein interaction (small scale), whereas others require more and/or indirect interactions, such as protein complexes (medium scale) and interactions between large modules of proteins (large scale). In this work, we derive generalized scale-aware versions of known graph topological measures based on diffusion kernels. We apply these to characterize the topology of networks across all scales simultaneously, generating a so-called graph topological scale-space. The comprehensive physical interaction network in yeast is used to show that scale-space based measures consistently give superior performance when distinguishing protein functional categories and three major types of functional interactions-genetic interaction, co-expression and perturbation interactions. Moreover, we demonstrate that graph topological scale spaces capture biologically meaningful features that provide new insights into the link between function and protein network architecture. Matlab(TM) code to calculate the scale-aware topological measures (STMs) is available at http://bioinformatics.tudelft.nl/TSSA © The Author 2014. Published by Oxford University Press.

A group LASSO-based method for robustly inferring gene regulatory networks from multiple time-course datasets.

PubMed

Liu, Li-Zhi; Wu, Fang-Xiang; Zhang, Wen-Jun

2014-01-01

As an abstract mapping of the gene regulations in the cell, gene regulatory network is important to both biological research study and practical applications. The reverse engineering of gene regulatory networks from microarray gene expression data is a challenging research problem in systems biology. With the development of biological technologies, multiple time-course gene expression datasets might be collected for a specific gene network under different circumstances. The inference of a gene regulatory network can be improved by integrating these multiple datasets. It is also known that gene expression data may be contaminated with large errors or outliers, which may affect the inference results. A novel method, Huber group LASSO, is proposed to infer the same underlying network topology from multiple time-course gene expression datasets as well as to take the robustness to large error or outliers into account. To solve the optimization problem involved in the proposed method, an efficient algorithm which combines the ideas of auxiliary function minimization and block descent is developed. A stability selection method is adapted to our method to find a network topology consisting of edges with scores. The proposed method is applied to both simulation datasets and real experimental datasets. It shows that Huber group LASSO outperforms the group LASSO in terms of both areas under receiver operating characteristic curves and areas under the precision-recall curves. The convergence analysis of the algorithm theoretically shows that the sequence generated from the algorithm converges to the optimal solution of the problem. The simulation and real data examples demonstrate the effectiveness of the Huber group LASSO in integrating multiple time-course gene expression datasets and improving the resistance to large errors or outliers.

On the robustness of complex heterogeneous gene expression networks.

PubMed

Gómez-Gardeñes, Jesús; Moreno, Yamir; Floría, Luis M

2005-04-01

We analyze a continuous gene expression model on the underlying topology of a complex heterogeneous network. Numerical simulations aimed at studying the chaotic and periodic dynamics of the model are performed. The results clearly indicate that there is a region in which the dynamical and structural complexity of the system avoid chaotic attractors. However, contrary to what has been reported for Random Boolean Networks, the chaotic phase cannot be completely suppressed, which has important bearings on network robustness and gene expression modeling.

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

Dorier, Matthieu; Mubarak, Misbah; Ross, Rob

Two-tiered direct network topologies such as Dragonflies have been proposed for future post-petascale and exascale machines, since they provide a high-radix, low-diameter, fast interconnection network. Such topologies call for redesigning MPI collective communication algorithms in order to attain the best performance. Yet as increasingly more applications share a machine, it is not clear how these topology-aware algorithms will react to interference with concurrent jobs accessing the same network. In this paper, we study three topology-aware broadcast algorithms, including one designed by ourselves. We evaluate their performance through event-driven simulation for small- and large-sized broadcasts (in terms of both data sizemore » and number of processes). We study the effect of different routing mechanisms on the topology-aware collective algorithms, as well as their sensitivity to network contention with other jobs. Our results show that while topology-aware algorithms dramatically reduce link utilization, their advantage in terms of latency is more limited.« less

Hyperswitch Network For Hypercube Computer

NASA Technical Reports Server (NTRS)

Chow, Edward; Madan, Herbert; Peterson, John

1989-01-01

Data-driven dynamic switching enables high speed data transfer. Proposed hyperswitch network based on mixed static and dynamic topologies. Routing header modified in response to congestion or faults encountered as path established. Static topology meets requirement if nodes have switching elements that perform necessary routing header revisions dynamically. Hypercube topology now being implemented with switching element in each computer node aimed at designing very-richly-interconnected multicomputer system. Interconnection network connects great number of small computer nodes, using fixed hypercube topology, characterized by point-to-point links between nodes.

Distributed Adaptive Finite-Time Approach for Formation-Containment Control of Networked Nonlinear Systems Under Directed Topology.

PubMed

Wang, Yujuan; Song, Yongduan; Ren, Wei

2017-07-06

This paper presents a distributed adaptive finite-time control solution to the formation-containment problem for multiple networked systems with uncertain nonlinear dynamics and directed communication constraints. By integrating the special topology feature of the new constructed symmetrical matrix, the technical difficulty in finite-time formation-containment control arising from the asymmetrical Laplacian matrix under single-way directed communication is circumvented. Based upon fractional power feedback of the local error, an adaptive distributed control scheme is established to drive the leaders into the prespecified formation configuration in finite time. Meanwhile, a distributed adaptive control scheme, independent of the unavailable inputs of the leaders, is designed to keep the followers within a bounded distance from the moving leaders and then to make the followers enter the convex hull shaped by the formation of the leaders in finite time. The effectiveness of the proposed control scheme is confirmed by the simulation.

Directed Random Markets: Connectivity Determines Money

NASA Astrophysics Data System (ADS)

Martínez-Martínez, Ismael; López-Ruiz, Ricardo

2013-12-01

Boltzmann-Gibbs (BG) distribution arises as the statistical equilibrium probability distribution of money among the agents of a closed economic system where random and undirected exchanges are allowed. When considering a model with uniform savings in the exchanges, the final distribution is close to the gamma family. In this paper, we implement these exchange rules on networks and we find that these stationary probability distributions are robust and they are not affected by the topology of the underlying network. We introduce a new family of interactions: random but directed ones. In this case, it is found the topology to be determinant and the mean money per economic agent is related to the degree of the node representing the agent in the network. The relation between the mean money per economic agent and its degree is shown to be linear.

Topological properties of robust biological and computational networks

PubMed Central

Navlakha, Saket; He, Xin; Faloutsos, Christos; Bar-Joseph, Ziv

2014-01-01

Network robustness is an important principle in biology and engineering. Previous studies of global networks have identified both redundancy and sparseness as topological properties used by robust networks. By focusing on molecular subnetworks, or modules, we show that module topology is tightly linked to the level of environmental variability (noise) the module expects to encounter. Modules internal to the cell that are less exposed to environmental noise are more connected and less robust than external modules. A similar design principle is used by several other biological networks. We propose a simple change to the evolutionary gene duplication model which gives rise to the rich range of module topologies observed within real networks. We apply these observations to evaluate and design communication networks that are specifically optimized for noisy or malicious environments. Combined, joint analysis of biological and computational networks leads to novel algorithms and insights benefiting both fields. PMID:24789562

Structure, Function, and Propagation of Information across Living Two, Four, and Eight Node Degree Topologies.

PubMed

Alagapan, Sankaraleengam; Franca, Eric; Pan, Liangbin; Leondopulos, Stathis; Wheeler, Bruce C; DeMarse, Thomas B

2016-01-01

In this study, we created four network topologies composed of living cortical neurons and compared resultant structural-functional dynamics including the nature and quality of information transmission. Each living network was composed of living cortical neurons and were created using microstamping of adhesion promoting molecules and each was "designed" with different levels of convergence embedded within each structure. Networks were cultured over a grid of electrodes that permitted detailed measurements of neural activity at each node in the network. Of the topologies we tested, the "Random" networks in which neurons connect based on their own intrinsic properties transmitted information embedded within their spike trains with higher fidelity relative to any other topology we tested. Within our patterned topologies in which we explicitly manipulated structure, the effect of convergence on fidelity was dependent on both topology and time-scale (rate vs. temporal coding). A more detailed examination using tools from network analysis revealed that these changes in fidelity were also associated with a number of other structural properties including a node's degree, degree-degree correlations, path length, and clustering coefficients. Whereas information transmission was apparent among nodes with few connections, the greatest transmission fidelity was achieved among the few nodes possessing the highest number of connections (high degree nodes or putative hubs). These results provide a unique view into the relationship between structure and its affect on transmission fidelity, at least within these small neural populations with defined network topology. They also highlight the potential role of tools such as microstamp printing and microelectrode array recordings to construct and record from arbitrary network topologies to provide a new direction in which to advance the study of structure-function relationships.

Energy latency tradeoffs for medium access and sleep scheduling in wireless sensor networks

NASA Astrophysics Data System (ADS)

Gang, Lu

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. The central thesis of this work is that energy efficient medium access and sleep scheduling mechanisms can be designed without necessarily sacrificing application-specific latency performance. We validate this thesis through results from four case studies that cover various aspects of medium access and sleep scheduling design in wireless sensor networks. Our first effort, DMAC, is to design an adaptive low latency and energy efficient MAC for data gathering to reduce the sleep latency. We propose staggered schedule, duty cycle adaptation, data prediction and the use of more-to-send packets to enable seamless packet forwarding under varying traffic load and channel contentions. Simulation and experimental results show significant energy savings and latency reduction while ensuring high data reliability. The second research effort, DESS, investigates the problem of designing sleep schedules in arbitrary network communication topologies to minimize the worst case end-to-end latency (referred to as delay diameter). We develop a novel graph-theoretical formulation, derive and analyze optimal solutions for the tree and ring topologies and heuristics for arbitrary topologies. The third study addresses the problem of minimum latency joint scheduling and routing (MLSR). By constructing a novel delay graph, the optimal joint scheduling and routing can be solved by M node-disjoint paths algorithm under multiple channel model. We further extended the algorithm to handle dynamic traffic changes and topology changes. A heuristic solution is proposed for MLSR under single channel interference. In the fourth study, EEJSPC, we first formulate a fundamental optimization problem that provides tunable energy-latency-throughput tradeoffs with joint scheduling and power control and present both exponential and polynomial complexity solutions. Then we investigate the problem of minimizing total transmission energy while satisfying transmission requests within a latency bound, and present an iterative approach which converges rapidly to the optimal parameter settings.

Network planning under uncertainties

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2008-11-01

One of the main focuses for network planning is on the optimization of network resources required to build a network under certain traffic demand projection. Traditionally, the inputs to this type of network planning problems are treated as deterministic. In reality, the varying traffic requirements and fluctuations in network resources can cause uncertainties in the decision models. The failure to include the uncertainties in the network design process can severely affect the feasibility and economics of the network. Therefore, it is essential to find a solution that can be insensitive to the uncertain conditions during the network planning process. As early as in the 1960's, a network planning problem with varying traffic requirements over time had been studied. Up to now, this kind of network planning problems is still being active researched, especially for the VPN network design. Another kind of network planning problems under uncertainties that has been studied actively in the past decade addresses the fluctuations in network resources. One such hotly pursued research topic is survivable network planning. It considers the design of a network under uncertainties brought by the fluctuations in topology to meet the requirement that the network remains intact up to a certain number of faults occurring anywhere in the network. Recently, the authors proposed a new planning methodology called Generalized Survivable Network that tackles the network design problem under both varying traffic requirements and fluctuations of topology. Although all the above network planning problems handle various kinds of uncertainties, it is hard to find a generic framework under more general uncertainty conditions that allows a more systematic way to solve the problems. With a unified framework, the seemingly diverse models and algorithms can be intimately related and possibly more insights and improvements can be brought out for solving the problem. This motivates us to seek a generic framework for solving the network planning problem under uncertainties. In addition to reviewing the various network planning problems involving uncertainties, we also propose that a unified framework based on robust optimization can be used to solve a rather large segment of network planning problem under uncertainties. Robust optimization is first introduced in the operations research literature and is a framework that incorporates information about the uncertainty sets for the parameters in the optimization model. Even though robust optimization is originated from tackling the uncertainty in the optimization process, it can serve as a comprehensive and suitable framework for tackling generic network planning problems under uncertainties. In this paper, we begin by explaining the main ideas behind the robust optimization approach. Then we demonstrate the capabilities of the proposed framework by giving out some examples of how the robust optimization framework can be applied to the current common network planning problems under uncertain environments. Next, we list some practical considerations for solving the network planning problem under uncertainties with the proposed framework. Finally, we conclude this article with some thoughts on the future directions for applying this framework to solve other network planning problems.

Assessment of the instantaneous unit hydrograph derived from the theory of topologically random networks

USGS Publications Warehouse

Karlinger, M.R.; Troutman, B.M.

1985-01-01

An instantaneous unit hydrograph (iuh) based on the theory of topologically random networks (topological iuh) is evaluated in terms of sets of basin characteristics and hydraulic parameters. Hydrographs were computed using two linear routing methods for each of two drainage basins in the southeastern United States and are the basis of comparison for the topological iuh's. Elements in the sets of basin characteristics for the topological iuh's are the number of first-order streams only, (N), or the nuber of sources together with the number of channel links in the topological diameter (N, D); the hydraulic parameters are values of the celerity and diffusivity constant. Sensitivity analyses indicate that the mean celerity of the internal links in the network is the critical hydraulic parameter for determining the shape of the topological iuh, while the diffusivity constant has minimal effect on the topological iuh. Asymptotic results (source-only) indicate the number of sources need not be large to approximate the topological iuh with the Weibull probability density function.

Sensitivity and network topology in chemical reaction systems

NASA Astrophysics Data System (ADS)

Okada, Takashi; Mochizuki, Atsushi

2017-08-01

In living cells, biochemical reactions are catalyzed by specific enzymes and connect to one another by sharing substrates and products, forming complex networks. In our previous studies, we established a framework determining the responses to enzyme perturbations only from network topology, and then proved a theorem, called the law of localization, explaining response patterns in terms of network topology. In this paper, we generalize these results to reaction networks with conserved concentrations, which allows us to study any reaction system. We also propose network characteristics quantifying robustness. We compare E. coli metabolic network with randomly rewired networks, and find that the robustness of the E. coli network is significantly higher than that of the random networks.

Virtual network embedding in cross-domain network based on topology and resource attributes

NASA Astrophysics Data System (ADS)

Zhu, Lei; Zhang, Zhizhong; Feng, Linlin; Liu, Lilan

2018-03-01

Aiming at the network architecture ossification and the diversity of access technologies issues, this paper researches the cross-domain virtual network embedding algorithm. By analysing the topological attribute from the local and global perspective of nodes in the virtual network and the physical network, combined with the local network resource property, we rank the embedding priority of the nodes with PCA and TOPSIS methods. Besides, the link load distribution is considered. Above all, We proposed an cross-domain virtual network embedding algorithm based on topology and resource attributes. The simulation results depicts that our algorithm increases the acceptance rate of multi-domain virtual network requests, compared with the existing virtual network embedding algorithm.

Disrupted topological organization of structural networks revealed by probabilistic diffusion tractography in Tourette syndrome children.

PubMed

Wen, Hongwei; Liu, Yue; Rekik, Islem; Wang, Shengpei; Zhang, Jishui; Zhang, Yue; Peng, Yun; He, Huiguang

2017-08-01

Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. Although previous TS studies revealed structural abnormalities in distinct corticobasal ganglia circuits, the topological alterations of the whole-brain white matter (WM) structural networks remain poorly understood. Here, we used diffusion MRI probabilistic tractography and graph theoretical analysis to investigate the topological organization of WM networks in 44 drug-naive TS children and 41 age- and gender-matched healthy children. The WM networks were constructed by estimating inter-regional connectivity probability and the topological properties were characterized using graph theory. We found that both TS and control groups showed an efficient small-world organization in WM networks. However, compared to controls, TS children exhibited decreased global and local efficiency, increased shortest path length and small worldness, indicating a disrupted balance between local specialization and global integration in structural networks. Although both TS and control groups showed highly similar hub distributions, TS children exhibited significant decreased nodal efficiency, mainly distributed in the default mode, language, visual, and sensorimotor systems. Furthermore, two separate networks showing significantly decreased connectivity in TS group were identified using network-based statistical (NBS) analysis, primarily composed of the parieto-occipital cortex, precuneus, and paracentral lobule. Importantly, we combined support vector machine and multiple kernel learning frameworks to fuse multiple levels of network topological features for classification of individuals, achieving high accuracy of 86.47%. Together, our study revealed the disrupted topological organization of structural networks related to pathophysiology of TS, and the discriminative topological features for classification are potential quantitative neuroimaging biomarkers for clinical TS diagnosis. Hum Brain Mapp 38:3988-4008, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Reconstruction of networks from one-step data by matching positions

NASA Astrophysics Data System (ADS)

Wu, Jianshe; Dang, Ni; Jiao, Yang

2018-05-01

It is a challenge in estimating the topology of a network from short time series data. In this paper, matching positions is developed to reconstruct the topology of a network from only one-step data. We consider a general network model of coupled agents, in which the phase transformation of each node is determined by its neighbors. From the phase transformation information from one step to the next, the connections of the tail vertices are reconstructed firstly by the matching positions. Removing the already reconstructed vertices, and repeatedly reconstructing the connections of tail vertices, the topology of the entire network is reconstructed. For sparse scale-free networks with more than ten thousands nodes, we almost obtain the actual topology using only the one-step data in simulations.

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

Default Cascades in Complex Networks: Topology and Systemic Risk

PubMed Central

Roukny, Tarik; Bersini, Hugues; Pirotte, Hugues; Caldarelli, Guido; Battiston, Stefano

2013-01-01

The recent crisis has brought to the fore a crucial question that remains still open: what would be the optimal architecture of financial systems? We investigate the stability of several benchmark topologies in a simple default cascading dynamics in bank networks. We analyze the interplay of several crucial drivers, i.e., network topology, banks' capital ratios, market illiquidity, and random vs targeted shocks. We find that, in general, topology matters only – but substantially – when the market is illiquid. No single topology is always superior to others. In particular, scale-free networks can be both more robust and more fragile than homogeneous architectures. This finding has important policy implications. We also apply our methodology to a comprehensive dataset of an interbank market from 1999 to 2011. PMID:24067913

Analysis of metro network performance from a complex network perspective

NASA Astrophysics Data System (ADS)

Wu, Xingtang; Dong, Hairong; Tse, Chi Kong; Ho, Ivan W. H.; Lau, Francis C. M.

2018-02-01

In this paper, the performance of metro networks is studied from a network science perspective. We review the structural efficiency of metro networks on the basis of a passenger's intuitive routing strategy that optimizes the number of transfers and the distance traveled.A new node centrality measure, called node occupying probability, is introduced for evaluating the level of utilization of stations. The robustness of a metro network is analyzed under several attack scenarios. Six metro networks (Beijing, London, Paris, Hong Kong, Tokyo and New York) are compared in terms of the node occupying probability and a few other performance parameters. Simulation results show that the New York metro system has better topological efficiency, the Tokyo and Hong Kong systems are the most robust under random attack and target attack, respectively.

Topology reduction in deep convolutional feature extraction networks

NASA Astrophysics Data System (ADS)

Wiatowski, Thomas; Grohs, Philipp; Bölcskei, Helmut

2017-08-01

Deep convolutional neural networks (CNNs) used in practice employ potentially hundreds of layers and 10,000s of nodes. Such network sizes entail significant computational complexity due to the large number of convolutions that need to be carried out; in addition, a large number of parameters needs to be learned and stored. Very deep and wide CNNs may therefore not be well suited to applications operating under severe resource constraints as is the case, e.g., in low-power embedded and mobile platforms. This paper aims at understanding the impact of CNN topology, specifically depth and width, on the network's feature extraction capabilities. We address this question for the class of scattering networks that employ either Weyl-Heisenberg filters or wavelets, the modulus non-linearity, and no pooling. The exponential feature map energy decay results in Wiatowski et al., 2017, are generalized to O(a-N), where an arbitrary decay factor a > 1 can be realized through suitable choice of the Weyl-Heisenberg prototype function or the mother wavelet. We then show how networks of fixed (possibly small) depth N can be designed to guarantee that ((1 - ɛ) · 100)% of the input signal's energy are contained in the feature vector. Based on the notion of operationally significant nodes, we characterize, partly rigorously and partly heuristically, the topology-reducing effects of (effectively) band-limited input signals, band-limited filters, and feature map symmetries. Finally, for networks based on Weyl-Heisenberg filters, we determine the prototype function bandwidth that minimizes - for fixed network depth N - the average number of operationally significant nodes per layer.

Topological Phenotypes Constitute a New Dimension in the Phenotypic Space of Leaf Venation Networks

PubMed Central

Ronellenfitsch, Henrik; Lasser, Jana; Daly, Douglas C.; Katifori, Eleni

2015-01-01

The leaves of angiosperms contain highly complex venation networks consisting of recursively nested, hierarchically organized loops. We describe a new phenotypic trait of reticulate vascular networks based on the topology of the nested loops. This phenotypic trait encodes information orthogonal to widely used geometric phenotypic traits, and thus constitutes a new dimension in the leaf venation phenotypic space. We apply our metric to a database of 186 leaves and leaflets representing 137 species, predominantly from the Burseraceae family, revealing diverse topological network traits even within this single family. We show that topological information significantly improves identification of leaves from fragments by calculating a “leaf venation fingerprint” from topology and geometry. Further, we present a phenomenological model suggesting that the topological traits can be explained by noise effects unique to specimen during development of each leaf which leave their imprint on the final network. This work opens the path to new quantitative identification techniques for leaves which go beyond simple geometric traits such as vein density and is directly applicable to other planar or sub-planar networks such as blood vessels in the brain. PMID:26700471

Topological Gyroscopic Metamaterials

NASA Astrophysics Data System (ADS)

Nash, Lisa Michelle

Topological materials are generally insulating in their bulk, with protected conducting states on their boundaries that are robust against disorder and perturbation of material property. The existence of these conducting edge states is characterized by an integer topological invariant. Though the phenomenon was first discovered in electronic systems, recent years have shown that topological states exist in classical systems as well. In this thesis we are primarily concerned with the topological properties of gyroscopic materials, which are created by coupling networks of fast-spinning objects. Through a series of simulations, numerical calculations, and experiments, we show that these materials can support topological edge states. We find that edge states in these gyroscopic metamaterials bear the hallmarks of topology related to broken time reversal symmetry: they transmit excitations unidirectionally and are extremely robust against experimental disorder. We also explore requirements for topology by studying several lattice configurations and find that topology emerges naturally in gyroscopic systems.A simple prescription can be used to create many gyroscopic lattices. Though many of our gyroscopic networks are periodic, we explore amorphous point-sets and find that topology also emerges in these networks.

Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies.

PubMed

Knabe, Johannes F; Nehaniv, Chrystopher L; Schilstra, Maria J

2008-01-01

Methods that analyse the topological structure of networks have recently become quite popular. Whether motifs (subgraph patterns that occur more often than in randomized networks) have specific functions as elementary computational circuits has been cause for debate. As the question is difficult to resolve with currently available biological data, we approach the issue using networks that abstractly model natural genetic regulatory networks (GRNs) which are evolved to show dynamical behaviors. Specifically one group of networks was evolved to be capable of exhibiting two different behaviors ("differentiation") in contrast to a group with a single target behavior. In both groups we find motif distribution differences within the groups to be larger than differences between them, indicating that evolutionary niches (target functions) do not necessarily mold network structure uniquely. These results show that variability operators can have a stronger influence on network topologies than selection pressures, especially when many topologies can create similar dynamics. Moreover, analysis of motif functional relevance by lesioning did not suggest that motifs were of greater importance to the functioning of the network than arbitrary subgraph patterns. Only when drastically restricting network size, so that one motif corresponds to a whole functionally evolved network, was preference for particular connection patterns found. This suggests that in non-restricted, bigger networks, entanglement with the rest of the network hinders topological subgraph analysis.

Retrieving infinite numbers of patterns in a spin-glass model of immune networks

NASA Astrophysics Data System (ADS)

Agliari, E.; Annibale, A.; Barra, A.; Coolen, A. C. C.; Tantari, D.

2017-01-01

The similarity between neural and (adaptive) immune networks has been known for decades, but so far we did not understand the mechanism that allows the immune system, unlike associative neural networks, to recall and execute a large number of memorized defense strategies in parallel. The explanation turns out to lie in the network topology. Neurons interact typically with a large number of other neurons, whereas interactions among lymphocytes in immune networks are very specific, and described by graphs with finite connectivity. In this paper we use replica techniques to solve a statistical mechanical immune network model with “coordinator branches” (T-cells) and “effector branches” (B-cells), and show how the finite connectivity enables the coordinators to manage an extensive number of effectors simultaneously, even above the percolation threshold (where clonal cross-talk is not negligible). A consequence of its underlying topological sparsity is that the adaptive immune system exhibits only weak ergodicity breaking, so that also spontaneous switch-like effects as bi-stabilities are present: the latter may play a significant role in the maintenance of immune homeostasis.

Topological Characteristics of the Hong Kong Stock Market: A Test-based P-threshold Approach to Understanding Network Complexity

NASA Astrophysics Data System (ADS)

Xu, Ronghua; Wong, Wing-Keung; Chen, Guanrong; Huang, Shuo

2017-02-01

In this paper, we analyze the relationship among stock networks by focusing on the statistically reliable connectivity between financial time series, which accurately reflects the underlying pure stock structure. To do so, we firstly filter out the effect of market index on the correlations between paired stocks, and then take a t-test based P-threshold approach to lessening the complexity of the stock network based on the P values. We demonstrate the superiority of its performance in understanding network complexity by examining the Hong Kong stock market. By comparing with other filtering methods, we find that the P-threshold approach extracts purely and significantly correlated stock pairs, which reflect the well-defined hierarchical structure of the market. In analyzing the dynamic stock networks with fixed-size moving windows, our results show that three global financial crises, covered by the long-range time series, can be distinguishingly indicated from the network topological and evolutionary perspectives. In addition, we find that the assortativity coefficient can manifest the financial crises and therefore can serve as a good indicator of the financial market development.

Recovery time after localized perturbations in complex dynamical networks

NASA Astrophysics Data System (ADS)

Mitra, Chiranjit; Kittel, Tim; Choudhary, Anshul; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed concept.

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.

Extending Topological Approaches to Microseismic-Derived 3D Fracture Networks

NASA Astrophysics Data System (ADS)

Urbancic, T.; Bosman, K.; Baig, A.; Ardakani, E. P.

2017-12-01

Fracture topology is important for determining the fluid-flow characteristics of a fracture network. In most unconventional petroleum applications, flow through subsurface fracture networks is the primary source of production, as matrix permeability is often in the nanodarcy range. Typical models of reservoir discrete fracture networks (DFNs) are constructed using fracture orientation and average spacing, without consideration of how the connectivity of the fracture network aids the percolation of hydrocarbons back to the wellbore. Topological approaches to DFN characterization have been developed and extensively used in analysis of outcrop data and aerial photography. Such study of the surface expression of fracture networks is straight-forward, and the physical form of the observed fractures is directly reflected in the parameters used to describe the topology. However, this analysis largely ignores the three-dimensional nature of natural fracture networks, which is difficult to define accurately in geological studies. SMTI analysis of microseismic event distributions can produce DFNs, where each event is represented by a penny-shaped crack with radius and orientation determined from the frequency content of the waveforms and assessment of the slip instability of the potential fracture planes, respectively. Analysis of the geometric relationships between a set of fractures can provide details of intersections between fractures, and thus the topological characteristics of the fracture network. Extension of existing 2D topology approaches to 3D fracture networks is non-trivial. In the 2D case, a fracture intersection is a single point (node), and branches connect adjacent nodes along fractures. For the 3D case, intersection "nodes" become lines, and connecting nodes to find branches becomes more complicated. There are several parameters defined in 2D topology to quantify the connectivity of the fracture network. Equivalent quantities must be defined and calibrated for the 3D case to provide a meaningful measurement of fracture network connectivity. We have developed an approach to analyze the topology of 3D fracture networks derived from microseismic moment tensors. We illustrate the utility of the approach with applications to example datasets from hydraulic fracturing completions.

Hidden Connectivity in Networks with Vulnerable Classes of Nodes

NASA Astrophysics Data System (ADS)

Krause, Sebastian M.; Danziger, Michael M.; Zlatić, Vinko

2016-10-01

In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a "color-avoiding" percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

Brain structural network topological alterations of the left prefrontal and limbic cortex in psychogenic erectile dysfunction.

PubMed

Chen, Jianhuai; Chen, Yun; Gao, Qingqiang; Chen, Guotao; Dai, Yutian; Yao, Zhijian; Lu, Qing

2018-05-01

Despite increasing understanding of the cerebral functional changes and structural abnormalities in erectile dysfunction, alterations in the topological organization of brain networks underlying psychogenic erectile dysfunction remain unclear. Here, based on the diffusion tensor image data of 25 patients and 26 healthy controls, we investigated the topological organization of brain structural networks and its correlations with the clinical variables using the graph theoretical analysis. Patients displayed a preserved overall small-world organization and exhibited a less connectivity strength in the left inferior frontal gyrus, amygdale and the right inferior temporal gyrus. Moreover, an abnormal hub pattern was observed in patients, which might disturb the information interactions of the remaining brain network. Additionally, the clustering coefficient of the left hippocampus was positively correlated with the duration of patients and the normalized betweenness centrality of the right anterior cingulate gyrus and the left calcarine fissure were negatively correlated with the sum scores of the 17-item Hamilton Depression Rating Scale. These findings suggested that the damaged white matter and the abnormal hub distribution of the left prefrontal and limbic cortex might contribute to the pathogenesis of psychogenic erectile dysfunction and provided new insights into the understanding of the pathophysiological mechanisms of psychogenic erectile dysfunction.

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

On the design of a hierarchical SS7 network: A graph theoretical approach

NASA Astrophysics Data System (ADS)

Krauss, Lutz; Rufa, Gerhard

1994-04-01

This contribution is concerned with the design of Signaling System No. 7 networks based on graph theoretical methods. A hierarchical network topology is derived by combining the advantage of the hierarchical network structure with the realization of node disjoint routes between nodes of the network. By using specific features of this topology, we develop an algorithm to construct circle-free routing data and to assure bidirectionality also in case of failure situations. The methods described are based on the requirements that the network topology, as well as the routing data, may be easily changed.

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

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

Potok, Thomas E; Schuman, Catherine D; Young, Steven R

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determinemore » network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.« less

Topological structures in the equities market network

PubMed Central

Leibon, Gregory; Pauls, Scott; Rockmore, Daniel; Savell, Robert

2008-01-01

We present a new method for articulating scale-dependent topological descriptions of the network structure inherent in many complex systems. The technique is based on “partition decoupled null models,” a new class of null models that incorporate the interaction of clustered partitions into a random model and generalize the Gaussian ensemble. As an application, we analyze a correlation matrix derived from 4 years of close prices of equities in the New York Stock Exchange (NYSE) and National Association of Securities Dealers Automated Quotation (NASDAQ). In this example, we expose (i) a natural structure composed of 2 interacting partitions of the market that both agrees with and generalizes standard notions of scale (e.g., sector and industry) and (ii) structure in the first partition that is a topological manifestation of a well-known pattern of capital flow called “sector rotation.” Our approach gives rise to a natural form of multiresolution analysis of the underlying time series that naturally decomposes the basic data in terms of the effects of the different scales at which it clusters. We support our conclusions and show the robustness of the technique with a successful analysis on a simulated network with an embedded topological structure. The equities market is a prototypical complex system, and we expect that our approach will be of use in understanding a broad class of complex systems in which correlation structures are resident.

Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.

PubMed

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

Altered Cerebral Blood Flow Covariance Network in Schizophrenia.

PubMed

Liu, Feng; Zhuo, Chuanjun; Yu, Chunshui

2016-01-01

Many studies have shown abnormal cerebral blood flow (CBF) in schizophrenia; however, it remains unclear how topological properties of CBF network are altered in this disorder. Here, arterial spin labeling (ASL) MRI was employed to measure resting-state CBF in 96 schizophrenia patients and 91 healthy controls. CBF covariance network of each group was constructed by calculating across-subject CBF covariance between 90 brain regions. Graph theory was used to compare intergroup differences in global and nodal topological measures of the network. Both schizophrenia patients and healthy controls had small-world topology in CBF covariance networks, implying an optimal balance between functional segregation and integration. Compared with healthy controls, schizophrenia patients showed reduced small-worldness, normalized clustering coefficient and local efficiency of the network, suggesting a shift toward randomized network topology in schizophrenia. Furthermore, schizophrenia patients exhibited altered nodal centrality in the perceptual-, affective-, language-, and spatial-related regions, indicating functional disturbance of these systems in schizophrenia. This study demonstrated for the first time that schizophrenia patients have disrupted topological properties in CBF covariance network, which provides a new perspective (efficiency of blood flow distribution between brain regions) for understanding neural mechanisms of schizophrenia.

TopologyNet: Topology based deep convolutional and multi-task neural networks for biomolecular property predictions

PubMed Central

2017-01-01

Although deep learning approaches have had tremendous success in image, video and audio processing, computer vision, and speech recognition, their applications to three-dimensional (3D) biomolecular structural data sets have been hindered by the geometric and biological complexity. To address this problem we introduce the element-specific persistent homology (ESPH) method. ESPH represents 3D complex geometry by one-dimensional (1D) topological invariants and retains important biological information via a multichannel image-like representation. This representation reveals hidden structure-function relationships in biomolecules. We further integrate ESPH and deep convolutional neural networks to construct a multichannel topological neural network (TopologyNet) for the predictions of protein-ligand binding affinities and protein stability changes upon mutation. To overcome the deep learning limitations from small and noisy training sets, we propose a multi-task multichannel topological convolutional neural network (MM-TCNN). We demonstrate that TopologyNet outperforms the latest methods in the prediction of protein-ligand binding affinities, mutation induced globular protein folding free energy changes, and mutation induced membrane protein folding free energy changes. Availability: weilab.math.msu.edu/TDL/ PMID:28749969

Analysis of a Data Communication Network’s Performance under Varying Retransmission Disciplines

DTIC Science & Technology

1990-09-01

The routing table is updated using delay information transmitted via congestion/routing up- date packets ( CRUP ) or through delay measurement...previous delay, plus or minus a threshold value, a CRUP is generated and flooded over the network. Upon receipt of a CRUP the ROUTING function up- dates...DDN topology is very large, accounting for the time delay for the full network to be updated, whereas adjacent PSN’s receive CRUP packets virtually

Abnormal brain white matter network in young smokers: a graph theory analysis study.

PubMed

Zhang, Yajuan; Li, Min; Wang, Ruonan; Bi, Yanzhi; Li, Yangding; Yi, Zhang; Liu, Jixin; Yu, Dahua; Yuan, Kai

2018-04-01

Previous diffusion tensor imaging (DTI) studies had investigated the white matter (WM) integrity abnormalities in some specific fiber bundles in smokers. However, little is known about the changes in topological organization of WM structural network in young smokers. In current study, we acquired DTI datasets from 58 male young smokers and 51 matched nonsmokers and constructed the WM networks by the deterministic fiber tracking approach. Graph theoretical analysis was used to compare the topological parameters of WM network (global and nodal) and the inter-regional fractional anisotropy (FA) weighted WM connections between groups. The results demonstrated that both young smokers and nonsmokers had small-world topology in WM network. Further analysis revealed that the young smokers exhibited the abnormal topological organization, i.e., increased network strength, global efficiency, and decreased shortest path length. In addition, the increased nodal efficiency predominately was located in frontal cortex, striatum and anterior cingulate gyrus (ACG) in smokers. Moreover, based on network-based statistic (NBS) approach, the significant increased FA-weighted WM connections were mainly found in the PFC, ACG and supplementary motor area (SMA) regions. Meanwhile, the network parameters were correlated with the nicotine dependence severity (FTND) scores, and the nodal efficiency of orbitofrontal cortex was positive correlation with the cigarette per day (CPD) in young smokers. We revealed the abnormal topological organization of WM network in young smokers, which may improve our understanding of the neural mechanism of young smokers form WM topological organization level.

Topological Analysis of Wireless Networks (TAWN)

DTIC Science & Technology

2016-05-31

transmissions from any other node. Definition 1. A wireless network vulnerability is its susceptibility to becoming disconnected when a single source of...19b. TELEPHONE NUMBER (Include area code) 31-05-2016 FINAL REPORT 12-02-2015 -- 31-05-2016 Topological Analysis of Wireless Networks (TAWN) Robinson...Release, Distribution Unlimited) N/A The goal of this project was to develop topological methods to detect and localize vulnerabilities of wireless

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.

Medium Access Control for Opportunistic Concurrent Transmissions under Shadowing Channels

PubMed Central

Son, In Keun; Mao, Shiwen; Hur, Seung Min

2009-01-01

We study the problem of how to alleviate the exposed terminal effect in multi-hop wireless networks in the presence of log-normal shadowing channels. Assuming node location information, we propose an extension of the IEEE 802.11 MAC protocol that sched-ules concurrent transmissions in the presence of log-normal shadowing, thus mitigating the exposed terminal problem and improving network throughput and delay performance. We observe considerable improvements in throughput and delay achieved over the IEEE 802.11 MAC under various network topologies and channel conditions in ns-2 simulations, which justify the importance of considering channel randomness in MAC protocol design for multi-hop wireless networks. PMID:22408556

Synchronized state of coupled dynamics on time-varying networks.

PubMed

Amritkar, R E; Hu, Chin-Kun

2006-03-01

We consider synchronization properties of coupled dynamics on time-varying networks and the corresponding time-average network. We find that if the different Laplacians corresponding to the time-varying networks commute with each other then the stability of the synchronized state for both the time-varying and the time-average topologies are approximately the same. On the other hand for noncommuting Laplacians the stability of the synchronized state for the time-varying topology is in general better than the time-average topology.

Organization of excitable dynamics in hierarchical biological networks.

PubMed

Müller-Linow, Mark; Hilgetag, Claus C; Hütt, Marc-Thorsten

2008-09-26

This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.

Evolutionary Conservation and Divergence of Gene Coexpression Networks in Gossypium (Cotton) Seeds.

PubMed

Hu, Guanjing; Hovav, Ran; Grover, Corrinne E; Faigenboim-Doron, Adi; Kadmon, Noa; Page, Justin T; Udall, Joshua A; Wendel, Jonathan F

2016-12-01

The cotton genus (Gossypium) provides a superior system for the study of diversification, genome evolution, polyploidization, and human-mediated selection. To gain insight into phenotypic diversification in cotton seeds, we conducted coexpression network analysis of developing seeds from diploid and allopolyploid cotton species and explored network properties. Key network modules and functional associations were identified related to seed oil content and seed weight. We compared species-specific networks to reveal topological changes, including rewired edges and differentially coexpressed genes, associated with speciation, polyploidy, and cotton domestication. Network comparisons among species indicate that topologies are altered in addition to gene expression profiles, indicating that changes in transcriptomic coexpression relationships play a role in the developmental architecture of cotton seed development. The global network topology of allopolyploids, especially for domesticated G. hirsutum, resembles the network of the A-genome diploid more than that of the D-genome parent, despite its D-like phenotype in oil content. Expression modifications associated with allopolyploidy include coexpression level dominance and transgressive expression, suggesting that the transcriptomic architecture in polyploids is to some extent a modular combination of that of its progenitor genomes. Among allopolyploids, intermodular relationships are more preserved between two different wild allopolyploid species than they are between wild and domesticated forms of a cultivated cotton, and regulatory connections of oil synthesis-related pathways are denser and more closely clustered in domesticated vs. wild G. hirsutum. These results demonstrate substantial modification of genic coexpression under domestication. Our work demonstrates how network inference informs our understanding of the transcriptomic architecture of phenotypic variation associated with temporal scales ranging from thousands (domestication) to millions (speciation) of years, and by polyploidy. © The Author(s) 2017. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

Structure and Topology Dynamics of Hyper-Frequency Networks during Rest and Auditory Oddball Performance.

PubMed

Müller, Viktor; Perdikis, Dionysios; von Oertzen, Timo; Sleimen-Malkoun, Rita; Jirsa, Viktor; Lindenberger, Ulman

2016-01-01

Resting-state and task-related recordings are characterized by oscillatory brain activity and widely distributed networks of synchronized oscillatory circuits. Electroencephalographic recordings (EEG) were used to assess network structure and network dynamics during resting state with eyes open and closed, and auditory oddball performance through phase synchronization between EEG channels. For this assessment, we constructed a hyper-frequency network (HFN) based on within- and cross-frequency coupling (WFC and CFC, respectively) at 10 oscillation frequencies ranging between 2 and 20 Hz. We found that CFC generally differentiates between task conditions better than WFC. CFC was the highest during resting state with eyes open. Using a graph-theoretical approach (GTA), we found that HFNs possess small-world network (SWN) topology with a slight tendency to random network characteristics. Moreover, analysis of the temporal fluctuations of HFNs revealed specific network topology dynamics (NTD), i.e., temporal changes of different graph-theoretical measures such as strength, clustering coefficient, characteristic path length (CPL), local, and global efficiency determined for HFNs at different time windows. The different topology metrics showed significant differences between conditions in the mean and standard deviation of these metrics both across time and nodes. In addition, using an artificial neural network approach, we found stimulus-related dynamics that varied across the different network topology metrics. We conclude that functional connectivity dynamics (FCD), or NTD, which was found using the HFN approach during rest and stimulus processing, reflects temporal and topological changes in the functional organization and reorganization of neuronal cell assemblies.

Structure and Topology Dynamics of Hyper-Frequency Networks during Rest and Auditory Oddball Performance

PubMed Central

Müller, Viktor; Perdikis, Dionysios; von Oertzen, Timo; Sleimen-Malkoun, Rita; Jirsa, Viktor; Lindenberger, Ulman

2016-01-01

Resting-state and task-related recordings are characterized by oscillatory brain activity and widely distributed networks of synchronized oscillatory circuits. Electroencephalographic recordings (EEG) were used to assess network structure and network dynamics during resting state with eyes open and closed, and auditory oddball performance through phase synchronization between EEG channels. For this assessment, we constructed a hyper-frequency network (HFN) based on within- and cross-frequency coupling (WFC and CFC, respectively) at 10 oscillation frequencies ranging between 2 and 20 Hz. We found that CFC generally differentiates between task conditions better than WFC. CFC was the highest during resting state with eyes open. Using a graph-theoretical approach (GTA), we found that HFNs possess small-world network (SWN) topology with a slight tendency to random network characteristics. Moreover, analysis of the temporal fluctuations of HFNs revealed specific network topology dynamics (NTD), i.e., temporal changes of different graph-theoretical measures such as strength, clustering coefficient, characteristic path length (CPL), local, and global efficiency determined for HFNs at different time windows. The different topology metrics showed significant differences between conditions in the mean and standard deviation of these metrics both across time and nodes. In addition, using an artificial neural network approach, we found stimulus-related dynamics that varied across the different network topology metrics. We conclude that functional connectivity dynamics (FCD), or NTD, which was found using the HFN approach during rest and stimulus processing, reflects temporal and topological changes in the functional organization and reorganization of neuronal cell assemblies. PMID:27799906

Photo-responsive surface topology in chiral nematic media

NASA Astrophysics Data System (ADS)

Liu, Danqing; Bastiaansen, Cees W. M.; Toonder, Jaap. M. J.; Broer, Dirk J.

2012-03-01

We report on the design and fabrication of 'smart surfaces' that exhibit dynamic changes in their surface topology in response to exposure to light. The principle is based on anisotropic geometric changes of a liquid crystal network upon a change of the molecular order parameter. The photomechanical property of the coating is induced by incorporating an azobenzene moiety into the liquid crystal network. The responsive surface topology consists of regions with two different types of molecular order: planar chiral-nematic areas and homeotropic. Under flood exposure with 365 nm light the surfaces deform from flat to one with a surface relief. The height of the relief structures is of the order of 1 um corresponding to strain difference of around 20%. Furthermore, we demonstrate surface reliefs can form either convex or concave structures upon exposure to UV light corresponding to the decrease or increase molecular order parameter, respectively, related to the isomeric state of the azobenzene crosslinker. The reversible deformation to the initial flat state occurs rapidly after removing the light source.

Multi-attribute integrated measurement of node importance in complex networks.

PubMed

Wang, Shibo; Zhao, Jinlou

2015-11-01

The measure of node importance in complex networks is very important to the research of networks stability and robustness; it also can ensure the security of the whole network. Most researchers have used a single indicator to measure the networks node importance, so that the obtained measurement results only reflect certain aspects of the networks with a loss of information. Meanwhile, because of the difference of networks topology, the nodes' importance should be described by combining the character of the networks topology. Most of the existing evaluation algorithms cannot completely reflect the circumstances of complex networks, so this paper takes into account the degree of centrality, the relative closeness centrality, clustering coefficient, and topology potential and raises an integrated measuring method to measure the nodes' importance. This method can reflect nodes' internal and outside attributes and eliminate the influence of network structure on the node importance. The experiments of karate network and dolphin network show that networks topology structure integrated measure has smaller range of metrical result than a single indicator and more universal. Experiments show that attacking the North American power grid and the Internet network with the method has a faster convergence speed than other methods.

A multi-agent intelligent environment for medical knowledge.

PubMed

Vicari, Rosa M; Flores, Cecilia D; Silvestre, André M; Seixas, Louise J; Ladeira, Marcelo; Coelho, Helder

2003-03-01

AMPLIA is a multi-agent intelligent learning environment designed to support training of diagnostic reasoning and modelling of domains with complex and uncertain knowledge. AMPLIA focuses on the medical area. It is a system that deals with uncertainty under the Bayesian network approach, where learner-modelling tasks will consist of creating a Bayesian network for a problem the system will present. The construction of a network involves qualitative and quantitative aspects. The qualitative part concerns the network topology, that is, causal relations among the domain variables. After it is ready, the quantitative part is specified. It is composed of the distribution of conditional probability of the variables represented. A negotiation process (managed by an intelligent MediatorAgent) will treat the differences of topology and probability distribution between the model the learner built and the one built-in in the system. That negotiation process occurs between the agents that represent the expert knowledge domain (DomainAgent) and the agent that represents the learner knowledge (LearnerAgent).

Topological dimension tunes activity patterns in hierarchical modular networks

NASA Astrophysics Data System (ADS)

Safari, Ali; Moretti, Paolo; Muñoz, Miguel A.

2017-11-01

Connectivity patterns of relevance in neuroscience and systems biology can be encoded in hierarchical modular networks (HMNs). Recent studies highlight the role of hierarchical modular organization in shaping brain activity patterns, providing an excellent substrate to promote both segregation and integration of neural information. Here, we propose an extensive analysis of the critical spreading rate (or ‘epidemic’ threshold)—separating a phase with endemic persistent activity from one in which activity ceases—on diverse HMNs. By employing analytical and computational techniques we determine the nature of such a threshold and scrutinize how it depends on general structural features of the underlying HMN. We critically discuss the extent to which current graph-spectral methods can be applied to predict the onset of spreading in HMNs and, most importantly, we elucidate the role played by the network topological dimension as a relevant and unifying structural parameter, controlling the epidemic threshold.

Chaotic, informational and synchronous behaviour of multiplex networks

NASA Astrophysics Data System (ADS)

Baptista, M. S.; Szmoski, R. M.; Pereira, R. F.; Pinto, S. E. De Souza

2016-03-01

The understanding of the relationship between topology and behaviour in interconnected networks would allow to charac- terise and predict behaviour in many real complex networks since both are usually not simultaneously known. Most previous studies have focused on the relationship between topology and synchronisation. In this work, we provide analytical formulas that shows how topology drives complex behaviour: chaos, information, and weak or strong synchronisation; in multiplex net- works with constant Jacobian. We also study this relationship numerically in multiplex networks of Hindmarsh-Rose neurons. Whereas behaviour in the analytically tractable network is a direct but not trivial consequence of the spectra of eigenvalues of the Laplacian matrix, where behaviour may strongly depend on the break of symmetry in the topology of interconnections, in Hindmarsh-Rose neural networks the nonlinear nature of the chemical synapses breaks the elegant mathematical connec- tion between the spectra of eigenvalues of the Laplacian matrix and the behaviour of the network, creating networks whose behaviour strongly depends on the nature (chemical or electrical) of the inter synapses.

Modifier constraint in alkali borophosphate glasses using topological constraint theory

NASA Astrophysics Data System (ADS)

Li, Xiang; Zeng, Huidan; Jiang, Qi; Zhao, Donghui; Chen, Guorong; Wang, Zhaofeng; Sun, Luyi; Chen, Jianding

2016-12-01

In recent years, composition-dependent properties of glasses have been successfully predicted using the topological constraint theory. The constraints of the glass network are derived from two main parts: network formers and network modifiers. The constraints of the network formers can be calculated on the basis of the topological structure of the glass. However, the latter cannot be accurately calculated in this way, because of the existing of ionic bonds. In this paper, the constraints of the modifier ions in phosphate glasses were thoroughly investigated using the topological constraint theory. The results show that the constraints of the modifier ions are gradually increased with the addition of alkali oxides. Furthermore, an improved topological constraint theory for borophosphate glasses is proposed by taking the composition-dependent constraints of the network modifiers into consideration. The proposed theory is subsequently evaluated by analyzing the composition dependence of the glass transition temperature in alkali borophosphate glasses. This method is supposed to be extended to other similar glass systems containing alkali ions.

Computational models of location-invariant orthographic processing

NASA Astrophysics Data System (ADS)

Dandurand, Frédéric; Hannagan, Thomas; Grainger, Jonathan

2013-03-01

We trained three topologies of backpropagation neural networks to discriminate 2000 words (lexical representations) presented at different positions of a horizontal letter array. The first topology (zero-deck) contains no hidden layer, the second (one-deck) has a single hidden layer, and for the last topology (two-deck), the task is divided in two subtasks implemented as two stacked neural networks, with explicit word-centred letters as intermediate representations. All topologies successfully simulated two key benchmark phenomena observed in skilled human reading: transposed-letter priming and relative-position priming. However, the two-deck topology most accurately simulated the ability to discriminate words from nonwords, while containing the fewest connection weights. We analysed the internal representations after training. Zero-deck networks implement a letter-based scheme with a position bias to differentiate anagrams. One-deck networks implement a holographic overlap coding in which representations are essentially letter-based and words are linear combinations of letters. Two-deck networks also implement holographic-coding.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow.

PubMed

Zubek, Julian; Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow

PubMed Central

Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. PMID:28809957

Characterizing Topology of Probabilistic Biological Networks.

PubMed

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-09-06

Biological interactions are often uncertain events, that may or may not take place with some probability. Existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. Here, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. We develop a method that accurately describes the degree distribution of such networks. We also extend our method to accurately compute the joint degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. It also helps us find an adequate mathematical model using maximum likelihood estimation. Our results demonstrate that power law and log-normal models best describe degree distributions for probabilistic networks. The inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected.

Cascading failures in interconnected networks with dynamical redistribution of loads

NASA Astrophysics Data System (ADS)

Zhao, Zhuang; Zhang, Peng; Yang, Hujiang

2015-09-01

Cascading failures of loads in isolated networks and coupled networks have been studied in the past few years. In most of the corresponding results, the topologies of the networks are destroyed. Here, we present an interconnected network model considering cascading failures based on the dynamic redistribution of flow in the networks. Compared with the results of single scale-free networks, we find that interconnected scale-free networks have higher vulnerability. Additionally, the network heterogeneity plays an important role in the robustness of interconnected networks under intentional attacks. Considering the effects of various coupling preferences, the results show that there are almost no differences. Finally, the application of our model to the Beijing interconnected traffic network, which consists of a subway network and a bus network, shows that the subway network suffers more damage under the attack. Moreover, the interconnected traffic network may be more exposed to damage after initial attacks on the bus network. These discussions are important for the design and optimization of interconnected networks.

Effects of substrate network topologies on competition dynamics

NASA Astrophysics Data System (ADS)

Lee, Sang Hoon; Jeong, Hawoong

2006-08-01

We study a competition dynamics, based on the minority game, endowed with various substrate network structures. We observe the effects of the network topologies by investigating the volatility of the system and the structure of follower networks. The topology of substrate structures significantly influences the system efficiency represented by the volatility and such substrate networks are shown to amplify the herding effect and cause inefficiency in most cases. The follower networks emerging from the leadership structure show a power-law incoming degree distribution. This study shows the emergence of scale-free structures of leadership in the minority game and the effects of the interaction among players on the networked version of the game.

Positron Emission Tomography Reveals Abnormal Topological Organization in Functional Brain Network in Diabetic Patients.

PubMed

Qiu, Xiangzhe; Zhang, Yanjun; Feng, Hongbo; Jiang, Donglang

2016-01-01

Recent studies have demonstrated alterations in the topological organization of structural brain networks in diabetes mellitus (DM). However, the DM-related changes in the topological properties in functional brain networks are unexplored so far. We therefore used fluoro-D-glucose positron emission tomography (FDG-PET) data to construct functional brain networks of 73 DM patients and 91 sex- and age-matched normal controls (NCs), followed by a graph theoretical analysis. We found that both DM patients and NCs had a small-world topology in functional brain network. In comparison to the NC group, the DM group was found to have significantly lower small-world index, lower normalized clustering coefficients and higher normalized characteristic path length. Moreover, for diabetic patients, the nodal centrality was significantly reduced in the right rectus, the right cuneus, the left middle occipital gyrus, and the left postcentral gyrus, and it was significantly increased in the orbitofrontal region of the left middle frontal gyrus, the left olfactory region, and the right paracentral lobule. Our results demonstrated that the diabetic brain was associated with disrupted topological organization in the functional PET network, thus providing functional evidence for the abnormalities of brain networks in DM.

Control Centrality and Hierarchical Structure in Complex Networks

PubMed Central

Liu, Yang-Yu; Slotine, Jean-Jacques; Barabási, Albert-László

2012-01-01

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network’s degree distribution. We show that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general directed network, we design an efficient attack strategy against the controllability of malicious networks. PMID:23028542

Homeostatic structural plasticity can account for topology changes following deafferentation and focal stroke.

PubMed

Butz, Markus; Steenbuck, Ines D; van Ooyen, Arjen

2014-01-01

After brain lesions caused by tumors or stroke, or after lasting loss of input (deafferentation), inter- and intra-regional brain networks respond with complex changes in topology. Not only areas directly affected by the lesion but also regions remote from the lesion may alter their connectivity-a phenomenon known as diaschisis. Changes in network topology after brain lesions can lead to cognitive decline and increasing functional disability. However, the principles governing changes in network topology are poorly understood. Here, we investigated whether homeostatic structural plasticity can account for changes in network topology after deafferentation and brain lesions. Homeostatic structural plasticity postulates that neurons aim to maintain a desired level of electrical activity by deleting synapses when neuronal activity is too high and by providing new synaptic contacts when activity is too low. Using our Model of Structural Plasticity, we explored how local changes in connectivity induced by a focal loss of input affected global network topology. In accordance with experimental and clinical data, we found that after partial deafferentation, the network as a whole became more random, although it maintained its small-world topology, while deafferentated neurons increased their betweenness centrality as they rewired and returned to the homeostatic range of activity. Furthermore, deafferentated neurons increased their global but decreased their local efficiency and got longer tailed degree distributions, indicating the emergence of hub neurons. Together, our results suggest that homeostatic structural plasticity may be an important driving force for lesion-induced network reorganization and that the increase in betweenness centrality of deafferentated areas may hold as a biomarker for brain repair.

Effects in the network topology due to node aggregation: Empirical evidence from the domestic maritime transportation in Greece

NASA Astrophysics Data System (ADS)

Tsiotas, Dimitrios; Polyzos, Serafeim

2018-02-01

This article studies the topological consistency of spatial networks due to node aggregation, examining the changes captured between different network representations that result from nodes' grouping and they refer to the same socioeconomic system. The main purpose of this study is to evaluate what kind of topological information remains unalterable due to node aggregation and, further, to develop a framework for linking the data of an empirical network with data of its socioeconomic environment, when the latter are available for hierarchically higher levels of aggregation, in an effort to promote the interdisciplinary research in the field of complex network analysis. The research question is empirically tested on topological and socioeconomic data extracted from the Greek Maritime Network (GMN) that is modeled as a non-directed multilayer (bilayer) graph consisting of a port-layer, where nodes represent ports, and a prefecture-layer, where nodes represent coastal and insular prefectural groups of ports. The analysis highlights that the connectivity (degree) of the GMN is the most consistent aspect of this multilayer network, which preserves both the topological and the socioeconomic information through node aggregation. In terms of spatial analysis and regional science, such effects illustrate the effectiveness of the prefectural administrative division for the functionality of the Greek maritime transportation system. Overall, this approach proposes a methodological framework that can enjoy further applications about the grouping effects induced on the network topology, providing physical, technical, socioeconomic, strategic or political insights.

Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation

PubMed Central

Phillips, James C.; Sun, Yanhua; Jain, Nikhil; Bohm, Eric J.; Kalé, Laxmikant V.

2014-01-01

Currently deployed petascale supercomputers typically use toroidal network topologies in three or more dimensions. While these networks perform well for topology-agnostic codes on a few thousand nodes, leadership machines with 20,000 nodes require topology awareness to avoid network contention for communication-intensive codes. Topology adaptation is complicated by irregular node allocation shapes and holes due to dedicated input/output nodes or hardware failure. In the context of the popular molecular dynamics program NAMD, we present methods for mapping a periodic 3-D grid of fixed-size spatial decomposition domains to 3-D Cray Gemini and 5-D IBM Blue Gene/Q toroidal networks to enable hundred-million atom full machine simulations, and to similarly partition node allocations into compact domains for smaller simulations using multiple-copy algorithms. Additional enabling techniques are discussed and performance is reported for NCSA Blue Waters, ORNL Titan, ANL Mira, TACC Stampede, and NERSC Edison. PMID:25594075

A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes

PubMed Central

Zhang, Ying; Chen, Wei; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming

2015-01-01

It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes’ mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network. PMID:26633405

A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes.

PubMed

Zhang, Ying; Chen, Wei; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming

2015-12-01

It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes' mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network.

Capacity on wireless quantum cellular communication system

NASA Astrophysics Data System (ADS)

Zhou, Xiang-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen

2018-03-01

Quantum technology is making excellent prospects in future communication networks. Entanglement generation and purification are two major components in quantum networks. Combining these two techniques with classical cellular mobile communication, we proposed a novel wireless quantum cellular(WQC) communication system which is possible to realize commercial mobile quantum communication. In this paper, the architecture and network topology of WQC communication system are discussed, the mathematical model of WQC system is extracted and the serving capacity, indicating the ability to serve customers, is defined and calculated under certain circumstances.

Exploring complex networks.

PubMed

Strogatz, S H

2001-03-08

The study of networks pervades all of science, from neurobiology to statistical physics. The most basic issues are structural: how does one characterize the wiring diagram of a food web or the Internet or the metabolic network of the bacterium Escherichia coli? Are there any unifying principles underlying their topology? From the perspective of nonlinear dynamics, we would also like to understand how an enormous network of interacting dynamical systems-be they neurons, power stations or lasers-will behave collectively, given their individual dynamics and coupling architecture. Researchers are only now beginning to unravel the structure and dynamics of complex networks.

Inferring network structure from cascades.

PubMed

Ghonge, Sushrut; Vural, Dervis Can

2017-07-01

Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors. We report high success rates for synthetic and real networks, for several different cascade models.

Inferring network structure from cascades

NASA Astrophysics Data System (ADS)

Ghonge, Sushrut; Vural, Dervis Can

2017-07-01

Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors. We report high success rates for synthetic and real networks, for several different cascade models.

Structural complexity, movement bias, and metapopulation extinction risk in dendritic ecological networks

USGS Publications Warehouse

Campbell Grant, Evan H.

2011-01-01

Spatial complexity in metacommunities can be separated into 3 main components: size (i.e., number of habitat patches), spatial arrangement of habitat patches (network topology), and diversity of habitat patch types. Much attention has been paid to lattice-type networks, such as patch-based metapopulations, but interest in understanding ecological networks of alternative geometries is building. Dendritic ecological networks (DENs) include some increasingly threatened ecological systems, such as caves and streams. The restrictive architecture of dendritic ecological networks might have overriding implications for species persistence. I used a modeling approach to investigate how number and spatial arrangement of habitat patches influence metapopulation extinction risk in 2 DENs of different size and topology. Metapopulation persistence was higher in larger networks, but this relationship was mediated by network topology and the dispersal pathways used to navigate the network. Larger networks, especially those with greater topological complexity, generally had lower extinction risk than smaller and less-complex networks, but dispersal bias and magnitude affected the shape of this relationship. Applying these general results to real systems will require empirical data on the movement behavior of organisms and will improve our understanding of the implications of network complexity on population and community patterns and processes.

Disrupted Structural Brain Network in AD and aMCI: A Finding of Long Fiber Degeneration.

PubMed

Fang, Rong; Yan, Xiao-Xiao; Wu, Zhi-Yuan; Sun, Yu; Yin, Qi-Hua; Wang, Ying; Tang, Hui-Dong; Sun, Jun-Feng; Miao, Fei; Chen, Sheng-Di

2015-01-01

Although recent evidence has emerged that Alzheimer's disease (AD) and amnestic mild cognitive impairment (aMCI) patients show both regional brain abnormalities and topological degeneration in brain networks, our understanding of the effects of white matter fiber aberrations on brain network topology in AD and aMCI is still rudimentary. In this study, we investigated the regional volumetric aberrations and the global topological abnormalities in AD and aMCI patients. The results showed a widely distributed atrophy in both gray and white matters in the AD and aMCI groups. In particular, AD patients had weaker connectivity with long fiber length than aMCI and normal control (NC) groups, as assessed by fractional anisotropy (FA). Furthermore, the brain networks of all three groups exhibited prominent economical small-world properties. Interestingly, the topological characteristics estimated from binary brain networks showed no significant group effect, indicating a tendency of preserving an optimal topological architecture in AD and aMCI during degeneration. However, significantly longer characteristic path length was observed in the FA weighted brain networks of AD and aMCI patients, suggesting dysfunctional global integration. Moreover, the abnormality of the characteristic path length was negatively correlated with the clinical ratings of cognitive impairment. Thus, the results therefore suggested that the topological alterations in weighted brain networks of AD are induced by the loss of connectivity with long fiber lengths. Our findings provide new insights into the alterations of the brain network in AD and may indicate the predictive value of the network metrics as biomarkers of disease development.

Characterizing the topology of probabilistic biological networks.

PubMed

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-01-01

Biological interactions are often uncertain events, that may or may not take place with some probability. This uncertainty leads to a massive number of alternative interaction topologies for each such network. The existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. In this paper, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. Using our mathematical representation, we develop a method that can accurately describe the degree distribution of such networks. We also take one more step and extend our method to accurately compute the joint-degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. Our method works quickly even for entire protein-protein interaction (PPI) networks. It also helps us find an adequate mathematical model using MLE. We perform a comparative study of node-degree and joint-degree distributions in two types of biological networks: the classical deterministic networks and the more flexible probabilistic networks. Our results confirm that power-law and log-normal models best describe degree distributions for both probabilistic and deterministic networks. Moreover, the inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected. We also show that probabilistic networks are more robust for node-degree distribution computation than the deterministic ones. all the data sets used, the software implemented and the alignments found in this paper are available at http://bioinformatics.cise.ufl.edu/projects/probNet/.

Simulation of dynamic expansion, contraction, and connectivity in a mountain stream network

NASA Astrophysics Data System (ADS)

Ward, Adam S.; Schmadel, Noah M.; Wondzell, Steven M.

2018-04-01

Headwater stream networks expand and contract in response to changes in stream discharge. The changes in the extent of the stream network are also controlled by geologic or geomorphic setting - some reaches go dry even under relatively wet conditions, other reaches remain flowing under relatively dry conditions. While such patterns are well recognized, we currently lack tools to predict the extent of the stream network and the times and locations where the network is dry within large river networks. Here, we develop a perceptual model of the river corridor in a headwater mountainous catchment, translate this into a reduced-complexity mechanistic model, and implement the model to examine connectivity and network extent over an entire water year. Our model agreed reasonably well with our observations, showing that the extent and connectivity of the river network was most sensitive to hydrologic forcing under the lowest discharges (Qgauge < 1 L s-1), that at intermediate discharges (1 L s-1 < Qgauge < 10 L s-1) the extent of the network changed dramatically with changes in discharge, and that under wet conditions (Qgauge > 10 L s-1) the extent of the network was relatively insensitive to hydrologic forcing and was instead determined by the network topology. We do not expect that the specific thresholds observed in this study would be transferable to other catchments with different geology, topology, or hydrologic forcing. However, we expect that the general pattern should be robust: the dominant controls will shift from hydrologic forcing to geologic setting as discharge increases. Furthermore, our method is readily transferable as the model can be applied with minimal data requirements (a single stream gauge, a digital terrain model, and estimates of hydrogeologic properties) to estimate flow duration or connectivity along the river corridor in unstudied catchments. As the available information increases, the model could be better calibrated to match site-specific observations of network extent, locations of dry reaches, or solute break through curves as demonstrated in this study. Based on the low initial data requirements and ability to later tune the model to a specific site, we suggest example applications of this parsimonious model that may prove useful to both researchers and managers.

Network analysis reveals disrupted functional brain circuitry in drug-naive social anxiety disorder.

PubMed

Yang, Xun; Liu, Jin; Meng, Yajing; Xia, Mingrui; Cui, Zaixu; Wu, Xi; Hu, Xinyu; Zhang, Wei; Gong, Gaolang; Gong, Qiyong; Sweeney, John A; He, Yong

2017-12-07

Social anxiety disorder (SAD) is a common and disabling condition characterized by excessive fear and avoidance of public scrutiny. Psychoradiology studies have suggested that the emotional and behavior deficits in SAD are associated with abnormalities in regional brain function and functional connectivity. However, little is known about whether intrinsic functional brain networks in patients with SAD are topologically disrupted. Here, we collected resting-state fMRI data from 33 drug-naive patients with SAD and 32 healthy controls (HC), constructed functional networks with 34 predefined regions based on previous meta-analytic research with task-based fMRI in SAD, and performed network-based statistic and graph-theory analyses. The network-based statistic analysis revealed a single connected abnormal circuitry including the frontolimbic circuit (termed the "fear circuit", including the dorsolateral prefrontal cortex, ventral medial prefrontal cortex and insula) and posterior cingulate/occipital areas supporting perceptual processing. In this single altered network, patients with SAD had higher functional connectivity than HC. At the global level, graph-theory analysis revealed that the patients exhibited a lower normalized characteristic path length than HC, which suggests a disorder-related shift of network topology toward randomized configurations. SAD-related deficits in nodal degree, efficiency and participation coefficient were detected in the parahippocampal gyrus, posterior cingulate cortex, dorsolateral prefrontal cortex, insula and the calcarine sulcus. Aspects of abnormal connectivity were associated with anxiety symptoms. These findings highlight the aberrant topological organization of functional brain network organization in SAD, which provides insights into the neural mechanisms underlying excessive fear and avoidance of social interactions in patients with debilitating social anxiety. Copyright © 2017. Published by Elsevier Inc.

The robustness of multiplex networks under layer node-based attack

PubMed Central

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-01-01

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology. PMID:27075870

The robustness of multiplex networks under layer node-based attack.

PubMed

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-04-14

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology.

NAP: The Network Analysis Profiler, a web tool for easier topological analysis and comparison of medium-scale biological networks.

PubMed

Theodosiou, Theodosios; Efstathiou, Georgios; Papanikolaou, Nikolas; Kyrpides, Nikos C; Bagos, Pantelis G; Iliopoulos, Ioannis; Pavlopoulos, Georgios A

2017-07-14

Nowadays, due to the technological advances of high-throughput techniques, Systems Biology has seen a tremendous growth of data generation. With network analysis, looking at biological systems at a higher level in order to better understand a system, its topology and the relationships between its components is of a great importance. Gene expression, signal transduction, protein/chemical interactions, biomedical literature co-occurrences, are few of the examples captured in biological network representations where nodes represent certain bioentities and edges represent the connections between them. Today, many tools for network visualization and analysis are available. Nevertheless, most of them are standalone applications that often (i) burden users with computing and calculation time depending on the network's size and (ii) focus on handling, editing and exploring a network interactively. While such functionality is of great importance, limited efforts have been made towards the comparison of the topological analysis of multiple networks. Network Analysis Provider (NAP) is a comprehensive web tool to automate network profiling and intra/inter-network topology comparison. It is designed to bridge the gap between network analysis, statistics, graph theory and partially visualization in a user-friendly way. It is freely available and aims to become a very appealing tool for the broader community. It hosts a great plethora of topological analysis methods such as node and edge rankings. Few of its powerful characteristics are: its ability to enable easy profile comparisons across multiple networks, find their intersection and provide users with simplified, high quality plots of any of the offered topological characteristics against any other within the same network. It is written in R and Shiny, it is based on the igraph library and it is able to handle medium-scale weighted/unweighted, directed/undirected and bipartite graphs. NAP is available at http://bioinformatics.med.uoc.gr/NAP .

Quantifying climatic controls on river network topology across scales

NASA Astrophysics Data System (ADS)

Ranjbar Moshfeghi, S.; Hooshyar, M.; Wang, D.; Singh, A.

2017-12-01

Branching structure of river networks is an important topologic and geomorphologic feature that depends on several factors (e.g. climate, tectonic). However, mechanisms that cause these drainage patterns in river networks are poorly understood. In this study, we investigate the effects of varying climatic forcing on river network topology and geomorphology. For this, we select 20 catchments across the United States with different long-term climatic conditions quantified by climate aridity index (AI), defined here as the ratio of mean annual potential evaporation (Ep) to precipitation (P), capturing variation in runoff and vegetation cover. The river networks of these catchments are extracted, using a curvature-based method, from high-resolution (1 m) digital elevation models and several metrics such as drainage density, branching angle, and width functions are computed. We also use a multiscale-entropy-based approach to quantify the topologic irregularity and structural richness of these river networks. Our results reveal systematic impacts of climate forcing on the structure of river networks.

Synaptic Plasticity and Spike Synchronisation in Neuronal Networks

NASA Astrophysics Data System (ADS)

Borges, Rafael R.; Borges, Fernando S.; Lameu, Ewandson L.; Protachevicz, Paulo R.; Iarosz, Kelly C.; Caldas, Iberê L.; Viana, Ricardo L.; Macau, Elbert E. N.; Baptista, Murilo S.; Grebogi, Celso; Batista, Antonio M.

2017-12-01

Brain plasticity, also known as neuroplasticity, is a fundamental mechanism of neuronal adaptation in response to changes in the environment or due to brain injury. In this review, we show our results about the effects of synaptic plasticity on neuronal networks composed by Hodgkin-Huxley neurons. We show that the final topology of the evolved network depends crucially on the ratio between the strengths of the inhibitory and excitatory synapses. Excitation of the same order of inhibition revels an evolved network that presents the rich-club phenomenon, well known to exist in the brain. For initial networks with considerably larger inhibitory strengths, we observe the emergence of a complex evolved topology, where neurons sparsely connected to other neurons, also a typical topology of the brain. The presence of noise enhances the strength of both types of synapses, but if the initial network has synapses of both natures with similar strengths. Finally, we show how the synchronous behaviour of the evolved network will reflect its evolved topology.

Topology for efficient information dissemination in ad-hoc networking

NASA Technical Reports Server (NTRS)

Jennings, E.; Okino, C. M.

2002-01-01

In this paper, we explore the information dissemination problem in ad-hoc wirless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bould relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of such events is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination.

Synchronization Dynamics of Coupled Chemical Oscillators

NASA Astrophysics Data System (ADS)

Tompkins, Nathan

The synchronization dynamics of complex networks have been extensively studied over the past few decades due to their ubiquity in the natural world. Prominent examples include cardiac rhythms, circadian rhythms, the flashing of fireflies, predator/prey population dynamics, mammalian gait, human applause, pendulum clocks, the electrical grid, and of the course the brain. Detailed experiments have been done to map the topology of many of these systems and significant advances have been made to describe the mathematics of these networks. Compared to these bodies of work relatively little has been done to directly test the role of topology in the synchronization dynamics of coupled oscillators. This Dissertation develops technology to examine the dynamics due to topology within networks of discrete oscillatory components. The oscillatory system used here consists of the photo-inhibitable Belousov-Zhabotinsky (BZ) reaction water-in-oil emulsion where the oscillatory drops are diffusively coupled to one another and the topology is defined by the geometry of the diffusive connections. Ring networks are created from a close-packed 2D array of drops using the Programmable Illumination Microscope (PIM) in order to test Turing's theory of morphogenesis directly. Further technology is developed to create custom planar networks of BZ drops in more complicated topologies which can be individually perturbed using illumination from the PIM. The work presented here establishes the validity of using the BZ emulsion system with a PIM to study the topology induced effects on the synchronization dynamics of coupled chemical oscillators, tests the successes and limitations of Turing's theory of morphogenesis, and develops new technology to further probe the effects of network topology on a system of coupled oscillators. Finally, this Dissertation concludes by describing ongoing experiments which utilize this new technology to examine topology induced transitions of synchronization dynamics of diffusively coupled chemical oscillators.

HubAlign: an accurate and efficient method for global alignment of protein-protein interaction networks.

PubMed

Hashemifar, Somaye; Xu, Jinbo

2014-09-01

High-throughput experimental techniques have produced a large amount of protein-protein interaction (PPI) data. The study of PPI networks, such as comparative analysis, shall benefit the understanding of life process and diseases at the molecular level. One way of comparative analysis is to align PPI networks to identify conserved or species-specific subnetwork motifs. A few methods have been developed for global PPI network alignment, but it still remains challenging in terms of both accuracy and efficiency. This paper presents a novel global network alignment algorithm, denoted as HubAlign, that makes use of both network topology and sequence homology information, based upon the observation that topologically important proteins in a PPI network usually are much more conserved and thus, more likely to be aligned. HubAlign uses a minimum-degree heuristic algorithm to estimate the topological and functional importance of a protein from the global network topology information. Then HubAlign aligns topologically important proteins first and gradually extends the alignment to the whole network. Extensive tests indicate that HubAlign greatly outperforms several popular methods in terms of both accuracy and efficiency, especially in detecting functionally similar proteins. HubAlign is available freely for non-commercial purposes at http://ttic.uchicago.edu/∼hashemifar/software/HubAlign.zip. Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press.

Epidemics in networks: a master equation approach

NASA Astrophysics Data System (ADS)

Cotacallapa, M.; Hase, M. O.

2016-02-01

A problem closely related to epidemiology, where a subgraph of ‘infected’ links is defined inside a larger network, is investigated. This subgraph is generated from the underlying network by a random variable, which decides whether a link is able to propagate a disease/information. The relaxation timescale of this random variable is examined in both annealed and quenched limits, and the effectiveness of propagation of disease/information is analyzed. The dynamics of the model is governed by a master equation and two types of underlying network are considered: one is scale-free and the other has exponential degree distribution. We have shown that the relaxation timescale of the contagion variable has a major influence on the topology of the subgraph of infected links, which determines the efficiency of spreading of disease/information over the network.

Symmetric Topological Phases and Tensor Network States

NASA Astrophysics Data System (ADS)

Jiang, Shenghan

Classification and simulation of quantum phases are one of main themes in condensed matter physics. Quantum phases can be distinguished by their symmetrical and topological properties. The interplay between symmetry and topology in condensed matter physics often leads to exotic quantum phases and rich phase diagrams. Famous examples include quantum Hall phases, spin liquids and topological insulators. In this thesis, I present our works toward a more systematically understanding of symmetric topological quantum phases in bosonic systems. In the absence of global symmetries, gapped quantum phases are characterized by topological orders. Topological orders in 2+1D are well studied, while a systematically understanding of topological orders in 3+1D is still lacking. By studying a family of exact solvable models, we find at least some topological orders in 3+1D can be distinguished by braiding phases of loop excitations. In the presence of both global symmetries and topological orders, the interplay between them leads to new phases termed as symmetry enriched topological (SET) phases. We develop a framework to classify a large class of SET phases using tensor networks. For each tensor class, we can write down generic variational wavefunctions. We apply our method to study gapped spin liquids on the kagome lattice, which can be viewed as SET phases of on-site symmetries as well as lattice symmetries. In the absence of topological order, symmetry could protect different topological phases, which are often referred to as symmetry protected topological (SPT) phases. We present systematic constructions of tensor network wavefunctions for bosonic symmetry protected topological (SPT) phases respecting both onsite and spatial symmetries.

Function, dynamics and evolution of network motif modules in integrated gene regulatory networks of worm and plant.

PubMed

Defoort, Jonas; Van de Peer, Yves; Vermeirssen, Vanessa

2018-06-05

Gene regulatory networks (GRNs) consist of different molecular interactions that closely work together to establish proper gene expression in time and space. Especially in higher eukaryotes, many questions remain on how these interactions collectively coordinate gene regulation. We study high quality GRNs consisting of undirected protein-protein, genetic and homologous interactions, and directed protein-DNA, regulatory and miRNA-mRNA interactions in the worm Caenorhabditis elegans and the plant Arabidopsis thaliana. Our data-integration framework integrates interactions in composite network motifs, clusters these in biologically relevant, higher-order topological network motif modules, overlays these with gene expression profiles and discovers novel connections between modules and regulators. Similar modules exist in the integrated GRNs of worm and plant. We show how experimental or computational methodologies underlying a certain data type impact network topology. Through phylogenetic decomposition, we found that proteins of worm and plant tend to functionally interact with proteins of a similar age, while at the regulatory level TFs favor same age, but also older target genes. Despite some influence of the duplication mode difference, we also observe at the motif and module level for both species a preference for age homogeneity for undirected and age heterogeneity for directed interactions. This leads to a model where novel genes are added together to the GRNs in a specific biological functional context, regulated by one or more TFs that also target older genes in the GRNs. Overall, we detected topological, functional and evolutionary properties of GRNs that are potentially universal in all species.

Pioneering topological methods for network-based drug-target prediction by exploiting a brain-network self-organization theory.

PubMed

Durán, Claudio; Daminelli, Simone; Thomas, Josephine M; Haupt, V Joachim; Schroeder, Michael; Cannistraci, Carlo Vittorio

2017-04-26

The bipartite network representation of the drug-target interactions (DTIs) in a biosystem enhances understanding of the drugs' multifaceted action modes, suggests therapeutic switching for approved drugs and unveils possible side effects. As experimental testing of DTIs is costly and time-consuming, computational predictors are of great aid. Here, for the first time, state-of-the-art DTI supervised predictors custom-made in network biology were compared-using standard and innovative validation frameworks-with unsupervised pure topological-based models designed for general-purpose link prediction in bipartite networks. Surprisingly, our results show that the bipartite topology alone, if adequately exploited by means of the recently proposed local-community-paradigm (LCP) theory-initially detected in brain-network topological self-organization and afterwards generalized to any complex network-is able to suggest highly reliable predictions, with comparable performance with the state-of-the-art-supervised methods that exploit additional (non-topological, for instance biochemical) DTI knowledge. Furthermore, a detailed analysis of the novel predictions revealed that each class of methods prioritizes distinct true interactions; hence, combining methodologies based on diverse principles represents a promising strategy to improve drug-target discovery. To conclude, this study promotes the power of bio-inspired computing, demonstrating that simple unsupervised rules inspired by principles of topological self-organization and adaptiveness arising during learning in living intelligent systems (like the brain) can efficiently equal perform complicated algorithms based on advanced, supervised and knowledge-based engineering. © The Author 2017. Published by Oxford University Press.

Spreading dynamics of an e-commerce preferential information model on scale-free networks

NASA Astrophysics Data System (ADS)

Wan, Chen; Li, Tao; Guan, Zhi-Hong; Wang, Yuanmei; Liu, Xiongding

2017-02-01

In order to study the influence of the preferential degree and the heterogeneity of underlying networks on the spread of preferential e-commerce information, we propose a novel susceptible-infected-beneficial model based on scale-free networks. The spreading dynamics of the preferential information are analyzed in detail using the mean-field theory. We determine the basic reproductive number and equilibria. The theoretical analysis indicates that the basic reproductive number depends mainly on the preferential degree and the topology of the underlying networks. We prove the global stability of the information-elimination equilibrium. The permanence of preferential information and the global attractivity of the information-prevailing equilibrium are also studied in detail. Some numerical simulations are presented to verify the theoretical results.

Emergence of small-world structure in networks of spiking neurons through STDP plasticity.

PubMed

Basalyga, Gleb; Gleiser, Pablo M; Wennekers, Thomas

2011-01-01

In this work, we use a complex network approach to investigate how a neural network structure changes under synaptic plasticity. In particular, we consider a network of conductance-based, single-compartment integrate-and-fire excitatory and inhibitory neurons. Initially the neurons are connected randomly with uniformly distributed synaptic weights. The weights of excitatory connections can be strengthened or weakened during spiking activity by the mechanism known as spike-timing-dependent plasticity (STDP). We extract a binary directed connection matrix by thresholding the weights of the excitatory connections at every simulation step and calculate its major topological characteristics such as the network clustering coefficient, characteristic path length and small-world index. We numerically demonstrate that, under certain conditions, a nontrivial small-world structure can emerge from a random initial network subject to STDP learning.

Empirical study of the role of the topology in spreading on communication networks

NASA Astrophysics Data System (ADS)

Medvedev, Alexey; Kertesz, Janos

2017-03-01

Topological aspects, like community structure, and temporal activity patterns, like burstiness, have been shown to severely influence the speed of spreading in temporal networks. We study the influence of the topology on the susceptible-infected (SI) spreading on time stamped communication networks, as obtained from a dataset of mobile phone records. We consider city level networks with intra- and inter-city connections. The networks using only intra-city links are usually sparse, where the spreading depends mainly on the average degree. The inter-city links serve as bridges in spreading, speeding up considerably the process. We demonstrate the effect also on model simulations.

Transition metal coordination polymers based on tetrabromoterephthalic and bis(imidazole) ligands: Syntheses, structures, topological analysis and photoluminescence properties

NASA Astrophysics Data System (ADS)

Zhang, Xiaowei; Xing, Peiqi; Geng, Xiujuan; Sun, Daofeng; Xiao, Zhenyu; Wang, Lei

2015-09-01

Eight new coordination polymers (CPs), namely, [Zn(1,2-mbix)(tbtpa)]n (1), [Co(1,2-mbix)(tbtpa)]n (2), [CdCl(1,2-mbix)(tbtpa)0.5]n (3), {[Cd(1,2-bix)(tbtpa)]·H2O}n (4), {[Cd0.5(1,2-bix)(tbtpa)0.5]·H2O}n (5), {[Co0.5(1,2-bix)(tbtpa)0.5]·2H2O}n (6), {[Co(1,2-bix)(tbtpa)]·H2O}n (7) and {[Co(1,2-bix)(tbtpa)]·Diox·2H2O}n (8), were synthesized under solvothermal conditions based on mix-ligand strategy (H2tbtpa=tetrabromoterephthalic acid and 1,2-mbix=1,2-bis((2-methyl-1H-imidazol-1-yl)methyl)benzene, 1,2-bix=1,2-bis(imidazol-1-ylmethyl)benzene). All of the CPs have been structurally characterized by single-crystal X-ray diffraction analyses and further characterized by elemental analyses, IR spectroscopy, powder X-ray diffraction (PXRD), and thermogravimetric analyses (TGA). X-ray diffraction analyses show that 1 and 2 are isotypics which have 2D highly undulated networks with (4,4)-sql topology with the existence of C-H ⋯Br interactions; for 3, it has a 2D planar network with (4,4)-sql topology with the occurrence of C-H ⋯Cl interactions other than C-H ⋯Br interactions; 4 shows a 3D 2-fold interpenetrated nets with rare 65·8-mok topology which has a self-catention property. As the same case as 1 and 2, 5 and 6 are also isostructural with planar layers with 44-sql topology which further assembled into 3D supramolecular structure through the interdigitated stacking fashion and the C-Br ⋯Cph interactions. As for 7, it has a 2D slightly undulated networks with (4,4)-sql topology which has one dimension channel. While 8 has a 2-fold interpenetrated networks with (3,4)-connect jeb topology with point symbol {63}{65·8}. And their structures can be tuned by conformations of bis(imidazol) ligands and solvent mixture. Besides, the TGA properties for all compounds and the luminescent properties for 1, 3, 4, 5 are discussed in detail.

Evolution versus "intelligent design": comparing the topology of protein-protein interaction networks to the Internet.

PubMed

Yang, Q; Siganos, G; Faloutsos, M; Lonardi, S

2006-01-01

Recent research efforts have made available genome-wide, high-throughput protein-protein interaction (PPI) maps for several model organisms. This has enabled the systematic analysis of PPI networks, which has become one of the primary challenges for the system biology community. In this study, we attempt to understand better the topological structure of PPI networks by comparing them against man-made communication networks, and more specifically, the Internet. Our comparative study is based on a comprehensive set of graph metrics. Our results exhibit an interesting dichotomy. On the one hand, both networks share several macroscopic properties such as scale-free and small-world properties. On the other hand, the two networks exhibit significant topological differences, such as the cliqueishness of the highest degree nodes. We attribute these differences to the distinct design principles and constraints that both networks are assumed to satisfy. We speculate that the evolutionary constraints that favor the survivability and diversification are behind the building process of PPI networks, whereas the leading force in shaping the Internet topology is a decentralized optimization process geared towards efficient node communication.

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Local Patterns to Global Architectures: Influences of Network Topology on Human Learning.

PubMed

Karuza, Elisabeth A; Thompson-Schill, Sharon L; Bassett, Danielle S

2016-08-01

A core question in cognitive science concerns how humans acquire and represent knowledge about their environments. To this end, quantitative theories of learning processes have been formalized in an attempt to explain and predict changes in brain and behavior. We connect here statistical learning approaches in cognitive science, which are rooted in the sensitivity of learners to local distributional regularities, and network science approaches to characterizing global patterns and their emergent properties. We focus on innovative work that describes how learning is influenced by the topological properties underlying sensory input. The confluence of these theoretical approaches and this recent empirical evidence motivate the importance of scaling-up quantitative approaches to learning at both the behavioral and neural levels. Copyright © 2016 Elsevier Ltd. All rights reserved.

Increased signaling entropy in cancer requires the scale-free property of protein interaction networks.

PubMed

Teschendorff, Andrew E; Banerji, Christopher R S; Severini, Simone; Kuehn, Reimer; Sollich, Peter

2015-04-28

One of the key characteristics of cancer cells is an increased phenotypic plasticity, driven by underlying genetic and epigenetic perturbations. However, at a systems-level it is unclear how these perturbations give rise to the observed increased plasticity. Elucidating such systems-level principles is key for an improved understanding of cancer. Recently, it has been shown that signaling entropy, an overall measure of signaling pathway promiscuity, and computable from integrating a sample's gene expression profile with a protein interaction network, correlates with phenotypic plasticity and is increased in cancer compared to normal tissue. Here we develop a computational framework for studying the effects of network perturbations on signaling entropy. We demonstrate that the increased signaling entropy of cancer is driven by two factors: (i) the scale-free (or near scale-free) topology of the interaction network, and (ii) a subtle positive correlation between differential gene expression and node connectivity. Indeed, we show that if protein interaction networks were random graphs, described by Poisson degree distributions, that cancer would generally not exhibit an increased signaling entropy. In summary, this work exposes a deep connection between cancer, signaling entropy and interaction network topology.

Dynamical Response of Networks Under External Perturbations: Exact Results

NASA Astrophysics Data System (ADS)

Chinellato, David D.; Epstein, Irving R.; Braha, Dan; Bar-Yam, Yaneer; de Aguiar, Marcus A. M.

2015-04-01

We give exact statistical distributions for the dynamic response of influence networks subjected to external perturbations. We consider networks whose nodes have two internal states labeled 0 and 1. We let nodes be frozen in state 0, in state 1, and the remaining nodes change by adopting the state of a connected node with a fixed probability per time step. The frozen nodes can be interpreted as external perturbations to the subnetwork of free nodes. Analytically extending and to be smaller than 1 enables modeling the case of weak coupling. We solve the dynamical equations exactly for fully connected networks, obtaining the equilibrium distribution, transition probabilities between any two states and the characteristic time to equilibration. Our exact results are excellent approximations for other topologies, including random, regular lattice, scale-free and small world networks, when the numbers of fixed nodes are adjusted to take account of the effect of topology on coupling to the environment. This model can describe a variety of complex systems, from magnetic spins to social networks to population genetics, and was recently applied as a framework for early warning signals for real-world self-organized economic market crises.

Increased signaling entropy in cancer requires the scale-free property of protein interaction networks

PubMed Central

Teschendorff, Andrew E.; Banerji, Christopher R. S.; Severini, Simone; Kuehn, Reimer; Sollich, Peter

2015-01-01

One of the key characteristics of cancer cells is an increased phenotypic plasticity, driven by underlying genetic and epigenetic perturbations. However, at a systems-level it is unclear how these perturbations give rise to the observed increased plasticity. Elucidating such systems-level principles is key for an improved understanding of cancer. Recently, it has been shown that signaling entropy, an overall measure of signaling pathway promiscuity, and computable from integrating a sample's gene expression profile with a protein interaction network, correlates with phenotypic plasticity and is increased in cancer compared to normal tissue. Here we develop a computational framework for studying the effects of network perturbations on signaling entropy. We demonstrate that the increased signaling entropy of cancer is driven by two factors: (i) the scale-free (or near scale-free) topology of the interaction network, and (ii) a subtle positive correlation between differential gene expression and node connectivity. Indeed, we show that if protein interaction networks were random graphs, described by Poisson degree distributions, that cancer would generally not exhibit an increased signaling entropy. In summary, this work exposes a deep connection between cancer, signaling entropy and interaction network topology. PMID:25919796

Topological Characteristics of the Hong Kong Stock Market: A Test-based P-threshold Approach to Understanding Network Complexity

PubMed Central

Xu, Ronghua; Wong, Wing-Keung; Chen, Guanrong; Huang, Shuo

2017-01-01

In this paper, we analyze the relationship among stock networks by focusing on the statistically reliable connectivity between financial time series, which accurately reflects the underlying pure stock structure. To do so, we firstly filter out the effect of market index on the correlations between paired stocks, and then take a t-test based P-threshold approach to lessening the complexity of the stock network based on the P values. We demonstrate the superiority of its performance in understanding network complexity by examining the Hong Kong stock market. By comparing with other filtering methods, we find that the P-threshold approach extracts purely and significantly correlated stock pairs, which reflect the well-defined hierarchical structure of the market. In analyzing the dynamic stock networks with fixed-size moving windows, our results show that three global financial crises, covered by the long-range time series, can be distinguishingly indicated from the network topological and evolutionary perspectives. In addition, we find that the assortativity coefficient can manifest the financial crises and therefore can serve as a good indicator of the financial market development. PMID:28145494

Spatial-temporal modeling of malware propagation in networks.

PubMed

Chen, Zesheng; Ji, Chuanyi

2005-09-01

Network security is an important task of network management. One threat to network security is malware (malicious software) propagation. One type of malware is called topological scanning that spreads based on topology information. The focus of this work is on modeling the spread of topological malwares, which is important for understanding their potential damages, and for developing countermeasures to protect the network infrastructure. Our model is motivated by probabilistic graphs, which have been widely investigated in machine learning. We first use a graphical representation to abstract the propagation of malwares that employ different scanning methods. We then use a spatial-temporal random process to describe the statistical dependence of malware propagation in arbitrary topologies. As the spatial dependence is particularly difficult to characterize, the problem becomes how to use simple (i.e., biased) models to approximate the spatially dependent process. In particular, we propose the independent model and the Markov model as simple approximations. We conduct both theoretical analysis and extensive simulations on large networks using both real measurements and synthesized topologies to test the performance of the proposed models. Our results show that the independent model can capture temporal dependence and detailed topology information and, thus, outperforms the previous models, whereas the Markov model incorporates a certain spatial dependence and, thus, achieves a greater accuracy in characterizing both transient and equilibrium behaviors of malware propagation.

Using Hybrid Angle/Distance Information for Distributed Topology Control in Vehicular Sensor Networks

PubMed Central

Huang, Chao-Chi; Chiu, Yang-Hung; Wen, Chih-Yu

2014-01-01

In a vehicular sensor network (VSN), the key design issue is how to organize vehicles effectively, such that the local network topology can be stabilized quickly. In this work, each vehicle with on-board sensors can be considered as a local controller associated with a group of communication members. In order to balance the load among the nodes and govern the local topology change, a group formation scheme using localized criteria is implemented. The proposed distributed topology control method focuses on reducing the rate of group member change and avoiding the unnecessary information exchange. Two major phases are sequentially applied to choose the group members of each vehicle using hybrid angle/distance information. The operation of Phase I is based on the concept of the cone-based method, which can select the desired vehicles quickly. Afterwards, the proposed time-slot method is further applied to stabilize the network topology. Given the network structure in Phase I, a routing scheme is presented in Phase II. The network behaviors are explored through simulation and analysis in a variety of scenarios. The results show that the proposed mechanism is a scalable and effective control framework for VSNs. PMID:25350506

Gene network interconnectedness and the generalized topological overlap measure

PubMed Central

Yip, Andy M; Horvath, Steve

2007-01-01

Background Network methods are increasingly used to represent the interactions of genes and/or proteins. Genes or proteins that are directly linked may have a similar biological function or may be part of the same biological pathway. Since the information on the connection (adjacency) between 2 nodes may be noisy or incomplete, it can be desirable to consider alternative measures of pairwise interconnectedness. Here we study a class of measures that are proportional to the number of neighbors that a pair of nodes share in common. For example, the topological overlap measure by Ravasz et al. [1] can be interpreted as a measure of agreement between the m = 1 step neighborhoods of 2 nodes. Several studies have shown that two proteins having a higher topological overlap are more likely to belong to the same functional class than proteins having a lower topological overlap. Here we address the question whether a measure of topological overlap based on higher-order neighborhoods could give rise to a more robust and sensitive measure of interconnectedness. Results We generalize the topological overlap measure from m = 1 step neighborhoods to m ≥ 2 step neighborhoods. This allows us to define the m-th order generalized topological overlap measure (GTOM) by (i) counting the number of m-step neighbors that a pair of nodes share and (ii) normalizing it to take a value between 0 and 1. Using theoretical arguments, a yeast co-expression network application, and a fly protein network application, we illustrate the usefulness of the proposed measure for module detection and gene neighborhood analysis. Conclusion Topological overlap can serve as an important filter to counter the effects of spurious or missing connections between network nodes. The m-th order topological overlap measure allows one to trade-off sensitivity versus specificity when it comes to defining pairwise interconnectedness and network modules. PMID:17250769

Hemisphere- and gender-related differences in small-world brain networks: a resting-state functional MRI study.

PubMed

Tian, Lixia; Wang, Jinhui; Yan, Chaogan; He, Yong

2011-01-01

We employed resting-state functional MRI (R-fMRI) to investigate hemisphere- and gender-related differences in the topological organization of human brain functional networks. Brain networks were first constructed by measuring inter-regional temporal correlations of R-fMRI data within each hemisphere in 86 young, healthy, right-handed adults (38 males and 48 females) followed by a graph-theory analysis. The hemispheric networks exhibit small-world attributes (high clustering and short paths) that are compatible with previous results in the whole-brain functional networks. Furthermore, we found that compared with females, males have a higher normalized clustering coefficient in the right hemispheric network but a lower clustering coefficient in the left hemispheric network, suggesting a gender-hemisphere interaction. Moreover, we observed significant hemisphere-related differences in the regional nodal characteristics in various brain regions, such as the frontal and occipital regions (leftward asymmetry) and the temporal regions (rightward asymmetry), findings that are consistent with previous studies of brain structural and functional asymmetries. Together, our results suggest that the topological organization of human brain functional networks is associated with gender and hemispheres, and they provide insights into the understanding of functional substrates underlying individual differences in behaviors and cognition. Copyright © 2010 Elsevier Inc. All rights reserved.

Robust spatial memory maps in flickering neuronal networks: a topological model

NASA Astrophysics Data System (ADS)

Dabaghian, Yuri; Babichev, Andrey; Memoli, Facundo; Chowdhury, Samir; Rice University Collaboration; Ohio State University Collaboration

It is widely accepted that the hippocampal place cells provide a substrate of the neuronal representation of the environment--the ``cognitive map''. However, hippocampal network, as any other network in the brain is transient: thousands of hippocampal neurons die every day and the connections formed by these cells constantly change due to various forms of synaptic plasticity. What then explains the remarkable reliability of our spatial memories? We propose a computational approach to answering this question based on a couple of insights. First, we propose that the hippocampal cognitive map is fundamentally topological, and hence it is amenable to analysis by topological methods. We then apply several novel methods from homology theory, to understand how dynamic connections between cells influences the speed and reliability of spatial learning. We simulate the rat's exploratory movements through different environments and study how topological invariants of these environments arise in a network of simulated neurons with ``flickering'' connectivity. We find that despite transient connectivity the network of place cells produces a stable representation of the topology of the environment.

Self-organization in multilayer network with adaptation mechanisms based on competition

NASA Astrophysics Data System (ADS)

Pitsik, Elena N.; Makarov, Vladimir V.; Nedaivozov, Vladimir O.; Kirsanov, Daniil V.; Goremyko, Mikhail V.

2018-04-01

The paper considers the phenomena of competition in multiplex network whose structure evolves corresponding to dynamics of it's elements, forming closed loop of self-learning with the aim to reach the optimal topology. Numerical analysis of proposed model shows that it is possible to obtain scale-invariant structures for corresponding parameters as well as the structures with homogeneous distribution of connections in the layers. Revealed phenomena emerges as the consequence of the self-organization processes related to structure-dynamical selflearning based on homeostasis and homophily, as well as the result of the competition between the network's layers for optimal topology. It was shown that in the mode of partial and cluster synchronization the network reaches scale-free topology of complex nature that is different from layer to layer. However, in the mode of global synchronization the homogeneous topologies on all layer of the network are observed. This phenomenon is tightly connected with the competitive processes that represent themselves as the natural mechanism of reaching the optimal topology of the links in variety of real-world systems.

Co-location and Self-Similar Topologies of Urban Infrastructure Networks

NASA Astrophysics Data System (ADS)

Klinkhamer, Christopher; Zhan, Xianyuan; Ukkusuri, Satish; Elisabeth, Krueger; Paik, Kyungrock; Rao, Suresh

2016-04-01

The co-location of urban infrastructure is too obvious to be easily ignored. For reasons of practicality, reliability, and eminent domain, the spatial locations of many urban infrastructure networks, including drainage, sanitary sewers, and road networks, are well correlated. However, important questions dealing with correlations in the network topologies of differing infrastructure types remain unanswered. Here, we have extracted randomly distributed, nested subnets from the urban drainage, sanitary sewer, and road networks in two distinctly different cities: Amman, Jordan; and Indianapolis, USA. Network analyses were performed for each randomly chosen subnet (location and size), using a dual-mapping approach (Hierarchical Intersection Continuity Negotiation). Topological metrics for each infrastructure type were calculated and compared for all subnets in a given city. Despite large differences in the climate, governance, and populace of the two cities, and functional properties of the different infrastructure types, these infrastructure networks are shown to be highly spatially homogenous. Furthermore, strong correlations are found between topological metrics of differing types of surface and subsurface infrastructure networks. Also, the network topologies of each infrastructure type for both cities are shown to exhibit self-similar characteristics (i.e., power law node-degree distributions, [p(k) = ak-γ]. These findings can be used to assist city planners and engineers either expanding or retrofitting existing infrastructure, or in the case of developing countries, building new cities from the ground up. In addition, the self-similar nature of these infrastructure networks holds significant implications for the vulnerability of these critical infrastructure networks to external hazards and ways in which network resilience can be improved.

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.

Altered brain functional networks in people with Internet gaming disorder: Evidence from resting-state fMRI.

PubMed

Wang, Lingxiao; Wu, Lingdan; Lin, Xiao; Zhang, Yifen; Zhou, Hongli; Du, Xiaoxia; Dong, Guangheng

2016-08-30

Although numerous neuroimaging studies have detected structural and functional abnormality in specific brain regions and connections in subjects with Internet gaming disorder (IGD), the topological organization of the whole-brain network in IGD remain unclear. In this study, we applied graph theoretical analysis to explore the intrinsic topological properties of brain networks in Internet gaming disorder (IGD). 37 IGD subjects and 35 matched healthy control (HC) subjects underwent a resting-state functional magnetic resonance imaging scan. The functional networks were constructed by thresholding partial correlation matrices of 90 brain regions. Then we applied graph-based approaches to analysis their topological attributes, including small-worldness, nodal metrics, and efficiency. Both IGD and HC subjects show efficient and economic brain network, and small-world topology. Although there was no significant group difference in global topology metrics, the IGD subjects showed reduced regional centralities in the prefrontal cortex, left posterior cingulate cortex, right amygdala, and bilateral lingual gyrus, and increased functional connectivity in sensory-motor-related brain networks compared to the HC subjects. These results imply that people with IGD may be associated with functional network dysfunction, including impaired executive control and emotional management, but enhanced coordination among visual, sensorimotor, auditory and visuospatial systems. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

NASA Astrophysics Data System (ADS)

Yang, Hong-Yong; Lu, Lan; Cao, Ke-Cai; Zhang, Si-Ying

2010-04-01

In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.

Different alterations in brain functional networks according to direct and indirect topological connections in patients with schizophrenia.

PubMed

Park, Chang-Hyun; Lee, Seungyup; Kim, Taewon; Won, Wang Yeon; Lee, Kyoung-Uk

2017-10-01

Schizophrenia displays connectivity deficits in the brain, but the literature has shown inconsistent findings about alterations in global efficiency of brain functional networks. We supposed that such inconsistency at the whole brain level may be due to a mixture of different portions of global efficiency at sub-brain levels. Accordingly, we considered measuring portions of global efficiency in two aspects: spatial portions by considering sub-brain networks and topological portions by considering contributions to global efficiency according to direct and indirect topological connections. We proposed adjacency and indirect adjacency as new network parameters attributable to direct and indirect topological connections, respectively, and applied them to graph-theoretical analysis of brain functional networks constructed from resting state fMRI data of 22 patients with schizophrenia and 22 healthy controls. Group differences in the network parameters were observed not for whole brain and hemispheric networks, but for regional networks. Alterations in adjacency and indirect adjacency were in opposite directions, such that adjacency increased, but indirect adjacency decreased in patients with schizophrenia. Furthermore, over connections in frontal and parietal regions, increased adjacency was associated with more severe negative symptoms, while decreased adjacency was associated with more severe positive symptoms of schizophrenia. This finding indicates that connectivity deficits associated with positive and negative symptoms of schizophrenia may involve topologically different paths in the brain. In patients with schizophrenia, although changes in global efficiency may not be clearly shown, different alterations in brain functional networks according to direct and indirect topological connections could be revealed at the regional level. Copyright © 2017 Elsevier B.V. All rights reserved.

Is the Internet gaming-addicted brain close to be in a pathological state?

PubMed

Park, Chang-Hyun; Chun, Ji-Won; Cho, Huyn; Jung, Young-Chul; Choi, Jihye; Kim, Dai Jin

2017-01-01

Internet gaming addiction (IGA) is becoming a common and widespread mental health concern. Although IGA induces a variety of negative psychosocial consequences, it is yet ambiguous whether the brain addicted to Internet gaming is considered to be in a pathological state. We investigated IGA-induced abnormalities of the brain specifically from the network perspective and qualitatively assessed whether the Internet gaming-addicted brain is in a state similar to the pathological brain. Topological properties of brain functional networks were examined by applying a graph-theoretical approach to analyzing functional magnetic resonance imaging data acquired during a resting state in 19 IGA adolescents and 20 age-matched healthy controls. We compared functional distance-based measures, global and local efficiency of resting state brain functional networks between the two groups to assess how the IGA subjects' brain was topologically altered from the controls' brain. The IGA subjects had severer impulsiveness and their brain functional networks showed higher global efficiency and lower local efficiency relative to the controls. These topological differences suggest that IGA induced brain functional networks to shift toward the random topological architecture, as exhibited in other pathological states. Furthermore, for the IGA subjects, the topological alterations were specifically attributable to interregional connections incident on the frontal region, and the degree of impulsiveness was associated with the topological alterations over the frontolimbic connections. The current findings lend support to the proposition that the Internet gaming-addicted brain could be in the state similar to pathological states in terms of topological characteristics of brain functional networks. © 2015 Society for the Study of Addiction.

Coordinated and uncoordinated optimization of networks

NASA Astrophysics Data System (ADS)

Brede, Markus

2010-06-01

In this paper, we consider spatial networks that realize a balance between an infrastructure cost (the cost of wire needed to connect the network in space) and communication efficiency, measured by average shortest path length. A global optimization procedure yields network topologies in which this balance is optimized. These are compared with network topologies generated by a competitive process in which each node strives to optimize its own cost-communication balance. Three phases are observed in globally optimal configurations for different cost-communication trade offs: (i) regular small worlds, (ii) starlike networks, and (iii) trees with a center of interconnected hubs. In the latter regime, i.e., for very expensive wire, power laws in the link length distributions P(w)∝w-α are found, which can be explained by a hierarchical organization of the networks. In contrast, in the local optimization process the presence of sharp transitions between different network regimes depends on the dimension of the underlying space. Whereas for d=∞ sharp transitions between fully connected networks, regular small worlds, and highly cliquish periphery-core networks are found, for d=1 sharp transitions are absent and the power law behavior in the link length distribution persists over a much wider range of link cost parameters. The measured power law exponents are in agreement with the hypothesis that the locally optimized networks consist of multiple overlapping suboptimal hierarchical trees.

Displayed Trees Do Not Determine Distinguishability Under the Network Multispecies Coalescent

PubMed Central

Zhu, Sha; Degnan, James H.

2017-01-01

Abstract Recent work in estimating species relationships from gene trees has included inferring networks assuming that past hybridization has occurred between species. Probabilistic models using the multispecies coalescent can be used in this framework for likelihood-based inference of both network topologies and parameters, including branch lengths and hybridization parameters. A difficulty for such methods is that it is not always clear whether, or to what extent, networks are identifiable—that is whether there could be two distinct networks that lead to the same distribution of gene trees. For cases in which incomplete lineage sorting occurs in addition to hybridization, we demonstrate a new representation of the species network likelihood that expresses the probability distribution of the gene tree topologies as a linear combination of gene tree distributions given a set of species trees. This representation makes it clear that in some cases in which two distinct networks give the same distribution of gene trees when sampling one allele per species, the two networks can be distinguished theoretically when multiple individuals are sampled per species. This result means that network identifiability is not only a function of the trees displayed by the networks but also depends on allele sampling within species. We additionally give an example in which two networks that display exactly the same trees can be distinguished from their gene trees even when there is only one lineage sampled per species. PMID:27780899

A Geographic and Functional Network Flow Analysis Tool

DTIC Science & Technology

2014-06-01

a context for the games to be run. By definition, a dystopia is “a place where bad things happen”—a fitting name for a place where the scenarios are...design identified by Topology Zoo and the BRITE Topology generator (Byers et al. 2014; Bowden 2013). Both projects aim to accurately map the network...Knight, Simon, Nguyen, Hung, Falkner, Nickolas, and Matthew Roughan. 2014. “The Internet Topology Zoo .” The Internet Topology Zoo . Accessed March

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.

Mass-action equilibrium and non-specific interactions in protein binding networks

NASA Astrophysics Data System (ADS)

Maslov, Sergei

2009-03-01

Large-scale protein binding networks serve as a paradigm of complex properties of living cells. These networks are naturally weighted with edges characterized by binding strength and protein-nodes -- by their concentrations. However, the state-of-the-art high-throughput experimental techniques generate just a binary (yes or no) information about individual interactions. As a result, most of the previous research concentrated just on topology of these networks. In a series of recent publications [1-4] my collaborators and I went beyond purely topological studies and calculated the mass-action equilibrium of a genome-wide binding network using experimentally determined protein concentrations, localizations, and reliable binding interactions in baker's yeast. We then studied how this equilibrium responds to large perturbations [1-2] and noise [3] in concentrations of proteins. We demonstrated that the change in the equilibrium concentration of a protein exponentially decays (and sign-alternates) with its network distance away from the perturbed node. This explains why, despite a globally connected topology, individual functional modules in such networks are able to operate fairly independently. In a separate study [4] we quantified the interplay between specific and non-specific binding interactions under crowded conditions inside living cells. We show how the need to limit the waste of resources constrains the number of types and concentrations of proteins that are present at the same time and at the same place in yeast cells. [1] S Maslov, I. Ispolatov, PNAS 104:13655 (2007). [2] S. Maslov, K. Sneppen, I. Ispolatov, New J. of Phys. 9: 273 (2007). [3] K-K. Yan, D. Walker, S. Maslov, PRL accepted (2008). [4] J. Zhang, S. Maslov, and E. I. Shakhnovich, Mol Syst Biol 4, 210 (2008).

Modeling and distributed gain scheduling strategy for load frequency control in smart grids with communication topology changes.

PubMed

Liu, Shichao; Liu, Xiaoping P; El Saddik, Abdulmotaleb

2014-03-01

In this paper, we investigate the modeling and distributed control problems for the load frequency control (LFC) in a smart grid. In contrast with existing works, we consider more practical and real scenarios, where the communication topology of the smart grid changes because of either link failures or packet losses. These topology changes are modeled as a time-varying communication topology matrix. By using this matrix, a new closed-loop power system model is proposed to integrate the communication topology changes into the dynamics of a physical power system. The globally asymptotical stability of this closed-loop power system is analyzed. A distributed gain scheduling LFC strategy is proposed to compensate for the potential degradation of dynamic performance (mean square errors of state vectors) of the power system under communication topology changes. In comparison to conventional centralized control approaches, the proposed method can improve the robustness of the smart grid to the variation of the communication network as well as to reduce computation load. Simulation results show that the proposed distributed gain scheduling approach is capable to improve the robustness of the smart grid to communication topology changes. © 2013 ISA. Published by ISA. All rights reserved.

Topology design and performance analysis of an integrated communication network

NASA Technical Reports Server (NTRS)

Li, V. O. K.; Lam, Y. F.; Hou, T. C.; Yuen, J. H.

1985-01-01

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix.

Network topology and resilience analysis of South Korean power grid

NASA Astrophysics Data System (ADS)

Kim, Dong Hwan; Eisenberg, Daniel A.; Chun, Yeong Han; Park, Jeryang

2017-01-01

In this work, we present topological and resilience analyses of the South Korean power grid (KPG) with a broad voltage level. While topological analysis of KPG only with high-voltage infrastructure shows an exponential degree distribution, providing another empirical evidence of power grid topology, the inclusion of low voltage components generates a distribution with a larger variance and a smaller average degree. This result suggests that the topology of a power grid may converge to a highly skewed degree distribution if more low-voltage data is considered. Moreover, when compared to ER random and BA scale-free networks, the KPG has a lower efficiency and a higher clustering coefficient, implying that highly clustered structure does not necessarily guarantee a functional efficiency of a network. Error and attack tolerance analysis, evaluated with efficiency, indicate that the KPG is more vulnerable to random or degree-based attacks than betweenness-based intentional attack. Cascading failure analysis with recovery mechanism demonstrates that resilience of the network depends on both tolerance capacity and recovery initiation time. Also, when the two factors are fixed, the KPG is most vulnerable among the three networks. Based on our analysis, we propose that the topology of power grids should be designed so the loads are homogeneously distributed, or functional hubs and their neighbors have high tolerance capacity to enhance resilience.

Altered topology of neural circuits in congenital prosopagnosia.

PubMed

Rosenthal, Gideon; Tanzer, Michal; Simony, Erez; Hasson, Uri; Behrmann, Marlene; Avidan, Galia

2017-08-21

Using a novel, fMRI-based inter-subject functional correlation (ISFC) approach, which isolates stimulus-locked inter-regional correlation patterns, we compared the cortical topology of the neural circuit for face processing in participants with an impairment in face recognition, congenital prosopagnosia (CP), and matched controls. Whereas the anterior temporal lobe served as the major network hub for face processing in controls, this was not the case for the CPs. Instead, this group evinced hyper-connectivity in posterior regions of the visual cortex, mostly associated with the lateral occipital and the inferior temporal cortices. Moreover, the extent of this hyper-connectivity was correlated with the face recognition deficit. These results offer new insights into the perturbed cortical topology in CP, which may serve as the underlying neural basis of the behavioral deficits typical of this disorder. The approach adopted here has the potential to uncover altered topologies in other neurodevelopmental disorders, as well.

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

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.

Geometry of complex networks and topological centrality

NASA Astrophysics Data System (ADS)

Ranjan, Gyan; Zhang, Zhi-Li

2013-09-01

We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L). The squared distance of a node i to the origin in this n-dimensional space (lii+), yields a topological centrality index, defined as C∗(i)=1/lii+. In turn, the sum of reciprocals of individual node centralities, ∑i1/C∗(i)=∑ilii+, or the trace of L, yields the well-known Kirchhoff index (K), an overall structural descriptor for the network. To put into context this geometric definition of centrality, we provide alternative interpretations of the proposed indices that connect them to meaningful topological characteristics - first, as forced detour overheads and frequency of recurrences in random walks that has an interesting analogy to voltage distributions in the equivalent electrical network; and then as the average connectedness of i in all the bi-partitions of the graph. These interpretations respectively help establish the topological centrality (C∗(i)) of node i as a measure of its overall position as well as its overall connectedness in the network; thus reflecting the robustness of i to random multiple edge failures. Through empirical evaluations using synthetic and real world networks, we demonstrate how the topological centrality is better able to distinguish nodes in terms of their structural roles in the network and, along with Kirchhoff index, is appropriately sensitive to perturbations/re-wirings in the network.

Weak signal transmission in complex networks and its application in detecting connectivity.

PubMed

Liang, Xiaoming; Liu, Zonghua; Li, Baowen

2009-10-01

We present a network model of coupled oscillators to study how a weak signal is transmitted in complex networks. Through both theoretical analysis and numerical simulations, we find that the response of other nodes to the weak signal decays exponentially with their topological distance to the signal source and the coupling strength between two neighboring nodes can be figured out by the responses. This finding can be conveniently used to detect the topology of unknown network, such as the degree distribution, clustering coefficient and community structure, etc., by repeatedly choosing different nodes as the signal source. Through four typical networks, i.e., the regular one dimensional, small world, random, and scale-free networks, we show that the features of network can be approximately given by investigating many fewer nodes than the network size, thus our approach to detect the topology of unknown network may be efficient in practical situations with large network size.

Coevolutionary, coexisting learning and teaching agents model for prisoner’s dilemma games enhancing cooperation with assortative heterogeneous networks

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2013-07-01

Unlike other natural network systems, assortativity can be observed in most human social networks, although it has been reported that a social dilemma situation represented by the prisoner’s dilemma favors dissortativity to enhance cooperation. We established a new coevolutionary model for both agents’ strategy and network topology, where teaching and learning agents coexist. Remarkably, this model enables agents’ enhancing cooperation more than a learners-only model on a time-frozen scale-free network and produces an underlying assortative network with a fair degree of power-law distribution. The model may imply how and why assortative networks are adaptive in human society.

Stability of a giant connected component in a complex network

NASA Astrophysics Data System (ADS)

Kitsak, Maksim; Ganin, Alexander A.; Eisenberg, Daniel A.; Krapivsky, Pavel L.; Krioukov, Dmitri; Alderson, David L.; Linkov, Igor

2018-01-01

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.

Topological Edge Floppy Modes in Disordered Fiber Networks

NASA Astrophysics Data System (ADS)

Zhou, Di; Zhang, Leyou; Mao, Xiaoming

2018-02-01

Disordered fiber networks are ubiquitous in a broad range of natural (e.g., cytoskeleton) and manmade (e.g., aerogels) materials. In this Letter, we discuss the emergence of topological floppy edge modes in two-dimensional fiber networks as a result of deformation or active driving. It is known that a network of straight fibers exhibits bulk floppy modes which only bend the fibers without stretching them. We find that, interestingly, with a perturbation in geometry, these bulk modes evolve into edge modes. We introduce a topological index for these edge modes and discuss their implications in biology.

Analysis of security and threat of underwater wireless sensor network topology

NASA Astrophysics Data System (ADS)

Yang, Guang; Wei, Zhiqiang; Cong, Yanping; Jia, Dongning

2012-04-01

Underwater wireless sensor networks (UWSNs) are a subclass of wireless sensor networks. Underwater sensor deployment is a significant challenge due to the characteristics of UWSNs and underwater environment. Recent researches for UWSNs deployment mostly focus on the maintenance of network connectivity and maximum communication coverage. However, the broadcast nature of the transmission medium incurs various types of security attacks. This paper studies the security issues and threats of UWSNs topology. Based on the cluster-based topology, an underwater cluster-based security scheme (U-CBSS) is presented to defend against these attacks. and safety.

Integrative topological analysis of mass spectrometry data reveals molecular features with clinical relevance in esophageal squamous cell carcinoma

PubMed Central

Gao, She-Gan; Liu, Rui-Min; Zhao, Yun-Gang; Wang, Pei; Ward, Douglas G.; Wang, Guang-Chao; Guo, Xiang-Qian; Gu, Juan; Niu, Wan-Bin; Zhang, Tian; Martin, Ashley; Guo, Zhi-Peng; Feng, Xiao-Shan; Qi, Yi-Jun; Ma, Yuan-Fang

2016-01-01

Combining MS-based proteomic data with network and topological features of such network would identify more clinically relevant molecules and meaningfully expand the repertoire of proteins derived from MS analysis. The integrative topological indexes representing 95.96% information of seven individual topological measures of node proteins were calculated within a protein-protein interaction (PPI) network, built using 244 differentially expressed proteins (DEPs) identified by iTRAQ 2D-LC-MS/MS. Compared with DEPs, differentially expressed genes (DEGs) and comprehensive features (CFs), structurally dominant nodes (SDNs) based on integrative topological index distribution produced comparable classification performance in three different clinical settings using five independent gene expression data sets. The signature molecules of SDN-based classifier for distinction of early from late clinical TNM stages were enriched in biological traits of protein synthesis, intracellular localization and ribosome biogenesis, which suggests that ribosome biogenesis represents a promising therapeutic target for treating ESCC. In addition, ITGB1 expression selected exclusively by integrative topological measures correlated with clinical stages and prognosis, which was further validated with two independent cohorts of ESCC samples. Thus the integrative topological analysis of PPI networks proposed in this study provides an alternative approach to identify potential biomarkers and therapeutic targets from MS/MS data with functional insights in ESCC. PMID:26898710

Deterministic ripple-spreading model for complex networks.

PubMed

Hu, Xiao-Bing; Wang, Ming; Leeson, Mark S; Hines, Evor L; Di Paolo, Ezequiel

2011-04-01

This paper proposes a deterministic complex network model, which is inspired by the natural ripple-spreading phenomenon. The motivations and main advantages of the model are the following: (i) The establishment of many real-world networks is a dynamic process, where it is often observed that the influence of a few local events spreads out through nodes, and then largely determines the final network topology. Obviously, this dynamic process involves many spatial and temporal factors. By simulating the natural ripple-spreading process, this paper reports a very natural way to set up a spatial and temporal model for such complex networks. (ii) Existing relevant network models are all stochastic models, i.e., with a given input, they cannot output a unique topology. Differently, the proposed ripple-spreading model can uniquely determine the final network topology, and at the same time, the stochastic feature of complex networks is captured by randomly initializing ripple-spreading related parameters. (iii) The proposed model can use an easily manageable number of ripple-spreading related parameters to precisely describe a network topology, which is more memory efficient when compared with traditional adjacency matrix or similar memory-expensive data structures. (iv) The ripple-spreading model has a very good potential for both extensions and applications.

Autonomous distributed self-organization for mobile wireless sensor networks.

PubMed

Wen, Chih-Yu; Tang, Hung-Kai

2009-01-01

This paper presents an adaptive combined-metrics-based clustering scheme for mobile wireless sensor networks, which manages the mobile sensors by utilizing the hierarchical network structure and allocates network resources efficiently A local criteria is used to help mobile sensors form a new cluster or join a current cluster. The messages transmitted during hierarchical clustering are applied to choose distributed gateways such that communication for adjacent clusters and distributed topology control can be achieved. In order to balance the load among clusters and govern the topology change, a cluster reformation scheme using localized criterions is implemented. The proposed scheme is simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithm provides efficient network topology management and achieves high scalability in mobile sensor networks.

Cooperation-Induced Topological Complexity: A Promising Road to Fault Tolerance and Hebbian Learning

DTIC Science & Technology

2012-03-16

topological complexity a way to compare the efficiency of a scale-free network to the random network of Erdos and Renyi . All this is extensively dis- cussed in...an excellent review paper byArenas et al. (2008) showing very interesting comparisons of Erdos– Renyi networks and scale- free networks as a function

Identifying partial topology of complex dynamical networks via a pinning mechanism

NASA Astrophysics Data System (ADS)

Zhu, Shuaibing; Zhou, Jin; Lu, Jun-an

2018-04-01

In this paper, we study the problem of identifying the partial topology of complex dynamical networks via a pinning mechanism. By using the network synchronization theory and the adaptive feedback controlling method, we propose a method which can greatly reduce the number of nodes and observers in the response network. Particularly, this method can also identify the whole topology of complex networks. A theorem is established rigorously, from which some corollaries are also derived in order to make our method more cost-effective. Several numerical examples are provided to verify the effectiveness of the proposed method. In the simulation, an approach is also given to avoid possible identification failure caused by inner synchronization of the drive network.

Analysis of stationary availability factor of two-level backbone computer networks with arbitrary topology

NASA Astrophysics Data System (ADS)

Rahman, P. A.

2018-05-01

This scientific paper deals with the two-level backbone computer networks with arbitrary topology. A specialized method, offered by the author for calculation of the stationary availability factor of the two-level backbone computer networks, based on the Markov reliability models for the set of the independent repairable elements with the given failure and repair rates and the methods of the discrete mathematics, is also discussed. A specialized algorithm, offered by the author for analysis of the network connectivity, taking into account different kinds of the network equipment failures, is also observed. Finally, this paper presents an example of calculation of the stationary availability factor for the backbone computer network with the given topology.

Concept Model on Topological Learning

NASA Astrophysics Data System (ADS)

Ae, Tadashi; Kioi, Kazumasa

2010-11-01

We discuss a new model for concept based on topological learning, where the learning process on the neural network is represented by mathematical topology. The topological learning of neural networks is summarized by a quotient of input space and the hierarchical step induces a tree where each node corresponds to a quotient. In general, the concept acquisition is a difficult problem, but the emotion for a subject is represented by providing the questions to a person. Therefore, a kind of concept is captured by such data and the answer sheet can be mapped into a topology consisting of trees. In this paper, we will discuss a way of mapping the emotional concept to a topological learning model.

Fibril growth kinetics link buffer conditions and topology of 3D collagen I networks.

PubMed

Kalbitzer, Liv; Pompe, Tilo

2018-02-01

Three-dimensional fibrillar networks reconstituted from collagen I are widely used as biomimetic scaffolds for in vitro and in vivo cell studies. Various physicochemical parameters of buffer conditions for in vitro fibril formation are well known, including pH-value, ion concentrations and temperature. However, there is a lack of a detailed understanding of reconstituting well-defined 3D network topologies, which is required to mimic specific properties of the native extracellular matrix. We screened a wide range of relevant physicochemical buffer conditions and characterized the topology of the reconstituted 3D networks in terms of mean pore size and fibril diameter. A congruent analysis of fibril formation kinetics by turbidimetry revealed the adjustment of the lateral growth phase of fibrils by buffer conditions to be key in the determination of pore size and fibril diameter of the networks. Although the kinetics of nucleation and linear growth phase were affected by buffer conditions as well, network topology was independent of those two growth phases. Overall, the results of our study provide necessary insights into how to engineer 3D collagen matrices with an independent control over topology parameters, in order to mimic in vivo tissues in in vitro experiments and tissue engineering applications. The study reports a comprehensive analysis of physicochemical conditions of buffer solutions to reconstitute defined 3D collagen I matrices. By a combined analysis of network topology, i.e., pore size and fibril diameter, and the kinetics of fibril formation we can reveal the dependence of 3D network topology on buffer conditions, such as pH-value, phosphate concentration and sodium chloride content. With those results we are now able to provide engineering strategies to independently tune the topology parameters of widely used 3D collagen scaffolds based on the buffer conditions. By that, we enable the straightforward mimicking of extracellular matrices of in vivo tissues for in vitro cell culture experiments and tissue engineering applications. Copyright © 2017 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Some Topics in Stochastic Control

DTIC Science & Technology

2010-10-14

general result in the study of such diffusion approximations is due to Reiman [27] who considered the case where the arrivals and services are mutually...state of the process. In models considered in works of Reiman and Yamada, the underlying topology of the network is the same as that of a Jackson...Sheffield and D. B. Wilson. Tug-of-war and the infinity Laplacian. Jour. AMS, to appear [27] M. I. Reiman . Open queueing networks in heavy traffic

Mid-Task Break Improves Global Integration of Functional Connectivity in Lower Alpha Band

PubMed Central

Li, Junhua; Lim, Julian; Chen, Yu; Wong, Kianfoong; Thakor, Nitish; Bezerianos, Anastasios; Sun, Yu

2016-01-01

Numerous efforts have been devoted to revealing neurophysiological mechanisms of mental fatigue, aiming to find an effective way to reduce the undesirable fatigue-related outcomes. Until recently, mental fatigue is thought to be related to functional dysconnectivity among brain regions. However, the topological representation of brain functional connectivity altered by mental fatigue is only beginning to be revealed. In the current study, we applied a graph theoretical approach to analyse such topological alterations in the lower alpha band (8~10 Hz) of EEG data from 20 subjects undergoing a two-session experiment, in which one session includes four successive blocks with visual oddball tasks (session 1) whereas a mid-task break was introduced in the middle of four task blocks in the other session (session 2). Phase lag index (PLI) was then employed to measure functional connectivity strengths for all pairs of EEG channels. Behavior and connectivity maps were compared between the first and last task blocks in both sessions. Inverse efficiency scores (IES = reaction time/response accuracy) were significantly increased in the last task block, showing a clear effect of time-on-task in participants. Furthermore, a significant block-by-session interaction was revealed in the IES, suggesting the effectiveness of the mid-task break on maintaining task performance. More importantly, a significant session-independent deficit of global integration and an increase of local segregation were found in the last task block across both sessions, providing further support for the presence of a reshaped topology in functional brain connectivity networks under fatigue state. Moreover, a significant block-by-session interaction was revealed in the characteristic path length, small-worldness, and global efficiency, attributing to the significantly disrupted network topology in session 1 in comparison of the maintained network structure in session 2. Specifically, we found increased nodal betweenness centrality in several channels resided in frontal regions in session 1, resembling the observations of more segregated global architecture under fatigue state. Taken together, our findings provide insights into the substrates of brain functional dysconnectivity patterns for mental fatigue and reiterate the effectiveness of the mid-task break on maintaining brain network efficiency. PMID:27378894

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.

How structure sculpts function: Unveiling the contribution of anatomical connectivity to the brain's spontaneous correlation structure

NASA Astrophysics Data System (ADS)

Bettinardi, R. G.; Deco, G.; Karlaftis, V. M.; Van Hartevelt, T. J.; Fernandes, H. M.; Kourtzi, Z.; Kringelbach, M. L.; Zamora-López, G.

2017-04-01

Intrinsic brain activity is characterized by highly organized co-activations between different regions, forming clustered spatial patterns referred to as resting-state networks. The observed co-activation patterns are sustained by the intricate fabric of millions of interconnected neurons constituting the brain's wiring diagram. However, as for other real networks, the relationship between the connectional structure and the emergent collective dynamics still evades complete understanding. Here, we show that it is possible to estimate the expected pair-wise correlations that a network tends to generate thanks to the underlying path structure. We start from the assumption that in order for two nodes to exhibit correlated activity, they must be exposed to similar input patterns from the entire network. We then acknowledge that information rarely spreads only along a unique route but rather travels along all possible paths. In real networks, the strength of local perturbations tends to decay as they propagate away from the sources, leading to a progressive attenuation of the original information content and, thus, of their influence. Accordingly, we define a novel graph measure, topological similarity, which quantifies the propensity of two nodes to dynamically correlate as a function of the resemblance of the overall influences they are expected to receive due to the underlying structure of the network. Applied to the human brain, we find that the similarity of whole-network inputs, estimated from the topology of the anatomical connectome, plays an important role in sculpting the backbone pattern of time-average correlations observed at rest.

Brain anatomical networks in early human brain development.

PubMed

Fan, Yong; Shi, Feng; Smith, Jeffrey Keith; Lin, Weili; Gilmore, John H; Shen, Dinggang

2011-02-01

Recent neuroimaging studies have demonstrated that human brain networks have economic small-world topology and modular organization, enabling efficient information transfer among brain regions. However, it remains largely unknown how the small-world topology and modular organization of human brain networks emerge and develop. Using longitudinal MRI data of 28 healthy pediatric subjects, collected at their ages of 1 month, 1 year, and 2 years, we analyzed development patterns of brain anatomical networks derived from morphological correlations of brain regional volumes. The results show that the brain network of 1-month-olds has the characteristically economic small-world topology and nonrandom modular organization. The network's cost efficiency increases with the brain development to 1 year and 2 years, so does the modularity, providing supportive evidence for the hypothesis that the small-world topology and the modular organization of brain networks are established during early brain development to support rapid synchronization and information transfer with minimal rewiring cost, as well as to balance between local processing and global integration of information. Copyright © 2010. Published by Elsevier Inc.

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

NASA Technical Reports Server (NTRS)

Fathpour, Nanaz; Hadaegh, Fred Y.; Mesbahi, Mehran; Rahmani, Amirreza

2011-01-01

Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation-flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are proposed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms rely on a local information exchange network, relaxing the assumptions on existing algorithms. Distributed space systems rely on a signal transmission network among multiple spacecraft for their operation. Control and coordination among multiple spacecraft in a formation is facilitated via a network of relative sensing and interspacecraft communications. Guidance, navigation, and control rely on the sensing network. This network becomes more complex the more spacecraft are added, or as mission requirements become more complex. The observability of a formation state was observed by a set of local observations from a particular node in the formation. Formation observability can be parameterized in terms of the matrices appearing in the formation dynamics and observation matrices. An agreement protocol was used as a mechanism for observing formation states from local measurements. An agreement protocol is essentially an unforced dynamic system whose trajectory is governed by the interconnection geometry and initial condition of each node, with a goal of reaching a common value of interest. The observability of the interconnected system depends on the geometry of the network, as well as the position of the observer relative to the topology. For the first time, critical GN&C (guidance, navigation, and control estimation) subsystems are synthesized by bringing the contribution of the spacecraft information-exchange network to the forefront of algorithmic analysis and design. The result is a formation estimation algorithm that is modular and robust to variations in the topology and link properties of the underlying formation network.

Optimal topologies for maximizing network transmission capacity

NASA Astrophysics Data System (ADS)

Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

2018-04-01

It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

Network of listed companies based on common shareholders and the prediction of market volatility

NASA Astrophysics Data System (ADS)

Li, Jie; Ren, Da; Feng, Xu; Zhang, Yongjie

2016-11-01

In this paper, we build a network of listed companies in the Chinese stock market based on common shareholding data from 2003 to 2013. We analyze the evolution of topological characteristics of the network (e.g., average degree, diameter, average path length and clustering coefficient) with respect to the time sequence. Additionally, we consider the economic implications of topological characteristic changes on market volatility and use them to make future predictions. Our study finds that the network diameter significantly predicts volatility. After adding control variables used in traditional financial studies (volume, turnover and previous volatility), network topology still significantly influences volatility and improves the predictive ability of the model.

Efficiency of weak brain connections support general cognitive functioning.

PubMed

Santarnecchi, Emiliano; Galli, Giulia; Polizzotto, Nicola Riccardo; Rossi, Alessandro; Rossi, Simone

2014-09-01

Brain network topology provides valuable information on healthy and pathological brain functioning. Novel approaches for brain network analysis have shown an association between topological properties and cognitive functioning. Under the assumption that "stronger is better", the exploration of brain properties has generally focused on the connectivity patterns of the most strongly correlated regions, whereas the role of weaker brain connections has remained obscure for years. Here, we assessed whether the different strength of connections between brain regions may explain individual differences in intelligence. We analyzed-functional connectivity at rest in ninety-eight healthy individuals of different age, and correlated several connectivity measures with full scale, verbal, and performance Intelligent Quotients (IQs). Our results showed that the variance in IQ levels was mostly explained by the distributed communication efficiency of brain networks built using moderately weak, long-distance connections, with only a smaller contribution of stronger connections. The variability in individual IQs was associated with the global efficiency of a pool of regions in the prefrontal lobes, hippocampus, temporal pole, and postcentral gyrus. These findings challenge the traditional view of a prominent role of strong functional brain connections in brain topology, and highlight the importance of both strong and weak connections in determining the functional architecture responsible for human intelligence variability. Copyright © 2014 Wiley Periodicals, Inc.

Deciphering microbial interactions and detecting keystone species with co-occurrence networks.

PubMed

Berry, David; Widder, Stefanie

2014-01-01

Co-occurrence networks produced from microbial survey sequencing data are frequently used to identify interactions between community members. While this approach has potential to reveal ecological processes, it has been insufficiently validated due to the technical limitations inherent in studying complex microbial ecosystems. Here, we simulate multi-species microbial communities with known interaction patterns using generalized Lotka-Volterra dynamics. We then construct co-occurrence networks and evaluate how well networks reveal the underlying interactions and how experimental and ecological parameters can affect network inference and interpretation. We find that co-occurrence networks can recapitulate interaction networks under certain conditions, but that they lose interpretability when the effects of habitat filtering become significant. We demonstrate that networks suffer from local hot spots of spurious correlation in the neighborhood of hub species that engage in many interactions. We also identify topological features associated with keystone species in co-occurrence networks. This study provides a substantiated framework to guide environmental microbiologists in the construction and interpretation of co-occurrence networks from microbial survey datasets.

Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

Glass transition temperature and topological constraints of sodium borophosphate glass-forming liquids.

PubMed

Jiang, Qi; Zeng, Huidan; Liu, Zhao; Ren, Jing; Chen, Guorong; Wang, Zhaofeng; Sun, Luyi; Zhao, Donghui

2013-09-28

Sodium borophosphate glasses exhibit intriguing mixed network former effect, with the nonlinear compositional dependence of their glass transition temperature as one of the most typical examples. In this paper, we establish the widely applicable topological constraint model of sodium borophosphate mixed network former glasses to explain the relationship between the internal structure and nonlinear changes of glass transition temperature. The application of glass topology network was discussed in detail in terms of the unified methodology for the quantitative distribution of each coordinated boron and phosphorus units and glass transition temperature dependence of atomic constraints. An accurate prediction of composition scaling of the glass transition temperature was obtained based on topological constraint model.

Attribute and topology based change detection in a constellation of previously detected objects

DOEpatents

Paglieroni, David W.; Beer, Reginald N.

2016-01-19

A system that applies attribute and topology based change detection to networks of objects that were detected on previous scans of a structure, roadway, or area of interest. The attributes capture properties or characteristics of the previously detected objects, such as location, time of detection, size, elongation, orientation, etc. The topology of the network of previously detected objects is maintained in a constellation database that stores attributes of previously detected objects and implicitly captures the geometrical structure of the network. A change detection system detects change by comparing the attributes and topology of new objects detected on the latest scan to the constellation database of previously detected objects.

Routing Topologies of Wireless Sensor Networks for Health Monitoring of a Cultural Heritage Site.

PubMed

Aparicio, Sofía; Martínez-Garrido, María I; Ranz, Javier; Fort, Rafael; Izquierdo, Miguel Ángel G

2016-10-19

This paper provides a performance evaluation of tree and mesh routing topologies of wireless sensor networks (WSNs) in a cultural heritage site. The historical site selected was San Juan Bautista church in Talamanca de Jarama (Madrid, Spain). We report the preliminary analysis required to study the effects of heating in this historical location using WSNs to monitor the temperature and humidity conditions during periods of weeks. To test which routing topology was better for this kind of application, the WSNs were first deployed on the upper floor of the CAEND institute in Arganda del Rey simulating the church deployment, but in the former scenario there was no direct line of sight between the WSN elements. Two parameters were selected to evaluate the performance of the routing topologies of WSNs: the percentage of received messages and the lifetime of the wireless sensor network. To analyze in more detail which topology gave the best performance, other communication parameters were also measured. The tree topology used was the collection tree protocol and the mesh topology was the XMESH provided by MEMSIC (Andover, MA, USA). For the scenarios presented in this paper, it can be concluded that the tree topology lost fewer messages than the mesh topology.

Aberrant brain functional connectome in patients with obstructive sleep apnea.

PubMed

Chen, Li-Ting; Fan, Xiao-Le; Li, Hai-Jun; Ye, Cheng-Long; Yu, Hong-Hui; Xin, Hui-Zhen; Gong, Hong-Han; Peng, De-Chang; Yan, Li-Ping

2018-01-01

Obstructive sleep apnea (OSA) is accompanied by widespread abnormal spontaneous regional activity related to cognitive deficits. However, little is known about the topological properties of the functional brain connectome of patients with OSA. This study aimed to use the graph theory approaches to investigate the topological properties and functional connectivity (FC) of the functional connectome in patients with OSA, based on resting-state functional magnetic resonance imaging (rs-fMRI). Forty-five male patients with newly diagnosed untreated severe OSA and 45 male good sleepers (GSs) underwent a polysomnography (PSG), clinical evaluations, and rs-fMRI scans. The automated anatomical labeling (AAL) atlas was used to construct the functional brain connectome. The topological organization and FC of brain functional networks in patients with OSA were characterized using graph theory methods and investigated the relationship between functional network topology and clinical variables. Both the patients with OSA and the GSs exhibited high-efficiency "small-world" network attributes. However, the patients with OSA exhibited decreased σ, γ, E glob ; increased Lp, λ; and abnormal nodal centralities in several default-mode network (DMN), salience network (SN), and central executive network (CEN) regions. However, the patients with OSA exhibited abnormal functional connections between the DMN, SN, and CEN. The disrupted FC was significantly positive correlations with the global network metrics γ and σ. The global network metrics were significantly correlated with the Epworth Sleepiness Scale (ESS) score, Montreal Cognitive Assessment (MoCA) score, and oxygen desaturation index. The findings suggest that the functional connectome of patients with OSA exhibited disrupted functional integration and segregation, and functional disconnections of the DMN, SN, and CEN. The aberrant topological attributes may be associated with disrupted FC and cognitive functions. These topological abnormalities and disconnections might be potential biomarkers of cognitive impairments in patients with OSA.

Statistical inference approach to structural reconstruction of complex networks from binary time series

NASA Astrophysics Data System (ADS)

Ma, Chuang; Chen, Han-Shuang; Lai, Ying-Cheng; Zhang, Hai-Feng

2018-02-01

Complex networks hosting binary-state dynamics arise in a variety of contexts. In spite of previous works, to fully reconstruct the network structure from observed binary data remains challenging. We articulate a statistical inference based approach to this problem. In particular, exploiting the expectation-maximization (EM) algorithm, we develop a method to ascertain the neighbors of any node in the network based solely on binary data, thereby recovering the full topology of the network. A key ingredient of our method is the maximum-likelihood estimation of the probabilities associated with actual or nonexistent links, and we show that the EM algorithm can distinguish the two kinds of probability values without any ambiguity, insofar as the length of the available binary time series is reasonably long. Our method does not require any a priori knowledge of the detailed dynamical processes, is parameter-free, and is capable of accurate reconstruction even in the presence of noise. We demonstrate the method using combinations of distinct types of binary dynamical processes and network topologies, and provide a physical understanding of the underlying reconstruction mechanism. Our statistical inference based reconstruction method contributes an additional piece to the rapidly expanding "toolbox" of data based reverse engineering of complex networked systems.

Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks

PubMed Central

Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim

2015-01-01

The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network. PMID:26606143

Statistical inference approach to structural reconstruction of complex networks from binary time series.

PubMed

Ma, Chuang; Chen, Han-Shuang; Lai, Ying-Cheng; Zhang, Hai-Feng

2018-02-01

Complex networks hosting binary-state dynamics arise in a variety of contexts. In spite of previous works, to fully reconstruct the network structure from observed binary data remains challenging. We articulate a statistical inference based approach to this problem. In particular, exploiting the expectation-maximization (EM) algorithm, we develop a method to ascertain the neighbors of any node in the network based solely on binary data, thereby recovering the full topology of the network. A key ingredient of our method is the maximum-likelihood estimation of the probabilities associated with actual or nonexistent links, and we show that the EM algorithm can distinguish the two kinds of probability values without any ambiguity, insofar as the length of the available binary time series is reasonably long. Our method does not require any a priori knowledge of the detailed dynamical processes, is parameter-free, and is capable of accurate reconstruction even in the presence of noise. We demonstrate the method using combinations of distinct types of binary dynamical processes and network topologies, and provide a physical understanding of the underlying reconstruction mechanism. Our statistical inference based reconstruction method contributes an additional piece to the rapidly expanding "toolbox" of data based reverse engineering of complex networked systems.

Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks.

PubMed

Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim

2015-01-01

The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network.

Superframe Duration Allocation Schemes to Improve the Throughput of Cluster-Tree Wireless Sensor Networks

PubMed Central

Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-01-01

The use of Wireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks. PMID:28134822

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.

A network perspective on the topological importance of enzymes and their phylogenetic conservation

PubMed Central

Liu, Wei-chung; Lin, Wen-hsien; Davis, Andrew J; Jordán, Ferenc; Yang, Hsih-te; Hwang, Ming-jing

2007-01-01

Background A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many enzymes exist in numerous species while others occur only in a few. We ask if there are relationships between the phylogenetic profile of an enzyme, or the number of different bacterial species that contain it, and its topological importance in the metabolic network. Our null hypothesis is that phylogenetic profile is independent of topological importance. To test our null hypothesis we constructed an enzyme network from the KEGG (Kyoto Encyclopedia of Genes and Genomes) database. We calculated three network indices of topological importance: the degree or the number of connections of a network node; closeness centrality, which measures how close a node is to others; and betweenness centrality measuring how frequently a node appears on all shortest paths between two other nodes. Results Enzyme phylogenetic profile correlates best with betweenness centrality and also quite closely with degree, but poorly with closeness centrality. Both betweenness and closeness centralities are non-local measures of topological importance and it is intriguing that they have contrasting power of predicting phylogenetic profile in bacterial species. We speculate that redundancy in an enzyme network may be reflected by betweenness centrality but not by closeness centrality. We also discuss factors influencing the correlation between phylogenetic profile and topological importance. Conclusion Our analysis falsifies the hypothesis that phylogenetic profile of enzymes is independent of enzyme network importance. Our results show that phylogenetic profile correlates better with degree and betweenness centrality, but less so with closeness centrality. Enzymes that occur in many bacterial species tend to be those that have high network importance. We speculate that this phenomenon originates in mechanisms driving network evolution. Closeness centrality reflects phylogenetic profile poorly. This is because metabolic networks often consist of distinct functional modules and some are not in the centre of the network. Enzymes in these peripheral parts of a network might be important for cell survival and should therefore occur in many bacterial species. They are, however, distant from other enzymes in the same network. PMID:17425808

Network Topologies and Dynamics Leading to Endotoxin Tolerance and Priming in Innate Immune Cells

NASA Astrophysics Data System (ADS)

Fu, Yan; Glaros, Trevor; Zhu, Meng; Wang, Ping; Wu, Zhanghan; Tyson, John; Li, Liwu; Xing, Jianhua

2012-01-01

The innate immune system, acting as the first line of host defense, senses and adapts to foreign challenges through complex intracellular and intercellular signaling networks. Endotoxin tolerance and priming elicited by macrophages are classic examples of the complex adaptation of innate immune cells. Upon repetitive exposures to different doses of bacterial endotoxin (lipopolysaccharide) or other stimulants, macrophages show either suppressed or augmented inflammatory responses compared to a single exposure to the stimulant. Endotoxin tolerance and priming are critically involved in both immune homeostasis and the pathogenesis of diverse inflammatory diseases. However, the underlying molecular mechanisms are not well understood. By means of a computational search through the parameter space of a coarse-grained three-node network with a two-stage Metropolis sampling approach, we enumerated all the network topologies that can generate priming or tolerance. We discovered three major mechanisms for priming (pathway synergy, suppressor deactivation, activator induction) and one for tolerance (inhibitor persistence). These results not only explain existing experimental observations, but also reveal intriguing test scenarios for future experimental studies to clarify mechanisms of endotoxin priming and tolerance.

Routing in Networks with Random Topologies

NASA Technical Reports Server (NTRS)

Bambos, Nicholas

1997-01-01

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

Analysis on the urban street network of Korea: Connections between topology and meta-information

NASA Astrophysics Data System (ADS)

Lee, Byoung-Hwa; Jung, Woo-Sung

2018-05-01

Cities consist of infrastructure that enables transportation, which can be considered as topology in abstract terms. Once cities are physically organized in terms of infrastructure, people interact with each other to form the values, which can be regarded as the meta-information of the cities. The topology and meta-information coevolve together as the cities are developed. In this study, we investigate the relationship between the topology and meta-information for a street network, which has aspects of both a complex network and planar graph. The degree of organization of a street structure determines the efficiency and productivity of the city in that they act as blood vessels to transport people, goods, and information. We analyze the topological aspect of a street network using centralities including the betweenness, closeness, straightness, and information. We classify the cities into several groups that share common meta-information based on the centrality, indicating that the topological factor of the street structure is closely related to meta-information through coevolution. We also obtain the coevolution in the planned cities using the regularity. Another footprint is the relation between the street segment length and the population, which shows the sublinear scaling.

Minimal Network Topologies for Signal Processing during Collective Cell Chemotaxis.

PubMed

Yue, Haicen; Camley, Brian A; Rappel, Wouter-Jan

2018-06-19

Cell-cell communication plays an important role in collective cell migration. However, it remains unclear how cells in a group cooperatively process external signals to determine the group's direction of motion. Although the topology of signaling pathways is vitally important in single-cell chemotaxis, the signaling topology for collective chemotaxis has not been systematically studied. Here, we combine mathematical analysis and simulations to find minimal network topologies for multicellular signal processing in collective chemotaxis. We focus on border cell cluster chemotaxis in the Drosophila egg chamber, in which responses to several experimental perturbations of the signaling network are known. Our minimal signaling network includes only four elements: a chemoattractant, the protein Rac (indicating cell activation), cell protrusion, and a hypothesized global factor responsible for cell-cell interaction. Experimental data on cell protrusion statistics allows us to systematically narrow the number of possible topologies from more than 40,000,000 to only six minimal topologies with six interactions between the four elements. This analysis does not require a specific functional form of the interactions, and only qualitative features are needed; it is thus robust to many modeling choices. Simulations of a stochastic biochemical model of border cell chemotaxis show that the qualitative selection procedure accurately determines which topologies are consistent with the experiment. We fit our model for all six proposed topologies; each produces results that are consistent with all experimentally available data. Finally, we suggest experiments to further discriminate possible pathway topologies. Copyright © 2018 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Persistent homology analysis of ion aggregations and hydrogen-bonding networks.

PubMed

Xia, Kelin

2018-05-16

Despite the great advancement of experimental tools and theoretical models, a quantitative characterization of the microscopic structures of ion aggregates and their associated water hydrogen-bonding networks still remains a challenging problem. In this paper, a newly-invented mathematical method called persistent homology is introduced, for the first time, to quantitatively analyze the intrinsic topological properties of ion aggregation systems and hydrogen-bonding networks. The two most distinguishable properties of persistent homology analysis of assembly systems are as follows. First, it does not require a predefined bond length to construct the ion or hydrogen-bonding network. Persistent homology results are determined by the morphological structure of the data only. Second, it can directly measure the size of circles or holes in ion aggregates and hydrogen-bonding networks. To validate our model, we consider two well-studied systems, i.e., NaCl and KSCN solutions, generated from molecular dynamics simulations. They are believed to represent two morphological types of aggregation, i.e., local clusters and extended ion networks. It has been found that the two aggregation types have distinguishable topological features and can be characterized by our topological model very well. Further, we construct two types of networks, i.e., O-networks and H2O-networks, for analyzing the topological properties of hydrogen-bonding networks. It is found that for both models, KSCN systems demonstrate much more dramatic variations in their local circle structures with a concentration increase. A consistent increase of large-sized local circle structures is observed and the sizes of these circles become more and more diverse. In contrast, NaCl systems show no obvious increase of large-sized circles. Instead a consistent decline of the average size of the circle structures is observed and the sizes of these circles become more and more uniform with a concentration increase. As far as we know, these unique intrinsic topological features in ion aggregation systems have never been pointed out before. More importantly, our models can be directly used to quantitatively analyze the intrinsic topological invariants, including circles, loops, holes, and cavities, of any network-like structures, such as nanomaterials, colloidal systems, biomolecular assemblies, among others. These topological invariants cannot be described by traditional graph and network models.

Assessing transfer property and reliability of urban bus network based on complex network theory

NASA Astrophysics Data System (ADS)

Zhang, Hui; Zhuge, Cheng-Xiang; Zhao, Xiang; Song, Wen-Bo

Transfer reliability has an important impact on the urban bus network. The proportion of zero and one transfer time is a key indicator to measure the connectivity of bus networks. However, it is hard to calculate the transfer time between nodes because of the complicated network structure. In this paper, the topological structures of urban bus network in Jinan are constructed by space L and space P. A method to calculate transfer times between stations has been proposed by reachable matrix under space P. The result shows that it is efficient to calculate the transfer time between nodes in large networks. In order to test the transfer reliability, a node failure process has been built according to degree, clustering coefficient and betweenness centrality under space L and space P. The results show that the deliberate attack by betweenness centrality under space P is more effective compared with other five attack modes. This research could provide a power tool to find hub stations in bus networks and give a help for traffic manager to guarantee the normal operation of urban bus systems.

Detecting network communities beyond assortativity-related attributes

NASA Astrophysics Data System (ADS)

Liu, Xin; Murata, Tsuyoshi; Wakita, Ken

2014-07-01

In network science, assortativity refers to the tendency of links to exist between nodes with similar attributes. In social networks, for example, links tend to exist between individuals of similar age, nationality, location, race, income, educational level, religious belief, and language. Thus, various attributes jointly affect the network topology. An interesting problem is to detect community structure beyond some specific assortativity-related attributes ρ, i.e., to take out the effect of ρ on network topology and reveal the hidden community structures which are due to other attributes. An approach to this problem is to redefine the null model of the modularity measure, so as to simulate the effect of ρ on network topology. However, a challenge is that we do not know to what extent the network topology is affected by ρ and by other attributes. In this paper, we propose a distance modularity, which allows us to freely choose any suitable function to simulate the effect of ρ. Such freedom can help us probe the effect of ρ and detect the hidden communities which are due to other attributes. We test the effectiveness of distance modularity on synthetic benchmarks and two real-world networks.

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

Stochastic Characterization of Communication Network Latency for Wide Area Grid Control Applications.

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

Ameme, Dan Selorm Kwami; Guttromson, Ross

This report characterizes communications network latency under various network topologies and qualities of service (QoS). The characterizations are probabilistic in nature, allowing deeper analysis of stability for Internet Protocol (IP) based feedback control systems used in grid applications. The work involves the use of Raspberry Pi computers as a proxy for a controlled resource, and an ns-3 network simulator on a Linux server to create an experimental platform (testbed) that can be used to model wide-area grid control network communications in smart grid. Modbus protocol is used for information transport, and Routing Information Protocol is used for dynamic route selectionmore » within the simulated network.« less

Static and transient performance prediction for CFB boilers using a Bayesian-Gaussian Neural Network

NASA Astrophysics Data System (ADS)

Ye, Haiwen; Ni, Weidou

1997-06-01

A Bayesian-Gaussian Neural Network (BGNN) is put forward in this paper to predict the static and transient performance of Circulating Fluidized Bed (CFB) boilers. The advantages of this network over Back-Propagation Neural Networks (BPNNs), easier determination of topology, simpler and time saving in training process as well as self-organizing ability, make this network more practical in on-line performance prediction for complicated processes. Simulation shows that this network is comparable to the BPNNs in predicting the performance of CFB boilers. Good and practical on-line performance predictions are essential for operation guide and model predictive control of CFB boilers, which are under research by the authors.

Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights.

PubMed

Wang, Jin-Liang; Wu, Huai-Ning; Huang, Tingwen; Ren, Shun-Yan; Wu, Jigang

2017-08-01

A complex dynamical network consisting of N identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.

Becoming-Topologies of Education: Deformations, Networks and the Database Effect

ERIC Educational Resources Information Center

Thompson, Greg; Cook, Ian

2015-01-01

This article uses topological approaches to suggest that education is becoming-topological. Analyses presented in a recent double-issue of "Theory, Culture & Society" are used to demonstrate the utility of topology for education. In particular, the article explains education's topological character through examining the global…

Minimum Interference Planar Geometric Topology in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Nguyen, Trac N.; Huynh, Dung T.

The approach of using topology control to reduce interference in wireless sensor networks has attracted attention of several researchers. There are at least two definitions of interference in the literature. In a wireless sensor network the interference at a node may be caused by an edge that is transmitting data [15], or it occurs because the node itself is within the transmission range of another [3], [1], [6]. In this paper we show that the problem of assigning power to nodes in the plane to yield a planar geometric graph whose nodes have bounded interference is NP-complete under both interference definitions. Our results provide a rigorous proof for a theorem in [15] whose proof is unconvincing. They also address one of the open issues raised in [6] where Halldórsson and Tokuyama were concerned with the receiver model of node interference, and derived an O(sqrt {Δ}) upper bound for the maximum node interference of a wireless ad hoc network in the plane (Δ is the maximum interference of the so-called uniform radius network). The question as to whether this problem is NP-complete in the 2-dimensional case was left open.

Stock market network’s topological stability: Evidence from planar maximally filtered graph and minimal spanning tree

NASA Astrophysics Data System (ADS)

Yan, Xin-Guo; Xie, Chi; Wang, Gang-Jin

2015-08-01

We study the topological stability of stock market network by investigating the topological robustness, namely the ability of the network to resist structural or topological changes. The stock market network is extracted by minimal spanning tree (MST) and planar maximally filtered graph (PMFG). We find that the specific delisting thresholds of the listed companies exist in both MST and PMFG networks. In comparison with MST, PMFG provides more information and is better for the aim of exploring stock market network’s robustness. The PMFG before the US sub-prime crisis (i.e., from June 2005 to May 2007) has a stronger robustness against the intentional topological damage than the other two sub-periods (i.e., from June 2007 to May 2009 and from June 2009 to May 2011). We also find that the nonfractal property exists in MSTs of S&P 500, i.e., the highly connected nodes link with each other directly, which indicates that the MSTs are vulnerable to the removal of such important nodes. Moreover, the financial institutions and high technology companies are important in maintaining the stability of S&P 500 network.

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.

A fault-tolerant small world topology control model in ad hoc networks for search and rescue

NASA Astrophysics Data System (ADS)

Tan, Mian; Fang, Ling; Wu, Yue; Zhang, Bo; Chang, Bowen; Holme, Petter; Zhao, Jing

2018-02-01

Due to their self-organized, multi-hop and distributed characteristics, ad hoc networks are useful in search and rescue. Topology control models need to be designed for energy-efficient, robust and fast communication in ad hoc networks. This paper proposes a topology control model which specializes for search and rescue-Compensation Small World-Repeated Game (CSWRG)-which integrates mobility models, constructing small world networks and a game-theoretic approach to the allocation of resources. Simulation results show that our mobility models can enhance the communication performance of the constructed small-world networks. Our strategy, based on repeated game, can suppress selfish behavior and compensate agents that encounter selfish or faulty neighbors. This model could be useful for the design of ad hoc communication networks.

The stability of financial market networks

NASA Astrophysics Data System (ADS)

Yan, Xin-Guo; Xie, Chi; Wang, Gang-Jin

2014-08-01

We investigate the stability of a financial market network by measuring its topological robustness, namely the ability of the network to resist structural or topological changes. The closing prices of 710 stocks in the Shanghai Stock Exchange (SSE) from 2005 to 2011 are chosen as the empirical data. We divide the period into three sub-periods: before, during, and after the US sub-prime crisis. By monitoring the size of the clusters which fall apart from the network after removing the nodes (i.e., the listed companies in the SSE), we find that: i) the SSE network is sensitive to the nodes' failure, which implies that the network is unstable. ii) the SSE network before the financial crisis has the strongest robustness against the intentional topological damage; iii) the hubs (i.e., highly connected nodes) connect with each other directly and play a vital important role in maintaining SSE network's stability.

Isolated desynchronization and intertwined synchronization in networks of semiconductor lasers

NASA Astrophysics Data System (ADS)

Xu, Mingfeng; Pan, Wei; Zhang, Liyue

2018-04-01

Two patterns of synchronization in networks of semiconductor lasers (SLs) induced by symmetries of inherent network topology are presented. One type is termed isolated desynchronization, in which one or more clusters lose stability while all others remain synchronized. Another type is intertwined synchronization, in which some clusters always achieve and lose their synchrony at the same time. The existence of these special synchronization patterns and their relationship with the topology of network is discussed systemically. The results show that such behaviors exist in different topologies of SL networks. We also discussed the influence of significant parameters of SL networks on the stability of cluster synchronization. It is shown that the network dynamics is sensitive to the two key internal parameters of SLs, the linewidth-enhancement factor, and gain saturation coefficient. Our work is very beneficial to the implementation of secure communication and synchronization networks based on SLs.

Sparse Regression Based Structure Learning of Stochastic Reaction Networks from Single Cell Snapshot Time Series.

PubMed

Klimovskaia, Anna; Ganscha, Stefan; Claassen, Manfred

2016-12-01

Stochastic chemical reaction networks constitute a model class to quantitatively describe dynamics and cell-to-cell variability in biological systems. The topology of these networks typically is only partially characterized due to experimental limitations. Current approaches for refining network topology are based on the explicit enumeration of alternative topologies and are therefore restricted to small problem instances with almost complete knowledge. We propose the reactionet lasso, a computational procedure that derives a stepwise sparse regression approach on the basis of the Chemical Master Equation, enabling large-scale structure learning for reaction networks by implicitly accounting for billions of topology variants. We have assessed the structure learning capabilities of the reactionet lasso on synthetic data for the complete TRAIL induced apoptosis signaling cascade comprising 70 reactions. We find that the reactionet lasso is able to efficiently recover the structure of these reaction systems, ab initio, with high sensitivity and specificity. With only < 1% false discoveries, the reactionet lasso is able to recover 45% of all true reactions ab initio among > 6000 possible reactions and over 102000 network topologies. In conjunction with information rich single cell technologies such as single cell RNA sequencing or mass cytometry, the reactionet lasso will enable large-scale structure learning, particularly in areas with partial network structure knowledge, such as cancer biology, and thereby enable the detection of pathological alterations of reaction networks. We provide software to allow for wide applicability of the reactionet lasso.

Revealing topological organization of human brain functional networks with resting-state functional near infrared spectroscopy.

PubMed

Niu, Haijing; Wang, Jinhui; Zhao, Tengda; Shu, Ni; He, Yong

2012-01-01

The human brain is a highly complex system that can be represented as a structurally interconnected and functionally synchronized network, which assures both the segregation and integration of information processing. Recent studies have demonstrated that a variety of neuroimaging and neurophysiological techniques such as functional magnetic resonance imaging (MRI), diffusion MRI and electroencephalography/magnetoencephalography can be employed to explore the topological organization of human brain networks. However, little is known about whether functional near infrared spectroscopy (fNIRS), a relatively new optical imaging technology, can be used to map functional connectome of the human brain and reveal meaningful and reproducible topological characteristics. We utilized resting-state fNIRS (R-fNIRS) to investigate the topological organization of human brain functional networks in 15 healthy adults. Brain networks were constructed by thresholding the temporal correlation matrices of 46 channels and analyzed using graph-theory approaches. We found that the functional brain network derived from R-fNIRS data had efficient small-world properties, significant hierarchical modular structure and highly connected hubs. These results were highly reproducible both across participants and over time and were consistent with previous findings based on other functional imaging techniques. Our results confirmed the feasibility and validity of using graph-theory approaches in conjunction with optical imaging techniques to explore the topological organization of human brain networks. These results may expand a methodological framework for utilizing fNIRS to study functional network changes that occur in association with development, aging and neurological and psychiatric disorders.

Criticality Is an Emergent Property of Genetic Networks that Exhibit Evolvability

PubMed Central

Torres-Sosa, Christian; Huang, Sui; Aldana, Maximino

2012-01-01

Accumulating experimental evidence suggests that the gene regulatory networks of living organisms operate in the critical phase, namely, at the transition between ordered and chaotic dynamics. Such critical dynamics of the network permits the coexistence of robustness and flexibility which are necessary to ensure homeostatic stability (of a given phenotype) while allowing for switching between multiple phenotypes (network states) as occurs in development and in response to environmental change. However, the mechanisms through which genetic networks evolve such critical behavior have remained elusive. Here we present an evolutionary model in which criticality naturally emerges from the need to balance between the two essential components of evolvability: phenotype conservation and phenotype innovation under mutations. We simulated the Darwinian evolution of random Boolean networks that mutate gene regulatory interactions and grow by gene duplication. The mutating networks were subjected to selection for networks that both (i) preserve all the already acquired phenotypes (dynamical attractor states) and (ii) generate new ones. Our results show that this interplay between extending the phenotypic landscape (innovation) while conserving the existing phenotypes (conservation) suffices to cause the evolution of all the networks in a population towards criticality. Furthermore, the networks produced by this evolutionary process exhibit structures with hubs (global regulators) similar to the observed topology of real gene regulatory networks. Thus, dynamical criticality and certain elementary topological properties of gene regulatory networks can emerge as a byproduct of the evolvability of the phenotypic landscape. PMID:22969419

Vpliv topoloskih lastnosti kompleksnih mrez in dinamicnih lastnosti sklopljenih celicnih oscilatorjev na kolektivno dinamiko

NASA Astrophysics Data System (ADS)

Markovic, Rene

This doctor thesis is both theoretical and applicative. In the theoretical part of the thesis, we examine how the interplay of dynamical features of oscillators and structural properties of complex networks affect the collective behavior of the system. We show, that weakly dissipative and flexible oscillators synchronize best in a broad scale network topology, whereas on the other hand strongly dissipative and rigid oscillators exhibit maximal synchronization in a scale-free network topology. We provide an analytical explanation for this phenomenon and validate it by implementing various continuous as well as discrete mathematical models that exhibit different levels of dynamical complexity. In the continuation, we additionally investigate how speed of signal transmission in the network affects the collective dynamic of the system. Our results show that besides an optimal network topology, also an optimal information transmission speed exists, at which the system reaches the highest degree of global synchronization. In the second part we apply the findings and the methodology from our theoretical studies to the examination of the collective pancreatic beta cell activity in the islets of Langerhans, which represents the main mechanism for the regulation of blood glucose homeostasis by the secretion of the hormone insulin. We show that the beta cells dynamics is not synchronized on the global scale of the whole islets. Instead, the cells form local clusters of synchronized activity which tend to get less segregated under higher stimulatory glucose concentrations. Furthermore, higher glucose concentrations also lead to the presence of broad scale small world connectivity patterns in the functional beta cell network. The main findings thereby shed light on the physiology and collective behavior of the islets of Langerhans and point out the possibilities of pathological changes associated with changes in the intercellular communication pathways.

The development of functional network organization in early childhood and early adolescence: A resting-state fNIRS study.

PubMed

Cai, Lin; Dong, Qi; Niu, Haijing

2018-04-01

Early childhood (7-8 years old) and early adolescence (11-12 years old) constitute two landmark developmental stages that comprise considerable changes in neural cognition. However, very limited information from functional neuroimaging studies exists on the functional topological configuration of the human brain during specific developmental periods. In the present study, we utilized continuous resting-state functional near-infrared spectroscopy (rs-fNIRS) imaging data to examine topological changes in network organization during development from early childhood and early adolescence to adulthood. Our results showed that the properties of small-worldness and modularity were not significantly different across development, demonstrating the developmental maturity of important functional brain organization in early childhood. Intriguingly, young children had a significantly lower global efficiency than early adolescents and adults, which revealed that the integration of the distributed networks strengthens across the developmental stages underlying cognitive development. Moreover, local efficiency of young children and adolescents was significantly lower than that of adults, while there was no difference between these two younger groups. This finding demonstrated that functional segregation remained relatively steady from early childhood to early adolescence, and the brain in these developmental periods possesses no optimal network configuration. Furthermore, we found heterogeneous developmental patterns in the regional nodal properties in various brain regions, such as linear increased nodal properties in the frontal cortex, indicating increasing cognitive capacity over development. Collectively, our results demonstrated that significant topological changes in functional network organization occurred during these two critical developmental stages, and provided a novel insight into elucidating subtle changes in brain functional networks across development. Copyright © 2018 The Authors. Published by Elsevier Ltd.. All rights reserved.

Topology-function conservation in protein-protein interaction networks.

PubMed

Davis, Darren; Yaveroğlu, Ömer Nebil; Malod-Dognin, Noël; Stojmirovic, Aleksandar; Pržulj, Nataša

2015-05-15

Proteins underlay the functioning of a cell and the wiring of proteins in protein-protein interaction network (PIN) relates to their biological functions. Proteins with similar wiring in the PIN (topology around them) have been shown to have similar functions. This property has been successfully exploited for predicting protein functions. Topological similarity is also used to guide network alignment algorithms that find similarly wired proteins between PINs of different species; these similarities are used to transfer annotation across PINs, e.g. from model organisms to human. To refine these functional predictions and annotation transfers, we need to gain insight into the variability of the topology-function relationships. For example, a function may be significantly associated with specific topologies, while another function may be weakly associated with several different topologies. Also, the topology-function relationships may differ between different species. To improve our understanding of topology-function relationships and of their conservation among species, we develop a statistical framework that is built upon canonical correlation analysis. Using the graphlet degrees to represent the wiring around proteins in PINs and gene ontology (GO) annotations to describe their functions, our framework: (i) characterizes statistically significant topology-function relationships in a given species, and (ii) uncovers the functions that have conserved topology in PINs of different species, which we term topologically orthologous functions. We apply our framework to PINs of yeast and human, identifying seven biological process and two cellular component GO terms to be topologically orthologous for the two organisms. © The Author 2015. Published by Oxford University Press.

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.

The topology of large Open Connectome networks for the human brain.

PubMed

Gastner, Michael T; Ódor, Géza

2016-06-07

The structural human connectome (i.e. the network of fiber connections in the brain) can be analyzed at ever finer spatial resolution thanks to advances in neuroimaging. Here we analyze several large data sets for the human brain network made available by the Open Connectome Project. We apply statistical model selection to characterize the degree distributions of graphs containing up to nodes and edges. A three-parameter generalized Weibull (also known as a stretched exponential) distribution is a good fit to most of the observed degree distributions. For almost all networks, simple power laws cannot fit the data, but in some cases there is statistical support for power laws with an exponential cutoff. We also calculate the topological (graph) dimension D and the small-world coefficient σ of these networks. While σ suggests a small-world topology, we found that D < 4 showing that long-distance connections provide only a small correction to the topology of the embedding three-dimensional space.

The topology of large Open Connectome networks for the human brain

NASA Astrophysics Data System (ADS)

Gastner, Michael T.; Ódor, Géza

2016-06-01

The structural human connectome (i.e. the network of fiber connections in the brain) can be analyzed at ever finer spatial resolution thanks to advances in neuroimaging. Here we analyze several large data sets for the human brain network made available by the Open Connectome Project. We apply statistical model selection to characterize the degree distributions of graphs containing up to nodes and edges. A three-parameter generalized Weibull (also known as a stretched exponential) distribution is a good fit to most of the observed degree distributions. For almost all networks, simple power laws cannot fit the data, but in some cases there is statistical support for power laws with an exponential cutoff. We also calculate the topological (graph) dimension D and the small-world coefficient σ of these networks. While σ suggests a small-world topology, we found that D < 4 showing that long-distance connections provide only a small correction to the topology of the embedding three-dimensional space.

The Social Network of Tracer Variations and O(100) Uncertain Photochemical Parameters in the Community Atmosphere Model

NASA Astrophysics Data System (ADS)

Lucas, D. D.; Labute, M.; Chowdhary, K.; Debusschere, B.; Cameron-Smith, P. J.

2014-12-01

Simulating the atmospheric cycles of ozone, methane, and other radiatively important trace gases in global climate models is computationally demanding and requires the use of 100's of photochemical parameters with uncertain values. Quantitative analysis of the effects of these uncertainties on tracer distributions, radiative forcing, and other model responses is hindered by the "curse of dimensionality." We describe efforts to overcome this curse using ensemble simulations and advanced statistical methods. Uncertainties from 95 photochemical parameters in the trop-MOZART scheme were sampled using a Monte Carlo method and propagated through 10,000 simulations of the single column version of the Community Atmosphere Model (CAM). The variance of the ensemble was represented as a network with nodes and edges, and the topology and connections in the network were analyzed using lasso regression, Bayesian compressive sensing, and centrality measures from the field of social network theory. Despite the limited sample size for this high dimensional problem, our methods determined the key sources of variation and co-variation in the ensemble and identified important clusters in the network topology. Our results can be used to better understand the flow of photochemical uncertainty in simulations using CAM and other climate models. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 and supported by the DOE Office of Science through the Scientific Discovery Through Advanced Computing (SciDAC).

Age-related changes in the topological organization of the white matter structural connectome across the human lifespan.

PubMed

Zhao, Tengda; Cao, Miao; Niu, Haijing; Zuo, Xi-Nian; Evans, Alan; He, Yong; Dong, Qi; Shu, Ni

2015-10-01

Lifespan is a dynamic process with remarkable changes in brain structure and function. Previous neuroimaging studies have indicated age-related microstructural changes in specific white matter tracts during development and aging. However, the age-related alterations in the topological architecture of the white matter structural connectome across the human lifespan remain largely unknown. Here, a cohort of 113 healthy individuals (ages 9-85) with both diffusion and structural MRI acquisitions were examined. For each participant, the high-resolution white matter structural networks were constructed by deterministic fiber tractography among 1024 parcellation units and were quantified with graph theoretical analyses. The global network properties, including network strength, cost, topological efficiency, and robustness, followed an inverted U-shaped trajectory with a peak age around the third decade. The brain areas with the most significantly nonlinear changes were located in the prefrontal and temporal cortices. Different brain regions exhibited heterogeneous trajectories: the posterior cingulate and lateral temporal cortices displayed prolonged maturation/degeneration compared with the prefrontal cortices. Rich-club organization was evident across the lifespan, whereas hub integration decreased linearly with age, especially accompanied by the loss of frontal hubs and their connections. Additionally, age-related changes in structural connections were predominantly located within and between the prefrontal and temporal modules. Finally, based on the graph metrics of structural connectome, accurate predictions of individual age were obtained (r = 0.77). Together, the data indicated a dynamic topological organization of the brain structural connectome across human lifespan, which may provide possible structural substrates underlying functional and cognitive changes with age. © 2015 Wiley Periodicals, Inc.

Topological Origin of the Network Dilation Anomaly in Ion-Exchanged Glasses

NASA Astrophysics Data System (ADS)

Wang, Mengyi; Smedskjaer, Morten M.; Mauro, John C.; Sant, Gaurav; Bauchy, Mathieu

2017-11-01

Ion exchange is commonly used to strengthen oxide glasses. However, the resulting stuffed glasses usually do not reach the molar volume of as-melted glasses of similar composition—a phenomenon known as the network dilation anomaly. This behavior seriously limits the potential for the chemical strengthening of glasses and its origin remains one of the mysteries of glass science. Here, based on molecular dynamics simulations of sodium silicate glasses coupled with topological constraint theory, we show that the topology of the atomic network controls the extent of ion-exchange-induced dilation. We demonstrate that isostatic glasses do not show any network dilation anomaly. This is found to arise from the combined absence of floppy modes of deformation and internal eigenstress in isostatic atomic networks.

Connected Dominating Set Based Topology Control in Wireless Sensor Networks

ERIC Educational Resources Information Center

He, Jing

2012-01-01

Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network.…

Network Design: Best Practices for Alberta School Jurisdictions.

ERIC Educational Resources Information Center

Schienbein, Ralph

This report examines subsections of the computer network topology that relate to end-to-end performance and capacity planning in schools. Active star topology, Category 5 wiring, Ethernet, and intelligent devices are assumed. The report describes a model that can be used to project WAN (wide area network) connection speeds based on user traffic,…

Chimera states: Effects of different coupling topologies

NASA Astrophysics Data System (ADS)

Bera, Bidesh K.; Majhi, Soumen; Ghosh, Dibakar; Perc, Matjaž

2017-04-01

Collective behavior among coupled dynamical units can emerge in various forms as a result of different coupling topologies as well as different types of coupling functions. Chimera states have recently received ample attention as a fascinating manifestation of collective behavior, in particular describing a symmetry breaking spatiotemporal pattern where synchronized and desynchronized states coexist in a network of coupled oscillators. In this perspective, we review the emergence of different chimera states, focusing on the effects of different coupling topologies that describe the interaction network connecting the oscillators. We cover chimera states that emerge in local, nonlocal and global coupling topologies, as well as in modular, temporal and multilayer networks. We also provide an outline of challenges and directions for future research.

On the Structure of Cortical Microcircuits Inferred from Small Sample Sizes.

PubMed

Vegué, Marina; Perin, Rodrigo; Roxin, Alex

2017-08-30

The structure in cortical microcircuits deviates from what would be expected in a purely random network, which has been seen as evidence of clustering. To address this issue, we sought to reproduce the nonrandom features of cortical circuits by considering several distinct classes of network topology, including clustered networks, networks with distance-dependent connectivity, and those with broad degree distributions. To our surprise, we found that all of these qualitatively distinct topologies could account equally well for all reported nonrandom features despite being easily distinguishable from one another at the network level. This apparent paradox was a consequence of estimating network properties given only small sample sizes. In other words, networks that differ markedly in their global structure can look quite similar locally. This makes inferring network structure from small sample sizes, a necessity given the technical difficulty inherent in simultaneous intracellular recordings, problematic. We found that a network statistic called the sample degree correlation (SDC) overcomes this difficulty. The SDC depends only on parameters that can be estimated reliably given small sample sizes and is an accurate fingerprint of every topological family. We applied the SDC criterion to data from rat visual and somatosensory cortex and discovered that the connectivity was not consistent with any of these main topological classes. However, we were able to fit the experimental data with a more general network class, of which all previous topologies were special cases. The resulting network topology could be interpreted as a combination of physical spatial dependence and nonspatial, hierarchical clustering. SIGNIFICANCE STATEMENT The connectivity of cortical microcircuits exhibits features that are inconsistent with a simple random network. Here, we show that several classes of network models can account for this nonrandom structure despite qualitative differences in their global properties. This apparent paradox is a consequence of the small numbers of simultaneously recorded neurons in experiment: when inferred via small sample sizes, many networks may be indistinguishable despite being globally distinct. We develop a connectivity measure that successfully classifies networks even when estimated locally with a few neurons at a time. We show that data from rat cortex is consistent with a network in which the likelihood of a connection between neurons depends on spatial distance and on nonspatial, asymmetric clustering. Copyright © 2017 the authors 0270-6474/17/378498-13$15.00/0.

A Dynamic Game on Network Topology for Counterinsurgency Applications

DTIC Science & Technology

2015-03-26

scenario. This study creates a dynamic game on network topology to provide insight into the effec- tiveness of offensive targeting strategies determined by...focused upon the diffusion of thoughts and innovations throughout complex social networks. Coleman et al. (1966) and Ryan & Gross (1950) investigated...free networks make them extremely resilient against errors but very vulnerable to attack. Most interest- ingly, a determined attacker can remove well

Gene regulatory and signaling networks exhibit distinct topological distributions of motifs

NASA Astrophysics Data System (ADS)

Ferreira, Gustavo Rodrigues; Nakaya, Helder Imoto; Costa, Luciano da Fontoura

2018-04-01

The biological processes of cellular decision making and differentiation involve a plethora of signaling pathways and gene regulatory circuits. These networks in turn exhibit a multitude of motifs playing crucial parts in regulating network activity. Here we compare the topological placement of motifs in gene regulatory and signaling networks and observe that it suggests different evolutionary strategies in motif distribution for distinct cellular subnetworks.

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Packet Traffic Dynamics Near Onset of Congestion in Data Communication Network Model

NASA Astrophysics Data System (ADS)

Lawniczak, A. T.; Tang, X.

2006-05-01

The dominant technology of data communication networks is the Packet Switching Network (PSN). It is a complex technology organized as various hierarchical layers according to the International Standard Organization (ISO) Open Systems Interconnect (OSI) Reference Model. The Network Layer of the ISO OSI Reference Model is responsible for delivering packets from their sources to their destinations and for dealing with congestion if it arises in a network. Thus, we focus on this layer and present an abstraction of the Network Layer of the ISO OSI Reference Model. Using this abstraction we investigate how onset of traffic congestion is affected for various routing algorithms by changes in network connection topology. We study how aggregate measures of network performance depend on network connection topology and routing. We explore packets traffic spatio-temporal dynamics near the phase transition point from free flow to congestion for various network connection topologies and routing algorithms. We consider static and adaptive routings. We present selected simulation results.

Topological determinants of self-sustained activity in a simple model of excitable dynamics on graphs

PubMed Central

Fretter, Christoph; Lesne, Annick; Hilgetag, Claus C.; Hütt, Marc-Thorsten

2017-01-01

Simple models of excitable dynamics on graphs are an efficient framework for studying the interplay between network topology and dynamics. This topic is of practical relevance to diverse fields, ranging from neuroscience to engineering. Here we analyze how a single excitation propagates through a random network as a function of the excitation threshold, that is, the relative amount of activity in the neighborhood required for the excitation of a node. We observe that two sharp transitions delineate a region of sustained activity. Using analytical considerations and numerical simulation, we show that these transitions originate from the presence of barriers to propagation and the excitation of topological cycles, respectively, and can be predicted from the network topology. Our findings are interpreted in the context of network reverberations and self-sustained activity in neural systems, which is a question of long-standing interest in computational neuroscience. PMID:28186182

Topological determinants of self-sustained activity in a simple model of excitable dynamics on graphs.

PubMed

Fretter, Christoph; Lesne, Annick; Hilgetag, Claus C; Hütt, Marc-Thorsten

2017-02-10

Simple models of excitable dynamics on graphs are an efficient framework for studying the interplay between network topology and dynamics. This topic is of practical relevance to diverse fields, ranging from neuroscience to engineering. Here we analyze how a single excitation propagates through a random network as a function of the excitation threshold, that is, the relative amount of activity in the neighborhood required for the excitation of a node. We observe that two sharp transitions delineate a region of sustained activity. Using analytical considerations and numerical simulation, we show that these transitions originate from the presence of barriers to propagation and the excitation of topological cycles, respectively, and can be predicted from the network topology. Our findings are interpreted in the context of network reverberations and self-sustained activity in neural systems, which is a question of long-standing interest in computational neuroscience.

Topological determinants of self-sustained activity in a simple model of excitable dynamics on graphs

NASA Astrophysics Data System (ADS)

Fretter, Christoph; Lesne, Annick; Hilgetag, Claus C.; Hütt, Marc-Thorsten

2017-02-01

Simple models of excitable dynamics on graphs are an efficient framework for studying the interplay between network topology and dynamics. This topic is of practical relevance to diverse fields, ranging from neuroscience to engineering. Here we analyze how a single excitation propagates through a random network as a function of the excitation threshold, that is, the relative amount of activity in the neighborhood required for the excitation of a node. We observe that two sharp transitions delineate a region of sustained activity. Using analytical considerations and numerical simulation, we show that these transitions originate from the presence of barriers to propagation and the excitation of topological cycles, respectively, and can be predicted from the network topology. Our findings are interpreted in the context of network reverberations and self-sustained activity in neural systems, which is a question of long-standing interest in computational neuroscience.

Practical synchronization on complex dynamical networks via optimal pinning control

NASA Astrophysics Data System (ADS)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Topological and kinetic determinants of the modal matrices of dynamic models of metabolism

PubMed Central

2017-01-01

Large-scale kinetic models of metabolism are becoming increasingly comprehensive and accurate. A key challenge is to understand the biochemical basis of the dynamic properties of these models. Linear analysis methods are well-established as useful tools for characterizing the dynamic response of metabolic networks. Central to linear analysis methods are two key matrices: the Jacobian matrix (J) and the modal matrix (M-1) arising from its eigendecomposition. The modal matrix M-1 contains dynamically independent motions of the kinetic model near a reference state, and it is sparse in practice for metabolic networks. However, connecting the structure of M-1 to the kinetic properties of the underlying reactions is non-trivial. In this study, we analyze the relationship between J, M-1, and the kinetic properties of the underlying network for kinetic models of metabolism. Specifically, we describe the origin of mode sparsity structure based on features of the network stoichiometric matrix S and the reaction kinetic gradient matrix G. First, we show that due to the scaling of kinetic parameters in real networks, diagonal dominance occurs in a substantial fraction of the rows of J, resulting in simple modal structures with clear biological interpretations. Then, we show that more complicated modes originate from topologically-connected reactions that have similar reaction elasticities in G. These elasticities represent dynamic equilibrium balances within reactions and are key determinants of modal structure. The work presented should prove useful towards obtaining an understanding of the dynamics of kinetic models of metabolism, which are rooted in the network structure and the kinetic properties of reactions. PMID:29267329

Retinal Connectomics: Towards Complete, Accurate Networks

PubMed Central

Marc, Robert E.; Jones, Bryan W.; Watt, Carl B.; Anderson, James R.; Sigulinsky, Crystal; Lauritzen, Scott

2013-01-01

Connectomics is a strategy for mapping complex neural networks based on high-speed automated electron optical imaging, computational assembly of neural data volumes, web-based navigational tools to explore 1012–1015 byte (terabyte to petabyte) image volumes, and annotation and markup tools to convert images into rich networks with cellular metadata. These collections of network data and associated metadata, analyzed using tools from graph theory and classification theory, can be merged with classical systems theory, giving a more completely parameterized view of how biologic information processing systems are implemented in retina and brain. Networks have two separable features: topology and connection attributes. The first findings from connectomics strongly validate the idea that the topologies complete retinal networks are far more complex than the simple schematics that emerged from classical anatomy. In particular, connectomics has permitted an aggressive refactoring of the retinal inner plexiform layer, demonstrating that network function cannot be simply inferred from stratification; exposing the complex geometric rules for inserting different cells into a shared network; revealing unexpected bidirectional signaling pathways between mammalian rod and cone systems; documenting selective feedforward systems, novel candidate signaling architectures, new coupling motifs, and the highly complex architecture of the mammalian AII amacrine cell. This is but the beginning, as the underlying principles of connectomics are readily transferrable to non-neural cell complexes and provide new contexts for assessing intercellular communication. PMID:24016532

Time-Frequency Cross Mutual Information Analysis of the Brain Functional Networks Underlying Multiclass Motor Imagery.

PubMed

Gong, Anmin; Liu, Jianping; Chen, Si; Fu, Yunfa

2018-01-01

To study the physiologic mechanism of the brain during different motor imagery (MI) tasks, the authors employed a method of brain-network modeling based on time-frequency cross mutual information obtained from 4-class (left hand, right hand, feet, and tongue) MI tasks recorded as brain-computer interface (BCI) electroencephalography data. The authors explored the brain network revealed by these MI tasks using statistical analysis and the analysis of topologic characteristics, and observed significant differences in the reaction level, reaction time, and activated target during 4-class MI tasks. There was a great difference in the reaction level between the execution and resting states during different tasks: the reaction level of the left-hand MI task was the greatest, followed by that of the right-hand, feet, and tongue MI tasks. The reaction time required to perform the tasks also differed: during the left-hand and right-hand MI tasks, the brain networks of subjects reacted promptly and strongly, but there was a delay during the feet and tongue MI task. Statistical analysis and the analysis of network topology revealed the target regions of the brain network during different MI processes. In conclusion, our findings suggest a new way to explain the neural mechanism behind MI.

Hopping Diffusion of Nanoparticles Subjected to Topological Constraints

NASA Astrophysics Data System (ADS)

Cai, Li-Heng; Panyukov, Sergey; Rubinstein, Michael

2013-03-01

We describe a novel hopping mechanism for diffusion of large non-sticky nanoparticles subjected to topological constraints in polymer solids (networks and gels) and entangled polymer liquids (melts and solutions). Probe particles with size larger than the mesh size of unentangled polymer networks (tube diameter of entangled polymer liquids) are trapped by the network (entanglement) cages at time scales longer than the relaxation time of the network (entanglement) strand. At long time scales, however, these particles can move further by hopping between neighboring confinement cages. This hopping is controlled by fluctuations of surrounding confinement cages, which could be large enough to allow particles to slip through. The terminal particle diffusion coefficient dominated by this hopping diffusion is appreciable for particles with size slightly larger than the network mesh size (tube diameter). Very large particles in polymer solids will be permanently trapped by local network cages, whereas they can still move in polymer liquids by waiting for entanglement cages to rearrange on the relaxation time scale of the liquids. We would like to acknowledge the financial support of NSF CHE-0911588, DMR-0907515, DMR-1121107, DMR-1122483, and CBET-0609087, NIH R01HL077546 and P50HL107168, and Cystic Fibrosis Foundation under grant RUBIN09XX0.

On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies

PubMed Central

Garcia-Sanchez, Antonio-Javier; Losilla, Fernando; Rodenas-Herraiz, David; Cruz-Martinez, Felipe; Garcia-Sanchez, Felipe

2016-01-01

Wireless Multimedia Sensor Networks (WMSNs) are a special type of Wireless Sensor Network (WSN) where large amounts of multimedia data are transmitted over networks composed of low power devices. Hierarchical routing protocols typically used in WSNs for multi-path communication tend to overload nodes located within radio communication range of the data collection unit or data sink. The battery life of these nodes is therefore reduced considerably, requiring frequent battery replacement work to extend the operational life of the WSN system. In a wireless sensor network with mesh topology, any node may act as a forwarder node, thereby enabling multiple routing paths toward any other node or collection unit. In addition, mesh topologies have proven advantages, such as data transmission reliability, network robustness against node failures, and potential reduction in energy consumption. This work studies the feasibility of implementing WMSNs in mesh topologies and their limitations by means of exhaustive computer simulation experiments. To this end, a module developed for the Synchronous Energy Saving (SES) mode of the IEEE 802.15.5 mesh standard has been integrated with multimedia tools to thoroughly test video sequences encoded using H.264 in mesh networks. PMID:27164106

On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies.

PubMed

Garcia-Sanchez, Antonio-Javier; Losilla, Fernando; Rodenas-Herraiz, David; Cruz-Martinez, Felipe; Garcia-Sanchez, Felipe

2016-05-05

Wireless Multimedia Sensor Networks (WMSNs) are a special type of Wireless Sensor Network (WSN) where large amounts of multimedia data are transmitted over networks composed of low power devices. Hierarchical routing protocols typically used in WSNs for multi-path communication tend to overload nodes located within radio communication range of the data collection unit or data sink. The battery life of these nodes is therefore reduced considerably, requiring frequent battery replacement work to extend the operational life of the WSN system. In a wireless sensor network with mesh topology, any node may act as a forwarder node, thereby enabling multiple routing paths toward any other node or collection unit. In addition, mesh topologies have proven advantages, such as data transmission reliability, network robustness against node failures, and potential reduction in energy consumption. This work studies the feasibility of implementing WMSNs in mesh topologies and their limitations by means of exhaustive computer simulation experiments. To this end, a module developed for the Synchronous Energy Saving (SES) mode of the IEEE 802.15.5 mesh standard has been integrated with multimedia tools to thoroughly test video sequences encoded using H.264 in mesh networks.

[Aberrant topological properties of whole-brain functional network in chronic right-sided sensorineural hearing loss: a resting-state functional MRI study].

PubMed

Zhang, Lingling; Liu, Bin; Xu, Yangwen; Yang, Ming; Feng, Yuan; Huang, Yaqing; Huan, Zhichun; Hou, Zhaorui

2015-02-03

To investigate the topological properties of the functional brain network in unilateral sensorineural hearing loss patients. In this study, we acquired resting-state BOLD- fMRI data from 19 right-sided SNHL patients and 31 healthy controls with normal hearing and constructed their whole brain functional networks. Two-sample two-tailed t-tests were performed to investigate group differences in topological parameters between the USNHL patients and the controls. Partial correlation analysis was conducted to determine the relationships between the network metrics and USNHL-related variables. Both USNHL patients and controls exhibited small-word architecture in their brain functional networks within the range 0. 1 - 0. 2 of sparsity. Compared to the controls, USNHL patients showed significant increase in characteristic path length and normalized characteristic path length, but significant decrease in global efficiency. Clustering coefficient, local efficiency and normalized clustering coefficient demonstrated no significant difference. Furthermore, USNHL patients exhibited no significant association between the altered network metrics and the duration of USNHL or the severity of hearing loss. Our results indicated the altered topological properties of whole brain functional networks in USNHL patients, which may help us to understand pathophysiologic mechanism of USNHL patients.

Simulation studies of a wide area health care network.

PubMed Central

McDaniel, J. G.

1994-01-01

There is an increasing number of efforts to install wide area health care networks. Some of these networks are being built to support several applications over a wide user base consisting primarily of medical practices, hospitals, pharmacies, medical laboratories, payors, and suppliers. Although on-line, multi-media telecommunication is desirable for some purposes such as cardiac monitoring, store-and-forward messaging is adequate for many common, high-volume applications. Laboratory test results and payment claims, for example, can be distributed using electronic messaging networks. Several network prototypes have been constructed to determine the technical problems and to assess the effectiveness of electronic messaging in wide area health care networks. Our project, Health Link, developed prototype software that was able to use the public switched telephone network to exchange messages automatically, reliably and securely. The network could be configured to accommodate the many different traffic patterns and cost constraints of its users. Discrete event simulations were performed on several network models. Canonical star and mesh networks, that were composed of nodes operating at steady state under equal loads, were modeled. Both topologies were found to support the throughput of a generic wide area health care network. The mean message delivery time of the mesh network was found to be less than that of the star network. Further simulations were conducted for a realistic large-scale health care network consisting of 1,553 doctors, 26 hospitals, four medical labs, one provincial lab and one insurer. Two network topologies were investigated: one using predominantly peer-to-peer communication, the other using client-server communication.(ABSTRACT TRUNCATED AT 250 WORDS) PMID:7949966

Reconfigureable network node

DOEpatents

Vanderveen, Keith B [Tracy, CA; Talbot, Edward B [Livermore, CA; Mayer, Laurence E [Davis, CA

2008-04-08

Nodes in a network having a plurality of nodes establish communication links with other nodes using available transmission media, as the ability to establish such links becomes available and desirable. The nodes predict when existing communications links will fail, become overloaded or otherwise degrade network effectiveness and act to establish substitute or additional links before the node's ability to communicate with the other nodes on the network is adversely affected. A node stores network topology information and programmed link establishment rules and criteria. The node evaluates characteristics that predict existing links with other nodes becoming unavailable or degraded. The node then determines whether it can form a communication link with a substitute node, in order to maintain connectivity with the network. When changing its communication links, a node broadcasts that information to the network. Other nodes update their stored topology information and consider the updated topology when establishing new communications links for themselves.

Inferring topological features of proteins from amino acid residue networks

NASA Astrophysics Data System (ADS)

Alves, Nelson Augusto; Martinez, Alexandre Souto

2007-02-01

Topological properties of native folds are obtained from statistical analysis of 160 low homology proteins covering the four structural classes. This is done analyzing one, two and three-vertex joint distribution of quantities related to the corresponding network of amino acid residues. Emphasis on the amino acid residue hydrophobicity leads to the definition of their center of mass as vertices in this contact network model with interactions represented by edges. The network analysis helps us to interpret experimental results such as hydrophobic scales and fraction of buried accessible surface area in terms of the network connectivity. Moreover, those networks show assortative mixing by degree. To explore the vertex-type dependent correlations, we build a network of hydrophobic and polar vertices. This procedure presents the wiring diagram of the topological structure of globular proteins leading to the following attachment probabilities between hydrophobic-hydrophobic 0.424(5), hydrophobic-polar 0.419(2) and polar-polar 0.157(3) residues.

Dynamical networks with topological self-organization

NASA Technical Reports Server (NTRS)

Zak, M.

2001-01-01

Coupled evolution of state and topology of dynamical networks is introduced. Due to the well organized tensor structure, the governing equations are presented in a canonical form, and required attractors as well as their basins can be easily implanted and controlled.

Deffuant model of opinion formation in one-dimensional multiplex networks

NASA Astrophysics Data System (ADS)

Shang, Yilun

2015-10-01

Complex systems in the real world often operate through multiple kinds of links connecting their constituents. In this paper we propose an opinion formation model under bounded confidence over multiplex networks, consisting of edges at different topological and temporal scales. We determine rigorously the critical confidence threshold by exploiting probability theory and network science when the nodes are arranged on the integers, {{Z}}, evolving in continuous time. It is found that the existence of ‘multiplexity’ impedes the convergence, and that working with the aggregated or summarized simplex network is inaccurate since it misses vital information. Analytical calculations are confirmed by extensive numerical simulations.

Advanced local area network concepts

NASA Technical Reports Server (NTRS)

Grant, Terry

1985-01-01

Development of a good model of the data traffic requirements for Local Area Networks (LANs) onboard the Space Station is the driving problem in this work. A parameterized workload model is under development. An analysis contract has been started specifically to capture the distributed processing requirements for the Space Station and then to develop a top level model to simulate how various processing scenarios can handle the workload and what data communication patterns result. A summary of the Local Area Network Extendsible Simulator 2 Requirements Specification and excerpts from a grant report on the topological design of fiber optic local area networks with application to Expressnet are given.

Characterization and control of small-world networks.

PubMed

Pandit, S A; Amritkar, R E

1999-08-01

Recently, Watts and Strogatz [Nature (London) 393, 440 (1998)] offered an interesting model of small-world networks. Here we concretize the concept of a "faraway" connection in a network by defining a far edge. Our definition is algorithmic and independent of any external parameters such as topology of the underlying space of the network. We show that it is possible to control the spread of an epidemic by using the knowledge of far edges. We also suggest a model for better product advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.

Characterization and control of small-world networks

NASA Astrophysics Data System (ADS)

Pandit, S. A.; Amritkar, R. E.

1999-08-01

Recently, Watts and Strogatz [Nature (London) 393, 440 (1998)] offered an interesting model of small-world networks. Here we concretize the concept of a ``faraway'' connection in a network by defining a far edge. Our definition is algorithmic and independent of any external parameters such as topology of the underlying space of the network. We show that it is possible to control the spread of an epidemic by using the knowledge of far edges. We also suggest a model for better product advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.

Design and implementation considerations of a MSAT packet data network

NASA Technical Reports Server (NTRS)

Karam, Fouad G.; Hearn, Terry; Rohr, Doug; Guibord, Arthur F.

1993-01-01

The Mobile Data System, which is intended to provide for packet switched data services is currently under development. The system is based on a star network topology consisting of a centralized Data Hub (DH) serving a large number of mobile terminals. Through the Data Hub, end-to-end connections can be established between terrestrial users on public or private data networks and mobile users. The MDS network will be capable of offering a variety of services some of which are based on the standard X.25 network interface protocol, and others optimized for short messages and broadcast messages. A description of these services and the trade-offs in the DH design are presented.

A Brief Historical Introduction to Euler's Formula for Polyhedra, Topology, Graph Theory and Networks

ERIC Educational Resources Information Center

Debnath, Lokenath

2010-01-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 Konigsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real…

Trapping in scale-free networks with hierarchical organization of modularity.

PubMed

Zhang, Zhongzhi; Lin, Yuan; Gao, Shuyang; Zhou, Shuigeng; Guan, Jihong; Li, Mo

2009-11-01

A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking place on such networks. In this paper, we investigate a simple stochastic process--trapping problem, a random walk with a perfect trap fixed at a given location, performed on a family of hierarchical networks that exhibit simultaneously striking scale-free and modular structure. We focus on a particular case with the immobile trap positioned at the hub node having the largest degree. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping problem, which is the mean of the node-to-trap first-passage time over the entire network. The exact expression for the MFPT is calculated through the recurrence relations derived from the special construction of the hierarchical networks. The obtained rigorous formula corroborated by extensive direct numerical calculations exhibits that the MFPT grows algebraically with the network order. Concretely, the MFPT increases as a power-law function of the number of nodes with the exponent much less than 1. We demonstrate that the hierarchical networks under consideration have more efficient structure for transport by diffusion in contrast with other analytically soluble media including some previously studied scale-free networks. We argue that the scale-free and modular topologies are responsible for the high efficiency of the trapping process on the hierarchical networks.

Effects of different correlation metrics and preprocessing factors on small-world brain functional networks: a resting-state functional MRI study.

PubMed

Liang, Xia; Wang, Jinhui; Yan, Chaogan; Shu, Ni; Xu, Ke; Gong, Gaolang; He, Yong

2012-01-01

Graph theoretical analysis of brain networks based on resting-state functional MRI (R-fMRI) has attracted a great deal of attention in recent years. These analyses often involve the selection of correlation metrics and specific preprocessing steps. However, the influence of these factors on the topological properties of functional brain networks has not been systematically examined. Here, we investigated the influences of correlation metric choice (Pearson's correlation versus partial correlation), global signal presence (regressed or not) and frequency band selection [slow-5 (0.01-0.027 Hz) versus slow-4 (0.027-0.073 Hz)] on the topological properties of both binary and weighted brain networks derived from them, and we employed test-retest (TRT) analyses for further guidance on how to choose the "best" network modeling strategy from the reliability perspective. Our results show significant differences in global network metrics associated with both correlation metrics and global signals. Analysis of nodal degree revealed differing hub distributions for brain networks derived from Pearson's correlation versus partial correlation. TRT analysis revealed that the reliability of both global and local topological properties are modulated by correlation metrics and the global signal, with the highest reliability observed for Pearson's-correlation-based brain networks without global signal removal (WOGR-PEAR). The nodal reliability exhibited a spatially heterogeneous distribution wherein regions in association and limbic/paralimbic cortices showed moderate TRT reliability in Pearson's-correlation-based brain networks. Moreover, we found that there were significant frequency-related differences in topological properties of WOGR-PEAR networks, and brain networks derived in the 0.027-0.073 Hz band exhibited greater reliability than those in the 0.01-0.027 Hz band. Taken together, our results provide direct evidence regarding the influences of correlation metrics and specific preprocessing choices on both the global and nodal topological properties of functional brain networks. This study also has important implications for how to choose reliable analytical schemes in brain network studies.

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

A study of the Immune Epitope Database for some fungi species using network topological indices.

PubMed

Vázquez-Prieto, Severo; Paniagua, Esperanza; Solana, Hugo; Ubeira, Florencio M; González-Díaz, Humberto

2017-08-01

In the last years, the encryption of system structure information with different network topological indices has been a very active field of research. In the present study, we assembled for the first time a complex network using data obtained from the Immune Epitope Database for fungi species, and we then considered the general topology, the node degree distribution, and the local structure of this network. We also calculated eight node centrality measures for the observed network and compared it with three theoretical models. In view of the results obtained, we may expect that the present approach can become a valuable tool to explore the complexity of this database, as well as for the storage, manipulation, comparison, and retrieval of information contained therein.

Coupling effect of nodes popularity and similarity on social network persistence

PubMed Central

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-01-01

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology. PMID:28220840

Coupling effect of nodes popularity and similarity on social network persistence

NASA Astrophysics Data System (ADS)

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-01

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

Coupling effect of nodes popularity and similarity on social network persistence.

PubMed

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-21

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes' popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

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.

Architecture of marine food webs: To be or not be a 'small-world'.

PubMed

Marina, Tomás Ignacio; Saravia, Leonardo A; Cordone, Georgina; Salinas, Vanesa; Doyle, Santiago R; Momo, Fernando R

2018-01-01

The search for general properties in network structure has been a central issue for food web studies in recent years. One such property is the small-world topology that combines a high clustering and a small distance between nodes of the network. This property may increase food web resilience but make them more sensitive to the extinction of connected species. Food web theory has been developed principally from freshwater and terrestrial ecosystems, largely omitting marine habitats. If theory needs to be modified to accommodate observations from marine ecosystems, based on major differences in several topological characteristics is still on debate. Here we investigated if the small-world topology is a common structural pattern in marine food webs. We developed a novel, simple and statistically rigorous method to examine the largest set of complex marine food webs to date. More than half of the analyzed marine networks exhibited a similar or lower characteristic path length than the random expectation, whereas 39% of the webs presented a significantly higher clustering than its random counterpart. Our method proved that 5 out of 28 networks fulfilled both features of the small-world topology: short path length and high clustering. This work represents the first rigorous analysis of the small-world topology and its associated features in high-quality marine networks. We conclude that such topology is a structural pattern that is not maximized in marine food webs; thus it is probably not an effective model to study robustness, stability and feasibility of marine ecosystems.

Modeling the propagation of mobile malware on complex networks

NASA Astrophysics Data System (ADS)

Liu, Wanping; Liu, Chao; Yang, Zheng; Liu, Xiaoyang; Zhang, Yihao; Wei, Zuxue

2016-08-01

In this paper, the spreading behavior of malware across mobile devices is addressed. By introducing complex networks to model mobile networks, which follows the power-law degree distribution, a novel epidemic model for mobile malware propagation is proposed. The spreading threshold that guarantees the dynamics of the model is calculated. Theoretically, the asymptotic stability of the malware-free equilibrium is confirmed when the threshold is below the unity, and the global stability is further proved under some sufficient conditions. The influences of different model parameters as well as the network topology on malware propagation are also analyzed. Our theoretical studies and numerical simulations show that networks with higher heterogeneity conduce to the diffusion of malware, and complex networks with lower power-law exponents benefit malware spreading.

Distributed Synchronization Control of Multiagent Systems With Unknown Nonlinearities.

PubMed

Su, Shize; Lin, Zongli; Garcia, Alfredo

2016-01-01

This paper revisits the distributed adaptive control problem for synchronization of multiagent systems where the dynamics of the agents are nonlinear, nonidentical, unknown, and subject to external disturbances. Two communication topologies, represented, respectively, by a fixed strongly-connected directed graph and by a switching connected undirected graph, are considered. Under both of these communication topologies, we use distributed neural networks to approximate the uncertain dynamics. Decentralized adaptive control protocols are then constructed to solve the cooperative tracker problem, the problem of synchronization of all follower agents to a leader agent. In particular, we show that, under the proposed decentralized control protocols, the synchronization errors are ultimately bounded, and their ultimate bounds can be reduced arbitrarily by choosing the control parameter appropriately. Simulation study verifies the effectiveness of our proposed protocols.

Singular Stokes-polarimetry as new technique for metrology and inspection of polarized speckle fields

NASA Astrophysics Data System (ADS)

Soskin, Marat S.; Denisenko, Vladimir G.; Egorov, Roman I.

2004-08-01

Polarimetry is effective technique for polarized light fields characterization. It was shown recently that most full "finger-print" of light fields with arbitrary complexity is network of polarization singularities: C points with circular polarization and L lines with variable azimuth. The new singular Stokes-polarimetry was elaborated for such measurements. It allows define azimuth, eccentricity and handedness of elliptical vibrations in each pixel of receiving CCD camera in the range of mega-pixels. It is based on precise measurement of full set of Stokes parameters by the help of high quality analyzers and quarter-wave plates with λ/500 preciseness and 4" adjustment. The matrices of obtained data are processed in PC by special programs to find positions of polarization singularities and other needed topological features. The developed SSP technique was proved successfully by measurements of topology of polarized speckle-fields produced by multimode "photonic-crystal" fibers, double side rubbed polymer films, biomedical samples. Each singularity is localized with preciseness up to +/- 1 pixel in comparison with 500 pixels dimensions of typical speckle. It was confirmed that network of topological features appeared in polarized light field after its interaction with specimen under inspection is exact individual "passport" for its characterization. Therefore, SSP can be used for smart materials characterization. The presented data show that SSP technique is promising for local analysis of properties and defects of thin films, liquid crystal cells, optical elements, biological samples, etc. It is able discover heterogeneities and defects, which define essentially merits of specimens under inspection and can"t be checked by usual polarimetry methods. The detected extra high sensitivity of polarization singularities position and network to any changes of samples position and deformation opens quite new possibilities for sensing of deformations and displacement of checked elements in the sub-micron range.

Drawing Inspiration from Human Brain Networks: Construction of Interconnected Virtual Networks

PubMed Central

Kominami, Daichi; Leibnitz, Kenji; Murata, Masayuki

2018-01-01

Virtualization of wireless sensor networks (WSN) is widely considered as a foundational block of edge/fog computing, which is a key technology that can help realize next-generation Internet of things (IoT) networks. In such scenarios, multiple IoT devices and service modules will be virtually deployed and interconnected over the Internet. Moreover, application services are expected to be more sophisticated and complex, thereby increasing the number of modifications required for the construction of network topologies. Therefore, it is imperative to establish a method for constructing a virtualized WSN (VWSN) topology that achieves low latency on information transmission and high resilience against network failures, while keeping the topological construction cost low. In this study, we draw inspiration from inter-modular connectivity in human brain networks, which achieves high performance when dealing with large-scale networks composed of a large number of modules (i.e., regions) and nodes (i.e., neurons). We propose a method for assigning inter-modular links based on a connectivity model observed in the cerebral cortex of the brain, known as the exponential distance rule (EDR) model. We then choose endpoint nodes of these links by controlling inter-modular assortativity, which characterizes the topological connectivity of brain networks. We test our proposed methods using simulation experiments. The results show that the proposed method based on the EDR model can construct a VWSN topology with an optimal combination of communication efficiency, robustness, and construction cost. Regarding the selection of endpoint nodes for the inter-modular links, the results also show that high assortativity enhances the robustness and communication efficiency because of the existence of inter-modular links of two high-degree nodes. PMID:29642483

Drawing Inspiration from Human Brain Networks: Construction of Interconnected Virtual Networks.

PubMed

Murakami, Masaya; Kominami, Daichi; Leibnitz, Kenji; Murata, Masayuki

2018-04-08

Virtualization of wireless sensor networks (WSN) is widely considered as a foundational block of edge/fog computing, which is a key technology that can help realize next-generation Internet of things (IoT) networks. In such scenarios, multiple IoT devices and service modules will be virtually deployed and interconnected over the Internet. Moreover, application services are expected to be more sophisticated and complex, thereby increasing the number of modifications required for the construction of network topologies. Therefore, it is imperative to establish a method for constructing a virtualized WSN (VWSN) topology that achieves low latency on information transmission and high resilience against network failures, while keeping the topological construction cost low. In this study, we draw inspiration from inter-modular connectivity in human brain networks, which achieves high performance when dealing with large-scale networks composed of a large number of modules (i.e., regions) and nodes (i.e., neurons). We propose a method for assigning inter-modular links based on a connectivity model observed in the cerebral cortex of the brain, known as the exponential distance rule (EDR) model. We then choose endpoint nodes of these links by controlling inter-modular assortativity, which characterizes the topological connectivity of brain networks. We test our proposed methods using simulation experiments. The results show that the proposed method based on the EDR model can construct a VWSN topology with an optimal combination of communication efficiency, robustness, and construction cost. Regarding the selection of endpoint nodes for the inter-modular links, the results also show that high assortativity enhances the robustness and communication efficiency because of the existence of inter-modular links of two high-degree nodes.

Synaptic Impairment and Robustness of Excitatory Neuronal Networks with Different Topologies

PubMed Central

Mirzakhalili, Ehsan; Gourgou, Eleni; Booth, Victoria; Epureanu, Bogdan

2017-01-01

Synaptic deficiencies are a known hallmark of neurodegenerative diseases, but the diagnosis of impaired synapses on the cellular level is not an easy task. Nonetheless, changes in the system-level dynamics of neuronal networks with damaged synapses can be detected using techniques that do not require high spatial resolution. This paper investigates how the structure/topology of neuronal networks influences their dynamics when they suffer from synaptic loss. We study different neuronal network structures/topologies by specifying their degree distributions. The modes of the degree distribution can be used to construct networks that consist of rich clubs and resemble small world networks, as well. We define two dynamical metrics to compare the activity of networks with different structures: persistent activity (namely, the self-sustained activity of the network upon removal of the initial stimulus) and quality of activity (namely, percentage of neurons that participate in the persistent activity of the network). Our results show that synaptic loss affects the persistent activity of networks with bimodal degree distributions less than it affects random networks. The robustness of neuronal networks enhances when the distance between the modes of the degree distribution increases, suggesting that the rich clubs of networks with distinct modes keep the whole network active. In addition, a tradeoff is observed between the quality of activity and the persistent activity. For a range of distributions, both of these dynamical metrics are considerably high for networks with bimodal degree distribution compared to random networks. We also propose three different scenarios of synaptic impairment, which may correspond to different pathological or biological conditions. Regardless of the network structure/topology, results demonstrate that synaptic loss has more severe effects on the activity of the network when impairments are correlated with the activity of the neurons. PMID:28659765

Effects of topology on network evolution

NASA Astrophysics Data System (ADS)

Oikonomou, Panos; Cluzel, Philippe

2006-08-01

The ubiquity of scale-free topology in nature raises the question of whether this particular network design confers an evolutionary advantage. A series of studies has identified key principles controlling the growth and the dynamics of scale-free networks. Here, we use neuron-based networks of boolean components as a framework for modelling a large class of dynamical behaviours in both natural and artificial systems. Applying a training algorithm, we characterize how networks with distinct topologies evolve towards a pre-established target function through a process of random mutations and selection. We find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. Whereas homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously. Remarkably, this latter property is robust to variations of the degree exponent. In contrast, homogeneous random networks require a specific tuning of their connectivity to optimize their ability to evolve. These results highlight an organizing principle that governs the evolution of complex networks and that can improve the design of engineered systems.

Topological dynamics of vortex-line networks in hexagonal manganites

NASA Astrophysics Data System (ADS)

Xue, Fei; Wang, Nan; Wang, Xueyun; Ji, Yanzhou; Cheong, Sang-Wook; Chen, Long-Qing

2018-01-01

The two-dimensional X Y model is the first well-studied system with topological point defects. On the other hand, although topological line defects are common in three-dimensional systems, the evolution mechanism of line defects is not fully understood. The six domains in hexagonal manganites converge to vortex lines in three dimensions. Using phase-field simulations, we predicted that during the domain coarsening process, the vortex-line network undergoes three types of basic topological changes, i.e., vortex-line loop shrinking, coalescence, and splitting. It is shown that the vortex-antivortex annihilation controls the scaling dynamics.

Scale-free networks of the earth’s surface

NASA Astrophysics Data System (ADS)

Liu, Gang; He, Jing; Luo, Kaitian; Gao, Peichao; Ma, Lei

2016-06-01

Studying the structure of real complex systems is of paramount importance in science and engineering. Despite our understanding of lots of real systems, we hardly cognize our unique living environment — the earth. The structural complexity of the earth’s surface is, however, still unknown in detail. Here, we define the modeling of graph topology for the earth’s surface, using the satellite images of the earth’s surface under different spatial resolutions derived from Google Earth. We find that the graph topologies of the earth’s surface are scale-free networks regardless of the spatial resolutions. For different spatial resolutions, the exponents of power-law distributions and the modularity are both quite different; however, the average clustering coefficient is approximately equal to a constant. We explore the morphology study of the earth’s surface, which enables a comprehensive understanding of the morphological feature of the earth’s surface.

On building a memory evolutive system for application to learning and cognition modeling.

PubMed

de Lima do Rego Monteiro, Julio; Kogler, Joao Eduardo; Ribeiro, Joao Henrique Ranhel; Netto, Marcio Lobo

2010-01-01

We address here aspects of the implementation of a memory evolutive system (MES), based on the model proposed by A. Ehresmann and J. Vanbremeersch (2007), by means of a simulated network of spiking neurons with time dependent plasticity. We point out the advantages and challenges of applying category theory for the representation of cognition, by using the MES architecture. Then we discuss the issues concerning the minimum requirements that an artificial neural network (ANN) should fulfill in order that it would be capable of expressing the categories and mappings between them, underlying the MES. We conclude that a pulsed ANN based on Izhikevich's formal neuron with STDP (spike time-dependent plasticity) has sufficient dynamical properties to achieve these requirements, provided it can cope with the topological requirements. Finally, we present some perspectives of future research concerning the proposed ANN topology.

Big words, halved brains and small worlds: complex brain networks of figurative language comprehension.

PubMed

Arzouan, Yossi; Solomon, Sorin; Faust, Miriam; Goldstein, Abraham

2011-04-27

Language comprehension is a complex task that involves a wide network of brain regions. We used topological measures to qualify and quantify the functional connectivity of the networks used under various comprehension conditions. To that aim we developed a technique to represent functional networks based on EEG recordings, taking advantage of their excellent time resolution in order to capture the fast processes that occur during language comprehension. Networks were created by searching for a specific causal relation between areas, the negative feedback loop, which is ubiquitous in many systems. This method is a simple way to construct directed graphs using event-related activity, which can then be analyzed topologically. Brain activity was recorded while subjects read expressions of various types and indicated whether they found them meaningful. Slightly different functional networks were obtained for event-related activity evoked by each expression type. The differences reflect the special contribution of specific regions in each condition and the balance of hemispheric activity involved in comprehending different types of expressions and are consistent with the literature in the field. Our results indicate that representing event-related brain activity as a network using a simple temporal relation, such as the negative feedback loop, to indicate directional connectivity is a viable option for investigation which also derives new information about aspects not reflected in the classical methods for investigating brain activity.

The influence of passenger flow on the topology characteristics of urban rail transit networks

NASA Astrophysics Data System (ADS)

Hu, Yingyue; Chen, Feng; Chen, Peiwen; Tan, Yurong

2017-05-01

Current researches on the network characteristics of metro networks are generally carried out on topology networks without passenger flows running on it, thus more complex features of the networks with ridership loaded on it cannot be captured. In this study, we incorporated the load of metro networks, passenger volume, into the exploration of network features. Thus, the network can be examined in the context of operation, which is the ultimate purpose of the existence of a metro network. To this end, section load was selected as an edge weight to demonstrate the influence of ridership on the network, and a weighted calculation method for complex network indicators and robustness were proposed to capture the unique behaviors of a metro network with passengers flowing in it. The proposed method was applied on Beijing Subway. Firstly, the passenger volume in terms of daily origin and destination matrix was extracted from exhausted transit smart card data. Using the established approach and the matrix as weighting, common indicators of complex network including clustering coefficient, betweenness and degree were calculated, and network robustness were evaluated under potential attacks. The results were further compared to that of unweighted networks, and it suggests indicators of the network with consideration of passenger volumes differ from that without ridership to some extent, and networks tend to be more vulnerable than that without load on it. The significance sequence for the stations can be changed. By introducing passenger flow weighting, actual operation status of the network can be reflected more accurately. It is beneficial to determine the crucial stations and make precautionary measures for the entire network’s operation security.

The Reorganization of Human Brain Networks Modulated by Driving Mental Fatigue.

PubMed

Chunlin Zhao; Min Zhao; Yong Yang; Junfeng Gao; Nini Rao; Pan Lin

2017-05-01

The organization of the brain functional network is associated with mental fatigue, but little is known about the brain network topology that is modulated by the mental fatigue. In this study, we used the graph theory approach to investigate reconfiguration changes in functional networks of different electroen-cephalography (EEG) bands from 16 subjects performing a simulated driving task. Behavior and brain functional networks were compared between the normal and driving mental fatigue states. The scores of subjective self-reports indicated that 90 min of simulated driving-induced mental fatigue. We observed that coherence was significantly increased in the frontal, central, and temporal brain regions. Furthermore, in the brain network topology metric, significant increases were observed in the clustering coefficient (Cp) for beta, alpha, and delta bands and the character path length (Lp) for all EEG bands. The normalized measures γ showed significant increases in beta, alpha, and delta bands, and λ showed similar patterns in beta and theta bands. These results indicate that functional network topology can shift the network topology structure toward a more economic but less efficient configuration, which suggests low wiring costs in functional networks and disruption of the effective interactions between and across cortical regions during mental fatigue states. Graph theory analysis might be a useful tool for further understanding the neural mechanisms of driving mental fatigue.

Association between resting-state brain network topological organization and creative ability: Evidence from a multiple linear regression model.

PubMed

Jiao, Bingqing; Zhang, Delong; Liang, Aiying; Liang, Bishan; Wang, Zengjian; Li, Junchao; Cai, Yuxuan; Gao, Mengxia; Gao, Zhenni; Chang, Song; Huang, Ruiwang; Liu, Ming

2017-10-01

Previous studies have indicated a tight linkage between resting-state functional connectivity of the human brain and creative ability. This study aimed to further investigate the association between the topological organization of resting-state brain networks and creativity. Therefore, we acquired resting-state fMRI data from 22 high-creativity participants and 22 low-creativity participants (as determined by their Torrance Tests of Creative Thinking scores). We then constructed functional brain networks for each participant and assessed group differences in network topological properties before exploring the relationships between respective network topological properties and creative ability. We identified an optimized organization of intrinsic brain networks in both groups. However, compared with low-creativity participants, high-creativity participants exhibited increased global efficiency and substantially decreased path length, suggesting increased efficiency of information transmission across brain networks in creative individuals. Using a multiple linear regression model, we further demonstrated that regional functional integration properties (i.e., the betweenness centrality and global efficiency) of brain networks, particularly the default mode network (DMN) and sensorimotor network (SMN), significantly predicted the individual differences in creative ability. Furthermore, the associations between network regional properties and creative performance were creativity-level dependent, where the difference in the resource control component may be important in explaining individual difference in creative performance. These findings provide novel insights into the neural substrate of creativity and may facilitate objective identification of creative ability. Copyright © 2017 Elsevier B.V. All rights reserved.

Controllability and observability analysis for vertex domination centrality in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu

2014-06-01

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks.

Controllability and observability analysis for vertex domination centrality in directed networks

PubMed Central

Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu

2014-01-01

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks. PMID:24954137

Deciphering microbial interactions and detecting keystone species with co-occurrence networks

PubMed Central

Berry, David; Widder, Stefanie

2014-01-01

Co-occurrence networks produced from microbial survey sequencing data are frequently used to identify interactions between community members. While this approach has potential to reveal ecological processes, it has been insufficiently validated due to the technical limitations inherent in studying complex microbial ecosystems. Here, we simulate multi-species microbial communities with known interaction patterns using generalized Lotka-Volterra dynamics. We then construct co-occurrence networks and evaluate how well networks reveal the underlying interactions and how experimental and ecological parameters can affect network inference and interpretation. We find that co-occurrence networks can recapitulate interaction networks under certain conditions, but that they lose interpretability when the effects of habitat filtering become significant. We demonstrate that networks suffer from local hot spots of spurious correlation in the neighborhood of hub species that engage in many interactions. We also identify topological features associated with keystone species in co-occurrence networks. This study provides a substantiated framework to guide environmental microbiologists in the construction and interpretation of co-occurrence networks from microbial survey datasets. PMID:24904535

State criminal justice telecommunications (STACOM). Volume 1: Executive summary

NASA Technical Reports Server (NTRS)

Fielding, J. E.; Frewing, H. K.; Lee, J. J.; Leflang, W. G.; Reilly, N. B.

1977-01-01

Techniques for identifying user requirements and network designs for criminal justice networks on a state wide basis are discussed. Topics covered include: methods for determining data required; data collection and survey; data organization procedures, and methods for forecasting network traffic volumes. Developed network design techniques center around a computerized topology program which enables the user to generate least cost network topologies that satisfy network traffic requirements, response time requirements and other specified functional requirements. The developed techniques were applied in Texas and Ohio, and results of these studies are presented.

Go Ahead of Malware’s Infections and Controls: Towards New Techniques for Proactive Cyber Defense

DTIC Science & Technology

2016-12-08

in SDN (such as topology poisoning attacks and data-to-control plan saturation attacks) and developed new defense for SDN (such as TopoGuard and... Poisoning Network Visibility in Software-Defined Networks: New Attacks and Countermeasures As part of our research on discovering new vulnerabilities...future network- ing paradigm. We demonstrate that this new attacks can effectively poison the network topology information, then further successfully

Topology Optimization for Energy Management in Underwater Sensor Networks

DTIC Science & Technology

2015-02-01

1 To appear in International Journal of Control as a regular paper Topology Optimization for Energy Management in Underwater Sensor Networks ⋆ Devesh...K. Jha1 Thomas A. Wettergren2 Asok Ray1 Kushal Mukherjee3 Keywords: Underwater Sensor Network , Energy Management, Pareto Optimization, Adaptation...Optimization for Energy Management in Underwater Sensor Networks 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d

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.

Network neighborhood analysis with the multi-node topological overlap measure.

PubMed

Li, Ai; Horvath, Steve

2007-01-15

The goal of neighborhood analysis is to find a set of genes (the neighborhood) that is similar to an initial 'seed' set of genes. Neighborhood analysis methods for network data are important in systems biology. If individual network connections are susceptible to noise, it can be advantageous to define neighborhoods on the basis of a robust interconnectedness measure, e.g. the topological overlap measure. Since the use of multiple nodes in the seed set may lead to more informative neighborhoods, it can be advantageous to define multi-node similarity measures. The pairwise topological overlap measure is generalized to multiple network nodes and subsequently used in a recursive neighborhood construction method. A local permutation scheme is used to determine the neighborhood size. Using four network applications and a simulated example, we provide empirical evidence that the resulting neighborhoods are biologically meaningful, e.g. we use neighborhood analysis to identify brain cancer related genes. An executable Windows program and tutorial for multi-node topological overlap measure (MTOM) based analysis can be downloaded from the webpage (http://www.genetics.ucla.edu/labs/horvath/MTOM/).

Learning and innovative elements of strategy adoption rules expand cooperative network topologies.

PubMed

Wang, Shijun; Szalay, Máté S; Zhang, Changshui; Csermely, Peter

2008-04-09

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoner's Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.

Network topology: patterns and mechanisms in plant-herbivore and host-parasitoid food webs.

PubMed

Cagnolo, Luciano; Salvo, Adriana; Valladares, Graciela

2011-03-01

1. Biological communities are organized in complex interaction networks such as food webs, which topology appears to be non-random. Gradients, compartments, nested subsets and even combinations of these structures have been shown in bipartite networks. However, in most studies only one pattern is tested against randomness and mechanistic hypotheses are generally lacking. 2. Here we examined the topology of regional, coexisting plant-herbivore and host-parasitoid food webs to discriminate between the mentioned network patterns. We also evaluated the role of species body size, local abundance, regional frequency and phylogeny as determinants of network topology. 3. We found both food webs to be compartmented, with interaction range boundaries imposed by host phylogeny. Species degree within compartments was mostly related to their regional frequency and local abundance. Only one compartment showed an internal nested structure in the distribution of interactions between species, but species position within this compartment was unrelated to species size or abundance. 4. These results suggest that compartmentalization may be more common than previously considered, and that network structure is a result of multiple, hierarchical, non-exclusive processes. © 2010 The Authors. Journal compilation © 2010 British Ecological Society.

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

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.

Age-related differences in the topological efficiency of the brain structural connectome in amnestic mild cognitive impairment.

PubMed

Zhao, Tengda; Sheng, Can; Bi, Qiuhui; Niu, Weili; Shu, Ni; Han, Ying

2017-11-01

Amnestic mild cognitive impairment (aMCI) is accompanied by the accelerated cognitive decline and rapid brain degeneration with aging. However, the age-related alterations of the topological organization of the brain connectome in aMCI patients remained largely unknown. In this study, we constructed the brain structural connectome in 51 aMCI patients and 51 healthy controls by diffusion magnetic resonance imaging and deterministic tractography. The different age-related alteration patterns of the global and regional network metrics between aMCI patients and healthy controls were assessed by a linear regression model. Compared with healthy controls, significantly decreased global and local network efficiency in aMCI patients were found. When correlating network efficiency with age, we observed a significant decline in network efficiency with aging in the aMCI patients, while not in the healthy controls. The age-related decreases of nodal efficiency in aMCI patients were mainly distributed in the key regions of the default-mode network, such as precuneus, anterior cingulate gyrus, and parahippocampal gyrus. In addition, age-related decreases in the connection strength of the edges between peripheral nodes were observed in aMCI patients. Moreover, the decreased regional efficiency of the parahippocampal gyrus was correlated with impaired memory performances in patients. The present study suggests an age-related disruption of the topological organization of the brain structural connectome in aMCI patients, which may provide evidence for different neural mechanisms underlying aging in aMCI and may serve as a potential imaging marker for the early diagnosis of Alzheimer's disease. Copyright © 2017 Elsevier Inc. All rights reserved.

Towards the prediction of essential genes by integration of network topology, cellular localization and biological process information

PubMed Central

2009-01-01

Background The identification of essential genes is important for the understanding of the minimal requirements for cellular life and for practical purposes, such as drug design. However, the experimental techniques for essential genes discovery are labor-intensive and time-consuming. Considering these experimental constraints, a computational approach capable of accurately predicting essential genes would be of great value. We therefore present here a machine learning-based computational approach relying on network topological features, cellular localization and biological process information for prediction of essential genes. Results We constructed a decision tree-based meta-classifier and trained it on datasets with individual and grouped attributes-network topological features, cellular compartments and biological processes-to generate various predictors of essential genes. We showed that the predictors with better performances are those generated by datasets with integrated attributes. Using the predictor with all attributes, i.e., network topological features, cellular compartments and biological processes, we obtained the best predictor of essential genes that was then used to classify yeast genes with unknown essentiality status. Finally, we generated decision trees by training the J48 algorithm on datasets with all network topological features, cellular localization and biological process information to discover cellular rules for essentiality. We found that the number of protein physical interactions, the nuclear localization of proteins and the number of regulating transcription factors are the most important factors determining gene essentiality. Conclusion We were able to demonstrate that network topological features, cellular localization and biological process information are reliable predictors of essential genes. Moreover, by constructing decision trees based on these data, we could discover cellular rules governing essentiality. PMID:19758426

Personalized anticancer therapy selection using molecular landscape topology and thermodynamics.

PubMed

Rietman, Edward A; Scott, Jacob G; Tuszynski, Jack A; Klement, Giannoula Lakka

2017-03-21

Personalized anticancer therapy requires continuous consolidation of emerging bioinformatics data into meaningful and accurate information streams. The use of novel mathematical and physical approaches, namely topology and thermodynamics can enable merging differing data types for improved accuracy in selecting therapeutic targets. We describe a method that uses chemical thermodynamics and two topology measures to link RNA-seq data from individual patients with academically curated protein-protein interaction networks to select clinically relevant targets for treatment of low-grade glioma (LGG). We show that while these three histologically distinct tumor types (astrocytoma, oligoastrocytoma, and oligodendroglioma) may share potential therapeutic targets, the majority of patients would benefit from more individualized therapies. The method involves computing Gibbs free energy of the protein-protein interaction network and applying a topological filtration on the energy landscape to produce a subnetwork known as persistent homology. We then determine the most likely best target for therapeutic intervention using a topological measure of the network known as Betti number. We describe the algorithm and discuss its application to several patients.

Local communities obstruct global consensus: Naming game on multi-local-world networks

NASA Astrophysics Data System (ADS)

Lou, Yang; Chen, Guanrong; Fan, Zhengping; Xiang, Luna

2018-02-01

Community structure is essential for social communications, where individuals belonging to the same community are much more actively interacting and communicating with each other than those in different communities within the human society. Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can generally reach global consensus asymptotically through iterative pair-wise conversations. The underlying network indicates the relationships among the individuals. In this paper, three typical topologies, namely random-graph, small-world and scale-free networks, are employed, which are embedded with the multi-local-world community structure, to study the naming game. Simulations show that (1) the convergence process to global consensus is getting slower as the community structure becomes more prominent, and eventually might fail; (2) if the inter-community connections are sufficiently dense, neither the number nor the size of the communities affects the convergence process; and (3) for different topologies with the same (or similar) average node-degree, local clustering of individuals obstruct or prohibit global consensus to take place. The results reveal the role of local communities in a global naming game in social network studies.

Lattice topology dictates photon statistics.

PubMed

Kondakci, H Esat; Abouraddy, Ayman F; Saleh, Bahaa E A

2017-08-21

Propagation of coherent light through a disordered network is accompanied by randomization and possible conversion into thermal light. Here, we show that network topology plays a decisive role in determining the statistics of the emerging field if the underlying lattice is endowed with chiral symmetry. In such lattices, eigenmode pairs come in skew-symmetric pairs with oppositely signed eigenvalues. By examining one-dimensional arrays of randomly coupled waveguides arranged on linear and ring topologies, we are led to a remarkable prediction: the field circularity and the photon statistics in ring lattices are dictated by its parity while the same quantities are insensitive to the parity of a linear lattice. For a ring lattice, adding or subtracting a single lattice site can switch the photon statistics from super-thermal to sub-thermal, or vice versa. This behavior is understood by examining the real and imaginary fields on a lattice exhibiting chiral symmetry, which form two strands that interleave along the lattice sites. These strands can be fully braided around an even-sited ring lattice thereby producing super-thermal photon statistics, while an odd-sited lattice is incommensurate with such an arrangement and the statistics become sub-thermal.

Distributed reconfigurable control strategies for switching topology networked multi-agent systems.

PubMed

Gallehdari, Z; Meskin, N; Khorasani, K

2017-11-01

In this paper, distributed control reconfiguration strategies for directed switching topology networked multi-agent systems are developed and investigated. The proposed control strategies are invoked when the agents are subject to actuator faults and while the available fault detection and isolation (FDI) modules provide inaccurate and unreliable information on the estimation of faults severities. Our proposed strategies will ensure that the agents reach a consensus while an upper bound on the team performance index is ensured and satisfied. Three types of actuator faults are considered, namely: the loss of effectiveness fault, the outage fault, and the stuck fault. By utilizing quadratic and convex hull (composite) Lyapunov functions, two cooperative and distributed recovery strategies are designed and provided to select the gains of the proposed control laws such that the team objectives are guaranteed. Our proposed reconfigurable control laws are applied to a team of autonomous underwater vehicles (AUVs) under directed switching topologies and subject to simultaneous actuator faults. Simulation results demonstrate the effectiveness of our proposed distributed reconfiguration control laws in compensating for the effects of sudden actuator faults and subject to fault diagnosis module uncertainties and unreliabilities. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

From Sensor Networks to Internet of Things. Bluetooth Low Energy, a Standard for This Evolution

PubMed Central

Hortelano, Diego; Olivares, Teresa; Ruiz, M. Carmen; Garrido-Hidalgo, Celia; López, Vicente

2017-01-01

Current sensor networks need to be improved and updated to satisfy new essential requirements of the Internet of Things, where cutting-edge applications will appear. These requirements are: total coverage, zero fails (high performance), scalability and sustainability (hardware and software). We are going to evaluate Bluetooth Low Energy as wireless transmission technology and as the ideal candidate for these improvements, due to its low power consumption, its low cost radio chips and its ability to communicate with users directly, using their smartphones or smartbands. However, this technology is relatively recent, and standard network topologies are not able to fulfil its new requirements. To address these shortcomings, the implementation of other more flexible topologies (as the mesh topology) will be very interesting. After studying it in depth, we have identified certain weaknesses, for example, specific devices are needed to provide network scalability, and the need to choose between high performance or sustainability. In this paper, after presenting the studies carried out on these new technologies, we propose a new packet format and a new BLE mesh topology, with two different configurations: Individual Mesh and Collaborative Mesh. Our results show how this topology improves the scalability, sustainability, coverage and performance. PMID:28216560

From Sensor Networks to Internet of Things. Bluetooth Low Energy, a Standard for This Evolution.

PubMed

Hortelano, Diego; Olivares, Teresa; Ruiz, M Carmen; Garrido-Hidalgo, Celia; López, Vicente

2017-02-14

Current sensor networks need to be improved and updated to satisfy new essential requirements of the Internet of Things, where cutting-edge applications will appear. These requirements are: total coverage, zero fails (high performance), scalability and sustainability (hardware and software). We are going to evaluate Bluetooth Low Energy as wireless transmission technology and as the ideal candidate for these improvements, due to its low power consumption, its low cost radio chips and its ability to communicate with users directly, using their smartphones or smartbands. However, this technology is relatively recent, and standard network topologies are not able to fulfil its new requirements. To address these shortcomings, the implementation of other more flexible topologies (as the mesh topology) will be very interesting. After studying it in depth, we have identified certain weaknesses, for example, specific devices are needed to provide network scalability, and the need to choose between high performance or sustainability. In this paper, after presenting the studies carried out on these new technologies, we propose a new packet format and a new BLE mesh topology, with two different configurations: Individual Mesh and Collaborative Mesh . Our results show how this topology improves the scalability, sustainability, coverage and performance.

Exact coupling threshold for structural transition reveals diversified behaviors in interconnected networks.

PubMed

Darabi Sahneh, Faryad; Scoglio, Caterina; Van Mieghem, Piet

2015-10-01

An interconnected network features a structural transition between two regimes [F. Radicchi and A. Arenas, Nat. Phys. 9, 717 (2013)]: one where the network components are structurally distinguishable and one where the interconnected network functions as a whole. Our exact solution for the coupling threshold uncovers network topologies with unexpected behaviors. Specifically, we show conditions that superdiffusion, introduced by Gómez et al. [Phys. Rev. Lett. 110, 028701 (2013)], can occur despite the network components functioning distinctly. Moreover, we find that components of certain interconnected network topologies are indistinguishable despite very weak coupling between them.

Retinal vascular segmentation using superpixel-based line operator and its application to vascular topology estimation.

PubMed

Na, Tong; Xie, Jianyang; Zhao, Yitian; Zhao, Yifan; Liu, Yue; Wang, Yongtian; Liu, Jiang

2018-05-09

Automatic methods of analyzing of retinal vascular networks, such as retinal blood vessel detection, vascular network topology estimation, and arteries/veins classification are of great assistance to the ophthalmologist in terms of diagnosis and treatment of a wide spectrum of diseases. We propose a new framework for precisely segmenting retinal vasculatures, constructing retinal vascular network topology, and separating the arteries and veins. A nonlocal total variation inspired Retinex model is employed to remove the image intensity inhomogeneities and relatively poor contrast. For better generalizability and segmentation performance, a superpixel-based line operator is proposed as to distinguish between lines and the edges, thus allowing more tolerance in the position of the respective contours. The concept of dominant sets clustering is adopted to estimate retinal vessel topology and classify the vessel network into arteries and veins. The proposed segmentation method yields competitive results on three public data sets (STARE, DRIVE, and IOSTAR), and it has superior performance when compared with unsupervised segmentation methods, with accuracy of 0.954, 0.957, and 0.964, respectively. The topology estimation approach has been applied to five public databases (DRIVE,STARE, INSPIRE, IOSTAR, and VICAVR) and achieved high accuracy of 0.830, 0.910, 0.915, 0.928, and 0.889, respectively. The accuracies of arteries/veins classification based on the estimated vascular topology on three public databases (INSPIRE, DRIVE and VICAVR) are 0.90.9, 0.910, and 0.907, respectively. The experimental results show that the proposed framework has effectively addressed crossover problem, a bottleneck issue in segmentation and vascular topology reconstruction. The vascular topology information significantly improves the accuracy on arteries/veins classification. © 2018 American Association of Physicists in Medicine.

The phenotype of cancer cell invasion controlled by fibril diameter and pore size of 3D collagen networks.

PubMed

Sapudom, Jiranuwat; Rubner, Stefan; Martin, Steve; Kurth, Tony; Riedel, Stefanie; Mierke, Claudia T; Pompe, Tilo

2015-06-01

The behavior of cancer cells is strongly influenced by the properties of extracellular microenvironments, including topology, mechanics and composition. As topological and mechanical properties of the extracellular matrix are hard to access and control for in-depth studies of underlying mechanisms in vivo, defined biomimetic in vitro models are needed. Herein we show, how pore size and fibril diameter of collagen I networks distinctively regulate cancer cell morphology and invasion. Three-dimensional collagen I matrices with a tight control of pore size, fibril diameter and stiffness were reconstituted by adjustment of concentration and pH value during matrix reconstitution. At first, a detailed analysis of topology and mechanics of matrices using confocal laser scanning microscopy, image analysis tools and force spectroscopy indicate pore size and not fibril diameter as the major determinant of matrix elasticity. Secondly, by using two different breast cancer cell lines (MDA-MB-231 and MCF-7), we demonstrate collagen fibril diameter--and not pore size--to primarily regulate cell morphology, cluster formation and invasion. Invasiveness increased and clustering decreased with increasing fibril diameter for both, the highly invasive MDA-MB-231 cells with mesenchymal migratory phenotype and the MCF-7 cells with amoeboid migratory phenotype. As this behavior was independent of overall pore size, matrix elasticity is shown to be not the major determinant of the cell characteristics. Our work emphasizes the complex relationship between structural-mechanical properties of the extracellular matrix and invasive behavior of cancer cells. It suggests a correlation of migratory and invasive phenotype of cancer cells in dependence on topological and mechanical features of the length scale of single fibrils and not on coarse-grained network properties. Copyright © 2015 Elsevier Ltd. All rights reserved.

Energy-efficient pulse-coupled synchronization strategy design for wireless sensor networks through reduced idle listening

PubMed Central

Wang, Yongqiang; Núñez, Felipe; Doyle, Francis J.

2013-01-01

Synchronization is crucial to wireless sensor networks due to their decentralized structure. We propose an energy-efficient pulse-coupled synchronization strategy to achieve this goal. The basic idea is to reduce idle listening by intentionally introducing a large refractory period in the sensors’ cooperation. The large refractory period greatly reduces idle listening in each oscillation period, and is analytically proven to have no influence on the time to synchronization. Hence, it significantly reduces the total energy consumption in a synchronization process. A topology control approach tailored for pulse-coupled synchronization is given to guarantee a k-edge strongly connected interaction topology, which is tolerant to communication-link failures. The topology control approach is totally decentralized and needs no information exchange among sensors, and it is applicable to dynamic network topologies as well. This facilitates a completely decentralized implementation of the synchronization strategy. The strategy is applicable to mobile sensor networks, too. QualNet case studies confirm the effectiveness of the synchronization strategy. PMID:24307831

Towards a unified description of the hydrogen bond network of liquid water: A dynamics based approach

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

Ozkanlar, Abdullah, E-mail: abdullah.ozkanlar@wsu.edu; Zhou, Tiecheng; Clark, Aurora E., E-mail: auclark@wsu.edu

2014-12-07

The definition of a hydrogen bond (H-bond) is intimately related to the topological and dynamic properties of the hydrogen bond network within liquid water. The development of a universal H-bond definition for water is an active area of research as it would remove many ambiguities in the network properties that derive from the fixed definition employed to assign whether a water dimer is hydrogen bonded. This work investigates the impact that an electronic-structure based definition, an energetic, and a geometric definition of the H-bond has upon both topological and dynamic network behavior of simulated water. In each definition, the usemore » of a cutoff (either geometric or energetic) to assign the presence of a H-bond leads to the formation of transiently bonded or broken dimers, which have been quantified within the simulation data. The relative concentration of transient species, and their duration, results in two of the three definitions sharing similarities in either topological or dynamic features (H-bond distribution, H-bond lifetime, etc.), however no two definitions exhibit similar behavior for both classes of network properties. In fact, two networks with similar local network topology (as indicated by similar average H-bonds) can have dramatically different global network topology (as indicated by the defect state distributions) and altered H-bond lifetimes. A dynamics based correction scheme is then used to remove artificially transient H-bonds and to repair artificially broken bonds within the network such that the corrected network exhibits the same structural and dynamic properties for two H-bond definitions (the properties of the third definition being significantly improved). The algorithm described represents a significant step forward in the development of a unified hydrogen bond network whose properties are independent of the original hydrogen bond definition that is employed.« less

Network analysis of functional brain connectivity in borderline personality disorder using resting-state fMRI

PubMed Central

Xu, Tingting; Cullen, Kathryn R.; Mueller, Bryon; Schreiner, Mindy W.; Lim, Kelvin O.; Schulz, S. Charles; Parhi, Keshab K.

2016-01-01

Borderline personality disorder (BPD) is associated with symptoms such as affect dysregulation, impaired sense of self, and self-harm behaviors. Neuroimaging research on BPD has revealed structural and functional abnormalities in specific brain regions and connections. However, little is known about the topological organizations of brain networks in BPD. We collected resting-state functional magnetic resonance imaging (fMRI) data from 20 patients with BPD and 10 healthy controls, and constructed frequency-specific functional brain networks by correlating wavelet-filtered fMRI signals from 82 cortical and subcortical regions. We employed graph-theory based complex network analysis to investigate the topological properties of the brain networks, and employed network-based statistic to identify functional dysconnections in patients. In the 0.03–0.06 Hz frequency band, compared to controls, patients with BPD showed significantly larger measures of global network topology, including the size of largest connected graph component, clustering coefficient, small-worldness, and local efficiency, indicating increased local cliquishness of the functional brain network. Compared to controls, patients showed lower nodal centrality at several hub nodes but greater centrality at several non-hub nodes in the network. Furthermore, an interconnected subnetwork in 0.03–0.06 Hz frequency band was identified that showed significantly lower connectivity in patients. The links in the subnetwork were mainly long-distance connections between regions located at different lobes; and the mean connectivity of this subnetwork was negatively correlated with the increased global topology measures. Lastly, the key network measures showed high correlations with several clinical symptom scores, and classified BPD patients against healthy controls with high accuracy based on linear discriminant analysis. The abnormal topological properties and connectivity found in this study may add new knowledge to the current understanding of functional brain networks in BPD. However, due to limitation of small sample sizes, the results of the current study should be viewed as exploratory and need to be validated on large samples in future works. PMID:26977400

Network analysis of functional brain connectivity in borderline personality disorder using resting-state fMRI.

PubMed

Xu, Tingting; Cullen, Kathryn R; Mueller, Bryon; Schreiner, Mindy W; Lim, Kelvin O; Schulz, S Charles; Parhi, Keshab K

2016-01-01

Borderline personality disorder (BPD) is associated with symptoms such as affect dysregulation, impaired sense of self, and self-harm behaviors. Neuroimaging research on BPD has revealed structural and functional abnormalities in specific brain regions and connections. However, little is known about the topological organizations of brain networks in BPD. We collected resting-state functional magnetic resonance imaging (fMRI) data from 20 patients with BPD and 10 healthy controls, and constructed frequency-specific functional brain networks by correlating wavelet-filtered fMRI signals from 82 cortical and subcortical regions. We employed graph-theory based complex network analysis to investigate the topological properties of the brain networks, and employed network-based statistic to identify functional dysconnections in patients. In the 0.03-0.06 Hz frequency band, compared to controls, patients with BPD showed significantly larger measures of global network topology, including the size of largest connected graph component, clustering coefficient, small-worldness, and local efficiency, indicating increased local cliquishness of the functional brain network. Compared to controls, patients showed lower nodal centrality at several hub nodes but greater centrality at several non-hub nodes in the network. Furthermore, an interconnected subnetwork in 0.03-0.06 Hz frequency band was identified that showed significantly lower connectivity in patients. The links in the subnetwork were mainly long-distance connections between regions located at different lobes; and the mean connectivity of this subnetwork was negatively correlated with the increased global topology measures. Lastly, the key network measures showed high correlations with several clinical symptom scores, and classified BPD patients against healthy controls with high accuracy based on linear discriminant analysis. The abnormal topological properties and connectivity found in this study may add new knowledge to the current understanding of functional brain networks in BPD. However, due to limitation of small sample sizes, the results of the current study should be viewed as exploratory and need to be validated on large samples in future works.

Topological Edge Modes in Active Mikado Networks

NASA Astrophysics Data System (ADS)

Zhou, Di; Zhang, Leyou; Mao, Xiaoming

Mechanical properties of disordered fiber networks are not only important in understanding a broad range of natural (such as the cytoskeleton and the extracellular matrix) and manmade materials (such as aerogels and porous media) but also exhibit interesting and rich physics. In this talk, we discuss how topological floppy edge modes can emerge from these fiber networks as a result of active driving. It is known that straight fibers in a network carries a state of self-stress and bears a bulk floppy mode. We find that, interestingly, by driving the network with a tiny perturbation, the bulk modes evolve into edge modes. We introduce a new transfer matrix formulation that can be applied to this strongly disordered system, to characterize the topological edge modes. We also discuss possible implications of these edge modes in biological processes. NSF-DMR-1609051.

Topological data analysis of contagion maps for examining spreading processes on networks.

PubMed

Taylor, Dane; Klimm, Florian; Harrington, Heather A; Kramár, Miroslav; Mischaikow, Konstantin; Porter, Mason A; Mucha, Peter J

2015-07-21

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth's surface; however, in modern contagions long-range edges-for example, due to airline transportation or communication media-allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct 'contagion maps' that use multiple contagions on a network to map the nodes as a point cloud. By analysing the topology, geometry and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modelling, forecast and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

Topological data analysis of contagion maps for examining spreading processes on networks

NASA Astrophysics Data System (ADS)

Taylor, Dane; Klimm, Florian; Harrington, Heather A.; Kramár, Miroslav; Mischaikow, Konstantin; Porter, Mason A.; Mucha, Peter J.

2015-07-01

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth's surface; however, in modern contagions long-range edges--for example, due to airline transportation or communication media--allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct `contagion maps' that use multiple contagions on a network to map the nodes as a point cloud. By analysing the topology, geometry and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modelling, forecast and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

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.

Multi-scale modularity and motif distributional effect in metabolic networks.

PubMed

Gao, Shang; Chen, Alan; Rahmani, Ali; Zeng, Jia; Tan, Mehmet; Alhajj, Reda; Rokne, Jon; Demetrick, Douglas; Wei, Xiaohui

2016-01-01

Metabolism is a set of fundamental processes that play important roles in a plethora of biological and medical contexts. It is understood that the topological information of reconstructed metabolic networks, such as modular organization, has crucial implications on biological functions. Recent interpretations of modularity in network settings provide a view of multiple network partitions induced by different resolution parameters. Here we ask the question: How do multiple network partitions affect the organization of metabolic networks? Since network motifs are often interpreted as the super families of evolved units, we further investigate their impact under multiple network partitions and investigate how the distribution of network motifs influences the organization of metabolic networks. We studied Homo sapiens, Saccharomyces cerevisiae and Escherichia coli metabolic networks; we analyzed the relationship between different community structures and motif distribution patterns. Further, we quantified the degree to which motifs participate in the modular organization of metabolic networks.

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

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

Mohammadi, Shahin; Gleich, David F.; Kolda, Tamara G.

2015-11-01

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangularmore » AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.« less

A Cluster-Based Architecture to Structure the Topology of Parallel Wireless Sensor Networks

PubMed Central

Lloret, Jaime; Garcia, Miguel; Bri, Diana; Diaz, Juan R.

2009-01-01

A wireless sensor network is a self-configuring network of mobile nodes connected by wireless links where the nodes have limited capacity and energy. In many cases, the application environment requires the design of an exclusive network topology for a particular case. Cluster-based network developments and proposals in existence have been designed to build a network for just one type of node, where all nodes can communicate with any other nodes in their coverage area. Let us suppose a set of clusters of sensor nodes where each cluster is formed by different types of nodes (e.g., they could be classified by the sensed parameter using different transmitting interfaces, by the node profile or by the type of device: laptops, PDAs, sensor etc.) and exclusive networks, as virtual networks, are needed with the same type of sensed data, or the same type of devices, or even the same type of profiles. In this paper, we propose an algorithm that is able to structure the topology of different wireless sensor networks to coexist in the same environment. It allows control and management of the topology of each network. The architecture operation and the protocol messages will be described. Measurements from a real test-bench will show that the designed protocol has low bandwidth consumption and also demonstrates the viability and the scalability of the proposed architecture. Our ccluster-based algorithm is compared with other algorithms reported in the literature in terms of architecture and protocol measurements. PMID:22303185

Optimal Topology Control and Power Allocation for Minimum Energy Consumption in Consensus Networks

DTIC Science & Technology

2011-12-16

network topologies, such as small world graphs, can greatly increase the convergence rate. In [9], the authors show that nonbipartite Ramanujan graphs...unclassified c . THIS PAGE unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 23384 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60...of iterations necessary to achieve consensus. From this perspec- tive, enforcing a small world, scale-free, or Ramanujan graph topology may not be the

Topological Structure of the Space of Phenotypes: The Case of RNA Neutral Networks

PubMed Central

Aguirre, Jacobo; Buldú, Javier M.; Stich, Michael; Manrubia, Susanna C.

2011-01-01

The evolution and adaptation of molecular populations is constrained by the diversity accessible through mutational processes. RNA is a paradigmatic example of biopolymer where genotype (sequence) and phenotype (approximated by the secondary structure fold) are identified in a single molecule. The extreme redundancy of the genotype-phenotype map leads to large ensembles of RNA sequences that fold into the same secondary structure and can be connected through single-point mutations. These ensembles define neutral networks of phenotypes in sequence space. Here we analyze the topological properties of neutral networks formed by 12-nucleotides RNA sequences, obtained through the exhaustive folding of sequence space. A total of 412 sequences fragments into 645 subnetworks that correspond to 57 different secondary structures. The topological analysis reveals that each subnetwork is far from being random: it has a degree distribution with a well-defined average and a small dispersion, a high clustering coefficient, and an average shortest path between nodes close to its minimum possible value, i.e. the Hamming distance between sequences. RNA neutral networks are assortative due to the correlation in the composition of neighboring sequences, a feature that together with the symmetries inherent to the folding process explains the existence of communities. Several topological relationships can be analytically derived attending to structural restrictions and generic properties of the folding process. The average degree of these phenotypic networks grows logarithmically with their size, such that abundant phenotypes have the additional advantage of being more robust to mutations. This property prevents fragmentation of neutral networks and thus enhances the navigability of sequence space. In summary, RNA neutral networks show unique topological properties, unknown to other networks previously described. PMID:22028856

Genome-Wide Networks of Amino Acid Covariances Are Common among Viruses

PubMed Central

Donlin, Maureen J.; Szeto, Brandon; Gohara, David W.; Aurora, Rajeev

2012-01-01

Coordinated variation among positions in amino acid sequence alignments can reveal genetic dependencies at noncontiguous positions, but methods to assess these interactions are incompletely developed. Previously, we found genome-wide networks of covarying residue positions in the hepatitis C virus genome (R. Aurora, M. J. Donlin, N. A. Cannon, and J. E. Tavis, J. Clin. Invest. 119:225–236, 2009). Here, we asked whether such networks are present in a diverse set of viruses and, if so, what they may imply about viral biology. Viral sequences were obtained for 16 viruses in 13 species from 9 families. The entire viral coding potential for each virus was aligned, all possible amino acid covariances were identified using the observed-minus-expected-squared algorithm at a false-discovery rate of ≤1%, and networks of covariances were assessed using standard methods. Covariances that spanned the viral coding potential were common in all viruses. In all cases, the covariances formed a single network that contained essentially all of the covariances. The hepatitis C virus networks had hub-and-spoke topologies, but all other networks had random topologies with an unusually large number of highly connected nodes. These results indicate that genome-wide networks of genetic associations and the coordinated evolution they imply are very common in viral genomes, that the networks rarely have the hub-and-spoke topology that dominates other biological networks, and that network topologies can vary substantially even within a given viral group. Five examples with hepatitis B virus and poliovirus are presented to illustrate how covariance network analysis can lead to inferences about viral biology. PMID:22238298

Investigating changes in brain network properties in HIV-associated neurocognitive disease (HAND) using mutual connectivity analysis (MCA)

NASA Astrophysics Data System (ADS)

Abidin, Anas Zainul; D'Souza, Adora M.; Nagarajan, Mahesh B.; Wismüller, Axel

2016-03-01

About 50% of subjects infected with HIV present deficits in cognitive domains, which are known collectively as HIV associated neurocognitive disorder (HAND). The underlying synaptodendritic damage can be captured using resting state functional MRI, as has been demonstrated by a few earlier studies. Such damage may induce topological changes of brain connectivity networks. We test this hypothesis by capturing the functional interdependence of 90 brain network nodes using a Mutual Connectivity Analysis (MCA) framework with non-linear time series modeling based on Generalized Radial Basis function (GRBF) neural networks. The network nodes are selected based on the regions defined in the Automated Anatomic Labeling (AAL) atlas. Each node is represented by the average time series of the voxels of that region. The resulting networks are then characterized using graph-theoretic measures that quantify various network topology properties at a global as well as at a local level. We tested for differences in these properties in network graphs obtained for 10 subjects (6 male and 4 female, 5 HIV+ and 5 HIV-). Global network properties captured some differences between these subject cohorts, though significant differences were seen only with the clustering coefficient measure. Local network properties, such as local efficiency and the degree of connections, captured significant differences in regions of the frontal lobe, precentral and cingulate cortex amongst a few others. These results suggest that our method can be used to effectively capture differences occurring in brain network connectivity properties revealed by resting-state functional MRI in neurological disease states, such as HAND.

The small world of osteocytes: connectomics of the lacuno-canalicular network in bone

NASA Astrophysics Data System (ADS)

Kollmannsberger, Philip; Kerschnitzki, Michael; Repp, Felix; Wagermaier, Wolfgang; Weinkamer, Richard; Fratzl, Peter

2017-07-01

Osteocytes and their cell processes reside in a large, interconnected network of voids pervading the mineralized bone matrix of most vertebrates. This osteocyte lacuno-canalicular network (OLCN) is believed to play important roles in mechanosensing, mineral homeostasis, and for the mechanical properties of bone. While the extracellular matrix structure of bone is extensively studied on ultrastructural and macroscopic scales, there is a lack of quantitative knowledge on how the cellular network is organized. Using a recently introduced imaging and quantification approach, we analyze the OLCN in different bone types from mouse and sheep that exhibit different degrees of structural organization not only of the cell network but also of the fibrous matrix deposited by the cells. We define a number of robust, quantitative measures that are derived from the theory of complex networks. These measures enable us to gain insights into how efficient the network is organized with regard to intercellular transport and communication. Our analysis shows that the cell network in regularly organized, slow-growing bone tissue from sheep is less connected, but more efficiently organized compared to irregular and fast-growing bone tissue from mice. On the level of statistical topological properties (edges per node, edge length and degree distribution), both network types are indistinguishable, highlighting that despite pronounced differences at the tissue level, the topological architecture of the osteocyte canalicular network at the subcellular level may be independent of species and bone type. Our results suggest a universal mechanism underlying the self-organization of individual cells into a large, interconnected network during bone formation and mineralization.

On-line training of recurrent neural networks with continuous topology adaptation.

PubMed

Obradovic, D

1996-01-01

This paper presents an online procedure for training dynamic neural networks with input-output recurrences whose topology is continuously adjusted to the complexity of the target system dynamics. This is accomplished by changing the number of the elements of the network hidden layer whenever the existing topology cannot capture the dynamics presented by the new data. The training mechanism is based on the suitably altered extended Kalman filter (EKF) algorithm which is simultaneously used for the network parameter adjustment and for its state estimation. The network consists of a single hidden layer with Gaussian radial basis functions (GRBF), and a linear output layer. The choice of the GRBF is induced by the requirements of the online learning. The latter implies the network architecture which permits only local influence of the new data point in order not to forget the previously learned dynamics. The continuous topology adaptation is implemented in our algorithm to avoid memory and computational problems of using a regular grid of GRBF'S which covers the network input space. Furthermore, we show that the resulting parameter increase can be handled "smoothly" without interfering with the already acquired information. If the target system dynamics are changing over time, we show that a suitable forgetting factor can be used to "unlearn" the no longer-relevant dynamics. The quality of the recurrent network training algorithm is demonstrated on the identification of nonlinear dynamic systems.

Determining root correspondence between previously and newly detected objects

DOEpatents

Paglieroni, David W.; Beer, N Reginald

2014-06-17

A system that applies attribute and topology based change detection to networks of objects that were detected on previous scans of a structure, roadway, or area of interest. The attributes capture properties or characteristics of the previously detected objects, such as location, time of detection, size, elongation, orientation, etc. The topology of the network of previously detected objects is maintained in a constellation database that stores attributes of previously detected objects and implicitly captures the geometrical structure of the network. A change detection system detects change by comparing the attributes and topology of new objects detected on the latest scan to the constellation database of previously detected objects.

Power-law tail probabilities of drainage areas in river basins

USGS Publications Warehouse

Veitzer, S.A.; Troutman, B.M.; Gupta, V.K.

2003-01-01

The significance of power-law tail probabilities of drainage areas in river basins was discussed. The convergence to a power law was not observed for all underlying distributions, but for a large class of statistical distributions with specific limiting properties. The article also discussed about the scaling properties of topologic and geometric network properties in river basins.

Linking network topology to function. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin, A. Krzywicki and M. Zagorski

NASA Astrophysics Data System (ADS)

di Bernardo, Diego

2016-07-01

The review by Martin et al. deals with a long standing problem at the interface of complex systems and molecular biology, that is the relationship between the topology of a complex network and its function. In biological terms the problem translates to relating the topology of gene regulatory networks (GRNs) to specific cellular functions. GRNs control the spatial and temporal activity of the genes encoded in the cell's genome by means of specialised proteins called Transcription Factors (TFs). A TF is able to recognise and bind specifically to a sequence (TF biding site) of variable length (order of magnitude of 10) found upstream of the sequence encoding one or more genes (at least in prokaryotes) and thus activating or repressing their transcription. TFs can thus be distinguished in activator and repressor. The picture can become more complex since some classes of TFs can form hetero-dimers consisting of a protein complex whose subunits are the individual TFs. Heterodimers can have completely different binding sites and activity compared to their individual parts. In this review the authors limit their attention to prokaryotes where the complexity of GRNs is somewhat reduced. Moreover they exploit a unique feature of living systems, i.e. evolution, to understand whether function can shape network topology. Indeed, prokaryotes such as bacteria are among the oldest living systems that have become perfectly adapted to their environment over geological scales and thus have reached an evolutionary steady-state where the fitness of the population has reached a plateau. By integrating in silico analysis and comparative evolution, the authors show that indeed function does tend to shape the structure of a GRN, however this trend is not always present and depends on the properties of the network being examined. Interestingly, the trend is more apparent for sparse networks, i.e. where the density of edges is very low. Sparsity is indeed one of the most prominent features of natural occurring GRNs, and more specifically GRNs have been found to approximate a power-law ;scale-free; degree distribution by Barabasi and Albert [2]. Why sparsity arises is still under debate, but Price in 1976 proposed a model [1], later renamed ;preferential attachment; by Barabasi and Albert [2], able to give rise to sparse scale-free networks. In this model, a network grows over time (such as GRN during evolution) by sequential addition of new nodes (caused by genome duplications) that attach with higher probability to nodes with higher degree. In this review, Martin et al. propose that sparsity could also be caused phenotypic constrains even in the absence of genome duplications, in order for the network to be robust against random mutations in the genome sequence, which in turn affect the specificity of TF binding sites. The authors also found that network motifs, i.e. subnetworks consisting of 3 or 4 nodes with a specific topology that are over-represented in the network, are also shaped by phenotypic constrains. Theoretical and computational approaches to understand the forces that shape network topology are of extreme interest in biology, although at this stage their impact has been limited. Neverteless, these approaches may soon have important practical applications. The era of synthetic biology is upon us, novel organisms with ;minimal genomes; are being built with the dual aim of simplifying engineering of new functions useful to humans and to understand which is the minimal set of genes needed to support life [3]. The first minimal organism has just been created [3] by randomly deleting genes and genomic regions until a minimal set supporting cell growth and replication was found. The GRN of this minimal organism has not been investigated yet, but it will be of limited complexity. What is the GRN structure in this organism? Will the cell phenotypes be robust to mutations? Is it possible to re-engineer the GRN in order to find an optimal structure that confers phenotypic robustness to the cell? All of these questions can be tackled only by understanding the guiding principles linking network topology to network function.

Probabilistic biological network alignment.

PubMed

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-01-01

Interactions between molecules are probabilistic events. An interaction may or may not happen with some probability, depending on a variety of factors such as the size, abundance, or proximity of the interacting molecules. In this paper, we consider the problem of aligning two biological networks. Unlike existing methods, we allow one of the two networks to contain probabilistic interactions. Allowing interaction probabilities makes the alignment more biologically relevant at the expense of explosive growth in the number of alternative topologies that may arise from different subsets of interactions that take place. We develop a novel method that efficiently and precisely characterizes this massive search space. We represent the topological similarity between pairs of aligned molecules (i.e., proteins) with the help of random variables and compute their expected values. We validate our method showing that, without sacrificing the running time performance, it can produce novel alignments. Our results also demonstrate that our method identifies biologically meaningful mappings under a comprehensive set of criteria used in the literature as well as the statistical coherence measure that we developed to analyze the statistical significance of the similarity of the functions of the aligned protein pairs.

Multiplex visibility graphs to investigate recurrent neural network dynamics

NASA Astrophysics Data System (ADS)

Bianchi, Filippo Maria; Livi, Lorenzo; Alippi, Cesare; Jenssen, Robert

2017-03-01

A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning them properly may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize internal dynamics of a class of RNNs called echo state networks (ESNs). We design principled unsupervised methods to derive hyperparameters configurations yielding maximal ESN performance, expressed in terms of prediction error and memory capacity. In particular, we propose to model time series generated by each neuron activations with a horizontal visibility graph, whose topological properties have been shown to be related to the underlying system dynamics. Successively, horizontal visibility graphs associated with all neurons become layers of a larger structure called a multiplex. We show that topological properties of such a multiplex reflect important features of ESN dynamics that can be used to guide the tuning of its hyperparamers. Results obtained on several benchmarks and a real-world dataset of telephone call data records show the effectiveness of the proposed methods.

Multiplex visibility graphs to investigate recurrent neural network dynamics

PubMed Central

Bianchi, Filippo Maria; Livi, Lorenzo; Alippi, Cesare; Jenssen, Robert

2017-01-01

A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning them properly may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize internal dynamics of a class of RNNs called echo state networks (ESNs). We design principled unsupervised methods to derive hyperparameters configurations yielding maximal ESN performance, expressed in terms of prediction error and memory capacity. In particular, we propose to model time series generated by each neuron activations with a horizontal visibility graph, whose topological properties have been shown to be related to the underlying system dynamics. Successively, horizontal visibility graphs associated with all neurons become layers of a larger structure called a multiplex. We show that topological properties of such a multiplex reflect important features of ESN dynamics that can be used to guide the tuning of its hyperparamers. Results obtained on several benchmarks and a real-world dataset of telephone call data records show the effectiveness of the proposed methods. PMID:28281563

Temporal Comparisons of Internet Topology

DTIC Science & Technology

2014-06-01

Number CAIDA Cooperative Association of Internet Data Analysis CDN Content Delivery Network CI Confidence Interval DoS denial of service GMT Greenwich...the CAIDA data. Our methods include analysis of graph theoretical measures as well as complex network and statistical measures that will quantify the...tool that probes the Internet for topology analysis and performance [26]. Scamper uses network diagnostic tools, such as traceroute and ping, to probe

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.

Stimulus-induced transitions between spike-wave discharges and spindles with the modulation of thalamic reticular nucleus.

PubMed

Fan, Denggui; Wang, Qingyun; Su, Jianzhong; Xi, Hongguang

2017-12-01

It is believed that thalamic reticular nucleus (TRN) controls spindles and spike-wave discharges (SWD) in seizure or sleeping processes. The dynamical mechanisms of spatiotemporal evolutions between these two types of activity, however, are not well understood. In light of this, we first use a single-compartment thalamocortical neural field model to investigate the effects of TRN on occurrence of SWD and its transition. Results show that the increasing inhibition from TRN to specific relay nuclei (SRN) can lead to the transition of system from SWD to slow-wave oscillation. Specially, it is shown that stimulations applied in the cortical neuronal populations can also initiate the SWD and slow-wave oscillation from the resting states under the typical inhibitory intensity from TRN to SRN. Then, we expand into a 3-compartment coupled thalamocortical model network in linear and circular structures, respectively, to explore the spatiotemporal evolutions of wave states in different compartments. The main results are: (i) for the open-ended model network, SWD induced by stimulus in the first compartment can be transformed into sleep-like slow UP-DOWN and spindle states as it propagates into the downstream compartments; (ii) for the close-ended model network, weak stimulations performed in the first compartment can result in the consistent experimentally observed spindle oscillations in all three compartments; in contrast, stronger periodic single-pulse stimulations applied in the first compartment can induce periodic transitions between SWD and spindle oscillations. Detailed investigations reveal that multi-attractor coexistence mechanism composed of SWD, spindles and background state underlies these state evolutions. What's more, in order to demonstrate the state evolution stability with respect to the topological structures of neural network, we further expand the 3-compartment coupled network into 10-compartment coupled one, with linear and circular structures, and nearest-neighbor (NN) coupled network as well as its realization of small-world (SW) topology via random rewiring, respectively. Interestingly, for the cases of linear and circular connetivities, qualitatively similar results were obtained in addition to the more irregularity of firings. However, SWD can be eventually transformed into the consistent low-amplitude oscillations for both NN and SW networks. In particular, SWD evolves into the slow spindling oscillations and background tonic oscillations within the NN and SW network, respectively. Our modeling and simulation studies highlight the effect of network topology in the evolutions of SWD and spindling oscillations, which provides new insights into the mechanisms of cortical seizures development.

The Impact of the Network Topology on the Viral Prevalence: A Node-Based Approach

PubMed Central

Yang, Lu-Xing; Draief, Moez; Yang, Xiaofan

2015-01-01

This paper addresses the impact of the structure of the viral propagation network on the viral prevalence. For that purpose, a new epidemic model of computer virus, known as the node-based SLBS model, is proposed. Our analysis shows that the maximum eigenvalue of the underlying network is a key factor determining the viral prevalence. Specifically, the value range of the maximum eigenvalue is partitioned into three subintervals: viruses tend to extinction very quickly or approach extinction or persist depending on into which subinterval the maximum eigenvalue of the propagation network falls. Consequently, computer virus can be contained by adjusting the propagation network so that its maximum eigenvalue falls into the desired subinterval. PMID:26222539

Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks

NASA Technical Reports Server (NTRS)

Jorgensen, Charles C.

1997-01-01

A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.

Information Assurance in Wireless Networks

NASA Astrophysics Data System (ADS)

Kabara, Joseph; Krishnamurthy, Prashant; Tipper, David

2001-09-01

Emerging wireless networks will contain a hybrid infrastructure based on fixed, mobile and ad hoc topologies and technologies. In such a dynamic architecture, we define information assurance as the provisions for both information security and information availability. The implications of this definition are that the wireless network architecture must (a) provide sufficient security measures, (b) be survivable under node or link attack or failure and (c) be designed such that sufficient capacity remains for all critical services (and preferably most other services) in the event of attack or component failure. We have begun a research project to investigate the provision of information assurance for wireless networks viz. survivability, security and availability and here discuss the issues and challenges therein.

Integrated in silico analyses of regulatory and metabolic networks of Synechococcus sp. PCC 7002 reveal relationships between gene centrality and essentiality

DOE PAGES

Song, Hyun-Seob; McClure, Ryan S.; Bernstein, Hans C.; ...

2015-03-27

Cyanobacteria dynamically relay environmental inputs to intracellular adaptations through a coordinated adjustment of photosynthetic efficiency and carbon processing rates. The output of such adaptations is reflected through changes in transcriptional patterns and metabolic flux distributions that ultimately define growth strategy. To address interrelationships between metabolism and regulation, we performed integrative analyses of metabolic and gene co-expression networks in a model cyanobacterium, Synechococcus sp. PCC 7002. Centrality analyses using the gene co-expression network identified a set of key genes, which were defined here as ‘topologically important.’ Parallel in silico gene knock-out simulations, using the genome-scale metabolic network, classified what we termedmore » as ‘functionally important’ genes, deletion of which affected growth or metabolism. A strong positive correlation was observed between topologically and functionally important genes. Functionally important genes exhibited variable levels of topological centrality; however, the majority of topologically central genes were found to be functionally essential for growth. Subsequent functional enrichment analysis revealed that both functionally and topologically important genes in Synechococcus sp. PCC 7002 are predominantly associated with translation and energy metabolism, two cellular processes critical for growth. This research demonstrates how synergistic network-level analyses can be used for reconciliation of metabolic and gene expression data to uncover fundamental biological principles.« less

Integrated in silico analyses of regulatory and metabolic networks of Synechococcus sp. PCC 7002 reveal relationships between gene centrality and essentiality

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

Song, Hyun-Seob; McClure, Ryan S.; Bernstein, Hans C.

Cyanobacteria dynamically relay environmental inputs to intracellular adaptations through a coordinated adjustment of photosynthetic efficiency and carbon processing rates. The output of such adaptations is reflected through changes in transcriptional patterns and metabolic flux distributions that ultimately define growth strategy. To address interrelationships between metabolism and regulation, we performed integrative analyses of metabolic and gene co-expression networks in a model cyanobacterium, Synechococcus sp. PCC 7002. Centrality analyses using the gene co-expression network identified a set of key genes, which were defined here as ‘topologically important.’ Parallel in silico gene knock-out simulations, using the genome-scale metabolic network, classified what we termedmore » as ‘functionally important’ genes, deletion of which affected growth or metabolism. A strong positive correlation was observed between topologically and functionally important genes. Functionally important genes exhibited variable levels of topological centrality; however, the majority of topologically central genes were found to be functionally essential for growth. Subsequent functional enrichment analysis revealed that both functionally and topologically important genes in Synechococcus sp. PCC 7002 are predominantly associated with translation and energy metabolism, two cellular processes critical for growth. This research demonstrates how synergistic network-level analyses can be used for reconciliation of metabolic and gene expression data to uncover fundamental biological principles.« less

Survivability in Layered Networks

DTIC Science & Technology

2011-02-01

of different lightpath routing formulations. ..... 60 2-7 Probabilty that logical topology becomes disconnected if physical links fail independently...13 14 15 Logical Topology Size Figure 2-7: Probabilty that logical topology becomes disconnected if physical links fail independently with probability

A Topology Control Strategy with Reliability Assurance for Satellite Cluster Networks in Earth Observation

PubMed Central

Chen, Qing; Zhang, Jinxiu; Hu, Ze

2017-01-01

This article investigates the dynamic topology control problem of satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites’ relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime. PMID:28241474

A Topology Control Strategy with Reliability Assurance for Satellite Cluster Networks in Earth Observation.

PubMed

Chen, Qing; Zhang, Jinxiu; Hu, Ze

2017-02-23

This article investigates the dynamic topology control problemof satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites' relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime.

Network Theory: A Primer and Questions for Air Transportation Systems Applications

NASA Technical Reports Server (NTRS)

Holmes, Bruce J.

2004-01-01

A new understanding (with potential applications to air transportation systems) has emerged in the past five years in the scientific field of networks. This development emerges in large part because we now have a new laboratory for developing theories about complex networks: The Internet. The premise of this new understanding is that most complex networks of interest, both of nature and of human contrivance, exhibit a fundamentally different behavior than thought for over two hundred years under classical graph theory. Classical theory held that networks exhibited random behavior, characterized by normal, (e.g., Gaussian or Poisson) degree distributions of the connectivity between nodes by links. The new understanding turns this idea on its head: networks of interest exhibit scale-free (or small world) degree distributions of connectivity, characterized by power law distributions. The implications of scale-free behavior for air transportation systems include the potential that some behaviors of complex system architectures might be analyzed through relatively simple approximations of local elements of the system. For air transportation applications, this presentation proposes a framework for constructing topologies (architectures) that represent the relationships between mobility, flight operations, aircraft requirements, and airspace capacity, and the related externalities in airspace procedures and architectures. The proposed architectures or topologies may serve as a framework for posing comparative and combinative analyses of performance, cost, security, environmental, and related metrics.

A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks

PubMed Central

Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

2017-01-01

The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) project is to make autonomous underwater vehicles (AUVs), remote operated vehicles (ROVs) and unmanned surface vehicles (USVs) more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC) algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV’s parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC) algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the transmission power adjustment ratio while improving the network performance. PMID:28471387

A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks.

PubMed

Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

2017-05-04

The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) project is to make autonomous underwater vehicles (AUVs), remote operated vehicles (ROVs) and unmanned surface vehicles (USVs) more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC) algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV's parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC) algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the transmission power adjustment ratio while improving the network performance.

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

Randomization and resilience of brain functional networks as systems-level endophenotypes of schizophrenia.

PubMed

Lo, Chun-Yi Zac; Su, Tsung-Wei; Huang, Chu-Chung; Hung, Chia-Chun; Chen, Wei-Ling; Lan, Tsuo-Hung; Lin, Ching-Po; Bullmore, Edward T

2015-07-21

Schizophrenia is increasingly conceived as a disorder of brain network organization or dysconnectivity syndrome. Functional MRI (fMRI) networks in schizophrenia have been characterized by abnormally random topology. We tested the hypothesis that network randomization is an endophenotype of schizophrenia and therefore evident also in nonpsychotic relatives of patients. Head movement-corrected, resting-state fMRI data were acquired from 25 patients with schizophrenia, 25 first-degree relatives of patients, and 29 healthy volunteers. Graphs were used to model functional connectivity as a set of edges between regional nodes. We estimated the topological efficiency, clustering, degree distribution, resilience, and connection distance (in millimeters) of each functional network. The schizophrenic group demonstrated significant randomization of global network metrics (reduced clustering, greater efficiency), a shift in the degree distribution to a more homogeneous form (fewer hubs), a shift in the distance distribution (proportionally more long-distance edges), and greater resilience to targeted attack on network hubs. The networks of the relatives also demonstrated abnormal randomization and resilience compared with healthy volunteers, but they were typically less topologically abnormal than the patients' networks and did not have abnormal connection distances. We conclude that schizophrenia is associated with replicable and convergent evidence for functional network randomization, and a similar topological profile was evident also in nonpsychotic relatives, suggesting that this is a systems-level endophenotype or marker of familial risk. We speculate that the greater resilience of brain networks may confer some fitness advantages on nonpsychotic relatives that could explain persistence of this endophenotype in the population.

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

Discrete-event simulation of a wide-area health care network.

PubMed Central

McDaniel, J G

1995-01-01

OBJECTIVE: Predict the behavior and estimate the telecommunication cost of a wide-area message store-and-forward network for health care providers that uses the telephone system. DESIGN: A tool with which to perform large-scale discrete-event simulations was developed. Network models for star and mesh topologies were constructed to analyze the differences in performances and telecommunication costs. The distribution of nodes in the network models approximates the distribution of physicians, hospitals, medical labs, and insurers in the Province of Saskatchewan, Canada. Modeling parameters were based on measurements taken from a prototype telephone network and a survey conducted at two medical clinics. Simulation studies were conducted for both topologies. RESULTS: For either topology, the telecommunication cost of a network in Saskatchewan is projected to be less than $100 (Canadian) per month per node. The estimated telecommunication cost of the star topology is approximately half that of the mesh. Simulations predict that a mean end-to-end message delivery time of two hours or less is achievable at this cost. A doubling of the data volume results in an increase of less than 50% in the mean end-to-end message transfer time. CONCLUSION: The simulation models provided an estimate of network performance and telecommunication cost in a specific Canadian province. At the expected operating point, network performance appeared to be relatively insensitive to increases in data volume. Similar results might be anticipated in other rural states and provinces in North America where a telephone-based network is desired. PMID:7583646

Spatial correlation between chemical and topological defects in vitreous silica: UV-resonance Raman study

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

Saito, M., E-mail: makina.saito@elettra.eu; D’Amico, F.; Bencivenga, F.

2014-06-28

A spatial correlation between chemical and topological defects in the tetrahedron network in vitreous silica produced by a fusion process of natural quartz crystals was found by synchrotron-based UV resonance Raman experiments. Furthermore, a quantitative correlation between these defects was obtained by comparing visible Raman and UV absorption spectra. These results indicate that in vitreous silica produced by the fusion process the topological defects disturb the surrounding tetrahedral silica network and induce further disorder regions with sub nanometric sizes.

Quantum Google in a Complex Network

PubMed Central

Paparo, Giuseppe Davide; Müller, Markus; Comellas, Francesc; Martin-Delgado, Miguel Angel

2013-01-01

We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scale-free and random networks. PMID:24091980

Dopamine precursor depletion impairs structure and efficiency of resting state brain functional networks.

PubMed

Carbonell, Felix; Nagano-Saito, Atsuko; Leyton, Marco; Cisek, Paul; Benkelfat, Chawki; He, Yong; Dagher, Alain

2014-09-01

Spatial patterns of functional connectivity derived from resting brain activity may be used to elucidate the topological properties of brain networks. Such networks are amenable to study using graph theory, which shows that they possess small world properties and can be used to differentiate healthy subjects and patient populations. Of particular interest is the possibility that some of these differences are related to alterations in the dopamine system. To investigate the role of dopamine in the topological organization of brain networks at rest, we tested the effects of reducing dopamine synthesis in 13 healthy subjects undergoing functional magnetic resonance imaging. All subjects were scanned twice, in a resting state, following ingestion of one of two amino acid drinks in a randomized, double-blind manner. One drink was a nutritionally balanced amino acid mixture, and the other was tyrosine and phenylalanine deficient. Functional connectivity between 90 cortical and subcortical regions was estimated for each individual subject under each dopaminergic condition. The lowered dopamine state caused the following network changes: reduced global and local efficiency of the whole brain network, reduced regional efficiency in limbic areas, reduced modularity of brain networks, and greater connection between the normally anti-correlated task-positive and default-mode networks. We conclude that dopamine plays a role in maintaining the efficient small-world properties and high modularity of functional brain networks, and in segregating the task-positive and default-mode networks. This article is part of the Special Issue Section entitled 'Neuroimaging in Neuropharmacology'. Copyright © 2014 Elsevier Ltd. All rights reserved.

Network-Level Structure-Function Relationships in Human Neocortex

PubMed Central

Mišić, Bratislav; Betzel, Richard F.; de Reus, Marcel A.; van den Heuvel, Martijn P.; Berman, Marc G.; McIntosh, Anthony R.; Sporns, Olaf

2016-01-01

The dynamics of spontaneous fluctuations in neural activity are shaped by underlying patterns of anatomical connectivity. While numerous studies have demonstrated edge-wise correspondence between structural and functional connections, much less is known about how large-scale coherent functional network patterns emerge from the topology of structural networks. In the present study, we deploy a multivariate statistical technique, partial least squares, to investigate the association between spatially extended structural networks and functional networks. We find multiple statistically robust patterns, reflecting reliable combinations of structural and functional subnetworks that are optimally associated with one another. Importantly, these patterns generally do not show a one-to-one correspondence between structural and functional edges, but are instead distributed and heterogeneous, with many functional relationships arising from nonoverlapping sets of anatomical connections. We also find that structural connections between high-degree hubs are disproportionately represented, suggesting that these connections are particularly important in establishing coherent functional networks. Altogether, these results demonstrate that the network organization of the cerebral cortex supports the emergence of diverse functional network configurations that often diverge from the underlying anatomical substrate. PMID:27102654

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.

Topological networks for quantum communication between distant qubits

NASA Astrophysics Data System (ADS)

Lang, Nicolai; Büchler, Hans Peter

2017-11-01

Efficient communication between qubits relies on robust networks, which allow for fast and coherent transfer of quantum information. It seems natural to harvest the remarkable properties of systems characterized by topological invariants to perform this task. Here, we show that a linear network of coupled bosonic degrees of freedom, characterized by topological bands, can be employed for the efficient exchange of quantum information over large distances. Important features of our setup are that it is robust against quenched disorder, all relevant operations can be performed by global variations of parameters, and the time required for communication between distant qubits approaches linear scaling with their distance. We demonstrate that our concept can be extended to an ensemble of qubits embedded in a two-dimensional network to allow for communication between all of them.

Effects of Different Correlation Metrics and Preprocessing Factors on Small-World Brain Functional Networks: A Resting-State Functional MRI Study

PubMed Central

Liang, Xia; Wang, Jinhui; Yan, Chaogan; Shu, Ni; Xu, Ke; Gong, Gaolang; He, Yong

2012-01-01

Graph theoretical analysis of brain networks based on resting-state functional MRI (R-fMRI) has attracted a great deal of attention in recent years. These analyses often involve the selection of correlation metrics and specific preprocessing steps. However, the influence of these factors on the topological properties of functional brain networks has not been systematically examined. Here, we investigated the influences of correlation metric choice (Pearson's correlation versus partial correlation), global signal presence (regressed or not) and frequency band selection [slow-5 (0.01–0.027 Hz) versus slow-4 (0.027–0.073 Hz)] on the topological properties of both binary and weighted brain networks derived from them, and we employed test-retest (TRT) analyses for further guidance on how to choose the “best” network modeling strategy from the reliability perspective. Our results show significant differences in global network metrics associated with both correlation metrics and global signals. Analysis of nodal degree revealed differing hub distributions for brain networks derived from Pearson's correlation versus partial correlation. TRT analysis revealed that the reliability of both global and local topological properties are modulated by correlation metrics and the global signal, with the highest reliability observed for Pearson's-correlation-based brain networks without global signal removal (WOGR-PEAR). The nodal reliability exhibited a spatially heterogeneous distribution wherein regions in association and limbic/paralimbic cortices showed moderate TRT reliability in Pearson's-correlation-based brain networks. Moreover, we found that there were significant frequency-related differences in topological properties of WOGR-PEAR networks, and brain networks derived in the 0.027–0.073 Hz band exhibited greater reliability than those in the 0.01–0.027 Hz band. Taken together, our results provide direct evidence regarding the influences of correlation metrics and specific preprocessing choices on both the global and nodal topological properties of functional brain networks. This study also has important implications for how to choose reliable analytical schemes in brain network studies. PMID:22412922

From brain to earth and climate systems: small-world interaction networks or not?

PubMed

Bialonski, Stephan; Horstmann, Marie-Therese; Lehnertz, Klaus

2010-03-01

We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With numerical simulations that mimic typical experimental situations, we have identified an important constraint when characterizing such networks: indications of a small-world topology can be expected solely due to the spatial sampling of the system along with the commonly used time series analysis based approaches to network characterization.

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.

On Adding Structure to Unstructured Overlay Networks

NASA Astrophysics Data System (ADS)

Leitão, João; Carvalho, Nuno A.; Pereira, José; Oliveira, Rui; Rodrigues, Luís

Unstructured peer-to-peer overlay networks are very resilient to churn and topology changes, while requiring little maintenance cost. Therefore, they are an infrastructure to build highly scalable large-scale services in dynamic networks. Typically, the overlay topology is defined by a peer sampling service that aims at maintaining, in each process, a random partial view of peers in the system. The resulting random unstructured topology is suboptimal when a specific performance metric is considered. On the other hand, structured approaches (for instance, a spanning tree) may optimize a given target performance metric but are highly fragile. In fact, the cost for maintaining structures with strong constraints may easily become prohibitive in highly dynamic networks. This chapter discusses different techniques that aim at combining the advantages of unstructured and structured networks. Namely we focus on two distinct approaches, one based on optimizing the overlay and another based on optimizing the gossip mechanism itself.

Coverage maximization under resource constraints using a nonuniform proliferating random walk.

PubMed

Saha, Sudipta; Ganguly, Niloy

2013-02-01

Information management services on networks, such as search and dissemination, play a key role in any large-scale distributed system. One of the most desirable features of these services is the maximization of the coverage, i.e., the number of distinctly visited nodes under constraints of network resources as well as time. However, redundant visits of nodes by different message packets (modeled, e.g., as walkers) initiated by the underlying algorithms for these services cause wastage of network resources. In this work, using results from analytical studies done in the past on a K-random-walk-based algorithm, we identify that redundancy quickly increases with an increase in the density of the walkers. Based on this postulate, we design a very simple distributed algorithm which dynamically estimates the density of the walkers and thereby carefully proliferates walkers in sparse regions. We use extensive computer simulations to test our algorithm in various kinds of network topologies whereby we find it to be performing particularly well in networks that are highly clustered as well as sparse.

A simplified memory network model based on pattern formations

NASA Astrophysics Data System (ADS)

Xu, Kesheng; Zhang, Xiyun; Wang, Chaoqing; Liu, Zonghua

2014-12-01

Many experiments have evidenced the transition with different time scales from short-term memory (STM) to long-term memory (LTM) in mammalian brains, while its theoretical understanding is still under debate. To understand its underlying mechanism, it has recently been shown that it is possible to have a long-period rhythmic synchronous firing in a scale-free network, provided the existence of both the high-degree hubs and the loops formed by low-degree nodes. We here present a simplified memory network model to show that the self-sustained synchronous firing can be observed even without these two necessary conditions. This simplified network consists of two loops of coupled excitable neurons with different synaptic conductance and with one node being the sensory neuron to receive an external stimulus signal. This model can be further used to show how the diversity of firing patterns can be selectively formed by varying the signal frequency, duration of the stimulus and network topology, which corresponds to the patterns of STM and LTM with different time scales. A theoretical analysis is presented to explain the underlying mechanism of firing patterns.

A network analysis of the Chinese stock market

NASA Astrophysics Data System (ADS)

Huang, Wei-Qiang; Zhuang, Xin-Tian; Yao, Shuang

2009-07-01

In many practical important cases, a massive dataset can be represented as a very large network with certain attributes associated with its vertices and edges. Stock markets generate huge amounts of data, which can be use for constructing the network reflecting the market’s behavior. In this paper, we use a threshold method to construct China’s stock correlation network and then study the network’s structural properties and topological stability. We conduct a statistical analysis of this network and show that it follows a power-law model. We also detect components, cliques and independent sets in this network. These analyses allows one to apply a new data mining technique of classifying financial instruments based on stock price data, which provides a deeper insight into the internal structure of the stock market. Moreover, we test the topological stability of this network and find that it displays a topological robustness against random vertex failures, but it is also fragile to intentional attacks. Such a network stability property would be also useful for portfolio investment and risk management.

Structure-topology-property correlations of sodium phosphosilicate glasses.

PubMed

Hermansen, Christian; Guo, Xiaoju; Youngman, Randall E; Mauro, John C; Smedskjaer, Morten M; Yue, Yuanzheng

2015-08-14

In this work, we investigate the correlations among structure, topology, and properties in a series of sodium phosphosilicate glasses with [SiO2]/[SiO2 + P2O5] ranging from 0 to 1. The network structure is characterized by (29)Si and (31)P magic-angle spinning nuclear magnetic resonance and Raman spectroscopy. The results show the formation of six-fold coordinated silicon species in phosphorous-rich glasses. Based on the structural data, we propose a formation mechanism of the six-fold coordinated silicon, which is used to develop a quantitative structural model for predicting the speciation of the network forming units as a function of chemical composition. The structural model is then used to establish a temperature-dependent constraint description of phosphosilicate glass topology that enables prediction of glass transition temperature, liquid fragility, and indentation hardness. The topological constraint model provides insight into structural origin of the mixed network former effect in phosphosilicate glasses.

Hemispheric Asymmetry of Human Brain Anatomical Network Revealed by Diffusion Tensor Tractography

PubMed Central

Liu, Yaou; Duan, Yunyun; Li, Kuncheng

2015-01-01

The topological architecture of the cerebral anatomical network reflects the structural organization of the human brain. Recently, topological measures based on graph theory have provided new approaches for quantifying large-scale anatomical networks. However, few studies have investigated the hemispheric asymmetries of the human brain from the perspective of the network model, and little is known about the asymmetries of the connection patterns of brain regions, which may reflect the functional integration and interaction between different regions. Here, we utilized diffusion tensor imaging to construct binary anatomical networks for 72 right-handed healthy adult subjects. We established the existence of structural connections between any pair of the 90 cortical and subcortical regions using deterministic tractography. To investigate the hemispheric asymmetries of the brain, statistical analyses were performed to reveal the brain regions with significant differences between bilateral topological properties, such as degree of connectivity, characteristic path length, and betweenness centrality. Furthermore, local structural connections were also investigated to examine the local asymmetries of some specific white matter tracts. From the perspective of both the global and local connection patterns, we identified the brain regions with hemispheric asymmetries. Combined with the previous studies, we suggested that the topological asymmetries in the anatomical network may reflect the functional lateralization of the human brain. PMID:26539535

AlignNemo: a local network alignment method to integrate homology and topology.

PubMed

Ciriello, Giovanni; Mina, Marco; Guzzi, Pietro H; Cannataro, Mario; Guerra, Concettina

2012-01-01

Local network alignment is an important component of the analysis of protein-protein interaction networks that may lead to the identification of evolutionary related complexes. We present AlignNemo, a new algorithm that, given the networks of two organisms, uncovers subnetworks of proteins that relate in biological function and topology of interactions. The discovered conserved subnetworks have a general topology and need not to correspond to specific interaction patterns, so that they more closely fit the models of functional complexes proposed in the literature. The algorithm is able to handle sparse interaction data with an expansion process that at each step explores the local topology of the networks beyond the proteins directly interacting with the current solution. To assess the performance of AlignNemo, we ran a series of benchmarks using statistical measures as well as biological knowledge. Based on reference datasets of protein complexes, AlignNemo shows better performance than other methods in terms of both precision and recall. We show our solutions to be biologically sound using the concept of semantic similarity applied to Gene Ontology vocabularies. The binaries of AlignNemo and supplementary details about the algorithms and the experiments are available at: sourceforge.net/p/alignnemo.

Inclusion of Topological Measurements into Analytic Estimates of Effective Permeability in Fractured Media

NASA Astrophysics Data System (ADS)

Sævik, P. N.; Nixon, C. W.

2017-11-01

We demonstrate how topology-based measures of connectivity can be used to improve analytical estimates of effective permeability in 2-D fracture networks, which is one of the key parameters necessary for fluid flow simulations at the reservoir scale. Existing methods in this field usually compute fracture connectivity using the average fracture length. This approach is valid for ideally shaped, randomly distributed fractures, but is not immediately applicable to natural fracture networks. In particular, natural networks tend to be more connected than randomly positioned fractures of comparable lengths, since natural fractures often terminate in each other. The proposed topological connectivity measure is based on the number of intersections and fracture terminations per sampling area, which for statistically stationary networks can be obtained directly from limited outcrop exposures. To evaluate the method, numerical permeability upscaling was performed on a large number of synthetic and natural fracture networks, with varying topology and geometry. The proposed method was seen to provide much more reliable permeability estimates than the length-based approach, across a wide range of fracture patterns. We summarize our results in a single, explicit formula for the effective permeability.

Does network topology influence systemic risk contribution? A perspective from the industry indices in Chinese stock market.

PubMed

Long, Haiming; Zhang, Ji; Tang, Nengyu

2017-01-01

This study considers the effect of an industry's network topology on its systemic risk contribution to the stock market using data from the CSI 300 two-tier industry indices from the Chinese stock market. We first measure industry's conditional-value-at-risk (CoVaR) and the systemic risk contribution (ΔCoVaR) using the fitted time-varying t-copula function. The network of the stock industry is established based on dynamic conditional correlations with the minimum spanning tree. Then, we investigate the connection characteristics and topology of the network. Finally, we utilize seemingly unrelated regression estimation (SUR) of panel data to analyze the relationship between network topology of the stock industry and the industry's systemic risk contribution. The results show that the systemic risk contribution of small-scale industries such as real estate, food and beverage, software services, and durable goods and clothing, is higher than that of large-scale industries, such as banking, insurance and energy. Industries with large betweenness centrality, closeness centrality, and clustering coefficient and small node occupancy layer are associated with greater systemic risk contribution. In addition, further analysis using a threshold model confirms that the results are robust.

EEG functional network topology is associated with disability in patients with amyotrophic lateral sclerosis

NASA Astrophysics Data System (ADS)

Fraschini, Matteo; Demuru, Matteo; Hillebrand, Arjan; Cuccu, Lorenza; Porcu, Silvia; di Stefano, Francesca; Puligheddu, Monica; Floris, Gianluca; Borghero, Giuseppe; Marrosu, Francesco

2016-12-01

Amyotrophic Lateral Sclerosis (ALS) is one of the most severe neurodegenerative diseases, which is known to affect upper and lower motor neurons. In contrast to the classical tenet that ALS represents the outcome of extensive and progressive impairment of a fixed set of motor connections, recent neuroimaging findings suggest that the disease spreads along vast non-motor connections. Here, we hypothesised that functional network topology is perturbed in ALS, and that this reorganization is associated with disability. We tested this hypothesis in 21 patients affected by ALS at several stages of impairment using resting-state electroencephalography (EEG) and compared the results to 16 age-matched healthy controls. We estimated functional connectivity using the Phase Lag Index (PLI), and characterized the network topology using the minimum spanning tree (MST). We found a significant difference between groups in terms of MST dissimilarity and MST leaf fraction in the beta band. Moreover, some MST parameters (leaf, hierarchy and kappa) significantly correlated with disability. These findings suggest that the topology of resting-state functional networks in ALS is affected by the disease in relation to disability. EEG network analysis may be of help in monitoring and evaluating the clinical status of ALS patients.

Slow, bursty dynamics as a consequence of quenched network topologies

NASA Astrophysics Data System (ADS)

Ådor, Géza

2014-04-01

Bursty dynamics of agents is shown to appear at criticality or in extended Griffiths phases, even in case of Poisson processes. I provide numerical evidence for a power-law type of intercommunication time distributions by simulating the contact process and the susceptible-infected-susceptible model. This observation suggests that in the case of nonstationary bursty systems, the observed non-Poissonian behavior can emerge as a consequence of an underlying hidden Poissonian network process, which is either critical or exhibits strong rare-region effects. On the contrary, in time-varying networks, rare-region effects do not cause deviation from the mean-field behavior, and heterogeneity-induced burstyness is absent.

Slow, bursty dynamics as a consequence of quenched network topologies.

PubMed

Ódor, Géza

2014-04-01

Bursty dynamics of agents is shown to appear at criticality or in extended Griffiths phases, even in case of Poisson processes. I provide numerical evidence for a power-law type of intercommunication time distributions by simulating the contact process and the susceptible-infected-susceptible model. This observation suggests that in the case of nonstationary bursty systems, the observed non-Poissonian behavior can emerge as a consequence of an underlying hidden Poissonian network process, which is either critical or exhibits strong rare-region effects. On the contrary, in time-varying networks, rare-region effects do not cause deviation from the mean-field behavior, and heterogeneity-induced burstyness is absent.

A stochastic and dynamical view of pluripotency in mouse embryonic stem cells

PubMed Central

Lee, Esther J.

2018-01-01

Pluripotent embryonic stem cells are of paramount importance for biomedical sciences because of their innate ability for self-renewal and differentiation into all major cell lines. The fateful decision to exit or remain in the pluripotent state is regulated by complex genetic regulatory networks. The rapid growth of single-cell sequencing data has greatly stimulated applications of statistical and machine learning methods for inferring topologies of pluripotency regulating genetic networks. The inferred network topologies, however, often only encode Boolean information while remaining silent about the roles of dynamics and molecular stochasticity inherent in gene expression. Herein we develop a framework for systematically extending Boolean-level network topologies into higher resolution models of networks which explicitly account for the promoter architectures and gene state switching dynamics. We show the framework to be useful for disentangling the various contributions that gene switching, external signaling, and network topology make to the global heterogeneity and dynamics of transcription factor populations. We find the pluripotent state of the network to be a steady state which is robust to global variations of gene switching rates which we argue are a good proxy for epigenetic states of individual promoters. The temporal dynamics of exiting the pluripotent state, on the other hand, is significantly influenced by the rates of genetic switching which makes cells more responsive to changes in extracellular signals. PMID:29451874

Graph theoretical modeling of baby brain networks.

PubMed

Zhao, Tengda; Xu, Yuehua; He, Yong

2018-06-12

The human brain undergoes explosive growth during the prenatal period and the first few postnatal years, establishing an early infrastructure for the later development of behaviors and cognitions. Revealing the developmental rules during the early phrase is essential in understanding the emergence of brain function and the origin of developmental disorders. The graph-theoretical network modeling in combination with multiple neuroimaging probes provides an important research framework to explore early development of the topological wiring and organizational paradigms of the brain. Here, we reviewed studies which employed neuroimaging and graph-theoretical modeling to investigate brain network development from approximately 20 gestational weeks to 2 years of age. Specifically, the structural and functional brain networks have evolved to highly efficient topological architectures in the early stage; where the structural network remains ahead and paves the way for the development of functional network. The brain network develops in a heterogeneous order, from primary to higher-order systems and from a tendency of network segregation to network integration in the prenatal and postnatal periods. The early brain network topologies show abilities in predicting certain cognitive and behavior performance in later life, and their impairments are likely to continue into childhood and even adulthood. These macroscopic topological changes are found to be associated with possible microstructural maturations, such as axonal growth and myelinations. Collectively, this review provides a detailed delineation of the early changes of the baby brains in the graph-theoretical modeling framework, which opens up a new avenue to understand the developmental principles of the connectome. Copyright © 2018. Published by Elsevier Inc.

Fault-Tolerant Algorithms for Connectivity Restoration in Wireless Sensor Networks.

PubMed

Zeng, Yali; Xu, Li; Chen, Zhide

2015-12-22

As wireless sensor network (WSN) is often deployed in a hostile environment, nodes in the networks are prone to large-scale failures, resulting in the network not working normally. In this case, an effective restoration scheme is needed to restore the faulty network timely. Most of existing restoration schemes consider more about the number of deployed nodes or fault tolerance alone, but fail to take into account the fact that network coverage and topology quality are also important to a network. To address this issue, we present two algorithms named Full 2-Connectivity Restoration Algorithm (F2CRA) and Partial 3-Connectivity Restoration Algorithm (P3CRA), which restore a faulty WSN in different aspects. F2CRA constructs the fan-shaped topology structure to reduce the number of deployed nodes, while P3CRA constructs the dual-ring topology structure to improve the fault tolerance of the network. F2CRA is suitable when the restoration cost is given the priority, and P3CRA is suitable when the network quality is considered first. Compared with other algorithms, these two algorithms ensure that the network has stronger fault-tolerant function, larger coverage area and better balanced load after the restoration.

Distributed Dynamic Host Configuration Protocol (D2HCP)

PubMed Central

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

Distributed Dynamic Host Configuration Protocol (D2HCP).

PubMed

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment.

Inferring Time-Varying Network Topologies from Gene Expression Data

PubMed Central

2007-01-01

Most current methods for gene regulatory network identification lead to the inference of steady-state networks, that is, networks prevalent over all times, a hypothesis which has been challenged. There has been a need to infer and represent networks in a dynamic, that is, time-varying fashion, in order to account for different cellular states affecting the interactions amongst genes. In this work, we present an approach, regime-SSM, to understand gene regulatory networks within such a dynamic setting. The approach uses a clustering method based on these underlying dynamics, followed by system identification using a state-space model for each learnt cluster—to infer a network adjacency matrix. We finally indicate our results on the mouse embryonic kidney dataset as well as the T-cell activation-based expression dataset and demonstrate conformity with reported experimental evidence. PMID:18309363

Inferring time-varying network topologies from gene expression data.

PubMed

Rao, Arvind; Hero, Alfred O; States, David J; Engel, James Douglas

2007-01-01

Most current methods for gene regulatory network identification lead to the inference of steady-state networks, that is, networks prevalent over all times, a hypothesis which has been challenged. There has been a need to infer and represent networks in a dynamic, that is, time-varying fashion, in order to account for different cellular states affecting the interactions amongst genes. In this work, we present an approach, regime-SSM, to understand gene regulatory networks within such a dynamic setting. The approach uses a clustering method based on these underlying dynamics, followed by system identification using a state-space model for each learnt cluster--to infer a network adjacency matrix. We finally indicate our results on the mouse embryonic kidney dataset as well as the T-cell activation-based expression dataset and demonstrate conformity with reported experimental evidence.

Effect of Field Spread on Resting-State Magneto Encephalography Functional Network Analysis: A Computational Modeling Study.

PubMed

Silva Pereira, Silvana; Hindriks, Rikkert; Mühlberg, Stefanie; Maris, Eric; van Ede, Freek; Griffa, Alessandra; Hagmann, Patric; Deco, Gustavo

2017-11-01

A popular way to analyze resting-state electroencephalography (EEG) and magneto encephalography (MEG) data is to treat them as a functional network in which sensors are identified with nodes and the interaction between channel time series and the network connections. Although conceptually appealing, the network-theoretical approach to sensor-level EEG and MEG data is challenged by the fact that EEG and MEG time series are mixtures of source activity. It is, therefore, of interest to assess the relationship between functional networks of source activity and the ensuing sensor-level networks. Since these topological features are of high interest in experimental studies, we address the question of to what extent the network topology can be reconstructed from sensor-level functional connectivity (FC) measures in case of MEG data. Simple simulations that consider only a small number of regions do not allow to assess network properties; therefore, we use a diffusion magnetic resonance imaging-constrained whole-brain computational model of resting-state activity. Our motivation lies behind the fact that still many contributions found in the literature perform network analysis at sensor level, and we aim at showing the discrepancies between source- and sensor-level network topologies by using realistic simulations of resting-state cortical activity. Our main findings are that the effect of field spread on network topology depends on the type of interaction (instantaneous or lagged) and leads to an underestimation of lagged FC at sensor level due to instantaneous mixing of cortical signals, instantaneous interaction is more sensitive to field spread than lagged interaction, and discrepancies are reduced when using planar gradiometers rather than axial gradiometers. We, therefore, recommend using lagged interaction measures on planar gradiometer data when investigating network properties of resting-state sensor-level MEG data.

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

NASA Astrophysics Data System (ADS)

Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

2015-11-01

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively implement neighbourhood-based link prediction entirely in the bipartite domain.

Optimization of controllability and robustness of complex networks by edge directionality

NASA Astrophysics Data System (ADS)

Liang, Man; Jin, Suoqin; Wang, Dingjie; Zou, Xiufen

2016-09-01

Recently, controllability of complex networks has attracted enormous attention in various fields of science and engineering. How to optimize structural controllability has also become a significant issue. Previous studies have shown that an appropriate directional assignment can improve structural controllability; however, the evolution of the structural controllability of complex networks under attacks and cascading has always been ignored. To address this problem, this study proposes a new edge orientation method (NEOM) based on residual degree that changes the link direction while conserving topology and directionality. By comparing the results with those of previous methods in two random graph models and several realistic networks, our proposed approach is demonstrated to be an effective and competitive method for improving the structural controllability of complex networks. Moreover, numerical simulations show that our method is near-optimal in optimizing structural controllability. Strikingly, compared to the original network, our method maintains the structural controllability of the network under attacks and cascading, indicating that the NEOM can also enhance the robustness of controllability of networks. These results alter the view of the nature of controllability in complex networks, change the understanding of structural controllability and affect the design of network models to control such networks.

Going End to End to Deliver High-Speed Data

NASA Technical Reports Server (NTRS)

2005-01-01

By the end of the 1990s, the optical fiber "backbone" of the telecommunication and data-communication networks had evolved from megabits-per-second transmission rates to gigabits-per-second transmission rates. Despite this boom in bandwidth, however, users at the end nodes were still not being reached on a consistent basis. (An end node is any device that does not behave like a router or a managed hub or switch. Examples of end node objects are computers, printers, serial interface processor phones, and unmanaged hubs and switches.) The primary reason that prevents bandwidth from reaching the end nodes is the complex local network topology that exists between the optical backbone and the end nodes. This complex network topology consists of several layers of routing and switch equipment which introduce potential congestion points and network latency. By breaking down the complex network topology, a true optical connection can be achieved. Access Optical Networks, Inc., is making this connection a reality with guidance from NASA s nondestructive evaluation experts.

Reconstruction and topological characterization of the sigma factor regulatory network of Mycobacterium tuberculosis

PubMed Central

Chauhan, Rinki; Ravi, Janani; Datta, Pratik; Chen, Tianlong; Schnappinger, Dirk; Bassler, Kevin E.; Balázsi, Gábor; Gennaro, Maria Laura

2016-01-01

Accessory sigma factors, which reprogram RNA polymerase to transcribe specific gene sets, activate bacterial adaptive responses to noxious environments. Here we reconstruct the complete sigma factor regulatory network of the human pathogen Mycobacterium tuberculosis by an integrated approach. The approach combines identification of direct regulatory interactions between M. tuberculosis sigma factors in an E. coli model system, validation of selected links in M. tuberculosis, and extensive literature review. The resulting network comprises 41 direct interactions among all 13 sigma factors. Analysis of network topology reveals (i) a three-tiered hierarchy initiating at master regulators, (ii) high connectivity and (iii) distinct communities containing multiple sigma factors. These topological features are likely associated with multi-layer signal processing and specialized stress responses involving multiple sigma factors. Moreover, the identification of overrepresented network motifs, such as autoregulation and coregulation of sigma and anti-sigma factor pairs, provides structural information that is relevant for studies of network dynamics. PMID:27029515

Dynamical Interplay between Awareness and Epidemic Spreading in Multiplex Networks

NASA Astrophysics Data System (ADS)

Granell, Clara; Gómez, Sergio; Arenas, Alex

2013-09-01

We present the analysis of the interrelation between two processes accounting for the spreading of an epidemic, and the information awareness to prevent its infection, on top of multiplex networks. This scenario is representative of an epidemic process spreading on a network of persistent real contacts, and a cyclic information awareness process diffusing in the network of virtual social contacts between the same individuals. The topology corresponds to a multiplex network where two diffusive processes are interacting affecting each other. The analysis using a microscopic Markov chain approach reveals the phase diagram of the incidence of the epidemics and allows us to capture the evolution of the epidemic threshold depending on the topological structure of the multiplex and the interrelation with the awareness process. Interestingly, the critical point for the onset of the epidemics has a critical value (metacritical point) defined by the awareness dynamics and the topology of the virtual network, from which the onset increases and the epidemics incidence decreases.

Dynamical interplay between awareness and epidemic spreading in multiplex networks.

PubMed

Granell, Clara; Gómez, Sergio; Arenas, Alex

2013-09-20

We present the analysis of the interrelation between two processes accounting for the spreading of an epidemic, and the information awareness to prevent its infection, on top of multiplex networks. This scenario is representative of an epidemic process spreading on a network of persistent real contacts, and a cyclic information awareness process diffusing in the network of virtual social contacts between the same individuals. The topology corresponds to a multiplex network where two diffusive processes are interacting affecting each other. The analysis using a microscopic Markov chain approach reveals the phase diagram of the incidence of the epidemics and allows us to capture the evolution of the epidemic threshold depending on the topological structure of the multiplex and the interrelation with the awareness process. Interestingly, the critical point for the onset of the epidemics has a critical value (metacritical point) defined by the awareness dynamics and the topology of the virtual network, from which the onset increases and the epidemics incidence decreases.

APHiD: Hierarchical Task Placement to Enable a Tapered Fat Tree Topology for Lower Power and Cost in HPC Networks

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

Michelogiannakis, George; Ibrahim, Khaled Z.; Shalf, John

The power and procurement cost of bandwidth in system-wide networks has forced a steady drop in the byte/flop ratio. This trend of computation becoming faster relative to the network is expected to hold. In this paper, we explore how cost-oriented task placement enables reducing the cost of system-wide networks by enabling high performance even on tapered topologies where more bandwidth is provisioned at lower levels. We describe APHiD, an efficient hierarchical placement algorithm that uses new techniques to improve the quality of heuristic solutions and reduces the demand on high-level, expensive bandwidth in hierarchical topologies. We apply APHiD to amore » tapered fat-tree, demonstrating that APHiD maintains application scalability even for severely tapered network configurations. Using simulation, we show that for tapered networks APHiD improves performance by more than 50% over random placement and even 15% in some cases over costlier, state-of-the-art placement algorithms.« less

Dynamic Evolution of Financial Network and its Relation to Economic Crises

NASA Astrophysics Data System (ADS)

Gao, Ya-Chun; Wei, Zong-Wen; Wang, Bing-Hong

2013-02-01

The static topology properties of financial networks have been widely investigated since the work done by Mantegna, yet their dynamic evolution with time is little considered. In this paper, we comprehensively study the dynamic evolution of financial network by a sliding window technique. The vertices and edges of financial network are represented by the stocks from S&P500 components and correlations between pairs of daily returns of price fluctuation, respectively. Furthermore, the duration of stock price fluctuation, spanning from January 4, 1985 to September 14, 2009, makes us to carefully observe the relation between the dynamic topological properties and big financial crashes. The empirical results suggest that the financial network has the robust small-world property when the time evolves, and the topological structure drastically changes when the big financial crashes occur. This correspondence between the dynamic evolution of financial network and big financial crashes may provide a novel view to understand the origin of economic crisis.

Effects of topologies on signal propagation in feedforward networks

NASA Astrophysics Data System (ADS)

Zhao, Jia; Qin, Ying-Mei; Che, Yan-Qiu

2018-01-01

We systematically investigate the effects of topologies on signal propagation in feedforward networks (FFNs) based on the FitzHugh-Nagumo neuron model. FFNs with different topological structures are constructed with same number of both in-degrees and out-degrees in each layer and given the same input signal. The propagation of firing patterns and firing rates are found to be affected by the distribution of neuron connections in the FFNs. Synchronous firing patterns emerge in the later layers of FFNs with identical, uniform, and exponential degree distributions, but the number of synchronous spike trains in the output layers of the three topologies obviously differs from one another. The firing rates in the output layers of the three FFNs can be ordered from high to low according to their topological structures as exponential, uniform, and identical distributions, respectively. Interestingly, the sequence of spiking regularity in the output layers of the three FFNs is consistent with the firing rates, but their firing synchronization is in the opposite order. In summary, the node degree is an important factor that can dramatically influence the neuronal network activity.

Effects of topologies on signal propagation in feedforward networks.

PubMed

Zhao, Jia; Qin, Ying-Mei; Che, Yan-Qiu

2018-01-01

We systematically investigate the effects of topologies on signal propagation in feedforward networks (FFNs) based on the FitzHugh-Nagumo neuron model. FFNs with different topological structures are constructed with same number of both in-degrees and out-degrees in each layer and given the same input signal. The propagation of firing patterns and firing rates are found to be affected by the distribution of neuron connections in the FFNs. Synchronous firing patterns emerge in the later layers of FFNs with identical, uniform, and exponential degree distributions, but the number of synchronous spike trains in the output layers of the three topologies obviously differs from one another. The firing rates in the output layers of the three FFNs can be ordered from high to low according to their topological structures as exponential, uniform, and identical distributions, respectively. Interestingly, the sequence of spiking regularity in the output layers of the three FFNs is consistent with the firing rates, but their firing synchronization is in the opposite order. In summary, the node degree is an important factor that can dramatically influence the neuronal network activity.

Discriminating topology in galaxy distributions using network analysis

NASA Astrophysics Data System (ADS)

Hong, Sungryong; Coutinho, Bruno C.; Dey, Arjun; Barabási, Albert-L.; Vogelsberger, Mark; Hernquist, Lars; Gebhardt, Karl

2016-07-01

The large-scale distribution of galaxies is generally analysed using the two-point correlation function. However, this statistic does not capture the topology of the distribution, and it is necessary to resort to higher order correlations to break degeneracies. We demonstrate that an alternate approach using network analysis can discriminate between topologically different distributions that have similar two-point correlations. We investigate two galaxy point distributions, one produced by a cosmological simulation and the other by a Lévy walk. For the cosmological simulation, we adopt the redshift z = 0.58 slice from Illustris and select galaxies with stellar masses greater than 108 M⊙. The two-point correlation function of these simulated galaxies follows a single power law, ξ(r) ˜ r-1.5. Then, we generate Lévy walks matching the correlation function and abundance with the simulated galaxies. We find that, while the two simulated galaxy point distributions have the same abundance and two-point correlation function, their spatial distributions are very different; most prominently, filamentary structures, absent in Lévy fractals. To quantify these missing topologies, we adopt network analysis tools and measure diameter, giant component, and transitivity from networks built by a conventional friends-of-friends recipe with various linking lengths. Unlike the abundance and two-point correlation function, these network quantities reveal a clear separation between the two simulated distributions; therefore, the galaxy distribution simulated by Illustris is not a Lévy fractal quantitatively. We find that the described network quantities offer an efficient tool for discriminating topologies and for comparing observed and theoretical distributions.

Organizational topology of brain and its relationship to ADHD in adolescents with d-transposition of the great arteries.

PubMed

Schmithorst, Vincent J; Panigrahy, Ashok; Gaynor, J William; Watson, Christopher G; Lee, Vince; Bellinger, David C; Rivkin, Michael J; Newburger, Jane W

2016-08-01

Little is currently known about the impact of congenital heart disease (CHD) on the organization of large-scale brain networks in relation to neurobehavioral outcome. We investigated whether CHD might impact ADHD symptoms via changes in brain structural network topology in a cohort of adolescents with d-transposition of the great arteries (d-TGA) repaired with the arterial switch operation in early infancy and referent subjects. We also explored whether these effects might be modified by apolipoprotein E (APOE) genotype, as the APOE ε2 allele has been associated with worse neurodevelopmental outcomes after repair of d-TGA in infancy. We applied graph analysis techniques to diffusion tensor imaging (DTI) data obtained from 47 d-TGA adolescents and 29 healthy referents to construct measures of structural topology at the global and regional levels. We developed statistical mediation models revealing the respective contributions of d-TGA, APOE genotype, and structural network topology on ADHD outcome as measured by the Connors ADHD/DSM-IV Scales (CADS). Changes in overall network connectivity, integration, and segregation mediated worse ADHD outcomes in d-TGA patients compared to healthy referents; these changes were predominantly in the left and right intrahemispheric regional subnetworks. Exploratory analysis revealed that network topology also mediated detrimental effects of the APOE ε4 allele but improved neurobehavioral outcomes for the APOE ε2 allele. Our results suggest that disruption of organization of large-scale networks may contribute to neurobehavioral dysfunction in adolescents with CHD and that this effect may interact with APOE genotype.

Graph theoretical analysis reveals disrupted topological properties of whole brain functional networks in temporal lobe epilepsy.

PubMed

Wang, Junjing; Qiu, Shijun; Xu, Yong; Liu, Zhenyin; Wen, Xue; Hu, Xiangshu; Zhang, Ruibin; Li, Meng; Wang, Wensheng; Huang, Ruiwang

2014-09-01

Temporal lobe epilepsy (TLE) is one of the most common forms of drug-resistant epilepsy. Previous studies have indicated that the TLE-related impairments existed in extensive local functional networks. However, little is known about the alterations in the topological properties of whole brain functional networks. In this study, we acquired resting-state BOLD-fMRI (rsfMRI) data from 26 TLE patients and 25 healthy controls, constructed their whole brain functional networks, compared the differences in topological parameters between the TLE patients and the controls, and analyzed the correlation between the altered topological properties and the epilepsy duration. The TLE patients showed significant increases in clustering coefficient and characteristic path length, but significant decrease in global efficiency compared to the controls. We also found altered nodal parameters in several regions in the TLE patients, such as the bilateral angular gyri, left middle temporal gyrus, right hippocampus, triangular part of left inferior frontal gyrus, left inferior parietal but supramarginal and angular gyri, and left parahippocampus gyrus. Further correlation analysis showed that the local efficiency of the TLE patients correlated positively with the epilepsy duration. Our results indicated the disrupted topological properties of whole brain functional networks in TLE patients. Our findings indicated the TLE-related impairments in the whole brain functional networks, which may help us to understand the clinical symptoms of TLE patients and offer a clue for the diagnosis and treatment of the TLE patients. Copyright © 2014 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

Hierarchical sequencing of online social graphs

NASA Astrophysics Data System (ADS)

Andjelković, Miroslav; Tadić, Bosiljka; Maletić, Slobodan; Rajković, Milan

2015-10-01

In online communications, patterns of conduct of individual actors and use of emotions in the process can lead to a complex social graph exhibiting multilayered structure and mesoscopic communities. Using simplicial complexes representation of graphs, we investigate in-depth topology of the online social network constructed from MySpace dialogs which exhibits original community structure. A simulation of emotion spreading in this network leads to the identification of two emotion-propagating layers. Three topological measures are introduced, referred to as the structure vectors, which quantify graph's architecture at different dimension levels. Notably, structures emerging through shared links, triangles and tetrahedral faces, frequently occur and range from tree-like to maximal 5-cliques and their respective complexes. On the other hand, the structures which spread only negative or only positive emotion messages appear to have much simpler topology consisting of links and triangles. The node's structure vector represents the number of simplices at each topology level in which the node resides and the total number of such simplices determines what we define as the node's topological dimension. The presented results suggest that the node's topological dimension provides a suitable measure of the social capital which measures the actor's ability to act as a broker in compact communities, the so called Simmelian brokerage. We also generalize the results to a wider class of computer-generated networks. Investigating components of the node's vector over network layers reveals that same nodes develop different socio-emotional relations and that the influential nodes build social capital by combining their connections in different layers.

Effects of stream topology on ecological community results from neutral models

EPA Science Inventory

While neutral theory and models have stimulated considerable literature, less well investigated is the effect of topology on neutral metacommunity model simulations. We implemented a neutral metacommunity model using two different stream network topologies, a widely branched netw...

Minimum curvilinearity to enhance topological prediction of protein interactions by network embedding

PubMed Central

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

2013-01-01

Motivation: Most functions within the cell emerge thanks to protein–protein interactions (PPIs), yet experimental determination of PPIs is both expensive and time-consuming. PPI networks present significant levels of noise and incompleteness. Predicting interactions using only PPI-network topology (topological prediction) is difficult but essential when prior biological knowledge is absent or unreliable. Methods: Network embedding emphasizes the relations between network proteins embedded in a low-dimensional space, in which protein pairs that are closer to each other represent good candidate interactions. To achieve network denoising, which boosts prediction performance, we first applied minimum curvilinear embedding (MCE), and then adopted shortest path (SP) in the reduced space to assign likelihood scores to candidate interactions. Furthermore, we introduce (i) a new valid variation of MCE, named non-centred MCE (ncMCE); (ii) two automatic strategies for selecting the appropriate embedding dimension; and (iii) two new randomized procedures for evaluating predictions. Results: We compared our method against several unsupervised and supervisedly tuned embedding approaches and node neighbourhood techniques. Despite its computational simplicity, ncMCE-SP was the overall leader, outperforming the current methods in topological link prediction. Conclusion: Minimum curvilinearity is a valuable non-linear framework that we successfully applied to the embedding of protein networks for the unsupervised prediction of novel PPIs. The rationale for our approach is that biological and evolutionary information is imprinted in the non-linear patterns hidden behind the protein network topology, and can be exploited for predicting new protein links. The predicted PPIs represent good candidates for testing in high-throughput experiments or for exploitation in systems biology tools such as those used for network-based inference and prediction of disease-related functional modules. Availability: https://sites.google.com/site/carlovittoriocannistraci/home Contact: kalokagathos.agon@gmail.com or timothy.ravasi@kaust.edu.sa Supplementary information: Supplementary data are available at Bioinformatics online. PMID:23812985

Methods of information geometry in computational system biology (consistency between chemical and biological evolution).

PubMed

Astakhov, Vadim

2009-01-01

Interest in simulation of large-scale metabolic networks, species development, and genesis of various diseases requires new simulation techniques to accommodate the high complexity of realistic biological networks. Information geometry and topological formalisms are proposed to analyze information processes. We analyze the complexity of large-scale biological networks as well as transition of the system functionality due to modification in the system architecture, system environment, and system components. The dynamic core model is developed. The term dynamic core is used to define a set of causally related network functions. Delocalization of dynamic core model provides a mathematical formalism to analyze migration of specific functions in biosystems which undergo structure transition induced by the environment. The term delocalization is used to describe these processes of migration. We constructed a holographic model with self-poetic dynamic cores which preserves functional properties under those transitions. Topological constraints such as Ricci flow and Pfaff dimension were found for statistical manifolds which represent biological networks. These constraints can provide insight on processes of degeneration and recovery which take place in large-scale networks. We would like to suggest that therapies which are able to effectively implement estimated constraints, will successfully adjust biological systems and recover altered functionality. Also, we mathematically formulate the hypothesis that there is a direct consistency between biological and chemical evolution. Any set of causal relations within a biological network has its dual reimplementation in the chemistry of the system environment.

Resilient Wireless Sensor Networks Using Topology Control: A Review

PubMed Central

Huang, Yuanjiang; Martínez, José-Fernán; Sendra, Juana; López, Lourdes

2015-01-01

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs. PMID:26404272

Intermittent and sustained periodic windows in networked chaotic Rössler oscillators

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

He, Zhiwei; Sun, Yong; University of the Chinese Academy of Sciences, Beijing 100049

Route to chaos (or periodicity) in dynamical systems is one of fundamental problems. Here, dynamical behaviors of coupled chaotic Rössler oscillators on complex networks are investigated and two different types of periodic windows with the variation of coupling strength are found. Under a moderate coupling, the periodic window is intermittent, and the attractors within the window extremely sensitively depend on the initial conditions, coupling parameter, and topology of the network. Therefore, after adding or removing one edge of network, the periodic attractor can be destroyed and substituted by a chaotic one, or vice versa. In contrast, under an extremely weakmore » coupling, another type of periodic window appears, which insensitively depends on the initial conditions, coupling parameter, and network. It is sustained and unchanged for different types of network structure. It is also found that the phase differences of the oscillators are almost discrete and randomly distributed except that directly linked oscillators more likely have different phases. These dynamical behaviors have also been generally observed in other networked chaotic oscillators.« less