Structure-based control of complex networks with nonlinear dynamics.

PubMed

Zañudo, Jorge Gomez Tejeda; Yang, Gang; Albert, Réka

2017-07-11

What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.

Major component analysis of dynamic networks of physiologic organ interactions

NASA Astrophysics Data System (ADS)

Liu, Kang K. L.; Bartsch, Ronny P.; Ma, Qianli D. Y.; Ivanov, Plamen Ch

2015-09-01

The human organism is a complex network of interconnected organ systems, where the behavior of one system affects the dynamics of other systems. Identifying and quantifying dynamical networks of diverse physiologic systems under varied conditions is a challenge due to the complexity in the output dynamics of the individual systems and the transient and nonlinear characteristics of their coupling. We introduce a novel computational method based on the concept of time delay stability and major component analysis to investigate how organ systems interact as a network to coordinate their functions. We analyze a large database of continuously recorded multi-channel physiologic signals from healthy young subjects during night-time sleep. We identify a network of dynamic interactions between key physiologic systems in the human organism. Further, we find that each physiologic state is characterized by a distinct network structure with different relative contribution from individual organ systems to the global network dynamics. Specifically, we observe a gradual decrease in the strength of coupling of heart and respiration to the rest of the network with transition from wake to deep sleep, and in contrast, an increased relative contribution to network dynamics from chin and leg muscle tone and eye movement, demonstrating a robust association between network topology and physiologic function.

Structure-based control of complex networks with nonlinear dynamics

NASA Astrophysics Data System (ADS)

Zanudo, Jorge G. T.; Yang, Gang; Albert, Reka

What can we learn about controlling a system solely from its underlying network structure? Here we use a framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors, regardless of the dynamic details and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of classical structural control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case, but not in specific model instances. This work was supported by NSF Grants PHY 1205840 and IIS 1160995. JGTZ is a recipient of a Stand Up To Cancer - The V Foundation Convergence Scholar Award.

Complex networks under dynamic repair model

NASA Astrophysics Data System (ADS)

Chaoqi, Fu; Ying, Wang; Kun, Zhao; Yangjun, Gao

2018-01-01

Invulnerability is not the only factor of importance when considering complex networks' security. It is also critical to have an effective and reasonable repair strategy. Existing research on network repair is confined to the static model. The dynamic model makes better use of the redundant capacity of repaired nodes and repairs the damaged network more efficiently than the static model; however, the dynamic repair model is complex and polytropic. In this paper, we construct a dynamic repair model and systematically describe the energy-transfer relationships between nodes in the repair process of the failure network. Nodes are divided into three types, corresponding to three structures. We find that the strong coupling structure is responsible for secondary failure of the repaired nodes and propose an algorithm that can select the most suitable targets (nodes or links) to repair the failure network with minimal cost. Two types of repair strategies are identified, with different effects under the two energy-transfer rules. The research results enable a more flexible approach to network repair.

Failure and recovery in dynamical networks.

PubMed

Böttcher, L; Luković, M; Nagler, J; Havlin, S; Herrmann, H J

2017-02-03

Failure, damage spread and recovery crucially underlie many spatially embedded networked systems ranging from transportation structures to the human body. Here we study the interplay between spontaneous damage, induced failure and recovery in both embedded and non-embedded networks. In our model the network's components follow three realistic processes that capture these features: (i) spontaneous failure of a component independent of the neighborhood (internal failure), (ii) failure induced by failed neighboring nodes (external failure) and (iii) spontaneous recovery of a component. We identify a metastable domain in the global network phase diagram spanned by the model's control parameters where dramatic hysteresis effects and random switching between two coexisting states are observed. This dynamics depends on the characteristic link length of the embedded system. For the Euclidean lattice in particular, hysteresis and switching only occur in an extremely narrow region of the parameter space compared to random networks. We develop a unifying theory which links the dynamics of our model to contact processes. Our unifying framework may help to better understand controllability in spatially embedded and random networks where spontaneous recovery of components can mitigate spontaneous failure and damage spread in dynamical networks.

Dynamics of Bottlebrush Networks

NASA Astrophysics Data System (ADS)

Cao, Zhen; Daniel, William; Vatankhah-Varnosfaderani, Mohammad; Sheiko, Sergei; Dobrynin, Andrey

The deformation dynamics of bottlebrush networks in a melt state is studied using a combination of theoretical, computational, and experimental techniques. Three main molecular relaxation processes are identified in these systems: (i) relaxation of the side chains, (ii) relaxation of the bottlebrush backbones on length scales shorter than the bottlebrush Kuhn length (bK) , and (iii) relaxation of the bottlebrush network strands between cross-links. The relaxation of side chains having a degree of polymerization (DP), nsc, dominates the network dynamics on the time scales τ0 < t <=τsc , where τ0 and τsc τ0 (nsc + 1)2 are the characteristic relaxation times of monomeric units and side chains, respectively. In this time interval, the shear modulus at small deformations decays with time as G0BB (t) t - 1 / 2. On time scales t >τsc, bottlebrush elastomers behave as networks of filaments with a shear modulus G0BB (t) (nsc + 1)- 1 / 4t - 1 / 2 . Finally, the response of the bottlebrush networks becomes time independent at times scales longer than the Rouse time of the bottlebrush network strands. In this time interval, the network shear modulus depends on the network molecular parameters as G0BB (t) (nsc + 1)-1N-1 . Analysis of the simulation data shows that the stress evolution in the bottlebrush networks during constant strain-rate deformation can be described by a universal function. NSF DMR-1409710, DMR-1407645, DMR-1624569, DMR-1436201.

Identifying Typhoon Tracks based on Event Synchronization derived Spatially Embedded Climate Networks

NASA Astrophysics Data System (ADS)

Ozturk, Ugur; Marwan, Norbert; Kurths, Jürgen

2017-04-01

Complex networks are commonly used for investigating spatiotemporal dynamics of complex systems, e.g. extreme rainfall. Especially directed networks are very effective tools in identifying climatic patterns on spatially embedded networks. They can capture the network flux, so as the principal dynamics of spreading significant phenomena. Network measures, such as network divergence, bare the source-receptor relation of the directed networks. However, it is still a challenge how to catch fast evolving atmospheric events, i.e. typhoons. In this study, we propose a new technique, namely Radial Ranks, to detect the general pattern of typhoons forward direction based on the strength parameter of the event synchronization over Japan. We suggest to subset a circular zone of high correlation around the selected grid based on the strength parameter. Radial sums of the strength parameter along vectors within this zone, radial ranks are measured for potential directions, which allows us to trace the network flux over long distances. We employed also the delay parameter of event synchronization to identify and separate the frontal storms' and typhoons' individual behaviors.

Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics

PubMed Central

Kovács, István A.; Palotai, Robin; Szalay, Máté S.; Csermely, Peter

2010-01-01

Background Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. Methodology/Principal Findings Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1) determine pervasively overlapping modules with high resolution; (2) uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3) allow the determination of key network nodes and (4) help to predict network dynamics. Conclusions/Significance The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction. PMID:20824084

Identifying early-warning signals of critical transitions with strong noise by dynamical network markers

PubMed Central

Liu, Rui; Chen, Pei; Aihara, Kazuyuki; Chen, Luonan

2015-01-01

Identifying early-warning signals of a critical transition for a complex system is difficult, especially when the target system is constantly perturbed by big noise, which makes the traditional methods fail due to the strong fluctuations of the observed data. In this work, we show that the critical transition is not traditional state-transition but probability distribution-transition when the noise is not sufficiently small, which, however, is a ubiquitous case in real systems. We present a model-free computational method to detect the warning signals before such transitions. The key idea behind is a strategy: “making big noise smaller” by a distribution-embedding scheme, which transforms the data from the observed state-variables with big noise to their distribution-variables with small noise, and thus makes the traditional criteria effective because of the significantly reduced fluctuations. Specifically, increasing the dimension of the observed data by moment expansion that changes the system from state-dynamics to probability distribution-dynamics, we derive new data in a higher-dimensional space but with much smaller noise. Then, we develop a criterion based on the dynamical network marker (DNM) to signal the impending critical transition using the transformed higher-dimensional data. We also demonstrate the effectiveness of our method in biological, ecological and financial systems. PMID:26647650

Alignment of dynamic networks

PubMed Central

Vijayan, V.; Critchlow, D.; Milenković, T.

2017-01-01

Abstract Motivation: Network alignment (NA) aims to find a node mapping that conserves similar regions between compared networks. NA is applicable to many fields, including computational biology, where NA can guide the transfer of biological knowledge from well- to poorly-studied species across aligned network regions. Existing NA methods can only align static networks. However, most complex real-world systems evolve over time and should thus be modeled as dynamic networks. We hypothesize that aligning dynamic network representations of evolving systems will produce superior alignments compared to aligning the systems’ static network representations, as is currently done. Results: For this purpose, we introduce the first ever dynamic NA method, DynaMAGNA ++. This proof-of-concept dynamic NA method is an extension of a state-of-the-art static NA method, MAGNA++. Even though both MAGNA++ and DynaMAGNA++ optimize edge as well as node conservation across the aligned networks, MAGNA++ conserves static edges and similarity between static node neighborhoods, while DynaMAGNA++ conserves dynamic edges (events) and similarity between evolving node neighborhoods. For this purpose, we introduce the first ever measure of dynamic edge conservation and rely on our recent measure of dynamic node conservation. Importantly, the two dynamic conservation measures can be optimized with any state-of-the-art NA method and not just MAGNA++. We confirm our hypothesis that dynamic NA is superior to static NA, on synthetic and real-world networks, in computational biology and social domains. DynaMAGNA++ is parallelized and has a user-friendly graphical interface. Availability and implementation: http://nd.edu/∼cone/DynaMAGNA++/. Contact: tmilenko@nd.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28881980

Alignment of dynamic networks.

PubMed

Vijayan, V; Critchlow, D; Milenkovic, T

2017-07-15

Network alignment (NA) aims to find a node mapping that conserves similar regions between compared networks. NA is applicable to many fields, including computational biology, where NA can guide the transfer of biological knowledge from well- to poorly-studied species across aligned network regions. Existing NA methods can only align static networks. However, most complex real-world systems evolve over time and should thus be modeled as dynamic networks. We hypothesize that aligning dynamic network representations of evolving systems will produce superior alignments compared to aligning the systems' static network representations, as is currently done. For this purpose, we introduce the first ever dynamic NA method, DynaMAGNA ++. This proof-of-concept dynamic NA method is an extension of a state-of-the-art static NA method, MAGNA++. Even though both MAGNA++ and DynaMAGNA++ optimize edge as well as node conservation across the aligned networks, MAGNA++ conserves static edges and similarity between static node neighborhoods, while DynaMAGNA++ conserves dynamic edges (events) and similarity between evolving node neighborhoods. For this purpose, we introduce the first ever measure of dynamic edge conservation and rely on our recent measure of dynamic node conservation. Importantly, the two dynamic conservation measures can be optimized with any state-of-the-art NA method and not just MAGNA++. We confirm our hypothesis that dynamic NA is superior to static NA, on synthetic and real-world networks, in computational biology and social domains. DynaMAGNA++ is parallelized and has a user-friendly graphical interface. http://nd.edu/∼cone/DynaMAGNA++/ . tmilenko@nd.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Cell fate reprogramming by control of intracellular network dynamics

NASA Astrophysics Data System (ADS)

Zanudo, Jorge G. T.; Albert, Reka

Identifying control strategies for biological networks is paramount for practical applications that involve reprogramming a cell's fate, such as disease therapeutics and stem cell reprogramming. Although the topic of controlling the dynamics of a system has a long history in control theory, most of this work is not directly applicable to intracellular networks. Here we present a network control method that integrates the structural and functional information available for intracellular networks to predict control targets. Formulated in a logical dynamic scheme, our control method takes advantage of certain function-dependent network components and their relation to steady states in order to identify control targets, which are guaranteed to drive any initial state to the target state with 100% effectiveness and need to be applied only transiently for the system to reach and stay in the desired state. We illustrate our method's potential to find intervention targets for cancer treatment and cell differentiation by applying it to a leukemia signaling network and to the network controlling the differentiation of T cells. We find that the predicted control targets are effective in a broad dynamic framework. Moreover, several of the predicted interventions are supported by experiments. This work was supported by NSF Grant PHY 1205840.

Dynamics on networks: the role of local dynamics and global networks on the emergence of hypersynchronous neural activity.

PubMed

Schmidt, Helmut; Petkov, George; Richardson, Mark P; Terry, John R

2014-11-01

Graph theory has evolved into a useful tool for studying complex brain networks inferred from a variety of measures of neural activity, including fMRI, DTI, MEG and EEG. In the study of neurological disorders, recent work has discovered differences in the structure of graphs inferred from patient and control cohorts. However, most of these studies pursue a purely observational approach; identifying correlations between properties of graphs and the cohort which they describe, without consideration of the underlying mechanisms. To move beyond this necessitates the development of computational modeling approaches to appropriately interpret network interactions and the alterations in brain dynamics they permit, which in the field of complexity sciences is known as dynamics on networks. In this study we describe the development and application of this framework using modular networks of Kuramoto oscillators. We use this framework to understand functional networks inferred from resting state EEG recordings of a cohort of 35 adults with heterogeneous idiopathic generalized epilepsies and 40 healthy adult controls. Taking emergent synchrony across the global network as a proxy for seizures, our study finds that the critical strength of coupling required to synchronize the global network is significantly decreased for the epilepsy cohort for functional networks inferred from both theta (3-6 Hz) and low-alpha (6-9 Hz) bands. We further identify left frontal regions as a potential driver of seizure activity within these networks. We also explore the ability of our method to identify individuals with epilepsy, observing up to 80% predictive power through use of receiver operating characteristic analysis. Collectively these findings demonstrate that a computer model based analysis of routine clinical EEG provides significant additional information beyond standard clinical interpretation, which should ultimately enable a more appropriate mechanistic stratification of people with

Dynamic motifs in socio-economic networks

NASA Astrophysics Data System (ADS)

Zhang, Xin; Shao, Shuai; Stanley, H. Eugene; Havlin, Shlomo

2014-12-01

Socio-economic networks are of central importance in economic life. We develop a method of identifying and studying motifs in socio-economic networks by focusing on “dynamic motifs,” i.e., evolutionary connection patterns that, because of “node acquaintances” in the network, occur much more frequently than random patterns. We examine two evolving bi-partite networks: i) the world-wide commercial ship chartering market and ii) the ship build-to-order market. We find similar dynamic motifs in both bipartite networks, even though they describe different economic activities. We also find that “influence” and “persistence” are strong factors in the interaction behavior of organizations. When two companies are doing business with the same customer, it is highly probable that another customer who currently only has business relationship with one of these two companies, will become customer of the second in the future. This is the effect of influence. Persistence means that companies with close business ties to customers tend to maintain their relationships over a long period of time.

MONOMIALS AND BASIN CYLINDERS FOR NETWORK DYNAMICS.

PubMed

Austin, Daniel; Dinwoodie, Ian H

We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks.

MONOMIALS AND BASIN CYLINDERS FOR NETWORK DYNAMICS

PubMed Central

AUSTIN, DANIEL; DINWOODIE, IAN H

2014-01-01

We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks. PMID:25620893

Identifying Broadband Rotational Spectra with Neural Networks

NASA Astrophysics Data System (ADS)

Zaleski, Daniel P.; Prozument, Kirill

2017-06-01

A typical broadband rotational spectrum may contain several thousand observable transitions, spanning many species. Identifying the individual spectra, particularly when the dynamic range reaches 1,000:1 or even 10,000:1, can be challenging. One approach is to apply automated fitting routines. In this approach, combinations of 3 transitions can be created to form a "triple", which allows fitting of the A, B, and C rotational constants in a Watson-type Hamiltonian. On a standard desktop computer, with a target molecule of interest, a typical AUTOFIT routine takes 2-12 hours depending on the spectral density. A new approach is to utilize machine learning to train a computer to recognize the patterns (frequency spacing and relative intensities) inherit in rotational spectra and to identify the individual spectra in a raw broadband rotational spectrum. Here, recurrent neural networks have been trained to identify different types of rotational spectra and classify them accordingly. Furthermore, early results in applying convolutional neural networks for spectral object recognition in broadband rotational spectra appear promising. Perez et al. "Broadband Fourier transform rotational spectroscopy for structure determination: The water heptamer." Chem. Phys. Lett., 2013, 571, 1-15. Seifert et al. "AUTOFIT, an Automated Fitting Tool for Broadband Rotational Spectra, and Applications to 1-Hexanal." J. Mol. Spectrosc., 2015, 312, 13-21. Bishop. "Neural networks for pattern recognition." Oxford university press, 1995.

Identifying influencers from sampled social networks

NASA Astrophysics Data System (ADS)

Tsugawa, Sho; Kimura, Kazuma

2018-10-01

Identifying influencers who can spread information to many other individuals from a social network is a fundamental research task in the network science research field. Several measures for identifying influencers have been proposed, and the effectiveness of these influence measures has been evaluated for the case where the complete social network structure is known. However, it is difficult in practice to obtain the complete structure of a social network because of missing data, false data, or node/link sampling from the social network. In this paper, we investigate the effects of node sampling from a social network on the effectiveness of influence measures at identifying influencers. Our experimental results show that the negative effect of biased sampling, such as sample edge count, on the identification of influencers is generally small. For social media networks, we can identify influencers whose influence is comparable with that of those identified from the complete social networks by sampling only 10%-30% of the networks. Moreover, our results also suggest the possible benefit of network sampling in the identification of influencers. Our results show that, for some networks, nodes with higher influence can be discovered from sampled social networks than from complete social networks.

Measuring the regulation of keratin filament network dynamics

PubMed Central

Moch, Marcin; Herberich, Gerlind; Aach, Til; Leube, Rudolf E.; Windoffer, Reinhard

2013-01-01

The organization of the keratin intermediate filament cytoskeleton is closely linked to epithelial function. To study keratin network plasticity and its regulation at different levels, tools are needed to localize and measure local network dynamics. In this paper, we present image analysis methods designed to determine the speed and direction of keratin filament motion and to identify locations of keratin filament polymerization and depolymerization at subcellular resolution. Using these methods, we have analyzed time-lapse fluorescence recordings of fluorescent keratin 13 in human vulva carcinoma-derived A431 cells. The fluorescent keratins integrated into the endogenous keratin cytoskeleton, and thereby served as reliable markers of keratin dynamics. We found that increased times after seeding correlated with down-regulation of inward-directed keratin filament movement. Bulk flow analyses further revealed that keratin filament polymerization in the cell periphery and keratin depolymerization in the more central cytoplasm were both reduced. Treating these cells and other human keratinocyte-derived cells with EGF reversed all these processes within a few minutes, coinciding with increased keratin phosphorylation. These results highlight the value of the newly developed tools for identifying modulators of keratin filament network dynamics and characterizing their mode of action, which, in turn, contributes to understanding the close link between keratin filament network plasticity and epithelial physiology. PMID:23757496

Identifying Gatekeepers in Online Learning Networks

ERIC Educational Resources Information Center

Gursakal, Necmi; Bozkurt, Aras

2017-01-01

The rise of the networked society has not only changed our perceptions but also the definitions, roles, processes and dynamics of online learning networks. From offline to online worlds, networks are everywhere and gatekeepers are an important entity in these networks. In this context, the purpose of this paper is to explore gatekeeping and…

Dynamical Networks Characterization of Space Weather Events

NASA Astrophysics Data System (ADS)

Orr, L.; Chapman, S. C.; Dods, J.; Gjerloev, J. W.

2017-12-01

Space weather can cause disturbances to satellite systems, impacting navigation technology and telecommunications; it can cause power loss and aviation disruption. A central aspect of the earth's magnetospheric response to space weather events are large scale and rapid changes in ionospheric current patterns. Space weather is highly dynamic and there are still many controversies about how the current system evolves in time. The recent SuperMAG initiative, collates ground-based vector magnetic field time series from over 200 magnetometers with 1-minute temporal resolution. In principle this combined dataset is an ideal candidate for quantification using dynamical networks. Network properties and parameters allow us to characterize the time dynamics of the full spatiotemporal pattern of the ionospheric current system. However, applying network methodologies to physical data presents new challenges. We establish whether a given pair of magnetometers are connected in the network by calculating their canonical cross correlation. The magnetometers are connected if their cross correlation exceeds a threshold. In our physical time series this threshold needs to be both station specific, as it varies with (non-linear) individual station sensitivity and location, and able to vary with season, which affects ground conductivity. Additionally, the earth rotates and therefore the ground stations move significantly on the timescales of geomagnetic disturbances. The magnetometers are non-uniformly spatially distributed. We will present new methodology which addresses these problems and in particular achieves dynamic normalization of the physical time series in order to form the network. Correlated disturbances across the magnetometers capture transient currents. Once the dynamical network has been obtained [1][2] from the full magnetometer data set it can be used to directly identify detailed inferred transient ionospheric current patterns and track their dynamics. We will show

Dynamic social networks based on movement

USGS Publications Warehouse

Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.

2016-01-01

Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.

Identifying influential spreaders in complex networks based on kshell hybrid method

NASA Astrophysics Data System (ADS)

Namtirtha, Amrita; Dutta, Animesh; Dutta, Biswanath

2018-06-01

Influential spreaders are the key players in maximizing or controlling the spreading in a complex network. Identifying the influential spreaders using kshell decomposition method has become very popular in the recent time. In the literature, the core nodes i.e. with the largest kshell index of a network are considered as the most influential spreaders. We have studied the kshell method and spreading dynamics of nodes using Susceptible-Infected-Recovered (SIR) epidemic model to understand the behavior of influential spreaders in terms of its topological location in the network. From the study, we have found that every node in the core area is not the most influential spreader. Even a strategically placed lower shell node can also be a most influential spreader. Moreover, the core area can also be situated at the periphery of the network. The existing indexing methods are only designed to identify the most influential spreaders from core nodes and not from lower shells. In this work, we propose a kshell hybrid method to identify highly influential spreaders not only from the core but also from lower shells. The proposed method comprises the parameters such as kshell power, node's degree, contact distance, and many levels of neighbors' influence potential. The proposed method is evaluated using nine real world network datasets. In terms of the spreading dynamics, the experimental results show the superiority of the proposed method over the other existing indexing methods such as the kshell method, the neighborhood coreness centrality, the mixed degree decomposition, etc. Furthermore, the proposed method can also be applied to large-scale networks by considering the three levels of neighbors' influence potential.

Identifying key nodes in multilayer networks based on tensor decomposition.

PubMed

Wang, Dingjie; Wang, Haitao; Zou, Xiufen

2017-06-01

The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

Identifying key nodes in multilayer networks based on tensor decomposition

NASA Astrophysics Data System (ADS)

Wang, Dingjie; Wang, Haitao; Zou, Xiufen

2017-06-01

The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

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

Entropy of dynamical social networks

NASA Astrophysics Data System (ADS)

Zhao, Kun; Karsai, Marton; Bianconi, Ginestra

2012-02-01

Dynamical social networks are evolving rapidly and are highly adaptive. Characterizing the information encoded in social networks is essential to gain insight into the structure, evolution, adaptability and dynamics. Recently entropy measures have been used to quantify the information in email correspondence, static networks and mobility patterns. Nevertheless, we still lack methods to quantify the information encoded in time-varying dynamical social networks. In this talk we present a model to quantify the entropy of dynamical social networks and use this model to analyze the data of phone-call communication. We show evidence that the entropy of the phone-call interaction network changes according to circadian rhythms. Moreover we show that social networks are extremely adaptive and are modified by the use of technologies such as mobile phone communication. Indeed the statistics of duration of phone-call is described by a Weibull distribution and is significantly different from the distribution of duration of face-to-face interactions in a conference. Finally we investigate how much the entropy of dynamical social networks changes in realistic models of phone-call or face-to face interactions characterizing in this way different type human social behavior.

Interfacial welding of dynamic covalent network polymers

NASA Astrophysics Data System (ADS)

Yu, Kai; Shi, Qian; Li, Hao; Jabour, John; Yang, Hua; Dunn, Martin L.; Wang, Tiejun; Qi, H. Jerry

2016-09-01

Dynamic covalent network (or covalent adaptable network) polymers can rearrange their macromolecular chain network by bond exchange reactions (BERs) where an active unit replaces a unit in an existing bond to form a new bond. Such macromolecular events, when they occur in large amounts, can attribute to unusual properties that are not seen in conventional covalent network polymers, such as shape reforming and surface welding; the latter further enables the important attributes of material malleability and powder-based reprocessing. In this paper, a multiscale modeling framework is developed to study the surface welding of thermally induced dynamic covalent network polymers. At the macromolecular network level, a lattice model is developed to describe the chain density evolution across the interface and its connection to bulk stress relaxation due to BERs. The chain density evolution rule is then fed into a continuum level interfacial model that takes into account surface roughness and applied pressure to predict the effective elastic modulus and interfacial fracture energy of welded polymers. The model yields particularly accessible results where the moduli and interfacial strength of the welded samples as a function of temperature and pressure can be predicted with four parameters, three of which can be measured directly. The model identifies the dependency of surface welding efficiency on the applied thermal and mechanical fields: the pressure will affect the real contact area under the consideration of surface roughness of dynamic covalent network polymers; the chain density increment on the real contact area of interface is only dependent on the welding time and temperature. The modeling approach shows good agreement with experiments and can be extended to other types of dynamic covalent network polymers using different stimuli for BERs, such as light and moisture etc.

Dynamical graph theory networks techniques for the analysis of sparse connectivity networks in dementia

NASA Astrophysics Data System (ADS)

Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke

2017-05-01

Graph network models in dementia have become an important computational technique in neuroscience to study fundamental organizational principles of brain structure and function of neurodegenerative diseases such as dementia. The graph connectivity is reflected in the connectome, the complete set of structural and functional connections of the graph network, which is mostly based on simple Pearson correlation links. In contrast to simple Pearson correlation networks, the partial correlations (PC) only identify direct correlations while indirect associations are eliminated. In addition to this, the state-of-the-art techniques in brain research are based on static graph theory, which is unable to capture the dynamic behavior of the brain connectivity, as it alters with disease evolution. We propose a new research avenue in neuroimaging connectomics based on combining dynamic graph network theory and modeling strategies at different time scales. We present the theoretical framework for area aggregation and time-scale modeling in brain networks as they pertain to disease evolution in dementia. This novel paradigm is extremely powerful, since we can derive both static parameters pertaining to node and area parameters, as well as dynamic parameters, such as system's eigenvalues. By implementing and analyzing dynamically both disease driven PC-networks and regular concentration networks, we reveal differences in the structure of these network that play an important role in the temporal evolution of this disease. The described research is key to advance biomedical research on novel disease prediction trajectories and dementia therapies.

Modeling Temporal Behavior in Large Networks: A Dynamic Mixed-Membership Model

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

Rossi, R; Gallagher, B; Neville, J

Given a large time-evolving network, how can we model and characterize the temporal behaviors of individual nodes (and network states)? How can we model the behavioral transition patterns of nodes? We propose a temporal behavior model that captures the 'roles' of nodes in the graph and how they evolve over time. The proposed dynamic behavioral mixed-membership model (DBMM) is scalable, fully automatic (no user-defined parameters), non-parametric/data-driven (no specific functional form or parameterization), interpretable (identifies explainable patterns), and flexible (applicable to dynamic and streaming networks). Moreover, the interpretable behavioral roles are generalizable, computationally efficient, and natively supports attributes. We applied ourmore » model for (a) identifying patterns and trends of nodes and network states based on the temporal behavior, (b) predicting future structural changes, and (c) detecting unusual temporal behavior transitions. We use eight large real-world datasets from different time-evolving settings (dynamic and streaming). In particular, we model the evolving mixed-memberships and the corresponding behavioral transitions of Twitter, Facebook, IP-Traces, Email (University), Internet AS, Enron, Reality, and IMDB. The experiments demonstrate the scalability, flexibility, and effectiveness of our model for identifying interesting patterns, detecting unusual structural transitions, and predicting the future structural changes of the network and individual nodes.« less

Dynamic Bayesian network modeling for longitudinal brain morphometry

PubMed Central

Chen, Rong; Resnick, Susan M; Davatzikos, Christos; Herskovits, Edward H

2011-01-01

Identifying interactions among brain regions from structural magnetic-resonance images presents one of the major challenges in computational neuroanatomy. We propose a Bayesian data-mining approach to the detection of longitudinal morphological changes in the human brain. Our method uses a dynamic Bayesian network to represent evolving inter-regional dependencies. The major advantage of dynamic Bayesian network modeling is that it can represent complicated interactions among temporal processes. We validated our approach by analyzing a simulated atrophy study, and found that this approach requires only a small number of samples to detect the ground-truth temporal model. We further applied dynamic Bayesian network modeling to a longitudinal study of normal aging and mild cognitive impairment — the Baltimore Longitudinal Study of Aging. We found that interactions among regional volume-change rates for the mild cognitive impairment group are different from those for the normal-aging group. PMID:21963916

Popularity and Adolescent Friendship Networks: Selection and Influence Dynamics

ERIC Educational Resources Information Center

Dijkstra, Jan Kornelis; Cillessen, Antonius H. N.; Borch, Casey

2013-01-01

This study examined the dynamics of popularity in adolescent friendship networks across 3 years in middle school. Longitudinal social network modeling was used to identify selection and influence in the similarity of popularity among friends. It was argued that lower status adolescents strive to enhance their status through befriending higher…

DAWN: Dynamic Ad-hoc Wireless Network

DTIC Science & Technology

2016-06-19

DAWN: Dynamic Ad-hoc Wireless Network The DAWN (Dynamic Ad-hoc Wireless Networks) project is developing a general theory of complex and dynamic... wireless communication networks. To accomplish this, DAWN adopts a very different approach than those followed in the past and summarized above. DAWN... wireless communication networks. The members of DAWN investigated difference aspects of wireless mobile ad hoc networks (MANET). The views, opinions and/or

Chronnectome fingerprinting: Identifying individuals and predicting higher cognitive functions using dynamic brain connectivity patterns.

PubMed

Liu, Jin; Liao, Xuhong; Xia, Mingrui; He, Yong

2018-02-01

The human brain is a large, interacting dynamic network, and its architecture of coupling among brain regions varies across time (termed the "chronnectome"). However, very little is known about whether and how the dynamic properties of the chronnectome can characterize individual uniqueness, such as identifying individuals as a "fingerprint" of the brain. Here, we employed multiband resting-state functional magnetic resonance imaging data from the Human Connectome Project (N = 105) and a sliding time-window dynamic network analysis approach to systematically examine individual time-varying properties of the chronnectome. We revealed stable and remarkable individual variability in three dynamic characteristics of brain connectivity (i.e., strength, stability, and variability), which was mainly distributed in three higher order cognitive systems (i.e., default mode, dorsal attention, and fronto-parietal) and in two primary systems (i.e., visual and sensorimotor). Intriguingly, the spatial patterns of these dynamic characteristics of brain connectivity could successfully identify individuals with high accuracy and could further significantly predict individual higher cognitive performance (e.g., fluid intelligence and executive function), which was primarily contributed by the higher order cognitive systems. Together, our findings highlight that the chronnectome captures inherent functional dynamics of individual brain networks and provides implications for individualized characterization of health and disease. © 2017 Wiley Periodicals, Inc.

Control of complex networks requires both structure and dynamics

NASA Astrophysics Data System (ADS)

Gates, Alexander J.; Rocha, Luis M.

2016-04-01

The study of network structure has uncovered signatures of the organization of complex systems. However, there is also a need to understand how to control them; for example, identifying strategies to revert a diseased cell to a healthy state, or a mature cell to a pluripotent state. Two recent methodologies suggest that the controllability of complex systems can be predicted solely from the graph of interactions between variables, without considering their dynamics: structural controllability and minimum dominating sets. We demonstrate that such structure-only methods fail to characterize controllability when dynamics are introduced. We study Boolean network ensembles of network motifs as well as three models of biochemical regulation: the segment polarity network in Drosophila melanogaster, the cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana. We demonstrate that structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models, highlighting the importance of the actual system dynamics in determining control. Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays an important role in the extent to which structure predicts dynamics.

Cell Fate Reprogramming by Control of Intracellular Network Dynamics

PubMed Central

Zañudo, Jorge G. T.; Albert, Réka

2015-01-01

Identifying control strategies for biological networks is paramount for practical applications that involve reprogramming a cell’s fate, such as disease therapeutics and stem cell reprogramming. Here we develop a novel network control framework that integrates the structural and functional information available for intracellular networks to predict control targets. Formulated in a logical dynamic scheme, our approach drives any initial state to the target state with 100% effectiveness and needs to be applied only transiently for the network to reach and stay in the desired state. We illustrate our method’s potential to find intervention targets for cancer treatment and cell differentiation by applying it to a leukemia signaling network and to the network controlling the differentiation of helper T cells. We find that the predicted control targets are effective in a broad dynamic framework. Moreover, several of the predicted interventions are supported by experiments. PMID:25849586

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics.

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

A network dynamics approach to chemical reaction networks

NASA Astrophysics Data System (ADS)

van der Schaft, A. J.; Rao, S.; Jayawardhana, B.

2016-04-01

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.

Improving resolution of dynamic communities in human brain networks through targeted node removal

PubMed Central

Turner, Benjamin O.; Miller, Michael B.; Carlson, Jean M.

2017-01-01

Current approaches to dynamic community detection in complex networks can fail to identify multi-scale community structure, or to resolve key features of community dynamics. We propose a targeted node removal technique to improve the resolution of community detection. Using synthetic oscillator networks with well-defined “ground truth” communities, we quantify the community detection performance of a common modularity maximization algorithm. We show that the performance of the algorithm on communities of a given size deteriorates when these communities are embedded in multi-scale networks with communities of different sizes, compared to the performance in a single-scale network. We demonstrate that targeted node removal during community detection improves performance on multi-scale networks, particularly when removing the most functionally cohesive nodes. Applying this approach to network neuroscience, we compare dynamic functional brain networks derived from fMRI data taken during both repetitive single-task and varied multi-task experiments. After the removal of regions in visual cortex, the most coherent functional brain area during the tasks, community detection is better able to resolve known functional brain systems into communities. In addition, node removal enables the algorithm to distinguish clear differences in brain network dynamics between these experiments, revealing task-switching behavior that was not identified with the visual regions present in the network. These results indicate that targeted node removal can improve spatial and temporal resolution in community detection, and they demonstrate a promising approach for comparison of network dynamics between neuroscientific data sets with different resolution parameters. PMID:29261662

Spatiotemporal neural network dynamics for the processing of dynamic facial expressions.

PubMed

Sato, Wataru; Kochiyama, Takanori; Uono, Shota

2015-07-24

The dynamic facial expressions of emotion automatically elicit multifaceted psychological activities; however, the temporal profiles and dynamic interaction patterns of brain activities remain unknown. We investigated these issues using magnetoencephalography. Participants passively observed dynamic facial expressions of fear and happiness, or dynamic mosaics. Source-reconstruction analyses utilizing functional magnetic-resonance imaging data revealed higher activation in broad regions of the bilateral occipital and temporal cortices in response to dynamic facial expressions than in response to dynamic mosaics at 150-200 ms and some later time points. The right inferior frontal gyrus exhibited higher activity for dynamic faces versus mosaics at 300-350 ms. Dynamic causal-modeling analyses revealed that dynamic faces activated the dual visual routes and visual-motor route. Superior influences of feedforward and feedback connections were identified before and after 200 ms, respectively. These results indicate that hierarchical, bidirectional neural network dynamics within a few hundred milliseconds implement the processing of dynamic facial expressions.

Spatiotemporal neural network dynamics for the processing of dynamic facial expressions

PubMed Central

Sato, Wataru; Kochiyama, Takanori; Uono, Shota

2015-01-01

The dynamic facial expressions of emotion automatically elicit multifaceted psychological activities; however, the temporal profiles and dynamic interaction patterns of brain activities remain unknown. We investigated these issues using magnetoencephalography. Participants passively observed dynamic facial expressions of fear and happiness, or dynamic mosaics. Source-reconstruction analyses utilizing functional magnetic-resonance imaging data revealed higher activation in broad regions of the bilateral occipital and temporal cortices in response to dynamic facial expressions than in response to dynamic mosaics at 150–200 ms and some later time points. The right inferior frontal gyrus exhibited higher activity for dynamic faces versus mosaics at 300–350 ms. Dynamic causal-modeling analyses revealed that dynamic faces activated the dual visual routes and visual–motor route. Superior influences of feedforward and feedback connections were identified before and after 200 ms, respectively. These results indicate that hierarchical, bidirectional neural network dynamics within a few hundred milliseconds implement the processing of dynamic facial expressions. PMID:26206708

Disease dynamics in a dynamic social network

NASA Astrophysics Data System (ADS)

Christensen, Claire; Albert, István; Grenfell, Bryan; Albert, Réka

2010-07-01

We develop a framework for simulating a realistic, evolving social network (a city) into which a disease is introduced. We compare our results to prevaccine era measles data for England and Wales, and find that they capture the quantitative and qualitative features of epidemics in populations spanning two orders of magnitude. Our results provide unique insight into how and why the social topology of the contact network influences the propagation of the disease through the population. We argue that network simulation is suitable for concurrently probing contact network dynamics and disease dynamics in ways that prior modeling approaches cannot and it can be extended to the study of less well-documented diseases.

The dynamic programming high-order Dynamic Bayesian Networks learning for identifying effective connectivity in human brain from fMRI.

PubMed

Dang, Shilpa; Chaudhury, Santanu; Lall, Brejesh; Roy, Prasun Kumar

2017-06-15

Determination of effective connectivity (EC) among brain regions using fMRI is helpful in understanding the underlying neural mechanisms. Dynamic Bayesian Networks (DBNs) are an appropriate class of probabilistic graphical temporal-models that have been used in past to model EC from fMRI, specifically order-one. High-order DBNs (HO-DBNs) have still not been explored for fMRI data. A fundamental problem faced in the structure-learning of HO-DBN is high computational-burden and low accuracy by the existing heuristic search techniques used for EC detection from fMRI. In this paper, we propose using dynamic programming (DP) principle along with integration of properties of scoring-function in a way to reduce search space for structure-learning of HO-DBNs and finally, for identifying EC from fMRI which has not been done yet to the best of our knowledge. The proposed exact search-&-score learning approach HO-DBN-DP is an extension of the technique which was originally devised for learning a BN's structure from static data (Singh and Moore, 2005). The effectiveness in structure-learning is shown on synthetic fMRI dataset. The algorithm reaches globally-optimal solution in appreciably reduced time-complexity than the static counterpart due to integration of properties. The proof of optimality is provided. The results demonstrate that HO-DBN-DP is comparably more accurate and faster than currently used structure-learning algorithms used for identifying EC from fMRI. The real data EC from HO-DBN-DP shows consistency with previous literature than the classical Granger Causality method. Hence, the DP algorithm can be employed for reliable EC estimates from experimental fMRI data. Copyright © 2017 Elsevier B.V. All rights reserved.

Structurally Dynamic Spin Market Networks

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent "brain" is modeled by a recursive neural network with local and global inputs and feedback connections. For specific parametric combination the complex network displays small-world phenomenon combined with scale-free behavior. The identification of a local leader (network hub, agent whose strategies are frequently adapted by its neighbors) is carried out by repeated random walk process through network. The simulations show empirically relevant dynamics of price returns and volatility clustering. The additional emerging aspects of stylized market statistics are Zipfian distributions of fitness.

Anomaly Detection in Dynamic Networks

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

Turcotte, Melissa

2014-10-14

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. Amore » second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the

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.

Dynamic brain glucose metabolism identifies anti-correlated cortical-cerebellar networks at rest.

PubMed

Tomasi, Dardo G; Shokri-Kojori, Ehsan; Wiers, Corinde E; Kim, Sunny W; Demiral, Şukru B; Cabrera, Elizabeth A; Lindgren, Elsa; Miller, Gregg; Wang, Gene-Jack; Volkow, Nora D

2017-12-01

It remains unclear whether resting state functional magnetic resonance imaging (rfMRI) networks are associated with underlying synchrony in energy demand, as measured by dynamic 2-deoxy-2-[ 18 F]fluoroglucose (FDG) positron emission tomography (PET). We measured absolute glucose metabolism, temporal metabolic connectivity (t-MC) and rfMRI patterns in 53 healthy participants at rest. Twenty-two rfMRI networks emerged from group independent component analysis (gICA). In contrast, only two anti-correlated t-MC emerged from FDG-PET time series using gICA or seed-voxel correlations; one included frontal, parietal and temporal cortices, the other included the cerebellum and medial temporal regions. Whereas cerebellum, thalamus, globus pallidus and calcarine cortex arose as the strongest t-MC hubs, the precuneus and visual cortex arose as the strongest rfMRI hubs. The strength of the t-MC linearly increased with the metabolic rate of glucose suggesting that t-MC measures are strongly associated with the energy demand of the brain tissue, and could reflect regional differences in glucose metabolism, counterbalanced metabolic network demand, and/or differential time-varying delivery of FDG. The mismatch between metabolic and functional connectivity patterns computed as a function of time could reflect differences in the temporal characteristics of glucose metabolism as measured with PET-FDG and brain activation as measured with rfMRI.

Collective Dynamics for Heterogeneous Networks of Theta Neurons

NASA Astrophysics Data System (ADS)

Luke, Tanushree

Collective behavior in neural networks has often been used as an indicator of communication between different brain areas. These collective synchronization and desynchronization patterns are also considered an important feature in understanding normal and abnormal brain function. To understand the emergence of these collective patterns, I create an analytic model that identifies all such macroscopic steady-states attainable by a network of Type-I neurons. This network, whose basic unit is the model "theta'' neuron, contains a mixture of excitable and spiking neurons coupled via a smooth pulse-like synapse. Applying the Ott-Antonsen reduction method in the thermodynamic limit, I obtain a low-dimensional evolution equation that describes the asymptotic dynamics of the macroscopic mean field of the network. This model can be used as the basis in understanding more complicated neuronal networks when additional dynamical features are included. From this reduced dynamical equation for the mean field, I show that the network exhibits three collective attracting steady-states. The first two are equilibrium states that both reflect partial synchronization in the network, whereas the third is a limit cycle in which the degree of network synchronization oscillates in time. In addition to a comprehensive identification of all possible attracting macro-states, this analytic model permits a complete bifurcation analysis of the collective behavior of the network with respect to three key network features: the degree of excitability of the neurons, the heterogeneity of the population, and the overall coupling strength. The network typically tends towards the two macroscopic equilibrium states when the neuron's intrinsic dynamics and the network interactions reinforce each other. In contrast, the limit cycle state, bifurcations, and multistability tend to occur when there is competition between these network features. I also outline here an extension of the above model where the

Dynamics in microbial communities: Unraveling mechanisms to identify principles

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

Konopka, Allan; Lindemann, Stephen R.; Fredrickson, Jim K.

2015-07-01

Diversity begets higher order properties such as functional stability and robustness in microbial communities, but principles that inform conceptual (and eventually predictive) models of community dynamics are lacking. Recent work has shown that selection as well as dispersal and drift shape communities, but the mechanistic bases for assembly of communities and the forces that maintain their function in the face of environmental perturbation are not well understood. Conceptually, some interactions among community members could generate endogenous dynamics in composition, even in the absence of environmental changes. These endogenous dynamics are further perturbed by exogenous forcing factors to produce a richermore » network of community interactions, and it is this “system” that is the basis for higher order community properties. Elucidation of principles that follow from this conceptual model requires identifying the mechanisms that (a) optimize diversity within a community and (b) impart community stability. The network of interactions between organisms can be an important element by providing a buffer against disturbance beyond the effect of functional redundancy, as alternative pathways with different combinations of microbes can be recruited to fulfill specific functions.« less

Conflict and convention in dynamic networks.

PubMed

Foley, Michael; Forber, Patrick; Smead, Rory; Riedl, Christoph

2018-03-01

An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioural strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here, we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models. © 2017 The Author(s).

Asynchronous networks: modularization of dynamics theorem

NASA Astrophysics Data System (ADS)

Bick, Christian; Field, Michael

2017-02-01

Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.

Dynamics of brain networks in the aesthetic appreciation

PubMed Central

Cela-Conde, Camilo J.; García-Prieto, Juan; Ramasco, José J.; Mirasso, Claudio R.; Bajo, Ricardo; Munar, Enric; Flexas, Albert; del-Pozo, Francisco; Maestú, Fernando

2013-01-01

Neuroimage experiments have been essential for identifying active brain networks. During cognitive tasks as in, e.g., aesthetic appreciation, such networks include regions that belong to the default mode network (DMN). Theoretically, DMN activity should be interrupted during cognitive tasks demanding attention, as is the case for aesthetic appreciation. Analyzing the functional connectivity dynamics along three temporal windows and two conditions, beautiful and not beautiful stimuli, here we report experimental support for the hypothesis that aesthetic appreciation relies on the activation of two different networks, an initial aesthetic network and a delayed aesthetic network, engaged within distinct time frames. Activation of the DMN might correspond mainly to the delayed aesthetic network. We discuss adaptive and evolutionary explanations for the relationships existing between the DMN and aesthetic networks and offer unique inputs to debates on the mind/brain interaction. PMID:23754437

Psychology and social networks: a dynamic network theory perspective.

PubMed

Westaby, James D; Pfaff, Danielle L; Redding, Nicholas

2014-04-01

Research on social networks has grown exponentially in recent years. However, despite its relevance, the field of psychology has been relatively slow to explain the underlying goal pursuit and resistance processes influencing social networks in the first place. In this vein, this article aims to demonstrate how a dynamic network theory perspective explains the way in which social networks influence these processes and related outcomes, such as goal achievement, performance, learning, and emotional contagion at the interpersonal level of analysis. The theory integrates goal pursuit, motivation, and conflict conceptualizations from psychology with social network concepts from sociology and organizational science to provide a taxonomy of social network role behaviors, such as goal striving, system supporting, goal preventing, system negating, and observing. This theoretical perspective provides psychologists with new tools to map social networks (e.g., dynamic network charts), which can help inform the development of change interventions. Implications for social, industrial-organizational, and counseling psychology as well as conflict resolution are discussed, and new opportunities for research are highlighted, such as those related to dynamic network intelligence (also known as cognitive accuracy), levels of analysis, methodological/ethical issues, and the need to theoretically broaden the study of social networking and social media behavior. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Dynamic networks of PTSD symptoms during conflict.

PubMed

Greene, Talya; Gelkopf, Marc; Epskamp, Sacha; Fried, Eiko

2018-02-28

Conceptualizing posttraumatic stress disorder (PTSD) symptoms as a dynamic system of causal elements could provide valuable insights into the way that PTSD develops and is maintained in traumatized individuals. We present the first study to apply a multilevel network model to produce an exploratory empirical conceptualization of dynamic networks of PTSD symptoms, using data collected during a period of conflict. Intensive longitudinal assessment data were collected during the Israel-Gaza War in July-August 2014. The final sample (n = 96) comprised a general population sample of Israeli adult civilians exposed to rocket fire. Participants completed twice-daily reports of PTSD symptoms via smartphone for 30 days. We used a multilevel vector auto-regression model to produce contemporaneous and temporal networks, and a partial correlation network model to obtain a between-subjects network. Multilevel network analysis found strong positive contemporaneous associations between hypervigilance and startle response, avoidance of thoughts and avoidance of reminders, and between flashbacks and emotional reactivity. The temporal network indicated the central role of startle response as a predictor of future PTSD symptomatology, together with restricted affect, blame, negative emotions, and avoidance of thoughts. There were some notable differences between the temporal and contemporaneous networks, including the presence of a number of negative associations, particularly from blame. The between-person network indicated flashbacks and emotional reactivity to be the most central symptoms. This study suggests various symptoms that could potentially be driving the development of PTSD. We discuss clinical implications such as identifying particular symptoms as targets for interventions.

Revealing networks from dynamics: an introduction

NASA Astrophysics Data System (ADS)

Timme, Marc; Casadiego, Jose

2014-08-01

What can we learn from the collective dynamics of a complex network about its interaction topology? Taking the perspective from nonlinear dynamics, we briefly review recent progress on how to infer structural connectivity (direct interactions) from accessing the dynamics of the units. Potential applications range from interaction networks in physics, to chemical and metabolic reactions, protein and gene regulatory networks as well as neural circuits in biology and electric power grids or wireless sensor networks in engineering. Moreover, we briefly mention some standard ways of inferring effective or functional connectivity.

Dynamic and interacting complex networks

NASA Astrophysics Data System (ADS)

Dickison, Mark E.

This thesis employs methods of statistical mechanics and numerical simulations to study some aspects of dynamic and interacting complex networks. The mapping of various social and physical phenomena to complex networks has been a rich field in the past few decades. Subjects as broad as petroleum engineering, scientific collaborations, and the structure of the internet have all been analyzed in a network physics context, with useful and universal results. In the first chapter we introduce basic concepts in networks, including the two types of network configurations that are studied and the statistical physics and epidemiological models that form the framework of the network research, as well as covering various previously-derived results in network theory that are used in the work in the following chapters. In the second chapter we introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the time evolution of the network. We show that the dynamic network undergoes a percolation phase transition at a critical concentration pc, that decreases with the rate r at which the network links are changed. The behavior near criticality is universal and independent of r. We find that for dynamic random networks fundamental laws are changed: i) The size of the giant component at criticality scales with the network size N for all values of r, rather than as N2/3 in static network, ii) In the presence of a broad distribution of disorder, the optimal path length between two nodes in a dynamic network scales as N1/2, compared to N1/3 in a static network. The third chapter consists of a study of the effect of quarantine on the propagation of epidemics on an adaptive network of social contacts. For this purpose, we analyze the susceptible-infected-recovered model in the presence of quarantine, where susceptible

Graph fibrations and symmetries of network dynamics

NASA Astrophysics Data System (ADS)

Nijholt, Eddie; Rink, Bob; Sanders, Jan

2016-11-01

Dynamical systems with a network structure can display remarkable phenomena such as synchronisation and anomalous synchrony breaking. A methodology for classifying patterns of synchrony in networks was developed by Golubitsky and Stewart. They showed that the robustly synchronous dynamics of a network is determined by its quotient networks. This result was recently reformulated by DeVille and Lerman, who pointed out that the reduction from a network to a quotient is an example of a graph fibration. The current paper exploits this observation and demonstrates the importance of self-fibrations of network graphs. Self-fibrations give rise to symmetries in the dynamics of a network. We show that every network admits a lift with a semigroup or semigroupoid of self-fibrations. The resulting symmetries impact the global dynamics of the network and can therefore be used to explain and predict generic scenarios for synchrony breaking. Also, when the network has a trivial symmetry groupoid, then every robust synchrony in the lift is determined by symmetry. We finish this paper with a discussion of networks with interior symmetries and nonhomogeneous networks.

The dynamics of transmission and the dynamics of networks.

PubMed

Farine, Damien

2017-05-01

A toy example depicted here highlighting the results of a study in this issue of the Journal of Animal Ecology that investigates the impact of network dynamics on potential disease outbreaks. Infections (stars) that spread by contact only (left) reduce the predicted outbreak size compared to situations where individuals can become infected by moving through areas that previously contained infected individuals (right). This is potentially important in species where individuals, or in this case groups, have overlapping ranges (as depicted on the top right). Incorporating network dynamics that maintain information about the ordering of contacts (central blocks; including the ordering of spatial overlap as noted by the arrows that highlight the blue group arriving after the red group in top-right of the figure) is important for capturing how a disease might not have the opportunity to spread to all individuals. By contrast, a static or 'average' network (lower blocks) does not capture any of these dynamics. Interestingly, although static networks generally predict larger outbreak sizes, the authors find that in cases when transmission probability is low, this prediction can switch as a result of changes in the estimated intensity of contacts among individuals. [Colour figure can be viewed at wileyonlinelibrary.com]. Springer, A., Kappeler, P.M. & Nunn, C.L. (2017) Dynamic vs. static social networks in models of parasite transmission: Predicting Cryptosporidium spread in wild lemurs. Journal of Animal Ecology, 86, 419-433. The spread of disease or information through networks can be affected by several factors. Whether and how these factors are accounted for can fundamentally change the predicted impact of a spreading epidemic. Springer, Kappeler & Nunn () investigate the role of different modes of transmission and network dynamics on the predicted size of a disease outbreak across several groups of Verreaux's sifakas, a group-living species of lemur. While some factors

Coevolution of dynamical states and interactions in dynamic networks

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.; San Miguel, Maxi

2004-06-01

We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.

Dynamics of social balance on networks

NASA Astrophysics Data System (ADS)

Antal, T.; Krapivsky, P. L.; Redner, S.

2005-09-01

We study the evolution of social networks that contain both friendly and unfriendly pairwise links between individual nodes. The network is endowed with dynamics in which the sense of a link in an imbalanced triad—a triangular loop with one or three unfriendly links—is reversed to make the triad balanced. With this dynamics, an infinite network undergoes a dynamic phase transition from a steady state to “paradise”—all links are friendly—as the propensity p for friendly links in an update event passes through 1/2 . A finite network always falls into a socially balanced absorbing state where no imbalanced triads remain. If the additional constraint that the number of imbalanced triads in the network not increase in an update is imposed, then the network quickly reaches a balanced final state.

Complex networks repair strategies: Dynamic models

NASA Astrophysics Data System (ADS)

Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang

2017-09-01

Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.

A transcriptional dynamic network during Arabidopsis thaliana pollen development.

PubMed

Wang, Jigang; Qiu, Xiaojie; Li, Yuhua; Deng, Youping; Shi, Tieliu

2011-01-01

To understand transcriptional regulatory networks (TRNs), especially the coordinated dynamic regulation between transcription factors (TFs) and their corresponding target genes during development, computational approaches would represent significant advances in the genome-wide expression analysis. The major challenges for the experiments include monitoring the time-specific TFs' activities and identifying the dynamic regulatory relationships between TFs and their target genes, both of which are currently not yet available at the large scale. However, various methods have been proposed to computationally estimate those activities and regulations. During the past decade, significant progresses have been made towards understanding pollen development at each development stage under the molecular level, yet the regulatory mechanisms that control the dynamic pollen development processes remain largely unknown. Here, we adopt Networks Component Analysis (NCA) to identify TF activities over time course, and infer their regulatory relationships based on the coexpression of TFs and their target genes during pollen development. We carried out meta-analysis by integrating several sets of gene expression data related to Arabidopsis thaliana pollen development (stages range from UNM, BCP, TCP, HP to 0.5 hr pollen tube and 4 hr pollen tube). We constructed a regulatory network, including 19 TFs, 101 target genes and 319 regulatory interactions. The computationally estimated TF activities were well correlated to their coordinated genes' expressions during the development process. We clustered the expression of their target genes in the context of regulatory influences, and inferred new regulatory relationships between those TFs and their target genes, such as transcription factor WRKY34, which was identified that specifically expressed in pollen, and regulated several new target genes. Our finding facilitates the interpretation of the expression patterns with more biological

Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

A state space approach for piecewise-linear recurrent neural networks for identifying computational dynamics from neural measurements.

PubMed

Durstewitz, Daniel

2017-06-01

The computational and cognitive properties of neural systems are often thought to be implemented in terms of their (stochastic) network dynamics. Hence, recovering the system dynamics from experimentally observed neuronal time series, like multiple single-unit recordings or neuroimaging data, is an important step toward understanding its computations. Ideally, one would not only seek a (lower-dimensional) state space representation of the dynamics, but would wish to have access to its statistical properties and their generative equations for in-depth analysis. Recurrent neural networks (RNNs) are a computationally powerful and dynamically universal formal framework which has been extensively studied from both the computational and the dynamical systems perspective. Here we develop a semi-analytical maximum-likelihood estimation scheme for piecewise-linear RNNs (PLRNNs) within the statistical framework of state space models, which accounts for noise in both the underlying latent dynamics and the observation process. The Expectation-Maximization algorithm is used to infer the latent state distribution, through a global Laplace approximation, and the PLRNN parameters iteratively. After validating the procedure on toy examples, and using inference through particle filters for comparison, the approach is applied to multiple single-unit recordings from the rodent anterior cingulate cortex (ACC) obtained during performance of a classical working memory task, delayed alternation. Models estimated from kernel-smoothed spike time data were able to capture the essential computational dynamics underlying task performance, including stimulus-selective delay activity. The estimated models were rarely multi-stable, however, but rather were tuned to exhibit slow dynamics in the vicinity of a bifurcation point. In summary, the present work advances a semi-analytical (thus reasonably fast) maximum-likelihood estimation framework for PLRNNs that may enable to recover relevant aspects

Embedding dynamical networks into distributed models

NASA Astrophysics Data System (ADS)

Innocenti, Giacomo; Paoletti, Paolo

2015-07-01

Large networks of interacting dynamical systems are well-known for the complex behaviours they are able to display, even when each node features a quite simple dynamics. Despite examples of such networks being widespread both in nature and in technological applications, the interplay between the local and the macroscopic behaviour, through the interconnection topology, is still not completely understood. Moreover, traditional analytical methods for dynamical response analysis fail because of the intrinsically large dimension of the phase space of the network which makes the general problem intractable. Therefore, in this paper we develop an approach aiming to condense all the information in a compact description based on partial differential equations. By focusing on propagative phenomena, rigorous conditions under which the original network dynamical properties can be successfully analysed within the proposed framework are derived as well. A network of Fitzhugh-Nagumo systems is finally used to illustrate the effectiveness of the proposed method.

Automated identification of functional dynamic networks from X-ray crystallography

PubMed Central

van den Bedem, Henry; Bhabha, Gira; Yang, Kun; Wright, Peter E.; Fraser, James S.

2013-01-01

Protein function often depends on the exchange between conformational substates. Allosteric ligand binding or distal mutations can stabilize specific active site conformations and consequently alter protein function. In addition to comparing independently determined X-ray crystal structures, alternative conformations observed at low levels of electron density have the potential to provide mechanistic insights into conformational dynamics. Here, we report a new multi-conformer contact network algorithm (CONTACT) that identifies networks of conformationally heterogeneous residues directly from high-resolution X-ray crystallography data. Contact networks in Escherichia coli dihydrofolate reductase (ecDHFR) predict the long-range pattern of NMR chemical shift perturbations of an allosteric mutation. A comparison of contact networks in wild type and mutant ecDHFR suggests how mutations that alter optimized networks of coordinated motions can impair catalytic function. Thus, CONTACT-guided mutagenesis will allow the structure-dynamics-function relationship to be exploited in protein engineering and design. PMID:23913260

Degenerate time-dependent network dynamics anticipate seizures in human epileptic brain.

PubMed

Tauste Campo, Adrià; Principe, Alessandro; Ley, Miguel; Rocamora, Rodrigo; Deco, Gustavo

2018-04-01

Epileptic seizures are known to follow specific changes in brain dynamics. While some algorithms can nowadays robustly detect these changes, a clear understanding of the mechanism by which these alterations occur and generate seizures is still lacking. Here, we provide crossvalidated evidence that such changes are initiated by an alteration of physiological network state dynamics. Specifically, our analysis of long intracranial electroencephalography (iEEG) recordings from a group of 10 patients identifies a critical phase of a few hours in which time-dependent network states become less variable ("degenerate"), and this phase is followed by a global functional connectivity reduction before seizure onset. This critical phase is characterized by an abnormal occurrence of highly correlated network instances and is shown to be particularly associated with the activity of the resected regions in patients with validated postsurgical outcome. Our approach characterizes preseizure network dynamics as a cascade of 2 sequential events providing new insights into seizure prediction and control.

Dynamics and control of diseases in networks with community structure.

PubMed

Salathé, Marcel; Jones, James H

2010-04-08

The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc.) depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how such community structure affects epidemics may provide insights for preventing the spread of disease between communities by changing the structure of the contact network through pharmaceutical or non-pharmaceutical interventions. We use empirical and simulated networks to investigate the spread of disease in networks with community structure. We find that community structure has a major impact on disease dynamics, and we show that in networks with strong community structure, immunization interventions targeted at individuals bridging communities are more effective than those simply targeting highly connected individuals. Because the structure of relevant contact networks is generally not known, and vaccine supply is often limited, there is great need for efficient vaccination algorithms that do not require full knowledge of the network. We developed an algorithm that acts only on locally available network information and is able to quickly identify targets for successful immunization intervention. The algorithm generally outperforms existing algorithms when vaccine supply is limited, particularly in networks with strong community structure. Understanding the spread of infectious diseases and designing optimal control strategies is a major goal of public health. Social networks show marked patterns of community structure, and our results, based on empirical and simulated data, demonstrate that community structure strongly affects disease dynamics. These results have implications for the design of control strategies.

Construction and analysis of gene-gene dynamics influence networks based on a Boolean model.

PubMed

Mazaya, Maulida; Trinh, Hung-Cuong; Kwon, Yung-Keun

2017-12-21

Identification of novel gene-gene relations is a crucial issue to understand system-level biological phenomena. To this end, many methods based on a correlation analysis of gene expressions or structural analysis of molecular interaction networks have been proposed. They have a limitation in identifying more complicated gene-gene dynamical relations, though. To overcome this limitation, we proposed a measure to quantify a gene-gene dynamical influence (GDI) using a Boolean network model and constructed a GDI network to indicate existence of a dynamical influence for every ordered pair of genes. It represents how much a state trajectory of a target gene is changed by a knockout mutation subject to a source gene in a gene-gene molecular interaction (GMI) network. Through a topological comparison between GDI and GMI networks, we observed that the former network is denser than the latter network, which implies that there exist many gene pairs of dynamically influencing but molecularly non-interacting relations. In addition, a larger number of hub genes were generated in the GDI network. On the other hand, there was a correlation between these networks such that the degree value of a node was positively correlated to each other. We further investigated the relationships of the GDI value with structural properties and found that there are negative and positive correlations with the length of a shortest path and the number of paths, respectively. In addition, a GDI network could predict a set of genes whose steady-state expression is affected in E. coli gene-knockout experiments. More interestingly, we found that the drug-targets with side-effects have a larger number of outgoing links than the other genes in the GDI network, which implies that they are more likely to influence the dynamics of other genes. Finally, we found biological evidences showing that the gene pairs which are not molecularly interacting but dynamically influential can be considered for novel gene

Dynamics of Bacterial Gene Regulatory Networks.

PubMed

Shis, David L; Bennett, Matthew R; Igoshin, Oleg A

2018-05-20

The ability of bacterial cells to adjust their gene expression program in response to environmental perturbation is often critical for their survival. Recent experimental advances allowing us to quantitatively record gene expression dynamics in single cells and in populations coupled with mathematical modeling enable mechanistic understanding on how these responses are shaped by the underlying regulatory networks. Here, we review how the combination of local and global factors affect dynamical responses of gene regulatory networks. Our goal is to discuss the general principles that allow extrapolation from a few model bacteria to less understood microbes. We emphasize that, in addition to well-studied effects of network architecture, network dynamics are shaped by global pleiotropic effects and cell physiology.

Dynamic facial expressions evoke distinct activation in the face perception network: a connectivity analysis study.

PubMed

Foley, Elaine; Rippon, Gina; Thai, Ngoc Jade; Longe, Olivia; Senior, Carl

2012-02-01

Very little is known about the neural structures involved in the perception of realistic dynamic facial expressions. In the present study, a unique set of naturalistic dynamic facial emotional expressions was created. Through fMRI and connectivity analysis, a dynamic face perception network was identified, which is demonstrated to extend Haxby et al.'s [Haxby, J. V., Hoffman, E. A., & Gobbini, M. I. The distributed human neural system for face perception. Trends in Cognitive Science, 4, 223-233, 2000] distributed neural system for face perception. This network includes early visual regions, such as the inferior occipital gyrus, which is identified as insensitive to motion or affect but sensitive to the visual stimulus, the STS, identified as specifically sensitive to motion, and the amygdala, recruited to process affect. Measures of effective connectivity between these regions revealed that dynamic facial stimuli were associated with specific increases in connectivity between early visual regions, such as the inferior occipital gyrus and the STS, along with coupling between the STS and the amygdala, as well as the inferior frontal gyrus. These findings support the presence of a distributed network of cortical regions that mediate the perception of different dynamic facial expressions.

Characterizing system dynamics with a weighted and directed network constructed from time series data

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

Sun, Xiaoran, E-mail: sxr0806@gmail.com; School of Mathematics and Statistics, The University of Western Australia, Crawley WA 6009; Small, Michael, E-mail: michael.small@uwa.edu.au

In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the timemore » series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.« less

Popularity and adolescent friendship networks: selection and influence dynamics.

PubMed

Dijkstra, Jan Kornelis; Cillessen, Antonius H N; Borch, Casey

2013-07-01

This study examined the dynamics of popularity in adolescent friendship networks across 3 years in middle school. Longitudinal social network modeling was used to identify selection and influence in the similarity of popularity among friends. It was argued that lower status adolescents strive to enhance their status through befriending higher status adolescents, whereas higher status adolescents strive to maintain their status by keeping lower status adolescents at a distance. The results largely supported these expectations. Selection partially accounted for similarity in popularity among friends; adolescents preferred to affiliate with similar-status or higher status peers, reinforcing the attractiveness of popular adolescents and explaining stability of popularity at the individual level. Influence processes also accounted for similarity in popularity over time, showing that peers increase in popularity and become more similar to their friends. The results showed how selection and influence processes account for popularity dynamics in adolescent networks over time.

Dynamic Business Networks: A Headache for Sustainable Systems Interoperability

NASA Astrophysics Data System (ADS)

Agostinho, Carlos; Jardim-Goncalves, Ricardo

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

Local Difference Measures between Complex Networks for Dynamical System Model Evaluation

PubMed Central

Lange, Stefan; Donges, Jonathan F.; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation. Building on a recent study by Feldhoff et al. [1] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system. Three types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node

Local difference measures between complex networks for dynamical system model evaluation.

PubMed

Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node

Dynamics of Intersubject Brain Networks during Anxious Anticipation

PubMed Central

Najafi, Mahshid; Kinnison, Joshua; Pessoa, Luiz

2017-01-01

How do large-scale brain networks reorganize during the waxing and waning of anxious anticipation? Here, threat was dynamically modulated during human functional MRI as two circles slowly meandered on the screen; if they touched, an unpleasant shock was delivered. We employed intersubject correlation analysis, which allowed the investigation of network-level functional connectivity across brains, and sought to determine how network connectivity changed during periods of approach (circles moving closer) and periods of retreat (circles moving apart). Analysis of positive connection weights revealed that dynamic threat altered connectivity within and between the salience, executive, and task-negative networks. For example, dynamic functional connectivity increased within the salience network during approach and decreased during retreat. The opposite pattern was found for the functional connectivity between the salience and task-negative networks: decreases during approach and increases during approach. Functional connections between subcortical regions and the salience network also changed dynamically during approach and retreat periods. Subcortical regions exhibiting such changes included the putative periaqueductal gray, putative habenula, and putative bed nucleus of the stria terminalis. Additional analysis of negative functional connections revealed dynamic changes, too. For example, negative weights within the salience network decreased during approach and increased during retreat, opposite what was found for positive weights. Together, our findings unraveled dynamic features of functional connectivity of large-scale networks and subcortical regions across participants while threat levels varied continuously, and demonstrate the potential of characterizing emotional processing at the level of dynamic networks. PMID:29209184

Empirical Modeling of the Plasmasphere Dynamics Using Neural Networks

NASA Astrophysics Data System (ADS)

Zhelavskaya, I. S.; Shprits, Y.; Spasojevic, M.

2017-12-01

We present a new empirical model for reconstructing the global dynamics of the cold plasma density distribution based only on solar wind data and geomagnetic indices. Utilizing the density database obtained using the NURD (Neural-network-based Upper hybrid Resonance Determination) algorithm for the period of October 1, 2012 - July 1, 2016, in conjunction with solar wind data and geomagnetic indices, we develop a neural network model that is capable of globally reconstructing the dynamics of the cold plasma density distribution for 2 ≤ L ≤ 6 and all local times. We validate and test the model by measuring its performance on independent datasets withheld from the training set and by comparing the model predicted global evolution with global images of He+ distribution in the Earth's plasmasphere from the IMAGE Extreme UltraViolet (EUV) instrument. We identify the parameters that best quantify the plasmasphere dynamics by training and comparing multiple neural networks with different combinations of input parameters (geomagnetic indices, solar wind data, and different durations of their time history). We demonstrate results of both local and global plasma density reconstruction. This study illustrates how global dynamics can be reconstructed from local in-situ observations by using machine learning techniques.

Glucans monomer-exchange dynamics as an open chemical network

NASA Astrophysics Data System (ADS)

Rao, Riccardo; Lacoste, David; Esposito, Massimiliano

2015-12-01

We describe the oligosaccharides-exchange dynamics performed by the so-called D-enzymes on polysaccharides. To mimic physiological conditions, we treat this process as an open chemical network by assuming some of the polymer concentrations fixed (chemostatting). We show that three different long-time behaviors may ensue: equilibrium states, nonequilibrium steady states, and continuous growth states. We dynamically and thermodynamically characterize these states and emphasize the crucial role of conservation laws in identifying the chemostatting conditions inducing them.

Glucans monomer-exchange dynamics as an open chemical network

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

Rao, Riccardo, E-mail: riccardo.rao@uni.lu; Esposito, Massimiliano, E-mail: massimiliano.esposito@uni.lu; Lacoste, David

2015-12-28

We describe the oligosaccharides-exchange dynamics performed by the so-called D-enzymes on polysaccharides. To mimic physiological conditions, we treat this process as an open chemical network by assuming some of the polymer concentrations fixed (chemostatting). We show that three different long-time behaviors may ensue: equilibrium states, nonequilibrium steady states, and continuous growth states. We dynamically and thermodynamically characterize these states and emphasize the crucial role of conservation laws in identifying the chemostatting conditions inducing them.

Dynamic tubulation of mitochondria drives mitochondrial network formation.

PubMed

Wang, Chong; Du, Wanqing; Su, Qian Peter; Zhu, Mingli; Feng, Peiyuan; Li, Ying; Zhou, Yichen; Mi, Na; Zhu, Yueyao; Jiang, Dong; Zhang, Senyan; Zhang, Zerui; Sun, Yujie; Yu, Li

2015-10-01

Mitochondria form networks. Formation of mitochondrial networks is important for maintaining mitochondrial DNA integrity and interchanging mitochondrial material, whereas disruption of the mitochondrial network affects mitochondrial functions. According to the current view, mitochondrial networks are formed by fusion of individual mitochondria. Here, we report a new mechanism for formation of mitochondrial networks through KIF5B-mediated dynamic tubulation of mitochondria. We found that KIF5B pulls thin, highly dynamic tubules out of mitochondria. Fusion of these dynamic tubules, which is mediated by mitofusins, gives rise to the mitochondrial network. We further demonstrated that dynamic tubulation and fusion is sufficient for mitochondrial network formation, by reconstituting mitochondrial networks in vitro using purified fusion-competent mitochondria, recombinant KIF5B, and polymerized microtubules. Interestingly, KIF5B only controls network formation in the peripheral zone of the cell, indicating that the mitochondrial network is divided into subzones, which may be constructed by different mechanisms. Our data not only uncover an essential mechanism for mitochondrial network formation, but also reveal that different parts of the mitochondrial network are formed by different mechanisms.

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.

Temporal network analysis identifies early physiological and transcriptomic indicators of mild drought in Brassica rapa

PubMed Central

Gehan, Malia A; Mockler, Todd C; Weinig, Cynthia; Ewers, Brent E

2017-01-01

The dynamics of local climates make development of agricultural strategies challenging. Yield improvement has progressed slowly, especially in drought-prone regions where annual crop production suffers from episodic aridity. Underlying drought responses are circadian and diel control of gene expression that regulate daily variations in metabolic and physiological pathways. To identify transcriptomic changes that occur in the crop Brassica rapa during initial perception of drought, we applied a co-expression network approach to associate rhythmic gene expression changes with physiological responses. Coupled analysis of transcriptome and physiological parameters over a two-day time course in control and drought-stressed plants provided temporal resolution necessary for correlation of network modules with dynamic changes in stomatal conductance, photosynthetic rate, and photosystem II efficiency. This approach enabled the identification of drought-responsive genes based on their differential rhythmic expression profiles in well-watered versus droughted networks and provided new insights into the dynamic physiological changes that occur during drought. PMID:28826479

Identifying online user reputation of user-object bipartite networks

NASA Astrophysics Data System (ADS)

Liu, Xiao-Lu; Liu, Jian-Guo; Yang, Kai; Guo, Qiang; Han, Jing-Ti

2017-02-01

Identifying online user reputation based on the rating information of the user-object bipartite networks is important for understanding online user collective behaviors. Based on the Bayesian analysis, we present a parameter-free algorithm for ranking online user reputation, where the user reputation is calculated based on the probability that their ratings are consistent with the main part of all user opinions. The experimental results show that the AUC values of the presented algorithm could reach 0.8929 and 0.8483 for the MovieLens and Netflix data sets, respectively, which is better than the results generated by the CR and IARR methods. Furthermore, the experimental results for different user groups indicate that the presented algorithm outperforms the iterative ranking methods in both ranking accuracy and computation complexity. Moreover, the results for the synthetic networks show that the computation complexity of the presented algorithm is a linear function of the network size, which suggests that the presented algorithm is very effective and efficient for the large scale dynamic online systems.

Dynamic model of time-dependent complex networks.

PubMed

Hill, Scott A; Braha, Dan

2010-10-01

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

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.

A big data pipeline: Identifying dynamic gene regulatory networks from time-course Gene Expression Omnibus data with applications to influenza infection.

PubMed

Carey, Michelle; Ramírez, Juan Camilo; Wu, Shuang; Wu, Hulin

2018-07-01

A biological host response to an external stimulus or intervention such as a disease or infection is a dynamic process, which is regulated by an intricate network of many genes and their products. Understanding the dynamics of this gene regulatory network allows us to infer the mechanisms involved in a host response to an external stimulus, and hence aids the discovery of biomarkers of phenotype and biological function. In this article, we propose a modeling/analysis pipeline for dynamic gene expression data, called Pipeline4DGEData, which consists of a series of statistical modeling techniques to construct dynamic gene regulatory networks from the large volumes of high-dimensional time-course gene expression data that are freely available in the Gene Expression Omnibus repository. This pipeline has a consistent and scalable structure that allows it to simultaneously analyze a large number of time-course gene expression data sets, and then integrate the results across different studies. We apply the proposed pipeline to influenza infection data from nine studies and demonstrate that interesting biological findings can be discovered with its implementation.

Brain connectivity dynamics during social interaction reflect social network structure

PubMed Central

Schmälzle, Ralf; Brook O’Donnell, Matthew; Garcia, Javier O.; Cascio, Christopher N.; Bayer, Joseph; Vettel, Jean M.

2017-01-01

Social ties are crucial for humans. Disruption of ties through social exclusion has a marked effect on our thoughts and feelings; however, such effects can be tempered by broader social network resources. Here, we use fMRI data acquired from 80 male adolescents to investigate how social exclusion modulates functional connectivity within and across brain networks involved in social pain and understanding the mental states of others (i.e., mentalizing). Furthermore, using objectively logged friendship network data, we examine how individual variability in brain reactivity to social exclusion relates to the density of participants’ friendship networks, an important aspect of social network structure. We find increased connectivity within a set of regions previously identified as a mentalizing system during exclusion relative to inclusion. These results are consistent across the regions of interest as well as a whole-brain analysis. Next, examining how social network characteristics are associated with task-based connectivity dynamics, we find that participants who showed greater changes in connectivity within the mentalizing system when socially excluded by peers had less dense friendship networks. This work provides insight to understand how distributed brain systems respond to social and emotional challenges and how such brain dynamics might vary based on broader social network characteristics. PMID:28465434

Assessing dynamics, spatial scale, and uncertainty in task-related brain network analyses.

PubMed

Stephen, Emily P; Lepage, Kyle Q; Eden, Uri T; Brunner, Peter; Schalk, Gerwin; Brumberg, Jonathan S; Guenther, Frank H; Kramer, Mark A

2014-01-01

The brain is a complex network of interconnected elements, whose interactions evolve dynamically in time to cooperatively perform specific functions. A common technique to probe these interactions involves multi-sensor recordings of brain activity during a repeated task. Many techniques exist to characterize the resulting task-related activity, including establishing functional networks, which represent the statistical associations between brain areas. Although functional network inference is commonly employed to analyze neural time series data, techniques to assess the uncertainty-both in the functional network edges and the corresponding aggregate measures of network topology-are lacking. To address this, we describe a statistically principled approach for computing uncertainty in functional networks and aggregate network measures in task-related data. The approach is based on a resampling procedure that utilizes the trial structure common in experimental recordings. We show in simulations that this approach successfully identifies functional networks and associated measures of confidence emergent during a task in a variety of scenarios, including dynamically evolving networks. In addition, we describe a principled technique for establishing functional networks based on predetermined regions of interest using canonical correlation. Doing so provides additional robustness to the functional network inference. Finally, we illustrate the use of these methods on example invasive brain voltage recordings collected during an overt speech task. The general strategy described here-appropriate for static and dynamic network inference and different statistical measures of coupling-permits the evaluation of confidence in network measures in a variety of settings common to neuroscience.

Dynamic Evolution Model Based on Social Network Services

NASA Astrophysics Data System (ADS)

Xiong, Xi; Gou, Zhi-Jian; Zhang, Shi-Bin; Zhao, Wen

2013-11-01

Based on the analysis of evolutionary characteristics of public opinion in social networking services (SNS), in the paper we propose a dynamic evolution model, in which opinions are coupled with topology. This model shows the clustering phenomenon of opinions in dynamic network evolution. The simulation results show that the model can fit the data from a social network site. The dynamic evolution of networks accelerates the opinion, separation and aggregation. The scale and the number of clusters are influenced by confidence limit and rewiring probability. Dynamic changes of the topology reduce the number of isolated nodes, while the increased confidence limit allows nodes to communicate more sufficiently. The two effects make the distribution of opinion more neutral. The dynamic evolution of networks generates central clusters with high connectivity and high betweenness, which make it difficult to control public opinions in SNS.

Antisynchronization of Two Complex Dynamical Networks

NASA Astrophysics Data System (ADS)

Banerjee, Ranjib; Grosu, Ioan; Dana, Syamal K.

A nonlinear type open-plus-closed-loop (OPCL) coupling is investi-gated for antisynchronization of two complex networks under unidirectional and bidirectional interactions where each node of the networks is considered as a continuous dynamical system. We present analytical results for antisynchroni-zation in identical networks. A numerical example is given for unidirectional coupling with each node represented by a spiking-bursting type Hindmarsh-Rose neuron model. Antisynchronization for mutual interaction is allowed only to inversion symmetric dynamical systems as chosen nodes.

Using Network Dynamical Influence to Drive Consensus

NASA Astrophysics Data System (ADS)

Punzo, Giuliano; Young, George F.; MacDonald, Malcolm; Leonard, Naomi E.

2016-05-01

Consensus and decision-making are often analysed in the context of networks, with many studies focusing attention on ranking the nodes of a network depending on their relative importance to information routing. Dynamical influence ranks the nodes with respect to their ability to influence the evolution of the associated network dynamical system. In this study it is shown that dynamical influence not only ranks the nodes, but also provides a naturally optimised distribution of effort to steer a network from one state to another. An example is provided where the “steering” refers to the physical change in velocity of self-propelled agents interacting through a network. Distinct from other works on this subject, this study looks at directed and hence more general graphs. The findings are presented with a theoretical angle, without targeting particular applications or networked systems; however, the framework and results offer parallels with biological flocks and swarms and opportunities for design of technological networks.

Identifying PHM market and network opportunities.

PubMed

Grube, Mark E; Krishnaswamy, Anand; Poziemski, John; York, Robert W

2015-11-01

Two key processes for healthcare organizations seeking to assume a financially sustainable role in population health management (PHM), after laying the groundwork for the effort, are to identify potential PHM market opportunities and determine the scope of the PHM network. Key variables organizations should consider with respect to market opportunities include the patient population, the overall insurance/employer market, and available types of insurance products. Regarding the network's scope, organizations should consider both traditional strategic criteria for a viable network and at least five additional criteria: network essentiality and PHM care continuum, network adequacy, service distribution right-sizing, network growth strategy, and organizational agility.

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS

PubMed Central

Almquist, Zack W.; Butts, Carter T.

2015-01-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach. PMID:26120218

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS.

PubMed

Almquist, Zack W; Butts, Carter T

2014-08-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach.

Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks

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

Jin, R; McCallen, S; Almaas, E

2007-05-28

Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of complex networks have mainly focused on their network topology. However, in many real world applications, the edges and vertices have associated attributes that are frequently represented as vertex or edge weights. Furthermore, these weights are often not static, instead changing with time and forming a time series. Hence, to fully understand the dynamics of the complex network, we have to consider both network topology and related time series data. In this work, we propose a motifmore » mining approach to identify trend motifs for such purposes. Simply stated, a trend motif describes a recurring subgraph where each of its vertices or edges displays similar dynamics over a userdefined period. Given this, each trend motif occurrence can help reveal significant events in a complex system; frequent trend motifs may aid in uncovering dynamic rules of change for the system, and the distribution of trend motifs may characterize the global dynamics of the system. Here, we have developed efficient mining algorithms to extract trend motifs. Our experimental validation using three disparate empirical datasets, ranging from the stock market, world trade, to a protein interaction network, has demonstrated the efficiency and effectiveness of our approach.« less

Noise-induced relations between network connectivity and dynamics

NASA Astrophysics Data System (ADS)

Ching, Emily Sc

Many biological systems of interest can be represented as networks of many nodes that are interacting with one another. Often these systems are subject to external influence or noise. One of the central issues is to understand the relation between dynamics and the interaction pattern of the system or the connectivity structure of the network. In particular, a challenging problem is to infer the network connectivity structure from the dynamics. In this talk, we show that for stochastic dynamical systems subjected to noise, the presence of noise gives rise to mathematical relations between the network connectivity structure and quantities that can be calculated using solely the time-series measurements of the dynamics of the nodes. We present these relations for both undirected networks with bidirectional coupling and directed networks with directional coupling and discuss how such relations can be utilized to infer the network connectivity structure of the systems. Work supported by the Hong Kong Research Grants Council under Grant No. CUHK 14300914.

Fundamental structures of dynamic social networks.

PubMed

Sekara, Vedran; Stopczynski, Arkadiusz; Lehmann, Sune

2016-09-06

Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships, and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection unnecessary. Starting from 5-min time slices, we uncover dynamic social structures expressed on multiple timescales. On the hourly timescale, we find that gatherings are fluid, with members coming and going, but organized via a stable core of individuals. Each core represents a social context. Cores exhibit a pattern of recurring meetings across weeks and months, each with varying degrees of regularity. Taken together, these findings provide a powerful simplification of the social network, where cores represent fundamental structures expressed with strong temporal and spatial regularity. Using this framework, we explore the complex interplay between social and geospatial behavior, documenting how the formation of cores is preceded by coordination behavior in the communication networks and demonstrating that social behavior can be predicted with high precision.

Fundamental structures of dynamic social networks

PubMed Central

Sekara, Vedran; Stopczynski, Arkadiusz; Lehmann, Sune

2016-01-01

Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships, and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection unnecessary. Starting from 5-min time slices, we uncover dynamic social structures expressed on multiple timescales. On the hourly timescale, we find that gatherings are fluid, with members coming and going, but organized via a stable core of individuals. Each core represents a social context. Cores exhibit a pattern of recurring meetings across weeks and months, each with varying degrees of regularity. Taken together, these findings provide a powerful simplification of the social network, where cores represent fundamental structures expressed with strong temporal and spatial regularity. Using this framework, we explore the complex interplay between social and geospatial behavior, documenting how the formation of cores is preceded by coordination behavior in the communication networks and demonstrating that social behavior can be predicted with high precision. PMID:27555584

Learning State Space Dynamics in Recurrent Networks

NASA Astrophysics Data System (ADS)

Simard, Patrice Yvon

Fully recurrent (asymmetrical) networks can be used to learn temporal trajectories. The network is unfolded in time, and backpropagation is used to train the weights. The presence of recurrent connections creates internal states in the system which vary as a function of time. The resulting dynamics can provide interesting additional computing power but learning is made more difficult by the existence of internal memories. This study first exhibits the properties of recurrent networks in terms of convergence when the internal states of the system are unknown. A new energy functional is provided to change the weights of the units in order to the control the stability of the fixed points of the network's dynamics. The power of the resultant algorithm is illustrated with the simulation of a content addressable memory. Next, the more general case of time trajectories on a recurrent network is studied. An application is proposed in which trajectories are generated to draw letters as a function of an input. In another application of recurrent systems, a neural network certain temporal properties observed in human callosally sectioned brains. Finally the proposed algorithm for stabilizing dynamics around fixed points is extended to one for stabilizing dynamics around time trajectories. Its effects are illustrated on a network which generates Lisajous curves.

Topological Principles of Control in Dynamical Networks

NASA Astrophysics Data System (ADS)

Kim, Jason; Pasqualetti, Fabio; Bassett, Danielle

Networked biological systems, such as the brain, feature complex patterns of interactions. To predict and correct the dynamic behavior of such systems, it is imperative to understand how the underlying topological structure affects and limits the function of the system. Here, we use network control theory to extract topological features that favor or prevent network controllability, and to understand the network-wide effect of external stimuli on large-scale brain systems. Specifically, we treat each brain region as a dynamic entity with real-valued state, and model the time evolution of all interconnected regions using linear, time-invariant dynamics. We propose a simplified feed-forward scheme where the effect of upstream regions (drivers) on the connected downstream regions (non-drivers) is characterized in closed-form. Leveraging this characterization of the simplified model, we derive topological features that predict the controllability properties of non-simplified networks. We show analytically and numerically that these predictors are accurate across a large range of parameters. Among other contributions, our analysis shows that heterogeneity in the network weights facilitate controllability, and allows us to implement targeted interventions that profoundly improve controllability. By assuming an underlying dynamical mechanism, we are able to understand the complex topology of networked biological systems in a functionally meaningful way.

Dynamic recruitment of resting state sub-networks

PubMed Central

O'Neill, George C.; Bauer, Markus; Woolrich, Mark W.; Morris, Peter G.; Barnes, Gareth R.; Brookes, Matthew J.

2015-01-01

Resting state networks (RSNs) are of fundamental importance in human systems neuroscience with evidence suggesting that they are integral to healthy brain function and perturbed in pathology. Despite rapid progress in this area, the temporal dynamics governing the functional connectivities that underlie RSN structure remain poorly understood. Here, we present a framework to help further our understanding of RSN dynamics. We describe a methodology which exploits the direct nature and high temporal resolution of magnetoencephalography (MEG). This technique, which builds on previous work, extends from solving fundamental confounds in MEG (source leakage) to multivariate modelling of transient connectivity. The resulting processing pipeline facilitates direct (electrophysiological) measurement of dynamic functional networks. Our results show that, when functional connectivity is assessed in small time windows, the canonical sensorimotor network can be decomposed into a number of transiently synchronising sub-networks, recruitment of which depends on current mental state. These rapidly changing sub-networks are spatially focal with, for example, bilateral primary sensory and motor areas resolved into two separate sub-networks. The likely interpretation is that the larger canonical sensorimotor network most often seen in neuroimaging studies reflects only a temporal aggregate of these transient sub-networks. Our approach opens new frontiers to study RSN dynamics, showing that MEG is capable of revealing the spatial, temporal and spectral signature of the human connectome in health and disease. PMID:25899137

Spatio-temporal organization of dynamics in a two-dimensional periodically driven vortex flow: A Lagrangian flow network perspective.

PubMed

Lindner, Michael; Donner, Reik V

2017-03-01

We study the Lagrangian dynamics of passive tracers in a simple model of a driven two-dimensional vortex resembling real-world geophysical flow patterns. Using a discrete approximation of the system's transfer operator, we construct a directed network that describes the exchange of mass between distinct regions of the flow domain. By studying different measures characterizing flow network connectivity at different time-scales, we are able to identify the location of dynamically invariant structures and regions of maximum dispersion. Specifically, our approach allows us to delimit co-existing flow regimes with different dynamics. To validate our findings, we compare several network characteristics to the well-established finite-time Lyapunov exponents and apply a receiver operating characteristic analysis to identify network measures that are particularly useful for unveiling the skeleton of Lagrangian chaos.

Assessing dynamics, spatial scale, and uncertainty in task-related brain network analyses

PubMed Central

Stephen, Emily P.; Lepage, Kyle Q.; Eden, Uri T.; Brunner, Peter; Schalk, Gerwin; Brumberg, Jonathan S.; Guenther, Frank H.; Kramer, Mark A.

2014-01-01

The brain is a complex network of interconnected elements, whose interactions evolve dynamically in time to cooperatively perform specific functions. A common technique to probe these interactions involves multi-sensor recordings of brain activity during a repeated task. Many techniques exist to characterize the resulting task-related activity, including establishing functional networks, which represent the statistical associations between brain areas. Although functional network inference is commonly employed to analyze neural time series data, techniques to assess the uncertainty—both in the functional network edges and the corresponding aggregate measures of network topology—are lacking. To address this, we describe a statistically principled approach for computing uncertainty in functional networks and aggregate network measures in task-related data. The approach is based on a resampling procedure that utilizes the trial structure common in experimental recordings. We show in simulations that this approach successfully identifies functional networks and associated measures of confidence emergent during a task in a variety of scenarios, including dynamically evolving networks. In addition, we describe a principled technique for establishing functional networks based on predetermined regions of interest using canonical correlation. Doing so provides additional robustness to the functional network inference. Finally, we illustrate the use of these methods on example invasive brain voltage recordings collected during an overt speech task. The general strategy described here—appropriate for static and dynamic network inference and different statistical measures of coupling—permits the evaluation of confidence in network measures in a variety of settings common to neuroscience. PMID:24678295

Global value chains: Building blocks and network dynamics

NASA Astrophysics Data System (ADS)

Tsekeris, Theodore

2017-12-01

The paper employs measures and tools from complex network analysis to enhance the understanding and interpretation of structural characteristics pertaining to the Global Value Chains (GVCs) during the period 1995-2011. The analysis involves the country, sector and country-sector value chain networks to identify main drivers of structural change. The results indicate significant intertemporal changes, mirroring the increased globalization in terms of network size, strength and connectivity. They also demonstrate higher clustering and increased concentration of the most influential countries and country-sectors relative to all others in the GVC network, with the geographical dimension to prevail over the sectoral dimension in the formation of value chains. The regionalization and less hierarchical organization drive country-sector production sharing, while the sectoral value chain network has become more integrated and more competitive over time. The findings suggest that the impact of country-sector policies and/or shocks may vary with the own-group and network-wide influence of each country, take place in multiple geographical scales, as GVCs have a block structure, and involve time dynamics.

Deciphering deterioration mechanisms of complex diseases based on the construction of dynamic networks and systems analysis

NASA Astrophysics Data System (ADS)

Li, Yuanyuan; Jin, Suoqin; Lei, Lei; Pan, Zishu; Zou, Xiufen

2015-03-01

The early diagnosis and investigation of the pathogenic mechanisms of complex diseases are the most challenging problems in the fields of biology and medicine. Network-based systems biology is an important technique for the study of complex diseases. The present study constructed dynamic protein-protein interaction (PPI) networks to identify dynamical network biomarkers (DNBs) and analyze the underlying mechanisms of complex diseases from a systems level. We developed a model-based framework for the construction of a series of time-sequenced networks by integrating high-throughput gene expression data into PPI data. By combining the dynamic networks and molecular modules, we identified significant DNBs for four complex diseases, including influenza caused by either H3N2 or H1N1, acute lung injury and type 2 diabetes mellitus, which can serve as warning signals for disease deterioration. Function and pathway analyses revealed that the identified DNBs were significantly enriched during key events in early disease development. Correlation and information flow analyses revealed that DNBs effectively discriminated between different disease processes and that dysfunctional regulation and disproportional information flow may contribute to the increased disease severity. This study provides a general paradigm for revealing the deterioration mechanisms of complex diseases and offers new insights into their early diagnoses.

Dynamic Agent Classification and Tracking Using an Ad Hoc Mobile Acoustic Sensor Network

NASA Astrophysics Data System (ADS)

Friedlander, David; Griffin, Christopher; Jacobson, Noah; Phoha, Shashi; Brooks, Richard R.

2003-12-01

Autonomous networks of sensor platforms can be designed to interact in dynamic and noisy environments to determine the occurrence of specified transient events that define the dynamic process of interest. For example, a sensor network may be used for battlefield surveillance with the purpose of detecting, identifying, and tracking enemy activity. When the number of nodes is large, human oversight and control of low-level operations is not feasible. Coordination and self-organization of multiple autonomous nodes is necessary to maintain connectivity and sensor coverage and to combine information for better understanding the dynamics of the environment. Resource conservation requires adaptive clustering in the vicinity of the event. This paper presents methods for dynamic distributed signal processing using an ad hoc mobile network of microsensors to detect, identify, and track targets in noisy environments. They seamlessly integrate data from fixed and mobile platforms and dynamically organize platforms into clusters to process local data along the trajectory of the targets. Local analysis of sensor data is used to determine a set of target attribute values and classify the target. Sensor data from a field test in the Marine base at Twentynine Palms, Calif, was analyzed using the techniques described in this paper. The results were compared to "ground truth" data obtained from GPS receivers on the vehicles.

Reconstructing networks from dynamics with correlated noise

NASA Astrophysics Data System (ADS)

Tam, H. C.; Ching, Emily S. C.; Lai, Pik-Yin

2018-07-01

Reconstructing the structure of complex networks from measurements of the nodes is a challenge in many branches of science. External influences are always present and act as a noise to the networks of interest. In this paper, we present a method for reconstructing networks from measured dynamics of the nodes subjected to correlated noise that cannot be approximated by a white noise. This method can reconstruct the links of both bidirectional and directed networks, the correlation time and strength of the noise, and also the relative coupling strength of the links when the coupling functions have certain properties. Our method is built upon theoretical relations between network structure and measurable quantities from the dynamics that we have derived for systems that have fixed point dynamics in the noise-free limit. Using these theoretical results, we can further explain the shortcomings of two common practices of inferring links for bidirectional networks using the Pearson correlation coefficient and the partial correlation coefficient.

A dynamic network model for interbank market

NASA Astrophysics Data System (ADS)

Xu, Tao; He, Jianmin; Li, Shouwei

2016-12-01

In this paper, a dynamic network model based on agent behavior is introduced to explain the formation mechanism of interbank market network. We investigate the impact of credit lending preference on interbank market network topology, the evolution of interbank market network and stability of interbank market. Experimental results demonstrate that interbank market network is a small-world network and cumulative degree follows the power-law distribution. We find that the interbank network structure keeps dynamic stability in the network evolution process. With the increase of bank credit lending preference, network clustering coefficient increases and average shortest path length decreases monotonously, which improves the stability of the network structure. External shocks are main threats for the interbank market and the reduction of bank external investment yield rate and deposits fluctuations contribute to improve the resilience of the banking system.

SCOUT: simultaneous time segmentation and community detection in dynamic networks

PubMed Central

Hulovatyy, Yuriy; Milenković, Tijana

2016-01-01

Many evolving complex real-world systems can be modeled via dynamic networks. An important problem in dynamic network research is community detection, which finds groups of topologically related nodes. Typically, this problem is approached by assuming either that each time point has a distinct community organization or that all time points share a single community organization. The reality likely lies between these two extremes. To find the compromise, we consider community detection in the context of the problem of segment detection, which identifies contiguous time periods with consistent network structure. Consequently, we formulate a combined problem of segment community detection (SCD), which simultaneously partitions the network into contiguous time segments with consistent community organization and finds this community organization for each segment. To solve SCD, we introduce SCOUT, an optimization framework that explicitly considers both segmentation quality and partition quality. SCOUT addresses limitations of existing methods that can be adapted to solve SCD, which consider only one of segmentation quality or partition quality. In a thorough evaluation, SCOUT outperforms the existing methods in terms of both accuracy and computational complexity. We apply SCOUT to biological network data to study human aging. PMID:27881879

Dynamic Trust Management for Mobile Networks and Its Applications

ERIC Educational Resources Information Center

Bao, Fenye

2013-01-01

Trust management in mobile networks is challenging due to dynamically changing network environments and the lack of a centralized trusted authority. In this dissertation research, we "design" and "validate" a class of dynamic trust management protocols for mobile networks, and demonstrate the utility of dynamic trust management…

Interplay of network dynamics and heterogeneity of ties on spreading dynamics.

PubMed

Ferreri, Luca; Bajardi, Paolo; Giacobini, Mario; Perazzo, Silvia; Venturino, Ezio

2014-07-01

The structure of a network dramatically affects the spreading phenomena unfolding upon it. The contact distribution of the nodes has long been recognized as the key ingredient in influencing the outbreak events. However, limited knowledge is currently available on the role of the weight of the edges on the persistence of a pathogen. At the same time, recent works showed a strong influence of temporal network dynamics on disease spreading. In this work we provide an analytical understanding, corroborated by numerical simulations, about the conditions for infected stable state in weighted networks. In particular, we reveal the role of heterogeneity of edge weights and of the dynamic assignment of weights on the ties in the network in driving the spread of the epidemic. In this context we show that when weights are dynamically assigned to ties in the network, a heterogeneous distribution is able to hamper the diffusion of the disease, contrary to what happens when weights are fixed in time.

Adaptive-network models of collective dynamics

NASA Astrophysics Data System (ADS)

Zschaler, G.

2012-09-01

Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge

Discrete dynamic modeling of cellular signaling networks.

PubMed

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

A Markov model for the temporal dynamics of balanced random networks of finite size

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2014-01-01

The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between

An association network analysis among microeukaryotes and bacterioplankton reveals algal bloom dynamics.

PubMed

Tan, Shangjin; Zhou, Jin; Zhu, Xiaoshan; Yu, Shichen; Zhan, Wugen; Wang, Bo; Cai, Zhonghua

2015-02-01

Algal blooms are a worldwide phenomenon and the biological interactions that underlie their regulation are only just beginning to be understood. It is established that algal microorganisms associate with many other ubiquitous, oceanic organisms, but the interactions that lead to the dynamics of bloom formation are currently unknown. To address this gap, we used network approaches to investigate the association patterns among microeukaryotes and bacterioplankton in response to a natural Scrippsiella trochoidea bloom. This is the first study to apply network approaches to bloom dynamics. To this end, terminal restriction fragment (T-RF) length polymorphism analysis showed dramatic changes in community compositions of microeukaryotes and bacterioplankton over the blooming period. A variance ratio test revealed significant positive overall associations both within and between microeukaryotic and bacterioplankton communities. An association network generated from significant correlations between T-RFs revealed that S. trochoidea had few connections to other microeukaryotes and bacterioplankton and was placed on the edge. This lack of connectivity allowed for the S. trochoidea sub-network to break off from the overall network. These results allowed us to propose a conceptual model for explaining how changes in microbial associations regulate the dynamics of an algal bloom. In addition, key T-RFs were screened by principal components analysis, correlation coefficients, and network analysis. Dominant T-RFs were then identified through 18S and 16S rRNA gene clone libraries. Results showed that microeukaryotes clustered predominantly with Dinophyceae and Perkinsea while the majority of bacterioplankton identified were Alphaproteobacteria, Gammaproteobacteria, and Bacteroidetes. The ecologi-cal roles of both were discussed in the context of these findings. © 2014 Phycological Society of America.

Competing dynamic phases of active polymer networks

NASA Astrophysics Data System (ADS)

Freedman, Simon; Banerjee, Shiladitya; Dinner, Aaron R.

Recent experiments on in-vitro reconstituted assemblies of F-actin, myosin-II motors, and cross-linking proteins show that tuning local network properties can changes the fundamental biomechanical behavior of the system. For example, by varying cross-linker density and actin bundle rigidity, one can switch between contractile networks useful for reshaping cells, polarity sorted networks ideal for directed molecular transport, and frustrated networks with robust structural properties. To efficiently investigate the dynamic phases of actomyosin networks, we developed a coarse grained non-equilibrium molecular dynamics simulation of model semiflexible filaments, molecular motors, and cross-linkers with phenomenologically defined interactions. The simulation's accuracy was verified by benchmarking the mechanical properties of its individual components and collective behavior against experimental results at the molecular and network scales. By adjusting the model's parameters, we can reproduce the qualitative phases observed in experiment and predict the protein characteristics where phase crossovers could occur in collective network dynamics. Our model provides a framework for understanding cells' multiple uses of actomyosin networks and their applicability in materials research. Supported by the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program.

Collective dynamics of 'small-world' networks.

PubMed

Watts, D J; Strogatz, S H

1998-06-04

Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.

Research on dynamic routing mechanisms in wireless sensor networks.

PubMed

Zhao, A Q; Weng, Y N; Lu, Y; Liu, C Y

2014-01-01

WirelessHART is the most widely applied standard in wireless sensor networks nowadays. However, it does not provide any dynamic routing mechanism, which is important for the reliability and robustness of the wireless network applications. In this paper, a collection tree protocol based, dynamic routing mechanism was proposed for WirelessHART network. The dynamic routing mechanism was evaluated through several simulation experiments in three aspects: time for generating the topology, link quality, and stability of network. Besides, the data transmission efficiency of this routing mechanism was analyzed. The simulation and evaluation results show that this mechanism can act as a dynamic routing mechanism for the TDMA-based wireless sensor network.

Criticality in finite dynamical networks

NASA Astrophysics Data System (ADS)

Rohlf, Thimo; Gulbahce, Natali; Teuscher, Christof

2007-03-01

It has been shown analytically and experimentally that both random boolean and random threshold networks show a transition from ordered to chaotic dynamics at a critical average connectivity Kc in the thermodynamical limit [1]. By looking at the statistical distributions of damage spreading (damage sizes), we go beyond this extensively studied mean-field approximation. We study the scaling properties of damage size distributions as a function of system size N and initial perturbation size d(t=0). We present numerical evidence that another characteristic point, Kd exists for finite system sizes, where the expectation value of damage spreading in the network is independent of the system size N. Further, the probability to obtain critical networks is investigated for a given system size and average connectivity k. Our results suggest that, for finite size dynamical networks, phase space structure is very complex and may not exhibit a sharp order-disorder transition. Finally, we discuss the implications of our findings for evolutionary processes and learning applied to networks which solve specific computational tasks. [1] Derrida, B. and Pomeau, Y. (1986), Europhys. Lett., 1, 45-49

Random Evolution of Idiotypic Networks: Dynamics and Architecture

NASA Astrophysics Data System (ADS)

Brede, Markus; Behn, Ulrich

The paper deals with modelling a subsystem of the immune system, the so-called idiotypic network (INW). INWs, conceived by N.K. Jerne in 1974, are functional networks of interacting antibodies and B cells. In principle, Jernes' framework provides solutions to many issues in immunology, such as immunological memory, mechanisms for antigen recognition and self/non-self discrimination. Explaining the interconnection between the elementary components, local dynamics, network formation and architecture, and possible modes of global system function appears to be an ideal playground of statistical mechanics. We present a simple cellular automaton model, based on a graph representation of the system. From a simplified description of idiotypic interactions, rules for the random evolution of networks of occupied and empty sites on these graphs are derived. In certain biologically relevant parameter ranges the resultant dynamics leads to stationary states. A stationary state is found to correspond to a specific pattern of network organization. It turns out that even these very simple rules give rise to a multitude of different kinds of patterns. We characterize these networks by classifying `static' and `dynamic' network-patterns. A type of `dynamic' network is found to display many features of real INWs.

Predicting the evolution of complex networks via similarity dynamics

NASA Astrophysics Data System (ADS)

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

2017-01-01

Almost all real-world networks are subject to constant evolution, and plenty of them have been investigated empirically to uncover the underlying evolution mechanism. However, the evolution prediction of dynamic networks still remains a challenging problem. The crux of this matter is to estimate the future network links of dynamic networks. This paper studies the evolution prediction of dynamic networks with link prediction paradigm. To estimate the likelihood of the existence of links more accurate, an effective and robust similarity index is presented by exploiting network structure adaptively. Moreover, most of the existing link prediction methods do not make a clear distinction between future links and missing links. In order to predict the future links, the networks are regarded as dynamic systems in this paper, and a similarity updating method, spatial-temporal position drift model, is developed to simulate the evolutionary dynamics of node similarity. Then the updated similarities are used as input information for the future links' likelihood estimation. Extensive experiments on real-world networks suggest that the proposed similarity index performs better than baseline methods and the position drift model performs well for evolution prediction in real-world evolving networks.

A New View of Dynamic River Networks

NASA Astrophysics Data System (ADS)

Perron, J. T.; Willett, S.; McCoy, S. W.

2014-12-01

River networks are the main conduits that transport water, sediment, and nutrients from continental interiors to the oceans. They also shape topography as they erode through bedrock. These hierarchical networks are dynamic: there are numerous examples of apparent changes in the topology of river networks through geologic time. But these examples are geographically scattered, the evidence can be ambiguous, and the mechanisms that drive changes in river networks are poorly understood. This makes it difficult to assess how pervasive river network reorganization is, how it operates, and how the interlocking river basins that compose a given landscape are changing through time. Recent progress has improved the situation. We describe three developments that have dramatically advanced our understanding of dynamic river networks. First, new topographic, geophysical and geochronological measurement techniques are revealing the rate and extent of river network adjustment. Second, laboratory experiments and computational models are clarifying how river networks respond to tectonic and climatic perturbations at scales ranging from local to continental. Third, spatial analysis of genetic data is exposing links between landscape evolution, biological evolution, and the development of biodiversity. We highlight key problems that remain unsolved, and suggest ways to build on recent advances that will bring dynamic river networks into even sharper focus.

Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method

PubMed Central

Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui

2017-01-01

Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli, and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs. PMID:29113310

Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method.

PubMed

Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui

2017-10-06

Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli , and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.

Time Series Analysis of the Bacillus subtilis Sporulation Network Reveals Low Dimensional Chaotic Dynamics.

PubMed

Lecca, Paola; Mura, Ivan; Re, Angela; Barker, Gary C; Ihekwaba, Adaoha E C

2016-01-01

Chaotic behavior refers to a behavior which, albeit irregular, is generated by an underlying deterministic process. Therefore, a chaotic behavior is potentially controllable. This possibility becomes practically amenable especially when chaos is shown to be low-dimensional, i.e., to be attributable to a small fraction of the total systems components. In this case, indeed, including the major drivers of chaos in a system into the modeling approach allows us to improve predictability of the systems dynamics. Here, we analyzed the numerical simulations of an accurate ordinary differential equation model of the gene network regulating sporulation initiation in Bacillus subtilis to explore whether the non-linearity underlying time series data is due to low-dimensional chaos. Low-dimensional chaos is expectedly common in systems with few degrees of freedom, but rare in systems with many degrees of freedom such as the B. subtilis sporulation network. The estimation of a number of indices, which reflect the chaotic nature of a system, indicates that the dynamics of this network is affected by deterministic chaos. The neat separation between the indices obtained from the time series simulated from the model and those obtained from time series generated by Gaussian white and colored noise confirmed that the B. subtilis sporulation network dynamics is affected by low dimensional chaos rather than by noise. Furthermore, our analysis identifies the principal driver of the networks chaotic dynamics to be sporulation initiation phosphotransferase B (Spo0B). We then analyzed the parameters and the phase space of the system to characterize the instability points of the network dynamics, and, in turn, to identify the ranges of values of Spo0B and of the other drivers of the chaotic dynamics, for which the whole system is highly sensitive to minimal perturbation. In summary, we described an unappreciated source of complexity in the B. subtilis sporulation network by gathering

Psychophysiological whole-brain network clustering based on connectivity dynamics analysis in naturalistic conditions.

PubMed

Raz, Gal; Shpigelman, Lavi; Jacob, Yael; Gonen, Tal; Benjamini, Yoav; Hendler, Talma

2016-12-01

We introduce a novel method for delineating context-dependent functional brain networks whose connectivity dynamics are synchronized with the occurrence of a specific psychophysiological process of interest. In this method of context-related network dynamics analysis (CRNDA), a continuous psychophysiological index serves as a reference for clustering the whole-brain into functional networks. We applied CRNDA to fMRI data recorded during the viewing of a sadness-inducing film clip. The method reliably demarcated networks in which temporal patterns of connectivity related to the time series of reported emotional intensity. Our work successfully replicated the link between network connectivity and emotion rating in an independent sample group for seven of the networks. The demarcated networks have clear common functional denominators. Three of these networks overlap with distinct empathy-related networks, previously identified in distinct sets of studies. The other networks are related to sensorimotor processing, language, attention, and working memory. The results indicate that CRNDA, a data-driven method for network clustering that is sensitive to transient connectivity patterns, can productively and reliably demarcate networks that follow psychologically meaningful processes. Hum Brain Mapp 37:4654-4672, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Dynamic connectivity states estimated from resting fMRI Identify differences among Schizophrenia, bipolar disorder, and healthy control subjects.

PubMed

Rashid, Barnaly; Damaraju, Eswar; Pearlson, Godfrey D; Calhoun, Vince D

2014-01-01

Schizophrenia (SZ) and bipolar disorder (BP) share significant overlap in clinical symptoms, brain characteristics, and risk genes, and both are associated with dysconnectivity among large-scale brain networks. Resting state functional magnetic resonance imaging (rsfMRI) data facilitates studying macroscopic connectivity among distant brain regions. Standard approaches to identifying such connectivity include seed-based correlation and data-driven clustering methods such as independent component analysis (ICA) but typically focus on average connectivity. In this study, we utilize ICA on rsfMRI data to obtain intrinsic connectivity networks (ICNs) in cohorts of healthy controls (HCs) and age matched SZ and BP patients. Subsequently, we investigated difference in functional network connectivity, defined as pairwise correlations among the timecourses of ICNs, between HCs and patients. We quantified differences in both static (average) and dynamic (windowed) connectivity during the entire scan duration. Disease-specific differences were identified in connectivity within different dynamic states. Notably, results suggest that patients make fewer transitions to some states (states 1, 2, and 4) compared to HCs, with most such differences confined to a single state. SZ patients showed more differences from healthy subjects than did bipolars, including both hyper and hypo connectivity in one common connectivity state (dynamic state 3). Also group differences between SZ and bipolar patients were identified in patterns (states) of connectivity involving the frontal (dynamic state 1) and frontal-parietal regions (dynamic state 3). Our results provide new information about these illnesses and strongly suggest that state-based analyses are critical to avoid averaging together important factors that can help distinguish these clinical groups.

Mapping dynamic social networks in real life using participants' own smartphones.

PubMed

Boonstra, Tjeerd W; E Larsen, Mark; Christensen, Helen

2015-11-01

Interpersonal relationships are vital for our daily functioning and wellbeing. Social networks may form the primary means by which environmental influences determine individual traits. Several studies have shown the influence of social networks on decision-making, behaviors and wellbeing. Smartphones have great potential for measuring social networks in a real world setting. Here we tested the feasibility of using people's own smartphones as a data collection platform for face-to-face interactions. We developed an application for iOS and Android to collect Bluetooth data and acquired one week of data from 14 participants in our organization. The Bluetooth scanning statistics were used to quantify the time-resolved connection strength between participants and define the weights of a dynamic social network. We used network metrics to quantify changes in network topology over time and non-negative matrix factorization to identify cliques or subgroups that reoccurred during the week. The scanning rate varied considerably between smartphones running Android and iOS and egocentric networks metrics were correlated with the scanning rate. The time courses of two identified subgroups matched with two meetings that took place that week. These findings demonstrate the feasibility of using participants' own smartphones to map social network, whilst identifying current limitations of using generic smartphones. The bias introduced by variations in scanning rate and missing data is an important limitation that needs to be addressed in future studies.

A probabilistic approach to identify putative drug targets in biochemical networks.

PubMed

Murabito, Ettore; Smallbone, Kieran; Swinton, Jonathan; Westerhoff, Hans V; Steuer, Ralf

2011-06-06

Network-based drug design holds great promise in clinical research as a way to overcome the limitations of traditional approaches in the development of drugs with high efficacy and low toxicity. This novel strategy aims to study how a biochemical network as a whole, rather than its individual components, responds to specific perturbations in different physiological conditions. Proteins exerting little control over normal cells and larger control over altered cells may be considered as good candidates for drug targets. The application of network-based drug design would greatly benefit from using an explicit computational model describing the dynamics of the system under investigation. However, creating a fully characterized kinetic model is not an easy task, even for relatively small networks, as it is still significantly hampered by the lack of data about kinetic mechanisms and parameters values. Here, we propose a Monte Carlo approach to identify the differences between flux control profiles of a metabolic network in different physiological states, when information about the kinetics of the system is partially or totally missing. Based on experimentally accessible information on metabolic phenotypes, we develop a novel method to determine probabilistic differences in the flux control coefficients between the two observable phenotypes. Knowledge of how differences in flux control are distributed among the different enzymatic steps is exploited to identify points of fragility in one of the phenotypes. Using a prototypical cancerous phenotype as an example, we demonstrate how our approach can assist researchers in developing compounds with high efficacy and low toxicity. © 2010 The Royal Society

Identifying the Community Structure of the Food-Trade International Multi-Network

NASA Technical Reports Server (NTRS)

Torreggiani, S.; Mangioni, G.

2018-01-01

Achieving international food security requires improved understanding of how international trade networks connect countries around the world through the import-export flows of food commodities. The properties of international food trade networks are still poorly documented, especially from a multi-network perspective. In particular, nothing is known about the multi-network's community structure. Here we find that the individual crop-specific layers of the multi-network have densely connected trading groups, a consistent characteristic over the period 2001-2011. Further, the multi-network is characterized by low variability over this period but with substantial heterogeneity across layers in each year. In particular, the layers are mostly assortative: more-intensively connected countries tend to import from and export to countries that are themselves more connected. We also fit econometric models to identify social, economic and geographic factors explaining the probability that any two countries are co-present in the same community. Our estimates indicate that the probability of country pairs belonging to the same food trade community depends more on geopolitical and economic factors-such as geographical proximity and trade-agreement co-membership-than on country economic size and/or income. These community-structure findings of the multi-network are especially valuable for efforts to understand past and emerging dynamics in the global food system, especially those that examine potential 'shocks' to global food trade.

Self-organization of complex networks as a dynamical system

NASA Astrophysics Data System (ADS)

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

Self-organization of complex networks as a dynamical system.

PubMed

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

Nonlinear Dynamics on Interconnected Networks

NASA Astrophysics Data System (ADS)

Arenas, Alex; De Domenico, Manlio

2016-06-01

Networks of dynamical interacting units can represent many complex systems, from the human brain to transportation systems and societies. The study of these complex networks, when accounting for different types of interactions has become a subject of interest in the last few years, especially because its representational power in the description of users' interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.) [1], or in representing different transportation modes in urban networks [2,3]. The general name coined for these networks is multilayer networks, where each layer accounts for a type of interaction (see Fig. 1).

A mathematical programming approach for sequential clustering of dynamic networks

NASA Astrophysics Data System (ADS)

Silva, Jonathan C.; Bennett, Laura; Papageorgiou, Lazaros G.; Tsoka, Sophia

2016-02-01

A common analysis performed on dynamic networks is community structure detection, a challenging problem that aims to track the temporal evolution of network modules. An emerging area in this field is evolutionary clustering, where the community structure of a network snapshot is identified by taking into account both its current state as well as previous time points. Based on this concept, we have developed a mixed integer non-linear programming (MINLP) model, SeqMod, that sequentially clusters each snapshot of a dynamic network. The modularity metric is used to determine the quality of community structure of the current snapshot and the historical cost is accounted for by optimising the number of node pairs co-clustered at the previous time point that remain so in the current snapshot partition. Our method is tested on social networks of interactions among high school students, college students and members of the Brazilian Congress. We show that, for an adequate parameter setting, our algorithm detects the classes that these students belong more accurately than partitioning each time step individually or by partitioning the aggregated snapshots. Our method also detects drastic discontinuities in interaction patterns across network snapshots. Finally, we present comparative results with similar community detection methods for time-dependent networks from the literature. Overall, we illustrate the applicability of mathematical programming as a flexible, adaptable and systematic approach for these community detection problems. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.

Multi-scale compositionality: identifying the compositional structures of social dynamics using deep learning.

PubMed

Peng, Huan-Kai; Marculescu, Radu

2015-01-01

Social media exhibit rich yet distinct temporal dynamics which cover a wide range of different scales. In order to study this complex dynamics, two fundamental questions revolve around (1) the signatures of social dynamics at different time scales, and (2) the way in which these signatures interact and form higher-level meanings. In this paper, we propose the Recursive Convolutional Bayesian Model (RCBM) to address both of these fundamental questions. The key idea behind our approach consists of constructing a deep-learning framework using specialized convolution operators that are designed to exploit the inherent heterogeneity of social dynamics. RCBM's runtime and convergence properties are guaranteed by formal analyses. Experimental results show that the proposed method outperforms the state-of-the-art approaches both in terms of solution quality and computational efficiency. Indeed, by applying the proposed method on two social network datasets, Twitter and Yelp, we are able to identify the compositional structures that can accurately characterize the complex social dynamics from these two social media. We further show that identifying these patterns can enable new applications such as anomaly detection and improved social dynamics forecasting. Finally, our analysis offers new insights on understanding and engineering social media dynamics, with direct applications to opinion spreading and online content promotion.

Multi-Scale Compositionality: Identifying the Compositional Structures of Social Dynamics Using Deep Learning

PubMed Central

Peng, Huan-Kai; Marculescu, Radu

2015-01-01

Objective Social media exhibit rich yet distinct temporal dynamics which cover a wide range of different scales. In order to study this complex dynamics, two fundamental questions revolve around (1) the signatures of social dynamics at different time scales, and (2) the way in which these signatures interact and form higher-level meanings. Method In this paper, we propose the Recursive Convolutional Bayesian Model (RCBM) to address both of these fundamental questions. The key idea behind our approach consists of constructing a deep-learning framework using specialized convolution operators that are designed to exploit the inherent heterogeneity of social dynamics. RCBM’s runtime and convergence properties are guaranteed by formal analyses. Results Experimental results show that the proposed method outperforms the state-of-the-art approaches both in terms of solution quality and computational efficiency. Indeed, by applying the proposed method on two social network datasets, Twitter and Yelp, we are able to identify the compositional structures that can accurately characterize the complex social dynamics from these two social media. We further show that identifying these patterns can enable new applications such as anomaly detection and improved social dynamics forecasting. Finally, our analysis offers new insights on understanding and engineering social media dynamics, with direct applications to opinion spreading and online content promotion. PMID:25830775

Dynamic Network-Based Epistasis Analysis: Boolean Examples

PubMed Central

Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.

2011-01-01

In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and

DNA-Based Dynamic Reaction Networks.

PubMed

Fu, Ting; Lyu, Yifan; Liu, Hui; Peng, Ruizi; Zhang, Xiaobing; Ye, Mao; Tan, Weihong

2018-05-21

Deriving from logical and mechanical interactions between DNA strands and complexes, DNA-based artificial reaction networks (RNs) are attractive for their high programmability, as well as cascading and fan-out ability, which are similar to the basic principles of electronic logic gates. Arising from the dream of creating novel computing mechanisms, researchers have placed high hopes on the development of DNA-based dynamic RNs and have strived to establish the basic theories and operative strategies of these networks. This review starts by looking back on the evolution of DNA dynamic RNs; in particular' the most significant applications in biochemistry occurring in recent years. Finally, we discuss the perspectives of DNA dynamic RNs and give a possible direction for the development of DNA circuits. Copyright © 2018. Published by Elsevier Ltd.

Architecture and dynamics of overlapped RNA regulatory networks.

PubMed

Lapointe, Christopher P; Preston, Melanie A; Wilinski, Daniel; Saunders, Harriet A J; Campbell, Zachary T; Wickens, Marvin

2017-11-01

A single protein can bind and regulate many mRNAs. Multiple proteins with similar specificities often bind and control overlapping sets of mRNAs. Yet little is known about the architecture or dynamics of overlapped networks. We focused on three proteins with similar structures and related RNA-binding specificities-Puf3p, Puf4p, and Puf5p of S. cerevisiae Using RNA Tagging, we identified a "super-network" comprised of four subnetworks: Puf3p, Puf4p, and Puf5p subnetworks, and one controlled by both Puf4p and Puf5p. The architecture of individual subnetworks, and thus the super-network, is determined by competition among particular PUF proteins to bind mRNAs, their affinities for binding elements, and the abundances of the proteins. The super-network responds dramatically: The remaining network can either expand or contract. These strikingly opposite outcomes are determined by an interplay between the relative abundance of the RNAs and proteins, and their affinities for one another. The diverse interplay between overlapping RNA-protein networks provides versatile opportunities for regulation and evolution. © 2017 Lapointe et al.; Published by Cold Spring Harbor Laboratory Press for the RNA Society.

Random graph models for dynamic networks

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Moore, Cristopher; Newman, Mark E. J.

2017-10-01

Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time. There exist natural generalizations to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. Here we give an introduction to this class of models, showing for instance how one can compute their equilibrium properties. We also demonstrate their use in data analysis and statistical inference, giving efficient algorithms for fitting them to observed network data using the method of maximum likelihood. This allows us, for example, to estimate the time constants of network evolution or infer community structure from temporal network data using cues embedded both in the probabilities over time that node pairs are connected by edges and in the characteristic dynamics of edge appearance and disappearance. We illustrate these methods with a selection of applications, both to computer-generated test networks and real-world examples.

Charge transport network dynamics in molecular aggregates

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

Jackson, Nicholas E.; Chen, Lin X.; Ratner, Mark A.

2016-07-20

Due to the nonperiodic nature of charge transport in disordered systems, generating insight into static charge transport networks, as well as analyzing the network dynamics, can be challenging. Here, we apply time-dependent network analysis to scrutinize the charge transport networks of two representative molecular semiconductors: a rigid n-type molecule, perylenediimide, and a flexible p-type molecule, bBDT(TDPP)2. Simulations reveal the relevant timescale for local transfer integral decorrelation to be ~100 fs, which is shown to be faster than that of a crystalline morphology of the same molecule. Using a simple graph metric, global network changes are observed over timescales competitive withmore » charge carrier lifetimes. These insights demonstrate that static charge transport networks are qualitatively inadequate, whereas average networks often overestimate network connectivity. Finally, a simple methodology for tracking dynamic charge transport properties is proposed.« less

From cognitive networks to seizures: Stimulus evoked dynamics in a coupled cortical network

NASA Astrophysics Data System (ADS)

Lee, Jaejin; Ermentrout, Bard; Bodner, Mark

2013-12-01

Epilepsy is one of the most common neuropathologies worldwide. Seizures arising in epilepsy or in seizure disorders are characterized generally by uncontrolled spread of excitation and electrical activity to a limited region or even over the entire cortex. While it is generally accepted that abnormal excessive firing and synchronization of neuron populations lead to seizures, little is known about the precise mechanisms underlying human epileptic seizures, the mechanisms of transitions from normal to paroxysmal activity, or about how seizures spread. Further complication arises in that seizures do not occur with a single type of dynamics but as many different phenotypes and genotypes with a range of patterns, synchronous oscillations, and time courses. The concept of preventing, terminating, or modulating seizures and/or paroxysmal activity through stimulation of brain has also received considerable attention. The ability of such stimulation to prevent or modulate such pathological activity may depend on identifiable parameters. In this work, firing rate networks with inhibitory and excitatory populations were modeled. Network parameters were chosen to model normal working memory behaviors. Two different models of cognitive activity were developed. The first model consists of a single network corresponding to a local area of the brain. The second incorporates two networks connected through sparser recurrent excitatory connectivity with transmission delays ranging from approximately 3 ms within local populations to 15 ms between populations residing in different cortical areas. The effect of excitatory stimulation to activate working memory behavior through selective persistent activation of populations is examined in the models, and the conditions and transition mechanisms through which that selective activation breaks down producing spreading paroxysmal activity and seizure states are characterized. Specifically, we determine critical parameters and architectural

Dynamic defense and network randomization for computer systems

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

Chavez, Adrian R.; Stout, William M. S.; Hamlet, Jason R.

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissancemore » stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.« less

Dynamic Network Model for Smart City Data-Loss Resilience Case Study: City-to-City Network for Crime Analytics

PubMed Central

Kotevska, Olivera; Kusne, A. Gilad; Samarov, Daniel V.; Lbath, Ahmed; Battou, Abdella

2017-01-01

Today’s cities generate tremendous amounts of data, thanks to a boom in affordable smart devices and sensors. The resulting big data creates opportunities to develop diverse sets of context-aware services and systems, ensuring smart city services are optimized to the dynamic city environment. Critical resources in these smart cities will be more rapidly deployed to regions in need, and those regions predicted to have an imminent or prospective need. For example, crime data analytics may be used to optimize the distribution of police, medical, and emergency services. However, as smart city services become dependent on data, they also become susceptible to disruptions in data streams, such as data loss due to signal quality reduction or due to power loss during data collection. This paper presents a dynamic network model for improving service resilience to data loss. The network model identifies statistically significant shared temporal trends across multivariate spatiotemporal data streams and utilizes these trends to improve data prediction performance in the case of data loss. Dynamics also allow the system to respond to changes in the data streams such as the loss or addition of new information flows. The network model is demonstrated by city-based crime rates reported in Montgomery County, MD, USA. A resilient network is developed utilizing shared temporal trends between cities to provide improved crime rate prediction and robustness to data loss, compared with the use of single city-based auto-regression. A maximum improvement in performance of 7.8% for Silver Spring is found and an average improvement of 5.6% among cities with high crime rates. The model also correctly identifies all the optimal network connections, according to prediction error minimization. City-to-city distance is designated as a predictor of shared temporal trends in crime and weather is shown to be a strong predictor of crime in Montgomery County. PMID:29250476

Dynamic Network Model for Smart City Data-Loss Resilience Case Study: City-to-City Network for Crime Analytics.

PubMed

Kotevska, Olivera; Kusne, A Gilad; Samarov, Daniel V; Lbath, Ahmed; Battou, Abdella

2017-01-01

Today's cities generate tremendous amounts of data, thanks to a boom in affordable smart devices and sensors. The resulting big data creates opportunities to develop diverse sets of context-aware services and systems, ensuring smart city services are optimized to the dynamic city environment. Critical resources in these smart cities will be more rapidly deployed to regions in need, and those regions predicted to have an imminent or prospective need. For example, crime data analytics may be used to optimize the distribution of police, medical, and emergency services. However, as smart city services become dependent on data, they also become susceptible to disruptions in data streams, such as data loss due to signal quality reduction or due to power loss during data collection. This paper presents a dynamic network model for improving service resilience to data loss. The network model identifies statistically significant shared temporal trends across multivariate spatiotemporal data streams and utilizes these trends to improve data prediction performance in the case of data loss. Dynamics also allow the system to respond to changes in the data streams such as the loss or addition of new information flows. The network model is demonstrated by city-based crime rates reported in Montgomery County, MD, USA. A resilient network is developed utilizing shared temporal trends between cities to provide improved crime rate prediction and robustness to data loss, compared with the use of single city-based auto-regression. A maximum improvement in performance of 7.8% for Silver Spring is found and an average improvement of 5.6% among cities with high crime rates. The model also correctly identifies all the optimal network connections, according to prediction error minimization. City-to-city distance is designated as a predictor of shared temporal trends in crime and weather is shown to be a strong predictor of crime in Montgomery County.

Dynamic Network Logistic Regression: A Logistic Choice Analysis of Inter- and Intra-Group Blog Citation Dynamics in the 2004 US Presidential Election

PubMed Central

2013-01-01

Methods for analysis of network dynamics have seen great progress in the past decade. This article shows how Dynamic Network Logistic Regression techniques (a special case of the Temporal Exponential Random Graph Models) can be used to implement decision theoretic models for network dynamics in a panel data context. We also provide practical heuristics for model building and assessment. We illustrate the power of these techniques by applying them to a dynamic blog network sampled during the 2004 US presidential election cycle. This is a particularly interesting case because it marks the debut of Internet-based media such as blogs and social networking web sites as institutionally recognized features of the American political landscape. Using a longitudinal sample of all Democratic National Convention/Republican National Convention–designated blog citation networks, we are able to test the influence of various strategic, institutional, and balance-theoretic mechanisms as well as exogenous factors such as seasonality and political events on the propensity of blogs to cite one another over time. Using a combination of deviance-based model selection criteria and simulation-based model adequacy tests, we identify the combination of processes that best characterizes the choice behavior of the contending blogs. PMID:24143060

Salience network dynamics underlying successful resistance of temptation

PubMed Central

Nomi, Jason S; Calhoun, Vince D; Stelzel, Christine; Paschke, Lena M; Gaschler, Robert; Goschke, Thomas; Walter, Henrik; Uddin, Lucina Q

2017-01-01

Abstract Self-control and the ability to resist temptation are critical for successful completion of long-term goals. Contemporary models in cognitive neuroscience emphasize the primary role of prefrontal cognitive control networks in aligning behavior with such goals. Here, we use gaze pattern analysis and dynamic functional connectivity fMRI data to explore how individual differences in the ability to resist temptation are related to intrinsic brain dynamics of the cognitive control and salience networks. Behaviorally, individuals exhibit greater gaze distance from target location (e.g. higher distractibility) during presentation of tempting erotic images compared with neutral images. Individuals whose intrinsic dynamic functional connectivity patterns gravitate toward configurations in which salience detection systems are less strongly coupled with visual systems resist tempting distractors more effectively. The ability to resist tempting distractors was not significantly related to intrinsic dynamics of the cognitive control network. These results suggest that susceptibility to temptation is governed in part by individual differences in salience network dynamics and provide novel evidence for involvement of brain systems outside canonical cognitive control networks in contributing to individual differences in self-control. PMID:29048582

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks.

PubMed

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-22

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

PubMed Central

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-01-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability. PMID:27874024

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

NASA Astrophysics Data System (ADS)

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Identifying the community structure of the food-trade international multi-network

NASA Astrophysics Data System (ADS)

Torreggiani, S.; Mangioni, G.; Puma, M. J.; Fagiolo, G.

2018-05-01

Achieving international food security requires improved understanding of how international trade networks connect countries around the world through the import-export flows of food commodities. The properties of international food trade networks are still poorly documented, especially from a multi-network perspective. In particular, nothing is known about the multi-network’s community structure. Here we find that the individual crop-specific layers of the multi-network have densely connected trading groups, a consistent characteristic over the period 2001–2011. Further, the multi-network is characterized by low variability over this period but with substantial heterogeneity across layers in each year. In particular, the layers are mostly assortative: more-intensively connected countries tend to import from and export to countries that are themselves more connected. We also fit econometric models to identify social, economic and geographic factors explaining the probability that any two countries are co-present in the same community. Our estimates indicate that the probability of country pairs belonging to the same food trade community depends more on geopolitical and economic factors—such as geographical proximity and trade-agreement co-membership—than on country economic size and/or income. These community-structure findings of the multi-network are especially valuable for efforts to understand past and emerging dynamics in the global food system, especially those that examine potential ‘shocks’ to global food trade.

The Dynamics of Protest Recruitment through an Online Network

NASA Astrophysics Data System (ADS)

González-Bailón, Sandra; Borge-Holthoefer, Javier; Rivero, Alejandro; Moreno, Yamir

2011-12-01

The recent wave of mobilizations in the Arab world and across Western countries has generated much discussion on how digital media is connected to the diffusion of protests. We examine that connection using data from the surge of mobilizations that took place in Spain in May 2011. We study recruitment patterns in the Twitter network and find evidence of social influence and complex contagion. We identify the network position of early participants (i.e. the leaders of the recruitment process) and of the users who acted as seeds of message cascades (i.e. the spreaders of information). We find that early participants cannot be characterized by a typical topological position but spreaders tend to be more central in the network. These findings shed light on the connection between online networks, social contagion, and collective dynamics, and offer an empirical test to the recruitment mechanisms theorized in formal models of collective action.

The dynamics of protest recruitment through an online network.

PubMed

González-Bailón, Sandra; Borge-Holthoefer, Javier; Rivero, Alejandro; Moreno, Yamir

2011-01-01

The recent wave of mobilizations in the Arab world and across Western countries has generated much discussion on how digital media is connected to the diffusion of protests. We examine that connection using data from the surge of mobilizations that took place in Spain in May 2011. We study recruitment patterns in the Twitter network and find evidence of social influence and complex contagion. We identify the network position of early participants (i.e. the leaders of the recruitment process) and of the users who acted as seeds of message cascades (i.e. the spreaders of information). We find that early participants cannot be characterized by a typical topological position but spreaders tend to be more central in the network. These findings shed light on the connection between online networks, social contagion, and collective dynamics, and offer an empirical test to the recruitment mechanisms theorized in formal models of collective action.

Structural network heterogeneities and network dynamics: a possible dynamical mechanism for hippocampal memory reactivation.

NASA Astrophysics Data System (ADS)

Jablonski, Piotr; Poe, Gina; Zochowski, Michal

2007-03-01

The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

Structural network heterogeneities and network dynamics: A possible dynamical mechanism for hippocampal memory reactivation

NASA Astrophysics Data System (ADS)

Jablonski, Piotr; Poe, Gina R.; Zochowski, Michal

2007-01-01

The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

Synthesis of recurrent neural networks for dynamical system simulation.

PubMed

Trischler, Adam P; D'Eleuterio, Gabriele M T

2016-08-01

We review several of the most widely used techniques for training recurrent neural networks to approximate dynamical systems, then describe a novel algorithm for this task. The algorithm is based on an earlier theoretical result that guarantees the quality of the network approximation. We show that a feedforward neural network can be trained on the vector-field representation of a given dynamical system using backpropagation, then recast it as a recurrent network that replicates the original system's dynamics. After detailing this algorithm and its relation to earlier approaches, we present numerical examples that demonstrate its capabilities. One of the distinguishing features of our approach is that both the original dynamical systems and the recurrent networks that simulate them operate in continuous time. Copyright © 2016 Elsevier Ltd. All rights reserved.

Sparse Additive Ordinary Differential Equations for Dynamic Gene Regulatory Network Modeling.

PubMed

Wu, Hulin; Lu, Tao; Xue, Hongqi; Liang, Hua

2014-04-02

The gene regulation network (GRN) is a high-dimensional complex system, which can be represented by various mathematical or statistical models. The ordinary differential equation (ODE) model is one of the popular dynamic GRN models. High-dimensional linear ODE models have been proposed to identify GRNs, but with a limitation of the linear regulation effect assumption. In this article, we propose a sparse additive ODE (SA-ODE) model, coupled with ODE estimation methods and adaptive group LASSO techniques, to model dynamic GRNs that could flexibly deal with nonlinear regulation effects. The asymptotic properties of the proposed method are established and simulation studies are performed to validate the proposed approach. An application example for identifying the nonlinear dynamic GRN of T-cell activation is used to illustrate the usefulness of the proposed method.

Recruitment dynamics in adaptive social networks

NASA Astrophysics Data System (ADS)

Shkarayev, Maxim; Shaw, Leah; Schwartz, Ira

2011-03-01

We model recruitment in social networks in the presence of birth and death processes. The recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. The recruiting nodes may adapt their connections in order to improve recruitment capabilities, thus changing the network structure. We develop a mean-field theory describing the system dynamics. Using mean-field theory we characterize the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment dynamics, as well as on network topology. The theoretical predictions are confirmed by the direct simulations of the full system.

Identifying the architecture of a supracellular actomyosin network that induces tissue folding

NASA Astrophysics Data System (ADS)

Yevick, Hannah; Stoop, Norbert; Dunkel, Jorn; Martin, Adam

During embryonic development, the establishment of correct tissue form ensures proper tissue function. Yet, how the thousands of cells within a tissue coordinate force production to sculpt tissue shape is poorly understood. One important tissue shape change is tissue folding where a cell sheet bends to form a closed tube. Drosophila (fruit fly) embryos undergo such a folding event, called ventral furrow formation. The ventral furrow is associated with a supracellular network of actin and myosin, where actin-myosin fibers assemble and connect between cells. It is not known how this tissue-wide network grows and connects over time, how reproducible it is between embryos, and what determines its architecture. Here, we used topological feature analysis to quantitatively and dynamically map the connections and architecture of this supracellular network across hundreds of cells in the folding tissue. We identified the importance of the cell unit in setting up the tissue-scale architecture of the network. Our mathematical framework allows us to explore stereotypic properties of the myosin network such that we can investigate the reproducibility of mechanical connections for a morphogenetic process. NIH F32.

Network analysis of patient flow in two UK acute care hospitals identifies key sub-networks for A&E performance

PubMed Central

Stringer, Clive; Beeknoo, Neeraj

2017-01-01

The topology of the patient flow network in a hospital is complex, comprising hundreds of overlapping patient journeys, and is a determinant of operational efficiency. To understand the network architecture of patient flow, we performed a data-driven network analysis of patient flow through two acute hospital sites of King’s College Hospital NHS Foundation Trust. Administration databases were queried for all intra-hospital patient transfers in an 18-month period and modelled as a dynamic weighted directed graph. A ‘core’ subnetwork containing only 13–17% of all edges channelled 83–90% of the patient flow, while an ‘ephemeral’ network constituted the remainder. Unsupervised cluster analysis and differential network analysis identified sub-networks where traffic is most associated with A&E performance. Increased flow to clinical decision units was associated with the best A&E performance in both sites. The component analysis also detected a weekend effect on patient transfers which was not associated with performance. We have performed the first data-driven hypothesis-free analysis of patient flow which can enhance understanding of whole healthcare systems. Such analysis can drive transformation in healthcare as it has in industries such as manufacturing. PMID:28968472

Rapid Neocortical Dynamics: Cellular and Network Mechanisms

PubMed Central

Haider, Bilal; McCormick, David A.

2011-01-01

The highly interconnected local and large-scale networks of the neocortical sheet rapidly and dynamically modulate their functional connectivity according to behavioral demands. This basic operating principle of the neocortex is mediated by the continuously changing flow of excitatory and inhibitory synaptic barrages that not only control participation of neurons in networks but also define the networks themselves. The rapid control of neuronal responsiveness via synaptic bombardment is a fundamental property of cortical dynamics that may provide the basis of diverse behaviors, including sensory perception, motor integration, working memory, and attention. PMID:19409263

Design and implementation of dynamic hybrid Honeypot network

NASA Astrophysics Data System (ADS)

Qiao, Peili; Hu, Shan-Shan; Zhai, Ji-Qiang

2013-05-01

The method of constructing a dynamic and self-adaptive virtual network is suggested to puzzle adversaries, delay and divert attacks, exhaust attacker resources and collect attacking information. The concepts of Honeypot and Honeyd, which is the frame of virtual Honeypot are introduced. The techniques of network scanning including active fingerprint recognition are analyzed. Dynamic virtual network system is designed and implemented. A virtual network similar to real network topology is built according to the collected messages from real environments in this system. By doing this, the system can perplex the attackers when Hackers attack and can further analyze and research the attacks. The tests to this system prove that this design can successfully simulate real network environment and can be used in network security analysis.

Information dynamics of brain-heart physiological networks during sleep

NASA Astrophysics Data System (ADS)

Faes, L.; Nollo, G.; Jurysta, F.; Marinazzo, D.

2014-10-01

This study proposes an integrated approach, framed in the emerging fields of network physiology and information dynamics, for the quantitative analysis of brain-heart interaction networks during sleep. With this approach, the time series of cardiac vagal autonomic activity and brain wave activities measured respectively as the normalized high frequency component of heart rate variability and the EEG power in the δ, θ, α, σ, and β bands, are considered as realizations of the stochastic processes describing the dynamics of the heart system and of different brain sub-systems. Entropy-based measures are exploited to quantify the predictive information carried by each (sub)system, and to dissect this information into a part actively stored in the system and a part transferred to it from the other connected systems. The application of this approach to polysomnographic recordings of ten healthy subjects led us to identify a structured network of sleep brain-brain and brain-heart interactions, with the node described by the β EEG power acting as a hub which conveys the largest amount of information flowing between the heart and brain nodes. This network was found to be sustained mostly by the transitions across different sleep stages, as the information transfer was weaker during specific stages than during the whole night, and vanished progressively when moving from light sleep to deep sleep and to REM sleep.

Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks.

PubMed

Onaga, Tomokatsu; Gleeson, James P; Masuda, Naoki

2017-09-08

Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks

NASA Astrophysics Data System (ADS)

Onaga, Tomokatsu; Gleeson, James P.; Masuda, Naoki

2017-09-01

Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

A network of networks.

PubMed

Iedema, Rick; Verma, Raj; Wutzke, Sonia; Lyons, Nigel; McCaughan, Brian

2017-04-10

Purpose To further our insight into the role of networks in health system reform, the purpose of this paper is to investigate how one agency, the NSW Agency for Clinical Innovation (ACI), and the multiple networks and enabling resources that it encompasses, govern, manage and extend the potential of networks for healthcare practice improvement. Design/methodology/approach This is a case study investigation which took place over ten months through the first author's participation in network activities and discussions with the agency's staff about their main objectives, challenges and achievements, and with selected services around the state of New South Wales to understand the agency's implementation and large system transformation activities. Findings The paper demonstrates that ACI accommodates multiple networks whose oversight structures, self-organisation and systems change approaches combined in dynamic ways, effectively yield a diversity of network governances. Further, ACI bears out a paradox of "centralised decentralisation", co-locating agents of innovation with networks of implementation and evaluation expertise. This arrangement strengthens and legitimates the role of the strategic hybrid - the healthcare professional in pursuit of change and improvement, and enhances their influence and impact on the wider system. Research limitations/implications While focussing the case study on one agency only, this study is unique as it highlights inter-network connections. Contributing to the literature on network governance, this paper identifies ACI as a "network of networks" through which resources, expectations and stakeholder dynamics are dynamically and flexibly mediated and enhanced. Practical implications The co-location of and dynamic interaction among clinical networks may create synergies among networks, nurture "strategic hybrids", and enhance the impact of network activities on health system reform. Social implications Network governance requires more

Communication Dynamics in Finite Capacity Social Networks

NASA Astrophysics Data System (ADS)

Haerter, Jan O.; Jamtveit, Bjørn; Mathiesen, Joachim

2012-10-01

In communication networks, structure and dynamics are tightly coupled. The structure controls the flow of information and is itself shaped by the dynamical process of information exchanged between nodes. In order to reconcile structure and dynamics, a generic model, based on the local interaction between nodes, is considered for the communication in large social networks. In agreement with data from a large human organization, we show that the flow is non-Markovian and controlled by the temporal limitations of individuals. We confirm the versatility of our model by predicting simultaneously the degree-dependent node activity, the balance between information input and output of nodes, and the degree distribution. Finally, we quantify the limitations to network analysis when it is based on data sampled over a finite period of time.

Dynamics of subway networks based on vehicles operation timetable

NASA Astrophysics Data System (ADS)

Xiao, Xue-mei; Jia, Li-min; Wang, Yan-hui

2017-05-01

In this paper, a subway network is represented as a dynamic, directed and weighted graph, in which vertices represent subway stations and weights of edges represent the number of vehicles passing through the edges by considering vehicles operation timetable. Meanwhile the definitions of static and dynamic metrics which can represent vertices' and edges' local and global attributes are proposed. Based on the model and metrics, standard deviation is further introduced to study the dynamic properties (heterogeneity and vulnerability) of subway networks. Through a detailed analysis of the Beijing subway network, we conclude that with the existing network structure, the heterogeneity and vulnerability of the Beijing subway network varies over time when the vehicle operation timetable is taken into consideration, and the distribution of edge weights affects the performance of the network. In other words, although the vehicles operation timetable is restrained by the physical structure of the network, it determines the performances and properties of the Beijing subway network.

Recent advances in symmetric and network dynamics

NASA Astrophysics Data System (ADS)

Golubitsky, Martin; Stewart, Ian

2015-09-01

We summarize some of the main results discovered over the past three decades concerning symmetric dynamical systems and networks of dynamical systems, with a focus on pattern formation. In both of these contexts, extra constraints on the dynamical system are imposed, and the generic phenomena can change. The main areas discussed are time-periodic states, mode interactions, and non-compact symmetry groups such as the Euclidean group. We consider both dynamics and bifurcations. We summarize applications of these ideas to pattern formation in a variety of physical and biological systems, and explain how the methods were motivated by transferring to new contexts René Thom's general viewpoint, one version of which became known as "catastrophe theory." We emphasize the role of symmetry-breaking in the creation of patterns. Topics include equivariant Hopf bifurcation, which gives conditions for a periodic state to bifurcate from an equilibrium, and the H/K theorem, which classifies the pairs of setwise and pointwise symmetries of periodic states in equivariant dynamics. We discuss mode interactions, which organize multiple bifurcations into a single degenerate bifurcation, and systems with non-compact symmetry groups, where new technical issues arise. We transfer many of the ideas to the context of networks of coupled dynamical systems, and interpret synchrony and phase relations in network dynamics as a type of pattern, in which space is discretized into finitely many nodes, while time remains continuous. We also describe a variety of applications including animal locomotion, Couette-Taylor flow, flames, the Belousov-Zhabotinskii reaction, binocular rivalry, and a nonlinear filter based on anomalous growth rates for the amplitude of periodic oscillations in a feed-forward network.

Water dynamics in rigid ionomer networks.

PubMed

Osti, N C; Etampawala, T N; Shrestha, U M; Aryal, D; Tyagi, M; Diallo, S O; Mamontov, E; Cornelius, C J; Perahia, D

2016-12-14

The dynamics of water within ionic polymer networks formed by sulfonated poly(phenylene) (SPP), as revealed by quasi-elastic neutron scattering (QENS), is presented. These polymers are distinguished from other ionic macromolecules by their rigidity and therefore in their network structure. QENS measurements as a function of temperature as the fraction of ionic groups and humidity were varied have shown that the polymer molecules are immobile while absorbed water molecules remain dynamic. The water molecules occupy multiple sites, either bound or loosely constrained, and bounce between the two. With increasing temperature and hydration levels, the system becomes more dynamic. Water molecules remain mobile even at subzero temperatures, illustrating the applicability of the SPP membrane for selective transport over a broad temperature range.

Model Of Neural Network With Creative Dynamics

NASA Technical Reports Server (NTRS)

Zak, Michail; Barhen, Jacob

1993-01-01

Paper presents analysis of mathematical model of one-neuron/one-synapse neural network featuring coupled activation and learning dynamics and parametrical periodic excitation. Demonstrates self-programming, partly random behavior of suitable designed neural network; believed to be related to spontaneity and creativity of biological neural networks.

Resumption of dynamism in damaged networks of coupled oscillators

NASA Astrophysics Data System (ADS)

Kundu, Srilena; Majhi, Soumen; Ghosh, Dibakar

2018-05-01

Deterioration in dynamical activities may come up naturally or due to environmental influences in a massive portion of biological and physical systems. Such dynamical degradation may have outright effect on the substantive network performance. This requires us to provide some proper prescriptions to overcome undesired circumstances. In this paper, we present a scheme based on external feedback that can efficiently revive dynamism in damaged networks of active and inactive oscillators and thus enhance the network survivability. Both numerical and analytical investigations are performed in order to verify our claim. We also provide a comparative study on the effectiveness of this mechanism for feedbacks to the inactive group or to the active group only. Most importantly, resurrection of dynamical activity is realized even in time-delayed damaged networks, which are considered to be less persistent against deterioration in the form of inactivity in the oscillators. Furthermore, prominence in our approach is substantiated by providing evidence of enhanced network persistence in complex network topologies taking small-world and scale-free architectures, which makes the proposed remedy quite general. Besides the study in the network of Stuart-Landau oscillators, affirmative influence of external feedback has been justified in the network of chaotic Rössler systems as well.

Population Dynamics of Genetic Regulatory Networks

NASA Astrophysics Data System (ADS)

Braun, Erez

2005-03-01

Unlike common objects in physics, a biological cell processes information. The cell interprets its genome and transforms the genomic information content, through the action of genetic regulatory networks, into proteins which in turn dictate its metabolism, functionality and morphology. Understanding the dynamics of a population of biological cells presents a unique challenge. It requires to link the intracellular dynamics of gene regulation, through the mechanism of cell division, to the level of the population. We present experiments studying adaptive dynamics of populations of genetically homogeneous microorganisms (yeast), grown for long durations under steady conditions. We focus on population dynamics that do not involve random genetic mutations. Our experiments follow the long-term dynamics of the population distributions and allow to quantify the correlations among generations. We focus on three interconnected issues: adaptation of genetically homogeneous populations following environmental changes, selection processes on the population and population variability and expression distributions. We show that while the population exhibits specific short-term responses to environmental inputs, it eventually adapts to a robust steady-state, largely independent of external conditions. Cycles of medium-switch show that the adapted state is imprinted in the population and that this memory is maintained for many generations. To further study population adaptation, we utilize the process of gene recruitment whereby a gene naturally regulated by a specific promoter is placed under a different regulatory system. This naturally occurring process has been recognized as a major driving force in evolution. We have recruited an essential gene to a foreign regulatory network and followed the population long-term dynamics. Rewiring of the regulatory network allows us to expose their complex dynamics and phase space structure.

Network dynamics in nanofilled polymers

NASA Astrophysics Data System (ADS)

Baeza, Guilhem P.; Dessi, Claudia; Costanzo, Salvatore; Zhao, Dan; Gong, Shushan; Alegria, Angel; Colby, Ralph H.; Rubinstein, Michael; Vlassopoulos, Dimitris; Kumar, Sanat K.

2016-04-01

It is well accepted that adding nanoparticles (NPs) to polymer melts can result in significant property improvements. Here we focus on the causes of mechanical reinforcement and present rheological measurements on favourably interacting mixtures of spherical silica NPs and poly(2-vinylpyridine), complemented by several dynamic and structural probes. While the system dynamics are polymer-like with increased friction for low silica loadings, they turn network-like when the mean face-to-face separation between NPs becomes smaller than the entanglement tube diameter. Gel-like dynamics with a Williams-Landel-Ferry temperature dependence then result. This dependence turns particle dominated, that is, Arrhenius-like, when the silica loading increases to ~31 vol%, namely, when the average nearest distance between NP faces becomes comparable to the polymer's Kuhn length. Our results demonstrate that the flow properties of nanocomposites are complex and can be tuned via changes in filler loading, that is, the character of polymer bridges which `tie' NPs together into a network.

Complex Dynamical Networks Constructed with Fully Controllable Nonlinear Nanomechanical Oscillators.

PubMed

Fon, Warren; Matheny, Matthew H; Li, Jarvis; Krayzman, Lev; Cross, Michael C; D'Souza, Raissa M; Crutchfield, James P; Roukes, Michael L

2017-10-11

Control of the global parameters of complex networks has been explored experimentally in a variety of contexts. Yet, the more difficult prospect of realizing arbitrary network architectures, especially analog physical networks that provide dynamical control of individual nodes and edges, has remained elusive. Given the vast hierarchy of time scales involved, it also proves challenging to measure a complex network's full internal dynamics. These span from the fastest nodal dynamics to very slow epochs over which emergent global phenomena, including network synchronization and the manifestation of exotic steady states, eventually emerge. Here, we demonstrate an experimental system that satisfies these requirements. It is based upon modular, fully controllable, nonlinear radio frequency nanomechanical oscillators, designed to form the nodes of complex dynamical networks with edges of arbitrary topology. The dynamics of these oscillators and their surrounding network are analog and continuous-valued and can be fully interrogated in real time. They comprise a piezoelectric nanomechanical membrane resonator, which serves as the frequency-determining element within an electrical feedback circuit. This embodiment permits network interconnections entirely within the electrical domain and provides unprecedented node and edge control over a vast region of parameter space. Continuous measurement of the instantaneous amplitudes and phases of every constituent oscillator node are enabled, yielding full and detailed network data without reliance upon statistical quantities. We demonstrate the operation of this platform through the real-time capture of the dynamics of a three-node ring network as it evolves from the uncoupled state to full synchronization.

Clustering promotes switching dynamics in networks of noisy neurons

NASA Astrophysics Data System (ADS)

Franović, Igor; Klinshov, Vladimir

2018-02-01

Macroscopic variability is an emergent property of neural networks, typically manifested in spontaneous switching between the episodes of elevated neuronal activity and the quiescent episodes. We investigate the conditions that facilitate switching dynamics, focusing on the interplay between the different sources of noise and heterogeneity of the network topology. We consider clustered networks of rate-based neurons subjected to external and intrinsic noise and derive an effective model where the network dynamics is described by a set of coupled second-order stochastic mean-field systems representing each of the clusters. The model provides an insight into the different contributions to effective macroscopic noise and qualitatively indicates the parameter domains where switching dynamics may occur. By analyzing the mean-field model in the thermodynamic limit, we demonstrate that clustering promotes multistability, which gives rise to switching dynamics in a considerably wider parameter region compared to the case of a non-clustered network with sparse random connection topology.

Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

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

McCullough, Michael; Iu, Herbert Ho-Ching; Small, Michael

2015-05-15

We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rössler system and find that periodic dynamics translate tomore » ring structures whereas chaotic time series translate to band or tube-like structures—thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.« less

Changes in dynamic resting state network connectivity following aphasia therapy.

PubMed

Duncan, E Susan; Small, Steven L

2017-10-24

Resting state magnetic resonance imaging (rsfMRI) permits observation of intrinsic neural networks produced by task-independent correlations in low frequency brain activity. Various resting state networks have been described, with each thought to reflect common engagement in some shared function. There has been limited investigation of the plasticity in these network relationships after stroke or induced by therapy. Twelve individuals with language disorders after stroke (aphasia) were imaged at multiple time points before (baseline) and after an imitation-based aphasia therapy. Language assessment using a narrative production task was performed at the same time points. Group independent component analysis (ICA) was performed on the rsfMRI data to identify resting state networks. A sliding window approach was then applied to assess the dynamic nature of the correlations among these networks. Network correlations during each 30-second window were used to cluster the data into ten states for each window at each time point for each subject. Correlation was performed between changes in time spent in each state and therapeutic gains on the narrative task. The amount of time spent in a single one of the (ten overall) dynamic states was positively associated with behavioral improvement on the narrative task at the 6-week post-therapy maintenance interval, when compared with either baseline or assessment immediately following therapy. This particular state was characterized by minimal correlation among the task-independent resting state networks. Increased functional independence and segregation of resting state networks underlies improvement on a narrative production task following imitation-based aphasia treatment. This has important clinical implications for the targeting of noninvasive brain stimulation in post-stroke remediation.

Inferring dynamic gene regulatory networks in cardiac differentiation through the integration of multi-dimensional data.

PubMed

Gong, Wuming; Koyano-Nakagawa, Naoko; Li, Tongbin; Garry, Daniel J

2015-03-07

Decoding the temporal control of gene expression patterns is key to the understanding of the complex mechanisms that govern developmental decisions during heart development. High-throughput methods have been employed to systematically study the dynamic and coordinated nature of cardiac differentiation at the global level with multiple dimensions. Therefore, there is a pressing need to develop a systems approach to integrate these data from individual studies and infer the dynamic regulatory networks in an unbiased fashion. We developed a two-step strategy to integrate data from (1) temporal RNA-seq, (2) temporal histone modification ChIP-seq, (3) transcription factor (TF) ChIP-seq and (4) gene perturbation experiments to reconstruct the dynamic network during heart development. First, we trained a logistic regression model to predict the probability (LR score) of any base being bound by 543 TFs with known positional weight matrices. Second, four dimensions of data were combined using a time-varying dynamic Bayesian network model to infer the dynamic networks at four developmental stages in the mouse [mouse embryonic stem cells (ESCs), mesoderm (MES), cardiac progenitors (CP) and cardiomyocytes (CM)]. Our method not only infers the time-varying networks between different stages of heart development, but it also identifies the TF binding sites associated with promoter or enhancers of downstream genes. The LR scores of experimentally verified ESCs and heart enhancers were significantly higher than random regions (p <10(-100)), suggesting that a high LR score is a reliable indicator for functional TF binding sites. Our network inference model identified a region with an elevated LR score approximately -9400 bp upstream of the transcriptional start site of Nkx2-5, which overlapped with a previously reported enhancer region (-9435 to -8922 bp). TFs such as Tead1, Gata4, Msx2, and Tgif1 were predicted to bind to this region and participate in the regulation of Nkx2

Advanced Polymer Network Structures

DTIC Science & Technology

2016-02-01

double networks in a single step was identified from coarse-grained molecular dynamics simulations of polymer solvents bearing rigid side chains dissolved...in a polymer network. Coarse-grained molecular dynamics simulations also explored the mechanical behavior of traditional double networks and...DRI), polymer networks, polymer gels, molecular dynamics simulations , double networks 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF

Analyzing neuronal networks using discrete-time dynamics

NASA Astrophysics Data System (ADS)

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

2010-05-01

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

CoMoDo: identifying dynamic protein domains based on covariances of motion.

PubMed

Wieninger, Silke A; Ullmann, G Matthias

2015-06-09

Most large proteins are built of several domains, compact units which enable functional protein motions. Different domain assignment approaches exist, which mostly rely on concepts of stability, folding, and evolution. We describe the automatic assignment method CoMoDo, which identifies domains based on protein dynamics. Covariances of atomic fluctuations, here calculated by an Elastic Network Model, are used to group residues into domains of different hierarchical levels. The so-called dynamic domains facilitate the study of functional protein motions involved in biological processes like ligand binding and signal transduction. By applying CoMoDo to a large number of proteins, we demonstrate that dynamic domains exhibit features absent in the commonly assigned structural domains, which can deliver insight into the interactions between domains and between subunits of multimeric proteins. CoMoDo is distributed as free open source software at www.bisb.uni-bayreuth.de/CoMoDo.html .

Dynamic reconfiguration of frontal brain networks during executive cognition in humans

PubMed Central

Braun, Urs; Schäfer, Axel; Walter, Henrik; Erk, Susanne; Romanczuk-Seiferth, Nina; Haddad, Leila; Schweiger, Janina I.; Grimm, Oliver; Heinz, Andreas; Tost, Heike; Meyer-Lindenberg, Andreas; Bassett, Danielle S.

2015-01-01

The brain is an inherently dynamic system, and executive cognition requires dynamically reconfiguring, highly evolving networks of brain regions that interact in complex and transient communication patterns. However, a precise characterization of these reconfiguration processes during cognitive function in humans remains elusive. Here, we use a series of techniques developed in the field of “dynamic network neuroscience” to investigate the dynamics of functional brain networks in 344 healthy subjects during a working-memory challenge (the “n-back” task). In contrast to a control condition, in which dynamic changes in cortical networks were spread evenly across systems, the effortful working-memory condition was characterized by a reconfiguration of frontoparietal and frontotemporal networks. This reconfiguration, which characterizes “network flexibility,” employs transient and heterogeneous connectivity between frontal systems, which we refer to as “integration.” Frontal integration predicted neuropsychological measures requiring working memory and executive cognition, suggesting that dynamic network reconfiguration between frontal systems supports those functions. Our results characterize dynamic reconfiguration of large-scale distributed neural circuits during executive cognition in humans and have implications for understanding impaired cognitive function in disorders affecting connectivity, such as schizophrenia or dementia. PMID:26324898

Diminished neural network dynamics after moderate and severe traumatic brain injury

PubMed Central

Gilbert, Nicholas; Bernier, Rachel A.; Calhoun, Vincent D.; Brenner, Einat; Grossner, Emily; Rajtmajer, Sarah M.

2018-01-01

Over the past decade there has been increasing enthusiasm in the cognitive neurosciences around using network science to understand the system-level changes associated with brain disorders. A growing literature has used whole-brain fMRI analysis to examine changes in the brain’s subnetworks following traumatic brain injury (TBI). Much of network modeling in this literature has focused on static network mapping, which provides a window into gross inter-nodal relationships, but is insensitive to more subtle fluctuations in network dynamics, which may be an important predictor of neural network plasticity. In this study, we examine the dynamic connectivity with focus on state-level connectivity (state) and evaluate the reliability of dynamic network states over the course of two runs of intermittent task and resting data. The goal was to examine the dynamic properties of neural networks engaged periodically with task stimulation in order to determine: 1) the reliability of inter-nodal and network-level characteristics over time and 2) the transitions between distinct network states after traumatic brain injury. To do so, we enrolled 23 individuals with moderate and severe TBI at least 1-year post injury and 19 age- and education-matched healthy adults using functional MRI methods, dynamic connectivity modeling, and graph theory. The results reveal several distinct network “states” that were reliably evident when comparing runs; the overall frequency of dynamic network states are highly reproducible (r-values>0.8) for both samples. Analysis of movement between states resulted in fewer state transitions in the TBI sample and, in a few cases, brain injury resulted in the appearance of states not exhibited by the healthy control (HC) sample. Overall, the findings presented here demonstrate the reliability of observable dynamic mental states during periods of on-task performance and support emerging evidence that brain injury may result in diminished network dynamics

Diminished neural network dynamics after moderate and severe traumatic brain injury.

PubMed

Gilbert, Nicholas; Bernier, Rachel A; Calhoun, Vincent D; Brenner, Einat; Grossner, Emily; Rajtmajer, Sarah M; Hillary, Frank G

2018-01-01

Over the past decade there has been increasing enthusiasm in the cognitive neurosciences around using network science to understand the system-level changes associated with brain disorders. A growing literature has used whole-brain fMRI analysis to examine changes in the brain's subnetworks following traumatic brain injury (TBI). Much of network modeling in this literature has focused on static network mapping, which provides a window into gross inter-nodal relationships, but is insensitive to more subtle fluctuations in network dynamics, which may be an important predictor of neural network plasticity. In this study, we examine the dynamic connectivity with focus on state-level connectivity (state) and evaluate the reliability of dynamic network states over the course of two runs of intermittent task and resting data. The goal was to examine the dynamic properties of neural networks engaged periodically with task stimulation in order to determine: 1) the reliability of inter-nodal and network-level characteristics over time and 2) the transitions between distinct network states after traumatic brain injury. To do so, we enrolled 23 individuals with moderate and severe TBI at least 1-year post injury and 19 age- and education-matched healthy adults using functional MRI methods, dynamic connectivity modeling, and graph theory. The results reveal several distinct network "states" that were reliably evident when comparing runs; the overall frequency of dynamic network states are highly reproducible (r-values>0.8) for both samples. Analysis of movement between states resulted in fewer state transitions in the TBI sample and, in a few cases, brain injury resulted in the appearance of states not exhibited by the healthy control (HC) sample. Overall, the findings presented here demonstrate the reliability of observable dynamic mental states during periods of on-task performance and support emerging evidence that brain injury may result in diminished network dynamics.

Dynamic range in the C. elegans brain network

NASA Astrophysics Data System (ADS)

Antonopoulos, Chris G.

2016-01-01

We study external electrical perturbations and their responses in the brain dynamic network of the Caenorhabditis elegans soil worm, given by the connectome of its large somatic nervous system. Our analysis is inspired by a realistic experiment where one stimulates externally specific parts of the brain and studies the persistent neural activity triggered in other cortical regions. In this work, we perturb groups of neurons that form communities, identified by the walktrap community detection method, by trains of stereotypical electrical Poissonian impulses and study the propagation of neural activity to other communities by measuring the corresponding dynamic ranges and Steven law exponents. We show that when one perturbs specific communities, keeping the rest unperturbed, the external stimulations are able to propagate to some of them but not to all. There are also perturbations that do not trigger any response. We found that this depends on the initially perturbed community. Finally, we relate our findings for the former cases with low neural synchronization, self-criticality, and large information flow capacity, and interpret them as the ability of the brain network to respond to external perturbations when it works at criticality and its information flow capacity becomes maximal.

Linking dynamics of the inhibitory network to the input structure

PubMed Central

Komarov, Maxim

2017-01-01

Networks of inhibitory interneurons are found in many distinct classes of biological systems. Inhibitory interneurons govern the dynamics of principal cells and are likely to be critically involved in the coding of information. In this theoretical study, we describe the dynamics of a generic inhibitory network in terms of low-dimensional, simplified rate models. We study the relationship between the structure of external input applied to the network and the patterns of activity arising in response to that stimulation. We found that even a minimal inhibitory network can generate a great diversity of spatio-temporal patterning including complex bursting regimes with non-trivial ratios of burst firing. Despite the complexity of these dynamics, the network’s response patterns can be predicted from the rankings of the magnitudes of external inputs to the inhibitory neurons. This type of invariant dynamics is robust to noise and stable in densely connected networks with strong inhibitory coupling. Our study predicts that the response dynamics generated by an inhibitory network may provide critical insights about the temporal structure of the sensory input it receives. PMID:27650865

Disruption to control network function correlates with altered dynamic connectivity in the wider autism spectrum.

PubMed

de Lacy, N; Doherty, D; King, B H; Rachakonda, S; Calhoun, V D

2017-01-01

Autism is a common developmental condition with a wide, variable range of co-occurring neuropsychiatric symptoms. Contrasting with most extant studies, we explored whole-brain functional organization at multiple levels simultaneously in a large subject group reflecting autism's clinical diversity, and present the first network-based analysis of transient brain states, or dynamic connectivity , in autism. Disruption to inter-network and inter-system connectivity, rather than within individual networks, predominated. We identified coupling disruption in the anterior-posterior default mode axis, and among specific control networks specialized for task start cues and the maintenance of domain-independent task positive status, specifically between the right fronto-parietal and cingulo-opercular networks and default mode network subsystems. These appear to propagate downstream in autism, with significantly dampened subject oscillations between brain states, and dynamic connectivity configuration differences. Our account proposes specific motifs that may provide candidates for neuroimaging biomarkers within heterogeneous clinical populations in this diverse condition.

Co-extinction in a host-parasite network: identifying key hosts for network stability.

PubMed

Dallas, Tad; Cornelius, Emily

2015-08-17

Parasites comprise a substantial portion of total biodiversity. Ultimately, this means that host extinction could result in many secondary extinctions of obligate parasites and potentially alter host-parasite network structure. Here, we examined a highly resolved fish-parasite network to determine key hosts responsible for maintaining parasite diversity and network structure (quantified here as nestedness and modularity). We evaluated four possible host extinction orders and compared the resulting co-extinction dynamics to random extinction simulations; including host removal based on estimated extinction risk, parasite species richness and host level contributions to nestedness and modularity. We found that all extinction orders, except the one based on realistic extinction risk, resulted in faster declines in parasite diversity and network structure relative to random biodiversity loss. Further, we determined species-level contributions to network structure were best predicted by parasite species richness and host family. Taken together, we demonstrate that a small proportion of hosts contribute substantially to network structure and that removal of these hosts results in rapid declines in parasite diversity and network structure. As network stability can potentially be inferred through measures of network structure, our findings may provide insight into species traits that confer stability.

Highly dynamic animal contact network and implications on disease transmission

PubMed Central

Chen, Shi; White, Brad J.; Sanderson, Michael W.; Amrine, David E.; Ilany, Amiyaal; Lanzas, Cristina

2014-01-01

Contact patterns among hosts are considered as one of the most critical factors contributing to unequal pathogen transmission. Consequently, networks have been widely applied in infectious disease modeling. However most studies assume static network structure due to lack of accurate observation and appropriate analytic tools. In this study we used high temporal and spatial resolution animal position data to construct a high-resolution contact network relevant to infectious disease transmission. The animal contact network aggregated at hourly level was highly variable and dynamic within and between days, for both network structure (network degree distribution) and individual rank of degree distribution in the network (degree order). We integrated network degree distribution and degree order heterogeneities with a commonly used contact-based, directly transmitted disease model to quantify the effect of these two sources of heterogeneity on the infectious disease dynamics. Four conditions were simulated based on the combination of these two heterogeneities. Simulation results indicated that disease dynamics and individual contribution to new infections varied substantially among these four conditions under both parameter settings. Changes in the contact network had a greater effect on disease dynamics for pathogens with smaller basic reproduction number (i.e. R0 < 2). PMID:24667241

Identifying emerging research collaborations and networks: method development.

PubMed

Dozier, Ann M; Martina, Camille A; O'Dell, Nicole L; Fogg, Thomas T; Lurie, Stephen J; Rubinstein, Eric P; Pearson, Thomas A

2014-03-01

Clinical and translational research is a multidisciplinary, collaborative team process. To evaluate this process, we developed a method to document emerging research networks and collaborations in our medical center to describe their productivity and viability over time. Using an e-mail survey, sent to 1,620 clinical and basic science full- and part-time faculty members, respondents identified their research collaborators. Initial analyses, using Pajek software, assessed the feasibility of using social network analysis (SNA) methods with these data. Nearly 400 respondents identified 1,594 collaborators across 28 medical center departments resulting in 309 networks with 5 or more collaborators. This low-burden approach yielded a rich data set useful for evaluation using SNA to: (a) assess networks at several levels of the organization, including intrapersonal (individuals), interpersonal (social), organizational/institutional leadership (tenure and promotion), and physical/environmental (spatial proximity) and (b) link with other data to assess the evolution of these networks.

Diminished neural network dynamics in amnestic mild cognitive impairment.

PubMed

Brenner, Einat K; Hampstead, Benjamin M; Grossner, Emily C; Bernier, Rachel A; Gilbert, Nicholas; Sathian, K; Hillary, Frank G

2018-05-05

Mild cognitive impairment (MCI) is widely regarded as an intermediate stage between typical aging and dementia, with nearly 50% of patients with amnestic MCI (aMCI) converting to Alzheimer's dementia (AD) within 30 months of follow-up (Fischer et al., 2007). The growing literature using resting-state functional magnetic resonance imaging reveals both increased and decreased connectivity in individuals with MCI and connectivity loss between the anterior and posterior components of the default mode network (DMN) throughout the course of the disease progression (Hillary et al., 2015; Sheline & Raichle, 2013; Tijms et al., 2013). In this paper, we use dynamic connectivity modeling and graph theory to identify unique brain "states," or temporal patterns of connectivity across distributed networks, to distinguish individuals with aMCI from healthy older adults (HOAs). We enrolled 44 individuals diagnosed with aMCI and 33 HOAs of comparable age and education. Our results indicated that individuals with aMCI spent significantly more time in one state in particular, whereas neural network analysis in the HOA sample revealed approximately equivalent representation across four distinct states. Among individuals with aMCI, spending a higher proportion of time in the dominant state relative to a state where participants exhibited high cost (a measure combining connectivity and distance), predicted better language performance and less perseveration. This is the first report to examine neural network dynamics in individuals with aMCI. Copyright © 2018 Elsevier B.V. All rights reserved.

Network dynamics and systems biology

NASA Astrophysics Data System (ADS)

Norrell, Johannes A.

The physics of complex systems has grown considerably as a field in recent decades, largely due to improved computational technology and increased availability of systems level data. One area in which physics is of growing relevance is molecular biology. A new field, systems biology, investigates features of biological systems as a whole, a strategy of particular importance for understanding emergent properties that result from a complex network of interactions. Due to the complicated nature of the systems under study, the physics of complex systems has a significant role to play in elucidating the collective behavior. In this dissertation, we explore three problems in the physics of complex systems, motivated in part by systems biology. The first of these concerns the applicability of Boolean models as an approximation of continuous systems. Studies of gene regulatory networks have employed both continuous and Boolean models to analyze the system dynamics, and the two have been found produce similar results in the cases analyzed. We ask whether or not Boolean models can generically reproduce the qualitative attractor dynamics of networks of continuously valued elements. Using a combination of analytical techniques and numerical simulations, we find that continuous networks exhibit two effects---an asymmetry between on and off states, and a decaying memory of events in each element's inputs---that are absent from synchronously updated Boolean models. We show that in simple loops these effects produce exactly the attractors that one would predict with an analysis of the stability of Boolean attractors, but in slightly more complicated topologies, they can destabilize solutions that are stable in the Boolean approximation, and can stabilize new attractors. Second, we investigate ensembles of large, random networks. Of particular interest is the transition between ordered and disordered dynamics, which is well characterized in Boolean systems. Networks at the

The co-evolutionary dynamics of directed network of spin market agents

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán; Gmitra, Martin

2006-09-01

The spin market model [S. Bornholdt, Int. J. Mod. Phys. C 12 (2001) 667] is generalized by employing co-evolutionary principles, where strategies of the interacting and competitive traders are represented by local and global couplings between the nodes of dynamic directed stochastic network. The co-evolutionary principles are applied in the frame of Bak-Sneppen self-organized dynamics [P. Bak, K. Sneppen, Phys. Rev. Lett. 71 (1993) 4083] that includes the processes of selection and extinction actuated by the local (node) fitness. The local fitness is related to orientation of spin agent with respect to the instant magnetization. The stationary regime is formed due to the interplay of self-organization and adaptivity effects. The fat tailed distributions of log-price returns are identified numerically. The non-trivial model consequence is the evidence of the long time market memory indicated by the power-law range of the autocorrelation function of volatility with exponent smaller than one. The simulations yield network topology with broad-scale node degree distribution characterized by the range of exponents 1.3<γin<3 coinciding with social networks.

Spatiotemporal dynamics of surface water networks across a global biodiversity hotspot—implications for conservation

NASA Astrophysics Data System (ADS)

Tulbure, Mirela G.; Kininmonth, Stuart; Broich, Mark

2014-11-01

The concept of habitat networks represents an important tool for landscape conservation and management at regional scales. Previous studies simulated degradation of temporally fixed networks but few quantified the change in network connectivity from disintegration of key features that undergo naturally occurring spatiotemporal dynamics. This is particularly of concern for aquatic systems, which typically show high natural spatiotemporal variability. Here we focused on the Swan Coastal Plain, a bioregion that encompasses a global biodiversity hotspot in Australia with over 1500 water bodies of high biodiversity. Using graph theory, we conducted a temporal analysis of water body connectivity over 13 years of variable climate. We derived large networks of surface water bodies using Landsat data (1999-2011). We generated an ensemble of 278 potential networks at three dispersal distances approximating the maximum dispersal distance of different water dependent organisms. We assessed network connectivity through several network topology metrics and quantified the resilience of the network topology during wet and dry phases. We identified ‘stepping stone’ water bodies across time and compared our networks with theoretical network models with known properties. Results showed a highly dynamic seasonal pattern of variability in network topology metrics. A decline in connectivity over the 13 years was noted with potential negative consequences for species with limited dispersal capacity. The networks described here resemble theoretical scale-free models, also known as ‘rich get richer’ algorithm. The ‘stepping stone’ water bodies are located in the area around the Peel-Harvey Estuary, a Ramsar listed site, and some are located in a national park. Our results describe a powerful approach that can be implemented when assessing the connectivity for a particular organism with known dispersal distance. The approach of identifying the surface water bodies that act as �

The geometry of chaotic dynamics — a complex network perspective

NASA Astrophysics Data System (ADS)

Donner, R. V.; Heitzig, J.; Donges, J. F.; Zou, Y.; Marwan, N.; Kurths, J.

2011-12-01

Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques, recurrence-based concepts and prominently ɛ-recurrence networks, most faithfully represent the geometrical fine structure of the attractors underlying chaotic (and less interestingly non-chaotic) time series. In this paper we demonstrate that the well known graph theoretical properties local clustering coefficient and global (network) transitivity can meaningfully be exploited to define two new local and two new global measures of dimension in phase space: local upper and lower clustering dimension as well as global upper and lower transitivity dimension. Rigorous analytical as well as numerical results for self-similar sets and simple chaotic model systems suggest that these measures are well-behaved in most non-pathological situations and that they can be estimated reasonably well using ɛ-recurrence networks constructed from relatively short time series. Moreover, we study the relationship between clustering and transitivity dimensions on the one hand, and traditional measures like pointwise dimension or local Lyapunov dimension on the other hand. We also provide further evidence that the local clustering coefficients, or equivalently the local clustering dimensions, are useful for identifying unstable periodic orbits and other dynamically invariant objects from time series. Our results demonstrate that ɛ-recurrence networks exhibit an important link between dynamical systems and graph theory.

Applications of flow-networks to opinion-dynamics

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Kurths, Jürgen

2015-04-01

Networks were successfully applied to describe complex systems, such as brain, climate, processes in society. Recently a socio-physical problem of opinion-dynamics was studied using network techniques. We present the toy-model of opinion-formation based on the physical model of advection-diffusion. We consider spreading of the opinion on the fixed subject, assuming that opinion on society is binary: if person has opinion then the state of the node in the society-network equals 1, if the person doesn't have opinion state of the node equals 0. Opinion can be spread from one person to another if they know each other, or in the network-terminology, if the nodes are connected. We include into the system governed by advection-diffusion equation the external field to model such effects as for instance influence from media. The assumptions for our model can be formulated as the following: 1.the node-states are influenced by the network structure in such a way, that opinion can be spread only between adjacent nodes (the advective term of the opinion-dynamics), 2.the network evolution can have two scenarios: -network topology is not changing with time; -additional links can appear or disappear each time-step with fixed probability which requires adaptive networks properties. Considering these assumptions for our system we obtain the system of equations describing our model-dynamics which corresponds well to other socio-physics models, for instance, the model of the social cohesion and the famous voter-model. We investigate the behavior of the suggested model studying "waiting time" of the system, time to get to the stable state, stability of the model regimes for different values of model parameters and network topology.

Dynamic social networks promote cooperation in experiments with humans

PubMed Central

Rand, David G.; Arbesman, Samuel; Christakis, Nicholas A.

2011-01-01

Human populations are both highly cooperative and highly organized. Human interactions are not random but rather are structured in social networks. Importantly, ties in these networks often are dynamic, changing in response to the behavior of one's social partners. This dynamic structure permits an important form of conditional action that has been explored theoretically but has received little empirical attention: People can respond to the cooperation and defection of those around them by making or breaking network links. Here, we present experimental evidence of the power of using strategic link formation and dissolution, and the network modification it entails, to stabilize cooperation in sizable groups. Our experiments explore large-scale cooperation, where subjects’ cooperative actions are equally beneficial to all those with whom they interact. Consistent with previous research, we find that cooperation decays over time when social networks are shuffled randomly every round or are fixed across all rounds. We also find that, when networks are dynamic but are updated only infrequently, cooperation again fails. However, when subjects can update their network connections frequently, we see a qualitatively different outcome: Cooperation is maintained at a high level through network rewiring. Subjects preferentially break links with defectors and form new links with cooperators, creating an incentive to cooperate and leading to substantial changes in network structure. Our experiments confirm the predictions of a set of evolutionary game theoretic models and demonstrate the important role that dynamic social networks can play in supporting large-scale human cooperation. PMID:22084103

Generalized master equations for non-Poisson dynamics on networks.

PubMed

Hoffmann, Till; Porter, Mason A; Lambiotte, Renaud

2012-10-01

The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in empirical temporal networks. Accordingly, we examine the effects of non-Poisson inter-event statistics on the dynamics of edges, and we apply the concept of a generalized master equation to the study of continuous-time random walks on networks. We show that this equation reduces to the standard rate equations when the underlying process is Poissonian and that its stationary solution is determined by an effective transition matrix whose leading eigenvector is easy to calculate. We conduct numerical simulations and also derive analytical results for the stationary solution under the assumption that all edges have the same waiting-time distribution. We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.

Generalized master equations for non-Poisson dynamics on networks

NASA Astrophysics Data System (ADS)

Hoffmann, Till; Porter, Mason A.; Lambiotte, Renaud

2012-10-01

The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in empirical temporal networks. Accordingly, we examine the effects of non-Poisson inter-event statistics on the dynamics of edges, and we apply the concept of a generalized master equation to the study of continuous-time random walks on networks. We show that this equation reduces to the standard rate equations when the underlying process is Poissonian and that its stationary solution is determined by an effective transition matrix whose leading eigenvector is easy to calculate. We conduct numerical simulations and also derive analytical results for the stationary solution under the assumption that all edges have the same waiting-time distribution. We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.

On investigating social dynamics in tactical opportunistic mobile networks

NASA Astrophysics Data System (ADS)

Gao, Wei; Li, Yong

2014-06-01

The efficiency of military mobile network operations at the tactical edge is challenging due to the practical Disconnected, Intermittent, and Limited (DIL) environments at the tactical edge which make it hard to maintain persistent end-to-end wireless network connectivity. Opportunistic mobile networks are hence devised to depict such tactical networking scenarios. Social relations among warfighters in tactical opportunistic mobile networks are implicitly represented by their opportunistic contacts via short-range radios, but were inappropriately considered as stationary over time by the conventional wisdom. In this paper, we develop analytical models to probabilistically investigate the temporal dynamics of this social relationship, which is critical to efficient mobile communication in the battlespace. We propose to formulate such dynamics by developing various sociological metrics, including centrality and community, with respect to the opportunistic mobile network contexts. These metrics investigate social dynamics based on the experimentally validated skewness of users' transient contact distributions over time.

Dynamic network expansion, contraction, and connectivity in the river corridor of mountain stream network

NASA Astrophysics Data System (ADS)

Ward, A. S.; Schmadel, N.; Wondzell, S. M.

2017-12-01

River networks are broadly recognized to expand and contract in response to hydrologic forcing. Additionally, the individual controls on river corridor dynamics of hydrologic forcing and geologic setting are well recognized. However, we currently lack tools to integrate our understanding of process dynamics in the river corridor and make predictions at the scale of river networks. In this study, we develop a perceptual model of the river corridor in mountain river networks, translate this into a reduced-complexity mechanistic model, and implement the model in a well-studied headwater catchment. We found that the river network was most sensitive to hydrologic dynamics under the lowest discharges (Qgauge < 1 L s-1). We also demonstrate a discharge-dependence on the dominant controls on network expansion, contraction, and river corridor exchange. Finally, we suggest this parsimonious model will be useful to managers of water resources who need to estimate connectivity and flow initiation location along the river corridor over broad, unstudied catchments.

Modeling the dynamical interaction between epidemics on overlay networks

NASA Astrophysics Data System (ADS)

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

2011-08-01

Epidemics seldom occur as isolated phenomena. Typically, two or more viral agents spread within the same host population and may interact dynamically with each other. We present a general model where two viral agents interact via an immunity mechanism as they propagate simultaneously on two networks connecting the same set of nodes. By exploiting a correspondence between the propagation dynamics and a dynamical process performing progressive network generation, we develop an analytical approach that accurately captures the dynamical interaction between epidemics on overlay networks. The formalism allows for overlay networks with arbitrary joint degree distribution and overlap. To illustrate the versatility of our approach, we consider a hypothetical delayed intervention scenario in which an immunizing agent is disseminated in a host population to hinder the propagation of an undesirable agent (e.g., the spread of preventive information in the context of an emerging infectious disease).

Flow-pattern identification and nonlinear dynamics of gas-liquid two-phase flow in complex networks.

PubMed

Gao, Zhongke; Jin, Ningde

2009-06-01

The identification of flow pattern is a basic and important issue in multiphase systems. Because of the complexity of phase interaction in gas-liquid two-phase flow, it is difficult to discern its flow pattern objectively. In this paper, we make a systematic study on the vertical upward gas-liquid two-phase flow using complex network. Three unique network construction methods are proposed to build three types of networks, i.e., flow pattern complex network (FPCN), fluid dynamic complex network (FDCN), and fluid structure complex network (FSCN). Through detecting the community structure of FPCN by the community-detection algorithm based on K -mean clustering, useful and interesting results are found which can be used for identifying five vertical upward gas-liquid two-phase flow patterns. To investigate the dynamic characteristics of gas-liquid two-phase flow, we construct 50 FDCNs under different flow conditions, and find that the power-law exponent and the network information entropy, which are sensitive to the flow pattern transition, can both characterize the nonlinear dynamics of gas-liquid two-phase flow. Furthermore, we construct FSCN and demonstrate how network statistic can be used to reveal the fluid structure of gas-liquid two-phase flow. In this paper, from a different perspective, we not only introduce complex network theory to the study of gas-liquid two-phase flow but also indicate that complex network may be a powerful tool for exploring nonlinear time series in practice.

Application of dynamic recurrent neural networks in nonlinear system identification

NASA Astrophysics Data System (ADS)

Du, Yun; Wu, Xueli; Sun, Huiqin; Zhang, Suying; Tian, Qiang

2006-11-01

An adaptive identification method of simple dynamic recurrent neural network (SRNN) for nonlinear dynamic systems is presented in this paper. This method based on the theory that by using the inner-states feed-back of dynamic network to describe the nonlinear kinetic characteristics of system can reflect the dynamic characteristics more directly, deduces the recursive prediction error (RPE) learning algorithm of SRNN, and improves the algorithm by studying topological structure on recursion layer without the weight values. The simulation results indicate that this kind of neural network can be used in real-time control, due to its less weight values, simpler learning algorithm, higher identification speed, and higher precision of model. It solves the problems of intricate in training algorithm and slow rate in convergence caused by the complicate topological structure in usual dynamic recurrent neural network.

Dynamics and thermodynamics of open chemical networks

NASA Astrophysics Data System (ADS)

Esposito, Massimiliano

Open chemical networks (OCN) are large sets of coupled chemical reactions where some of the species are chemostated (i.e. continuously restored from the environment). Cell metabolism is a notable example of OCN. Two results will be presented. First, dissipation in OCN operating in nonequilibrium steady-states strongly depends on the network topology (algebraic properties of the stoichiometric matrix). An application to oligosaccharides exchange dynamics performed by so-called D-enzymes will be provided. Second, at low concentration the dissipation of OCN is in general inaccurately predicted by deterministic dynamics (i.e. nonlinear rate equations for the species concentrations). In this case a description in terms of the chemical master equation is necessary. A notable exception is provided by so-called deficiency zero networks, i.e. chemical networks with no hidden cycles present in the graph of reactant complexes.

Individual heterogeneity generating explosive system network dynamics.

PubMed

Manrique, Pedro D; Johnson, Neil F

2018-03-01

Individual heterogeneity is a key characteristic of many real-world systems, from organisms to humans. However, its role in determining the system's collective dynamics is not well understood. Here we study how individual heterogeneity impacts the system network dynamics by comparing linking mechanisms that favor similar or dissimilar individuals. We find that this heterogeneity-based evolution drives an unconventional form of explosive network behavior, and it dictates how a polarized population moves toward consensus. Our model shows good agreement with data from both biological and social science domains. We conclude that individual heterogeneity likely plays a key role in the collective development of real-world networks and communities, and it cannot be ignored.

Individual heterogeneity generating explosive system network dynamics

NASA Astrophysics Data System (ADS)

Manrique, Pedro D.; Johnson, Neil F.

2018-03-01

Individual heterogeneity is a key characteristic of many real-world systems, from organisms to humans. However, its role in determining the system's collective dynamics is not well understood. Here we study how individual heterogeneity impacts the system network dynamics by comparing linking mechanisms that favor similar or dissimilar individuals. We find that this heterogeneity-based evolution drives an unconventional form of explosive network behavior, and it dictates how a polarized population moves toward consensus. Our model shows good agreement with data from both biological and social science domains. We conclude that individual heterogeneity likely plays a key role in the collective development of real-world networks and communities, and it cannot be ignored.

Relaxation dynamics of maximally clustered networks

NASA Astrophysics Data System (ADS)

Klaise, Janis; Johnson, Samuel

2018-01-01

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős-Rényi phenomenology.

Dynamic transcriptional signatures and network responses for clinical symptoms in influenza-infected human subjects using systems biology approaches.

PubMed

Linel, Patrice; Wu, Shuang; Deng, Nan; Wu, Hulin

2014-10-01

Recent studies demonstrate that human blood transcriptional signatures may be used to support diagnosis and clinical decisions for acute respiratory viral infections such as influenza. In this article, we propose to use a newly developed systems biology approach for time course gene expression data to identify significant dynamically response genes and dynamic gene network responses to viral infection. We illustrate the methodological pipeline by reanalyzing the time course gene expression data from a study with healthy human subjects challenged by live influenza virus. We observed clear differences in the number of significant dynamic response genes (DRGs) between the symptomatic and asymptomatic subjects and also identified DRG signatures for symptomatic subjects with influenza infection. The 505 common DRGs shared by the symptomatic subjects have high consistency with the signature genes for predicting viral infection identified in previous works. The temporal response patterns and network response features were carefully analyzed and investigated.

Metric projection for dynamic multiplex networks.

PubMed

Jurman, Giuseppe

2016-08-01

Evolving multiplex networks are a powerful model for representing the dynamics along time of different phenomena, such as social networks, power grids, biological pathways. However, exploring the structure of the multiplex network time series is still an open problem. Here we propose a two-step strategy to tackle this problem based on the concept of distance (metric) between networks. Given a multiplex graph, first a network of networks is built for each time step, and then a real valued time series is obtained by the sequence of (simple) networks by evaluating the distance from the first element of the series. The effectiveness of this approach in detecting the occurring changes along the original time series is shown on a synthetic example first, and then on the Gulf dataset of political events.

Pattern Analysis in Social Networks with Dynamic Connections

NASA Astrophysics Data System (ADS)

Wu, Yu; Zhang, Yu

In this paper, we explore how decentralized local interactions of autonomous agents in a network relate to collective behaviors. Most existing work in this area models social network in which agent relations are fixed; instead, we focus on dynamic social networks where agents can rationally adjust their neighborhoods based on their individual interests. We propose a new connection evaluation rule called the Highest Weighted Reward (HWR) rule, with which agents dynamically choose their neighbors in order to maximize their own utilities based on the rewards from previous interactions. Our experiments show that in the 2-action pure coordination game, our system will stabilize to a clustering state where all relationships in the network are rewarded with the optimal payoff. Our experiments also reveal additional interesting patterns in the network.

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

NASA Astrophysics Data System (ADS)

Gan, Yu; Tang, Ming; Yang, Hanxin

2013-05-01

Since the discovery of non-Poisson statistics of human mobility trajectories, more attention has been paid to understand the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate packet forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and the higher proportion of high-speed agents can enhance the network throughput and reduce the mean traveling time in random forwarding. A hierarchical structure in the dependence of high-speed is observed: the network throughput remains unchanged at small and large high-speed value. It is also interesting to find that a slightly preferential forwarding to high-speed agents can maximize the network capacity. Through theoretical analysis and numerical simulations, we show that the optimal forwarding ratio stems from the local structural heterogeneity of low-speed agents.

A biologically inspired neural network for dynamic programming.

PubMed

Francelin Romero, R A; Kacpryzk, J; Gomide, F

2001-12-01

An artificial neural network with a two-layer feedback topology and generalized recurrent neurons, for solving nonlinear discrete dynamic optimization problems, is developed. A direct method to assign the weights of neural networks is presented. The method is based on Bellmann's Optimality Principle and on the interchange of information which occurs during the synaptic chemical processing among neurons. The neural network based algorithm is an advantageous approach for dynamic programming due to the inherent parallelism of the neural networks; further it reduces the severity of computational problems that can occur in methods like conventional methods. Some illustrative application examples are presented to show how this approach works out including the shortest path and fuzzy decision making problems.

On structural identifiability analysis of the cascaded linear dynamic systems in isotopically non-stationary 13C labelling experiments.

PubMed

Lin, Weilu; Wang, Zejian; Huang, Mingzhi; Zhuang, Yingping; Zhang, Siliang

2018-06-01

The isotopically non-stationary 13C labelling experiments, as an emerging experimental technique, can estimate the intracellular fluxes of the cell culture under an isotopic transient period. However, to the best of our knowledge, the issue of the structural identifiability analysis of non-stationary isotope experiments is not well addressed in the literature. In this work, the local structural identifiability analysis for non-stationary cumomer balance equations is conducted based on the Taylor series approach. The numerical rank of the Jacobian matrices of the finite extended time derivatives of the measured fractions with respect to the free parameters is taken as the criterion. It turns out that only one single time point is necessary to achieve the structural identifiability analysis of the cascaded linear dynamic system of non-stationary isotope experiments. The equivalence between the local structural identifiability of the cascaded linear dynamic systems and the local optimum condition of the nonlinear least squares problem is elucidated in the work. Optimal measurements sets can then be determined for the metabolic network. Two simulated metabolic networks are adopted to demonstrate the utility of the proposed method. Copyright © 2018 Elsevier Inc. All rights reserved.

Coarse-Grained Molecular Dynamics Simulation of Ionic Polymer Networks

DTIC Science & Technology

2008-07-01

AFRL-RX-WP-TP-2009-4198 COARSE-GRAINED MOLECULAR DYNAMICS SIMULATION OF IONIC POLYMER NETWORKS (Postprint) T.E. Dirama, V. Varshney, K.L...GRAINED MOLECULAR DYNAMICS SIMULATION OF IONIC POLYMER NETWORKS (Postprint) 5a. CONTRACT NUMBER FA8650-05-D-5807-0052 5b. GRANT NUMBER 5c...We studied two types of networks which differ only by one containing ionic pairs that amount to 7% of the total number of bonds present. The stress

Comparison of neural network applications for channel assignment in cellular TDMA networks and dynamically sectored PCS networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

1997-04-01

The use of artificial neural networks (NNs) to address the channel assignment problem (CAP) for cellular time-division multiple access and code-division multiple access networks has previously been investigated by this author and many others. The investigations to date have been based on a hexagonal cell structure established by omnidirectional antennas at the base stations. No account was taken of the use of spatial isolation enabled by directional antennas to reduce interference between mobiles. Any reduction in interference translates into increased capacity and consequently alters the performance of the NNs. Previous studies have sought to improve the performance of Hopfield- Tank network algorithms and self-organizing feature map algorithms applied primarily to static channel assignment (SCA) for cellular networks that handle uniformly distributed, stationary traffic in each cell for a single type of service. The resulting algorithms minimize energy functions representing interference constraint and ad hoc conditions that promote convergence to optimal solutions. While the structures of the derived neural network algorithms (NNAs) offer the potential advantages of inherent parallelism and adaptability to changing system conditions, this potential has yet to be fulfilled the CAP for emerging mobile networks. The next-generation communication infrastructures must accommodate dynamic operating conditions. Macrocell topologies are being refined to microcells and picocells that can be dynamically sectored by adaptively controlled, directional antennas and programmable transceivers. These networks must support the time-varying demands for personal communication services (PCS) that simultaneously carry voice, data and video and, thus, require new dynamic channel assignment (DCA) algorithms. This paper examines the impact of dynamic cell sectoring and geometric conditioning on NNAs developed for SCA in omnicell networks with stationary traffic to improve the metrics

Adaptive identifier for uncertain complex nonlinear systems based on continuous neural networks.

PubMed

Alfaro-Ponce, Mariel; Cruz, Amadeo Argüelles; Chairez, Isaac

2014-03-01

This paper presents the design of a complex-valued differential neural network identifier for uncertain nonlinear systems defined in the complex domain. This design includes the construction of an adaptive algorithm to adjust the parameters included in the identifier. The algorithm is obtained based on a special class of controlled Lyapunov functions. The quality of the identification process is characterized using the practical stability framework. Indeed, the region where the identification error converges is derived by the same Lyapunov method. This zone is defined by the power of uncertainties and perturbations affecting the complex-valued uncertain dynamics. Moreover, this convergence zone is reduced to its lowest possible value using ideas related to the so-called ellipsoid methodology. Two simple but informative numerical examples are developed to show how the identifier proposed in this paper can be used to approximate uncertain nonlinear systems valued in the complex domain.

Dynamical network of residue–residue contacts reveals coupled allosteric effects in recognition, catalysis, and mutation

PubMed Central

Doshi, Urmi; Holliday, Michael J.; Eisenmesser, Elan Z.; Hamelberg, Donald

2016-01-01

Detailed understanding of how conformational dynamics orchestrates function in allosteric regulation of recognition and catalysis remains ambiguous. Here, we simulate CypA using multiple-microsecond-long atomistic molecular dynamics in explicit solvent and carry out NMR experiments. We analyze a large amount of time-dependent multidimensional data with a coarse-grained approach and map key dynamical features within individual macrostates by defining dynamics in terms of residue–residue contacts. The effects of substrate binding are observed to be largely sensed at a location over 15 Å from the active site, implying its importance in allostery. Using NMR experiments, we confirm that a dynamic cluster of residues in this distal region is directly coupled to the active site. Furthermore, the dynamical network of interresidue contacts is found to be coupled and temporally dispersed, ranging over 4 to 5 orders of magnitude. Finally, using network centrality measures we demonstrate the changes in the communication network, connectivity, and influence of CypA residues upon substrate binding, mutation, and during catalysis. We identify key residues that potentially act as a bottleneck in the communication flow through the distinct regions in CypA and, therefore, as targets for future mutational studies. Mapping these dynamical features and the coupling of dynamics to function has crucial ramifications in understanding allosteric regulation in enzymes and proteins, in general. PMID:27071107

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.

Network Dynamics of Innovation Processes.

PubMed

Iacopini, Iacopo; Milojević, Staša; Latora, Vito

2018-01-26

We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

Network Dynamics of Innovation Processes

NASA Astrophysics Data System (ADS)

Iacopini, Iacopo; Milojević, Staša; Latora, Vito

2018-01-01

We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

Dynamical Graph Theory Networks Methods for the Analysis of Sparse Functional Connectivity Networks and for Determining Pinning Observability in Brain Networks

PubMed Central

Meyer-Bäse, Anke; Roberts, Rodney G.; Illan, Ignacio A.; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja

2017-01-01

Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary

Dynamical Graph Theory Networks Methods for the Analysis of Sparse Functional Connectivity Networks and for Determining Pinning Observability in Brain Networks.

PubMed

Meyer-Bäse, Anke; Roberts, Rodney G; Illan, Ignacio A; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja

2017-01-01

Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary

Dynamic security contingency screening and ranking using neural networks.

PubMed

Mansour, Y; Vaahedi, E; El-Sharkawi, M A

1997-01-01

This paper summarizes BC Hydro's experience in applying neural networks to dynamic security contingency screening and ranking. The idea is to use the information on the prevailing operating condition and directly provide contingency screening and ranking using a trained neural network. To train the two neural networks for the large scale systems of BC Hydro and Hydro Quebec, in total 1691 detailed transient stability simulation were conducted, 1158 for BC Hydro system and 533 for the Hydro Quebec system. The simulation program was equipped with the energy margin calculation module (second kick) to measure the energy margin in each run. The first set of results showed poor performance for the neural networks in assessing the dynamic security. However a number of corrective measures improved the results significantly. These corrective measures included: 1) the effectiveness of output; 2) the number of outputs; 3) the type of features (static versus dynamic); 4) the number of features; 5) system partitioning; and 6) the ratio of training samples to features. The final results obtained using the large scale systems of BC Hydro and Hydro Quebec demonstrates a good potential for neural network in dynamic security assessment contingency screening and ranking.

Generalized priority-queue network dynamics: Impact of team and hierarchy

NASA Astrophysics Data System (ADS)

Cho, Won-Kuk; Min, Byungjoon; Goh, K.-I.; Kim, I.-M.

2010-06-01

We study the effect of team and hierarchy on the waiting-time dynamics of priority-queue networks. To this end, we introduce generalized priority-queue network models incorporating interaction rules based on team-execution and hierarchy in decision making, respectively. It is numerically found that the waiting-time distribution exhibits a power law for long waiting times in both cases, yet with different exponents depending on the team size and the position of queue nodes in the hierarchy, respectively. The observed power-law behaviors have in many cases a corresponding single or pairwise-interacting queue dynamics, suggesting that the pairwise interaction may constitute a major dynamic consequence in the priority-queue networks. It is also found that the reciprocity of influence is a relevant factor for the priority-queue network dynamics.

Competitive Dynamics on Complex Networks

PubMed Central

Zhao, Jiuhua; Liu, Qipeng; Wang, Xiaofan

2014-01-01

We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is most likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition. PMID:25068622

Detectability Thresholds and Optimal Algorithms for Community Structure in Dynamic Networks

NASA Astrophysics Data System (ADS)

Ghasemian, Amir; Zhang, Pan; Clauset, Aaron; Moore, Cristopher; Peel, Leto

2016-07-01

The detection of communities within a dynamic network is a common means for obtaining a coarse-grained view of a complex system and for investigating its underlying processes. While a number of methods have been proposed in the machine learning and physics literature, we lack a theoretical analysis of their strengths and weaknesses, or of the ultimate limits on when communities can be detected. Here, we study the fundamental limits of detecting community structure in dynamic networks. Specifically, we analyze the limits of detectability for a dynamic stochastic block model where nodes change their community memberships over time, but where edges are generated independently at each time step. Using the cavity method, we derive a precise detectability threshold as a function of the rate of change and the strength of the communities. Below this sharp threshold, we claim that no efficient algorithm can identify the communities better than chance. We then give two algorithms that are optimal in the sense that they succeed all the way down to this threshold. The first uses belief propagation, which gives asymptotically optimal accuracy, and the second is a fast spectral clustering algorithm, based on linearizing the belief propagation equations. These results extend our understanding of the limits of community detection in an important direction, and introduce new mathematical tools for similar extensions to networks with other types of auxiliary information.

Active influence in dynamical models of structural balance in social networks

NASA Astrophysics Data System (ADS)

Summers, Tyler H.; Shames, Iman

2013-07-01

We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social psychology called structural balance, the negative links play a key role in both the structure and dynamics of the network. Recent research has shown that in a nonlinear dynamical system modeling the time evolution of “friendliness levels” in the network, two opposing factions emerge from almost any initial condition. Here we study active external influence in this dynamical model and show that any agent in the network can achieve any desired structurally balanced state from any initial condition by perturbing its own local friendliness levels. Based on this result, we also introduce a new network centrality measure for signed networks. The results are illustrated in an international-relations network using United Nations voting record data from 1946 to 2008 to estimate friendliness levels amongst various countries.

Revealing physical interaction networks from statistics of collective dynamics

PubMed Central

Nitzan, Mor; Casadiego, Jose; Timme, Marc

2017-01-01

Revealing physical interactions in complex systems from observed collective dynamics constitutes a fundamental inverse problem in science. Current reconstruction methods require access to a system’s model or dynamical data at a level of detail often not available. We exploit changes in invariant measures, in particular distributions of sampled states of the system in response to driving signals, and use compressed sensing to reveal physical interaction networks. Dynamical observations following driving suffice to infer physical connectivity even if they are temporally disordered, are acquired at large sampling intervals, and stem from different experiments. Testing various nonlinear dynamic processes emerging on artificial and real network topologies indicates high reconstruction quality for existence as well as type of interactions. These results advance our ability to reveal physical interaction networks in complex synthetic and natural systems. PMID:28246630

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Extracting neuronal functional network dynamics via adaptive Granger causality analysis.

PubMed

Sheikhattar, Alireza; Miran, Sina; Liu, Ji; Fritz, Jonathan B; Shamma, Shihab A; Kanold, Patrick O; Babadi, Behtash

2018-04-24

Quantifying the functional relations between the nodes in a network based on local observations is a key challenge in studying complex systems. Most existing time series analysis techniques for this purpose provide static estimates of the network properties, pertain to stationary Gaussian data, or do not take into account the ubiquitous sparsity in the underlying functional networks. When applied to spike recordings from neuronal ensembles undergoing rapid task-dependent dynamics, they thus hinder a precise statistical characterization of the dynamic neuronal functional networks underlying adaptive behavior. We develop a dynamic estimation and inference paradigm for extracting functional neuronal network dynamics in the sense of Granger, by integrating techniques from adaptive filtering, compressed sensing, point process theory, and high-dimensional statistics. We demonstrate the utility of our proposed paradigm through theoretical analysis, algorithm development, and application to synthetic and real data. Application of our techniques to two-photon Ca 2+ imaging experiments from the mouse auditory cortex reveals unique features of the functional neuronal network structures underlying spontaneous activity at unprecedented spatiotemporal resolution. Our analysis of simultaneous recordings from the ferret auditory and prefrontal cortical areas suggests evidence for the role of rapid top-down and bottom-up functional dynamics across these areas involved in robust attentive behavior.

Spatial-temporal-spectral EEG patterns of BOLD functional network connectivity dynamics

NASA Astrophysics Data System (ADS)

Lamoš, Martin; Mareček, Radek; Slavíček, Tomáš; Mikl, Michal; Rektor, Ivan; Jan, Jiří

2018-06-01

Objective. Growing interest in the examination of large-scale brain network functional connectivity dynamics is accompanied by an effort to find the electrophysiological correlates. The commonly used constraints applied to spatial and spectral domains during electroencephalogram (EEG) data analysis may leave part of the neural activity unrecognized. We propose an approach that blindly reveals multimodal EEG spectral patterns that are related to the dynamics of the BOLD functional network connectivity. Approach. The blind decomposition of EEG spectrogram by parallel factor analysis has been shown to be a useful technique for uncovering patterns of neural activity. The simultaneously acquired BOLD fMRI data were decomposed by independent component analysis. Dynamic functional connectivity was computed on the component’s time series using a sliding window correlation, and between-network connectivity states were then defined based on the values of the correlation coefficients. ANOVA tests were performed to assess the relationships between the dynamics of between-network connectivity states and the fluctuations of EEG spectral patterns. Main results. We found three patterns related to the dynamics of between-network connectivity states. The first pattern has dominant peaks in the alpha, beta, and gamma bands and is related to the dynamics between the auditory, sensorimotor, and attentional networks. The second pattern, with dominant peaks in the theta and low alpha bands, is related to the visual and default mode network. The third pattern, also with peaks in the theta and low alpha bands, is related to the auditory and frontal network. Significance. Our previous findings revealed a relationship between EEG spectral pattern fluctuations and the hemodynamics of large-scale brain networks. In this study, we suggest that the relationship also exists at the level of functional connectivity dynamics among large-scale brain networks when no standard spatial and spectral

Memory Dynamics in Cross-linked Actin Networks

NASA Astrophysics Data System (ADS)

Scheff, Danielle; Majumdar, Sayantan; Gardel, Margaret

Cells demonstrate the remarkable ability to adapt to mechanical stimuli through rearrangement of the actin cytoskeleton, a cross-linked network of actin filaments. In addition to its importance in cell biology, understanding this mechanical response provides strategies for creation of novel materials. A recent study has demonstrated that applied stress can encode mechanical memory in these networks through changes in network geometry, which gives rise to anisotropic shear response. Under later shear, the network is stiffer in the direction of the previously applied stress. However, the dynamics behind the encoding of this memory are unknown. To address this question, we explore the effect of varying either the rigidity of the cross-linkers or the length of actin filament on the time scales required for both memory encoding and over which it later decays. While previous experiments saw only a long-lived memory, initial results suggest another mechanism where memories relax relatively quickly. Overall, our study is crucial for understanding the process by which an external stress can impact network arrangement and thus the dynamics of memory formation.

Dynamics of deceptive interactions in social networks.

PubMed

Barrio, Rafael A; Govezensky, Tzipe; Dunbar, Robin; Iñiguez, Gerardo; Kaski, Kimmo

2015-11-06

In this paper, we examine the role of lies in human social relations by implementing some salient characteristics of deceptive interactions into an opinion formation model, so as to describe the dynamical behaviour of a social network more realistically. In this model, we take into account such basic properties of social networks as the dynamics of the intensity of interactions, the influence of public opinion and the fact that in every human interaction it might be convenient to deceive or withhold information depending on the instantaneous situation of each individual in the network. We find that lies shape the topology of social networks, especially the formation of tightly linked, small communities with loose connections between them. We also find that agents with a larger proportion of deceptive interactions are the ones that connect communities of different opinion, and, in this sense, they have substantial centrality in the network. We then discuss the consequences of these results for the social behaviour of humans and predict the changes that could arise due to a varying tolerance for lies in society. © 2015 The Author(s).

Adaptive online inverse control of a shape memory alloy wire actuator using a dynamic neural network

NASA Astrophysics Data System (ADS)

Mai, Huanhuan; Song, Gangbing; Liao, Xiaofeng

2013-01-01

Shape memory alloy (SMA) actuators exhibit severe hysteresis, a nonlinear behavior, which complicates control strategies and limits their applications. This paper presents a new approach to controlling an SMA actuator through an adaptive inverse model based controller that consists of a dynamic neural network (DNN) identifier, a copy dynamic neural network (CDNN) feedforward term and a proportional (P) feedback action. Unlike fixed hysteresis models used in most inverse controllers, the proposed one uses a DNN to identify online the relationship between the applied voltage to the actuator and the displacement (the inverse model). Even without a priori knowledge of the SMA hysteresis and without pre-training, the proposed controller can precisely control the SMA wire actuator in various tracking tasks by identifying online the inverse model of the SMA actuator. Experiments were conducted, and experimental results demonstrated real-time modeling capabilities of DNN and the performance of the adaptive inverse controller.

Dynamic interactions in neural networks

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

Arbib, M.A.; Amari, S.

The study of neural networks is enjoying a great renaissance, both in computational neuroscience, the development of information processing models of living brains, and in neural computing, the use of neurally inspired concepts in the construction of intelligent machines. This volume presents models and data on the dynamic interactions occurring in the brain, and exhibits the dynamic interactions between research in computational neuroscience and in neural computing. The authors present current research, future trends and open problems.

Representing Micro-Macro Linkages by Actor-Based Dynamic Network Models

PubMed Central

Snijders, Tom A.B.; Steglich, Christian E.G.

2014-01-01

Stochastic actor-based models for network dynamics have the primary aim of statistical inference about processes of network change, but may be regarded as a kind of agent-based models. Similar to many other agent-based models, they are based on local rules for actor behavior. Different from many other agent-based models, by including elements of generalized linear statistical models they aim to be realistic detailed representations of network dynamics in empirical data sets. Statistical parallels to micro-macro considerations can be found in the estimation of parameters determining local actor behavior from empirical data, and the assessment of goodness of fit from the correspondence with network-level descriptives. This article studies several network-level consequences of dynamic actor-based models applied to represent cross-sectional network data. Two examples illustrate how network-level characteristics can be obtained as emergent features implied by micro-specifications of actor-based models. PMID:25960578

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

NASA Astrophysics Data System (ADS)

Lu, Qiming

Many modern and important technological, social, information and infrastructure systems can be viewed as complex systems with a large number of interacting components. Models of complex networks and dynamical interactions, as well as their applications are of fundamental interests in many aspects. Here, several stylized models of multiplex propagation and opinion dynamics are investigated on complex and empirical social networks. We first investigate cascade dynamics in threshold-controlled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network's response, while keeping energy consumption at a manageable level. We also investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long

Personality traits and ego-network dynamics

PubMed Central

Centellegher, Simone; López, Eduardo; Saramäki, Jari; Lepri, Bruno

2017-01-01

Strong and supportive social relationships are fundamental to our well-being. However, there are costs to their maintenance, resulting in a trade-off between quality and quantity, a typical strategy being to put a lot of effort on a few high-intensity relationships while maintaining larger numbers of less close relationships. It has also been shown that there are persistent individual differences in this pattern; some individuals allocate their efforts more uniformly across their networks, while others strongly focus on their closest relationships. Furthermore, some individuals maintain more stable networks than others. Here, we focus on how personality traits of individuals affect this picture, using mobile phone calls records and survey data from the Mobile Territorial Lab (MTL) study. In particular, we look at the relationship between personality traits and the (i) persistence of social signatures, namely the similarity of the social signature shape of an individual measured in different time intervals; (ii) the turnover in egocentric networks, that is, differences in the set of alters present at two consecutive temporal intervals; and (iii) the rank dynamics defined as the variation of alter rankings in egocentric networks in consecutive intervals. We observe that some traits have effects on the stability of the social signatures as well as network turnover and rank dynamics. As an example, individuals who score highly in the Openness to Experience trait tend to have higher levels of network turnover and larger alter rank variations. On broader terms, our study shows that personality traits clearly affect the ways in which individuals maintain their personal networks. PMID:28253333

Rumor Diffusion in an Interests-Based Dynamic Social Network

PubMed Central

Mao, Xinjun; Guessoum, Zahia; Zhou, Huiping

2013-01-01

To research rumor diffusion in social friend network, based on interests, a dynamic friend network is proposed, which has the characteristics of clustering and community, and a diffusion model is also proposed. With this friend network and rumor diffusion model, based on the zombie-city model, some simulation experiments to analyze the characteristics of rumor diffusion in social friend networks have been conducted. The results show some interesting observations: (1) positive information may evolve to become a rumor through the diffusion process that people may modify the information by word of mouth; (2) with the same average degree, a random social network has a smaller clustering coefficient and is more beneficial for rumor diffusion than the dynamic friend network; (3) a rumor is spread more widely in a social network with a smaller global clustering coefficient than in a social network with a larger global clustering coefficient; and (4) a network with a smaller clustering coefficient has a larger efficiency. PMID:24453911

Rumor diffusion in an interests-based dynamic social network.

PubMed

Tang, Mingsheng; Mao, Xinjun; Guessoum, Zahia; Zhou, Huiping

2013-01-01

To research rumor diffusion in social friend network, based on interests, a dynamic friend network is proposed, which has the characteristics of clustering and community, and a diffusion model is also proposed. With this friend network and rumor diffusion model, based on the zombie-city model, some simulation experiments to analyze the characteristics of rumor diffusion in social friend networks have been conducted. The results show some interesting observations: (1) positive information may evolve to become a rumor through the diffusion process that people may modify the information by word of mouth; (2) with the same average degree, a random social network has a smaller clustering coefficient and is more beneficial for rumor diffusion than the dynamic friend network; (3) a rumor is spread more widely in a social network with a smaller global clustering coefficient than in a social network with a larger global clustering coefficient; and (4) a network with a smaller clustering coefficient has a larger efficiency.

Dynamic network reconstruction from gene expression data applied to immune response during bacterial infection.

PubMed

Guthke, Reinhard; Möller, Ulrich; Hoffmann, Martin; Thies, Frank; Töpfer, Susanne

2005-04-15

The immune response to bacterial infection represents a complex network of dynamic gene and protein interactions. We present an optimized reverse engineering strategy aimed at a reconstruction of this kind of interaction networks. The proposed approach is based on both microarray data and available biological knowledge. The main kinetics of the immune response were identified by fuzzy clustering of gene expression profiles (time series). The number of clusters was optimized using various evaluation criteria. For each cluster a representative gene with a high fuzzy-membership was chosen in accordance with available physiological knowledge. Then hypothetical network structures were identified by seeking systems of ordinary differential equations, whose simulated kinetics could fit the gene expression profiles of the cluster-representative genes. For the construction of hypothetical network structures singular value decomposition (SVD) based methods and a newly introduced heuristic Network Generation Method here were compared. It turned out that the proposed novel method could find sparser networks and gave better fits to the experimental data. Reinhard.Guthke@hki-jena.de.

Simulating market dynamics: interactions between consumer psychology and social networks.

PubMed

Janssen, Marco A; Jager, Wander

2003-01-01

Markets can show different types of dynamics, from quiet markets dominated by one or a few products, to markets with continual penetration of new and reintroduced products. In a previous article we explored the dynamics of markets from a psychological perspective using a multi-agent simulation model. The main results indicated that the behavioral rules dominating the artificial consumer's decision making determine the resulting market dynamics, such as fashions, lock-in, and unstable renewal. Results also show the importance of psychological variables like social networks, preferences, and the need for identity to explain the dynamics of markets. In this article we extend this work in two directions. First, we will focus on a more systematic investigation of the effects of different network structures. The previous article was based on Watts and Strogatz's approach, which describes the small-world and clustering characteristics in networks. More recent research demonstrated that many large networks display a scale-free power-law distribution for node connectivity. In terms of market dynamics this may imply that a small proportion of consumers may have an exceptional influence on the consumptive behavior of others (hubs, or early adapters). We show that market dynamics is a self-organized property depending on the interaction between the agents' decision-making process (heuristics), the product characteristics (degree of satisfaction of unit of consumption, visibility), and the structure of interactions between agents (size of network and hubs in a social network).

Influence maximization in time bounded network identifies transcription factors regulating perturbed pathways

PubMed Central

Jo, Kyuri; Jung, Inuk; Moon, Ji Hwan; Kim, Sun

2016-01-01

Motivation: To understand the dynamic nature of the biological process, it is crucial to identify perturbed pathways in an altered environment and also to infer regulators that trigger the response. Current time-series analysis methods, however, are not powerful enough to identify perturbed pathways and regulators simultaneously. Widely used methods include methods to determine gene sets such as differentially expressed genes or gene clusters and these genes sets need to be further interpreted in terms of biological pathways using other tools. Most pathway analysis methods are not designed for time series data and they do not consider gene-gene influence on the time dimension. Results: In this article, we propose a novel time-series analysis method TimeTP for determining transcription factors (TFs) regulating pathway perturbation, which narrows the focus to perturbed sub-pathways and utilizes the gene regulatory network and protein–protein interaction network to locate TFs triggering the perturbation. TimeTP first identifies perturbed sub-pathways that propagate the expression changes along the time. Starting points of the perturbed sub-pathways are mapped into the network and the most influential TFs are determined by influence maximization technique. The analysis result is visually summarized in TF-Pathway map in time clock. TimeTP was applied to PIK3CA knock-in dataset and found significant sub-pathways and their regulators relevant to the PIP3 signaling pathway. Availability and Implementation: TimeTP is implemented in Python and available at http://biohealth.snu.ac.kr/software/TimeTP/. Supplementary information: Supplementary data are available at Bioinformatics online. Contact: sunkim.bioinfo@snu.ac.kr PMID:27307609

Self-Organized Information Processing in Neuronal Networks: Replacing Layers in Deep Networks by Dynamics

NASA Astrophysics Data System (ADS)

Kirst, Christoph

It is astonishing how the sub-parts of a brain co-act to produce coherent behavior. What are mechanism that coordinate information processing and communication and how can those be changed flexibly in order to cope with variable contexts? Here we show that when information is encoded in the deviations around a collective dynamical reference state of a recurrent network the propagation of these fluctuations is strongly dependent on precisely this underlying reference. Information here 'surfs' on top of the collective dynamics and switching between states enables fast and flexible rerouting of information. This in turn affects local processing and consequently changes in the global reference dynamics that re-regulate the distribution of information. This provides a generic mechanism for self-organized information processing as we demonstrate with an oscillatory Hopfield network that performs contextual pattern recognition. Deep neural networks have proven to be very successful recently. Here we show that generating information channels via collective reference dynamics can effectively compress a deep multi-layer architecture into a single layer making this mechanism a promising candidate for the organization of information processing in biological neuronal networks.

Failure dynamics of the global risk network.

PubMed

Szymanski, Boleslaw K; Lin, Xin; Asztalos, Andrea; Sreenivasan, Sameet

2015-06-18

Risks threatening modern societies form an intricately interconnected network that often underlies crisis situations. Yet, little is known about how risk materializations in distinct domains influence each other. Here we present an approach in which expert assessments of likelihoods and influence of risks underlie a quantitative model of the global risk network dynamics. The modeled risks range from environmental to economic and technological, and include difficult to quantify risks, such as geo-political and social. Using the maximum likelihood estimation, we find the optimal model parameters and demonstrate that the model including network effects significantly outperforms the others, uncovering full value of the expert collected data. We analyze the model dynamics and study its resilience and stability. Our findings include such risk properties as contagion potential, persistence, roles in cascades of failures and the identity of risks most detrimental to system stability. The model provides quantitative means for measuring the adverse effects of risk interdependencies and the materialization of risks in the network.

Exploring the structure and function of temporal networks with dynamic graphlets

PubMed Central

Hulovatyy, Y.; Chen, H.; Milenković, T.

2015-01-01

Motivation: With increasing availability of temporal real-world networks, how to efficiently study these data? One can model a temporal network as a single aggregate static network, or as a series of time-specific snapshots, each being an aggregate static network over the corresponding time window. Then, one can use established methods for static analysis on the resulting aggregate network(s), but losing in the process valuable temporal information either completely, or at the interface between different snapshots, respectively. Here, we develop a novel approach for studying a temporal network more explicitly, by capturing inter-snapshot relationships. Results: We base our methodology on well-established graphlets (subgraphs), which have been proven in numerous contexts in static network research. We develop new theory to allow for graphlet-based analyses of temporal networks. Our new notion of dynamic graphlets is different from existing dynamic network approaches that are based on temporal motifs (statistically significant subgraphs). The latter have limitations: their results depend on the choice of a null network model that is required to evaluate the significance of a subgraph, and choosing a good null model is non-trivial. Our dynamic graphlets overcome the limitations of the temporal motifs. Also, when we aim to characterize the structure and function of an entire temporal network or of individual nodes, our dynamic graphlets outperform the static graphlets. Clearly, accounting for temporal information helps. We apply dynamic graphlets to temporal age-specific molecular network data to deepen our limited knowledge about human aging. Availability and implementation: http://www.nd.edu/∼cone/DG. Contact: tmilenko@nd.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:26072480

Extensive cross-talk and global regulators identified from an analysis of the integrated transcriptional and signaling network in Escherichia coli.

PubMed

Antiqueira, Lucas; Janga, Sarath Chandra; Costa, Luciano da Fontoura

2012-11-01

To understand the regulatory dynamics of transcription factors (TFs) and their interplay with other cellular components we have integrated transcriptional, protein-protein and the allosteric or equivalent interactions which mediate the physiological activity of TFs in Escherichia coli. To study this integrated network we computed a set of network measurements followed by principal component analysis (PCA), investigated the correlations between network structure and dynamics, and carried out a procedure for motif detection. In particular, we show that outliers identified in the integrated network based on their network properties correspond to previously characterized global transcriptional regulators. Furthermore, outliers are highly and widely expressed across conditions, thus supporting their global nature in controlling many genes in the cell. Motifs revealed that TFs not only interact physically with each other but also obtain feedback from signals delivered by signaling proteins supporting the extensive cross-talk between different types of networks. Our analysis can lead to the development of a general framework for detecting and understanding global regulatory factors in regulatory networks and reinforces the importance of integrating multiple types of interactions in underpinning the interrelationships between them.

Dynamic properties of epidemic spreading on finite size complex networks

NASA Astrophysics Data System (ADS)

Li, Ying; Liu, Yang; Shan, Xiu-Ming; Ren, Yong; Jiao, Jian; Qiu, Ben

2005-11-01

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS (susceptible-infected-susceptible) model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.

Predicting the Lifetime of Dynamic Networks Experiencing Persistent Random Attacks.

PubMed

Podobnik, Boris; Lipic, Tomislav; Horvatic, Davor; Majdandzic, Antonio; Bishop, Steven R; Eugene Stanley, H

2015-09-21

Estimating the critical points at which complex systems abruptly flip from one state to another is one of the remaining challenges in network science. Due to lack of knowledge about the underlying stochastic processes controlling critical transitions, it is widely considered difficult to determine the location of critical points for real-world networks, and it is even more difficult to predict the time at which these potentially catastrophic failures occur. We analyse a class of decaying dynamic networks experiencing persistent failures in which the magnitude of the overall failure is quantified by the probability that a potentially permanent internal failure will occur. When the fraction of active neighbours is reduced to a critical threshold, cascading failures can trigger a total network failure. For this class of network we find that the time to network failure, which is equivalent to network lifetime, is inversely dependent upon the magnitude of the failure and logarithmically dependent on the threshold. We analyse how permanent failures affect network robustness using network lifetime as a measure. These findings provide new methodological insight into system dynamics and, in particular, of the dynamic processes of networks. We illustrate the network model by selected examples from biology, and social science.

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

PubMed Central

McDonnell, Mark D.; Ward, Lawrence M.

2014-01-01

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

Complex and unexpected dynamics in simple genetic regulatory networks

NASA Astrophysics Data System (ADS)

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

2014-03-01

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

Infraslow Electroencephalographic and Dynamic Resting State Network Activity.

PubMed

Grooms, Joshua K; Thompson, Garth J; Pan, Wen-Ju; Billings, Jacob; Schumacher, Eric H; Epstein, Charles M; Keilholz, Shella D

2017-06-01

A number of studies have linked the blood oxygenation level dependent (BOLD) signal to electroencephalographic (EEG) signals in traditional frequency bands (δ, θ, α, β, and γ), but the relationship between BOLD and its direct frequency correlates in the infraslow band (<1 Hz) has been little studied. Previously, work in rodents showed that infraslow local field potentials play a role in functional connectivity, particularly in the dynamic organization of large-scale networks. To examine the relationship between infraslow activity and network dynamics in humans, direct current (DC) EEG and resting state magnetic resonance imaging data were acquired simultaneously. The DC EEG signals were correlated with the BOLD signal in patterns that resembled resting state networks. Subsequent dynamic analysis showed that the correlation between DC EEG and the BOLD signal varied substantially over time, even within individual subjects. The variation in DC EEG appears to reflect the time-varying contribution of different resting state networks. Furthermore, some of the patterns of DC EEG and BOLD correlation are consistent with previous work demonstrating quasiperiodic spatiotemporal patterns of large-scale network activity in resting state. These findings demonstrate that infraslow electrical activity is linked to BOLD fluctuations in humans and that it may provide a basis for large-scale organization comparable to that observed in animal studies.

A geometrical approach to control and controllability of nonlinear dynamical networks

PubMed Central

Wang, Le-Zhi; Su, Ri-Qi; Huang, Zi-Gang; Wang, Xiao; Wang, Wen-Xu; Grebogi, Celso; Lai, Ying-Cheng

2016-01-01

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control. PMID:27076273

Dynamic Channel Network Extraction from Satellite Imagery of the Jamuna River

NASA Astrophysics Data System (ADS)

Addink, E. A.; Marra, W. A.; Kleinhans, M. G.

2010-12-01

Evolution of the largest rivers on Earth is poorly understood while their response to global change is dramatic, such as severe drought and flooding problems. Rivers with high annual dynamics, like the Jamuna, allow us to study their response to changing conditions. Most remote-sensing work so far focused only on pixel-based analysis of channels and change detection or manual digitisation of channels, which is far from urgently needed quantifiers of pattern and pattern change. Using a series of Landsat TM images taken at irregular intervals showing inter- and intra-annual variation, we demonstrate that braided rivers can be represented as nearly chain-like directional networks. These can be studied with novel methods gleaned from neurology. These networks provide an integral spatial description of the network and should not be confused with hierarchical hydrological stream network descriptions developed in the ’60s to describe drainage basins. The images were first classified into water, bare sediment and vegetation. The contiguous water body of the river was then selected and translated into a network description with bifurcations and confluences at the nodes, and interconnecting channels. Along the entire river the well-known braiding indices were derived from the network. The channel width is a crucial attribute of the channel network as this allows the calculation of bifurcation asymmetry. The width was also used with channel length as weights to all the elements in the network in the calculation of more advanced measures for the nature and evolution of the channel network. The key step here is to describe river network evolution by identifying the same node in multiple subsequent images as well as new and abandoned nodes, in order to distinguish migration of bifurcations from avulsion processes. Once identified through time, the changes in node position and the changes in the connected channels can be quantified. These changes can potentially be linked to

Dynamics of epidemic diseases on a growing adaptive network.

PubMed

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-02-10

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.

Dynamics of epidemic diseases on a growing adaptive network

NASA Astrophysics Data System (ADS)

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-02-01

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.

Dynamic hydro-climatic networks in pristine and regulated rivers

NASA Astrophysics Data System (ADS)

Botter, G.; Basso, S.; Lazzaro, G.; Doulatyari, B.; Biswal, B.; Schirmer, M.; Rinaldo, A.

2014-12-01

Flow patterns observed at-a-station are the dynamical byproduct of a cascade of processes involving different compartments of the hydro-climatic network (e.g., climate, rainfall, soil, vegetation) that regulates the transformation of rainfall into streamflows. In complex branching rivers, flow regimes result from the heterogeneous arrangement around the stream network of multiple hydrologic cascades that simultaneously occur within distinct contributing areas. As such, flow regimes are seen as the integrated output of a complex "network of networks", which can be properly characterized by its degree of temporal variability and spatial heterogeneity. Hydrologic networks that generate river flow regimes are dynamic in nature. In pristine rivers, the time-variance naturally emerges at multiple timescales from climate variability (namely, seasonality and inter-annual fluctuations), implying that the magnitude (and the features) of the water flow between two nodes may be highly variable across different seasons and years. Conversely, the spatial distribution of river flow regimes within pristine rivers involves scale-dependent transport features, as well as regional climatic and soil use gradients, which in small and meso-scale catchments (A < 103 km2) are usually mild enough to guarantee quite uniform flow regimes and high spatial correlations. Human-impacted rivers, instead, constitute hybrid networks where observed spatio-temporal patterns are dominated by anthropogenic shifts, such as landscape alterations and river regulation. In regulated rivers, the magnitude and the features of water flows from node to node may change significantly through time due to damming and withdrawals. However, regulation may impact river regimes in a spatially heterogeneous manner (e.g. in localized river reaches), with a significant decrease of spatial correlations and network connectivity. Provided that the spatial and temporal dynamics of flow regimes in complex rivers may strongly

Identifying causal networks linking cancer processes and anti-tumor immunity using Bayesian network inference and metagene constructs.

PubMed

Kaiser, Jacob L; Bland, Cassidy L; Klinke, David J

2016-03-01

Cancer arises from a deregulation of both intracellular and intercellular networks that maintain system homeostasis. Identifying the architecture of these networks and how they are changed in cancer is a pre-requisite for designing drugs to restore homeostasis. Since intercellular networks only appear in intact systems, it is difficult to identify how these networks become altered in human cancer using many of the common experimental models. To overcome this, we used the diversity in normal and malignant human tissue samples from the Cancer Genome Atlas (TCGA) database of human breast cancer to identify the topology associated with intercellular networks in vivo. To improve the underlying biological signals, we constructed Bayesian networks using metagene constructs, which represented groups of genes that are concomitantly associated with different immune and cancer states. We also used bootstrap resampling to establish the significance associated with the inferred networks. In short, we found opposing relationships between cell proliferation and epithelial-to-mesenchymal transformation (EMT) with regards to macrophage polarization. These results were consistent across multiple carcinomas in that proliferation was associated with a type 1 cell-mediated anti-tumor immune response and EMT was associated with a pro-tumor anti-inflammatory response. To address the identifiability of these networks from other datasets, we could identify the relationship between EMT and macrophage polarization with fewer samples when the Bayesian network was generated from malignant samples alone. However, the relationship between proliferation and macrophage polarization was identified with fewer samples when the samples were taken from a combination of the normal and malignant samples. © 2016 American Institute of Chemical Engineers Biotechnol. Prog., 32:470-479, 2016. © 2016 American Institute of Chemical Engineers.

Impact of constrained rewiring on network structure and node dynamics

NASA Astrophysics Data System (ADS)

Rattana, P.; Berthouze, L.; Kiss, I. Z.

2014-11-01

In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

A Mathematical Model to study the Dynamics of Epithelial Cellular Networks

PubMed Central

Abate, Alessandro; Vincent, Stéphane; Dobbe, Roel; Silletti, Alberto; Master, Neal; Axelrod, Jeffrey D.; Tomlin, Claire J.

2013-01-01

Epithelia are sheets of connected cells that are essential across the animal kingdom. Experimental observations suggest that the dynamical behavior of many single-layered epithelial tissues has strong analogies with that of specific mechanical systems, namely large networks consisting of point masses connected through spring-damper elements and undergoing the influence of active and dissipating forces. Based on this analogy, this work develops a modeling framework to enable the study of the mechanical properties and of the dynamic behavior of large epithelial cellular networks. The model is built first by creating a network topology that is extracted from the actual cellular geometry as obtained from experiments, then by associating a mechanical structure and dynamics to the network via spring-damper elements. This scalable approach enables running simulations of large network dynamics: the derived modeling framework in particular is predisposed to be tailored to study general dynamics (for example, morphogenesis) of various classes of single-layered epithelial cellular networks. In this contribution we test the model on a case study of the dorsal epithelium of the Drosophila melanogaster embryo during early dorsal closure (and, less conspicuously, germband retraction). PMID:23221083

Dynamical state of the network determines the efficacy of single neuron properties in shaping the network activity

PubMed Central

Sahasranamam, Ajith; Vlachos, Ioannis; Aertsen, Ad; Kumar, Arvind

2016-01-01

Spike patterns are among the most common electrophysiological descriptors of neuron types. Surprisingly, it is not clear how the diversity in firing patterns of the neurons in a network affects its activity dynamics. Here, we introduce the state-dependent stochastic bursting neuron model allowing for a change in its firing patterns independent of changes in its input-output firing rate relationship. Using this model, we show that the effect of single neuron spiking on the network dynamics is contingent on the network activity state. While spike bursting can both generate and disrupt oscillations, these patterns are ineffective in large regions of the network state space in changing the network activity qualitatively. Finally, we show that when single-neuron properties are made dependent on the population activity, a hysteresis like dynamics emerges. This novel phenomenon has important implications for determining the network response to time-varying inputs and for the network sensitivity at different operating points. PMID:27212008

Dynamical state of the network determines the efficacy of single neuron properties in shaping the network activity.

PubMed

Sahasranamam, Ajith; Vlachos, Ioannis; Aertsen, Ad; Kumar, Arvind

2016-05-23

Spike patterns are among the most common electrophysiological descriptors of neuron types. Surprisingly, it is not clear how the diversity in firing patterns of the neurons in a network affects its activity dynamics. Here, we introduce the state-dependent stochastic bursting neuron model allowing for a change in its firing patterns independent of changes in its input-output firing rate relationship. Using this model, we show that the effect of single neuron spiking on the network dynamics is contingent on the network activity state. While spike bursting can both generate and disrupt oscillations, these patterns are ineffective in large regions of the network state space in changing the network activity qualitatively. Finally, we show that when single-neuron properties are made dependent on the population activity, a hysteresis like dynamics emerges. This novel phenomenon has important implications for determining the network response to time-varying inputs and for the network sensitivity at different operating points.

A Survey of Geosensor Networks: Advances in Dynamic Environmental Monitoring

PubMed Central

Nittel, Silvia

2009-01-01

In the recent decade, several technology trends have influenced the field of geosciences in significant ways. The first trend is the more readily available technology of ubiquitous wireless communication networks and progress in the development of low-power, short-range radio-based communication networks, the miniaturization of computing and storage platforms as well as the development of novel microsensors and sensor materials. All three trends have changed the type of dynamic environmental phenomena that can be detected, monitored and reacted to. Another important aspect is the real-time data delivery of novel platforms today. In this paper, I will survey the field of geosensor networks, and mainly focus on the technology of small-scale geosensor networks, example applications and their feasibility and lessons learnt as well as the current research questions posed by using this technology today. Furthermore, my objective is to investigate how this technology can be embedded in the current landscape of intelligent sensor platforms in the geosciences and identify its place and purpose. PMID:22346721

Predictive Coding of Dynamical Variables in Balanced Spiking Networks

PubMed Central

Boerlin, Martin; Machens, Christian K.; Denève, Sophie

2013-01-01

Two observations about the cortex have puzzled neuroscientists for a long time. First, neural responses are highly variable. Second, the level of excitation and inhibition received by each neuron is tightly balanced at all times. Here, we demonstrate that both properties are necessary consequences of neural networks that represent information efficiently in their spikes. We illustrate this insight with spiking networks that represent dynamical variables. Our approach is based on two assumptions: We assume that information about dynamical variables can be read out linearly from neural spike trains, and we assume that neurons only fire a spike if that improves the representation of the dynamical variables. Based on these assumptions, we derive a network of leaky integrate-and-fire neurons that is able to implement arbitrary linear dynamical systems. We show that the membrane voltage of the neurons is equivalent to a prediction error about a common population-level signal. Among other things, our approach allows us to construct an integrator network of spiking neurons that is robust against many perturbations. Most importantly, neural variability in our networks cannot be equated to noise. Despite exhibiting the same single unit properties as widely used population code models (e.g. tuning curves, Poisson distributed spike trains), balanced networks are orders of magnitudes more reliable. Our approach suggests that spikes do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly underestimated. PMID:24244113

Dynamic Brain Network Correlates of Spontaneous Fluctuations in Attention.

PubMed

Kucyi, Aaron; Hove, Michael J; Esterman, Michael; Hutchison, R Matthew; Valera, Eve M

2017-03-01

Human attention is intrinsically dynamic, with focus continuously shifting between elements of the external world and internal, self-generated thoughts. Communication within and between large-scale brain networks also fluctuates spontaneously from moment to moment. However, the behavioral relevance of dynamic functional connectivity and possible link with attentional state shifts is unknown. We used a unique approach to examine whether brain network dynamics reflect spontaneous fluctuations in moment-to-moment behavioral variability, a sensitive marker of attentional state. Nineteen healthy adults were instructed to tap their finger every 600 ms while undergoing fMRI. This novel, but simple, approach allowed us to isolate moment-to-moment fluctuations in behavioral variability related to attention, independent of common confounds in cognitive tasks (e.g., stimulus changes, response inhibition). Spontaneously increasing tap variance ("out-of-the-zone" attention) was associated with increasing activation in dorsal-attention and salience network regions, whereas decreasing tap variance ("in-the-zone" attention) was marked by increasing activation of default mode network (DMN) regions. Independent of activation, tap variance representing out-of-the-zone attention was also time-locked to connectivity both within DMN and between DMN and salience network regions. These results provide novel mechanistic data on the understudied neural dynamics of everyday, moment-to-moment attentional fluctuations, elucidating the behavioral importance of spontaneous, transient coupling within and between attention-relevant networks. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

The dynamics of social networks among female Asian elephants

PubMed Central

2011-01-01

Background Patterns in the association of individuals can shed light on the underlying conditions and processes that shape societies. Here we characterize patterns of association in a population of wild Asian Elephants at Uda Walawe National Park in Sri Lanka. We observed 286 individually-identified adult female elephants over 20 months and examined their social dynamics at three levels of organization: pairs of individuals (dyads), small sets of direct companions (ego-networks), and the population level (complete networks). Results Corroborating previous studies of this and other Asian elephant populations, we find that the sizes of elephant groups observed in the field on any particular day are typically small and that rates of association are low. In contrast to earlier studies, our longitudinal observations reveal that individuals form larger social units that can be remarkably stable across years while associations among such units change across seasons. Association rates tend to peak in dry seasons as opposed to wet seasons, with some cyclicity at the level of dyads. In addition, we find that individuals vary substantially in their fidelity to companions. At the ego-network level, we find that despite these fluctuations, individuals associate with a pool of long-term companions. At the population level, social networks do not exhibit any clear seasonal structure or hierarchical stratification. Conclusions This detailed longitudinal study reveals different social dynamics at different levels of organization. Taken together, these results demonstrate that low association rates, seemingly small group sizes, and fission-fusion grouping behavior mask hidden stability in the extensive and fluid social affiliations in this population of Asian elephants. PMID:21794147

Effects of adaptive dynamical linking in networked games

NASA Astrophysics Data System (ADS)

Yang, Zhihu; Li, Zhi; Wu, Te; Wang, Long

2013-10-01

The role of dynamical topologies in the evolution of cooperation has received considerable attention, as some studies have demonstrated that dynamical networks are much better than static networks in terms of boosting cooperation. Here we study a dynamical model of evolution of cooperation on stochastic dynamical networks in which there are no permanent partners to each agent. Whenever a new link is created, its duration is randomly assigned without any bias or preference. We allow the agent to adaptively adjust the duration of each link during the evolution in accordance with the feedback from game interactions. By Monte Carlo simulations, we find that cooperation can be remarkably promoted by this adaptive dynamical linking mechanism both for the game of pairwise interactions, such as the Prisoner's Dilemma game (PDG), and for the game of group interactions, illustrated by the public goods game (PGG). And the faster the adjusting rate, the more successful the evolution of cooperation. We also show that in this context weak selection favors cooperation much more than strong selection does. What is particularly meaningful is that the prosperity of cooperation in this study indicates that the rationality and selfishness of a single agent in adjusting social ties can lead to the progress of altruism of the whole population.

Temporal transcriptional logic of dynamic regulatory networks underlying nitrogen signaling and use in plants.

PubMed

Varala, Kranthi; Marshall-Colón, Amy; Cirrone, Jacopo; Brooks, Matthew D; Pasquino, Angelo V; Léran, Sophie; Mittal, Shipra; Rock, Tara M; Edwards, Molly B; Kim, Grace J; Ruffel, Sandrine; McCombie, W Richard; Shasha, Dennis; Coruzzi, Gloria M

2018-06-19

This study exploits time, the relatively unexplored fourth dimension of gene regulatory networks (GRNs), to learn the temporal transcriptional logic underlying dynamic nitrogen (N) signaling in plants. Our "just-in-time" analysis of time-series transcriptome data uncovered a temporal cascade of cis elements underlying dynamic N signaling. To infer transcription factor (TF)-target edges in a GRN, we applied a time-based machine learning method to 2,174 dynamic N-responsive genes. We experimentally determined a network precision cutoff, using TF-regulated genome-wide targets of three TF hubs (CRF4, SNZ, and CDF1), used to "prune" the network to 155 TFs and 608 targets. This network precision was reconfirmed using genome-wide TF-target regulation data for four additional TFs (TGA1, HHO5/6, and PHL1) not used in network pruning. These higher-confidence edges in the GRN were further filtered by independent TF-target binding data, used to calculate a TF "N-specificity" index. This refined GRN identifies the temporal relationship of known/validated regulators of N signaling (NLP7/8, TGA1/4, NAC4, HRS1, and LBD37/38/39) and 146 additional regulators. Six TFs-CRF4, SNZ, CDF1, HHO5/6, and PHL1-validated herein regulate a significant number of genes in the dynamic N response, targeting 54% of N-uptake/assimilation pathway genes. Phenotypically, inducible overexpression of CRF4 in planta regulates genes resulting in altered biomass, root development, and 15 NO 3 - uptake, specifically under low-N conditions. This dynamic N-signaling GRN now provides the temporal "transcriptional logic" for 155 candidate TFs to improve nitrogen use efficiency with potential agricultural applications. Broadly, these time-based approaches can uncover the temporal transcriptional logic for any biological response system in biology, agriculture, or medicine. Copyright © 2018 the Author(s). Published by PNAS.

Identifying influential spreaders in complex networks based on gravity formula

NASA Astrophysics Data System (ADS)

Ma, Ling-ling; Ma, Chuang; Zhang, Hai-Feng; Wang, Bing-Hong

2016-06-01

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gravity centrality index to identify the influential spreaders in complex networks. The comparison between the gravity centrality index and some well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, and k-shell centrality, and so forth, indicates that our method can effectively identify the influential spreaders in real networks as well as synthetic networks. We also use the classical Susceptible-Infected-Recovered (SIR) epidemic model to verify the good performance of our method.

Dynamic baseline detection method for power data network service

NASA Astrophysics Data System (ADS)

Chen, Wei

2017-08-01

This paper proposes a dynamic baseline Traffic detection Method which is based on the historical traffic data for the Power data network. The method uses Cisco's NetFlow acquisition tool to collect the original historical traffic data from network element at fixed intervals. This method uses three dimensions information including the communication port, time, traffic (number of bytes or number of packets) t. By filtering, removing the deviation value, calculating the dynamic baseline value, comparing the actual value with the baseline value, the method can detect whether the current network traffic is abnormal.

Collective Dynamics in Physical and Social Networks

NASA Astrophysics Data System (ADS)

Isakov, Alexander

We study four systems where individual units come together to display a range of collective behavior. First, we consider a physical system of phase oscillators on a network that expands the Kuramoto model to include oscillator-network interactions and the presence of noise: using a Hebbian-like learning rule, oscillators that synchronize in turn strengthen their connections to each other. We find that the average degree of connectivity strongly affects rates of flipping between aligned and anti-aligned states, and that this result persists to the case of complex networks. Turning to a fully multi-player, multi-strategy evolutionary dynamics model of cooperating bacteria that change who they give resources to and take resources from, we find several regimes that give rise to high levels of collective structure in the resulting networks. In this setting, we also explore the conditions in which an intervention that affects cooperation itself (e.g. "seeding the network with defectors") can lead to wiping out an infection. We find a non-monotonic connection between the percent of disabled cooperation and cure rate, suggesting that in some regimes a limited perturbation can lead to total population collapse. At a larger scale, we study how the locomotor system recovers after amputation in fruit flies. Through experiment and a theoretical model of multi-legged motion controlled by neural oscillators, we find that proprioception plays a role in the ability of flies to control leg forces appropriately to recover from a large initial turning bias induced by the injury. Finally, at the human scale, we consider a social network in a traditional society in Africa to understand how social ties lead to group formation for collective action (stealth raids). We identify critical and distinct roles for both leadership (important for catalyzing a group) and friendship (important for final composition). We conclude with prospects for future work.

Optimal Objective-Based Experimental Design for Uncertain Dynamical Gene Networks with Experimental Error.

PubMed

Mohsenizadeh, Daniel N; Dehghannasiri, Roozbeh; Dougherty, Edward R

2018-01-01

In systems biology, network models are often used to study interactions among cellular components, a salient aim being to develop drugs and therapeutic mechanisms to change the dynamical behavior of the network to avoid undesirable phenotypes. Owing to limited knowledge, model uncertainty is commonplace and network dynamics can be updated in different ways, thereby giving multiple dynamic trajectories, that is, dynamics uncertainty. In this manuscript, we propose an experimental design method that can effectively reduce the dynamics uncertainty and improve performance in an interaction-based network. Both dynamics uncertainty and experimental error are quantified with respect to the modeling objective, herein, therapeutic intervention. The aim of experimental design is to select among a set of candidate experiments the experiment whose outcome, when applied to the network model, maximally reduces the dynamics uncertainty pertinent to the intervention objective.

VCP-dependent muscle degeneration is linked to defects in a dynamic tubular lysosomal network in vivo

PubMed Central

Johnson, Alyssa E; Shu, Huidy; Hauswirth, Anna G; Tong, Amy; Davis, Graeme W

2015-01-01

Lysosomes are classically viewed as vesicular structures to which cargos are delivered for degradation. Here, we identify a network of dynamic, tubular lysosomes that extends throughout Drosophila muscle, in vivo. Live imaging reveals that autophagosomes merge with tubular lysosomes and that lysosomal membranes undergo extension, retraction, fusion and fission. The dynamics and integrity of this tubular lysosomal network requires VCP, an AAA-ATPase that, when mutated, causes degenerative diseases of muscle, bone and neurons. We show that human VCP rescues the defects caused by loss of Drosophila VCP and overexpression of disease relevant VCP transgenes dismantles tubular lysosomes, linking tubular lysosome dysfunction to human VCP-related diseases. Finally, disruption of tubular lysosomes correlates with impaired autophagosome-lysosome fusion, increased cytoplasmic poly-ubiquitin aggregates, lipofuscin material, damaged mitochondria and impaired muscle function. We propose that VCP sustains sarcoplasmic proteostasis, in part, by controlling the integrity of a dynamic tubular lysosomal network. DOI: http://dx.doi.org/10.7554/eLife.07366.001 PMID:26167652

Mouse Social Network Dynamics and Community Structure are Associated with Plasticity-Related Brain Gene Expression

PubMed Central

Williamson, Cait M.; Franks, Becca; Curley, James P.

2016-01-01

Laboratory studies of social behavior have typically focused on dyadic interactions occurring within a limited spatiotemporal context. However, this strategy prevents analyses of the dynamics of group social behavior and constrains identification of the biological pathways mediating individual differences in behavior. In the current study, we aimed to identify the spatiotemporal dynamics and hierarchical organization of a large social network of male mice. We also sought to determine if standard assays of social and exploratory behavior are predictive of social behavior in this social network and whether individual network position was associated with the mRNA expression of two plasticity-related genes, DNA methyltransferase 1 and 3a. Mice were observed to form a hierarchically organized social network and self-organized into two separate social network communities. Members of both communities exhibited distinct patterns of socio-spatial organization within the vivaria that was not limited to only agonistic interactions. We further established that exploratory and social behaviors in standard behavioral assays conducted prior to placing the mice into the large group was predictive of initial network position and behavior but were not associated with final social network position. Finally, we determined that social network position is associated with variation in mRNA levels of two neural plasticity genes, DNMT1 and DNMT3a, in the hippocampus but not the mPOA. This work demonstrates the importance of understanding the role of social context and complex social dynamics in determining the relationship between individual differences in social behavior and brain gene expression. PMID:27540359

Hydrodynamically induced oscillations and traffic dynamics in 1D microfludic networks

NASA Astrophysics Data System (ADS)

Bartolo, Denis; Jeanneret, Raphael

2011-03-01

We report on the traffic dynamics of particles driven through a minimal microfluidic network. Even in the minimal network consisting in a single loop, the traffic dynamics has proven to yield complex temporal patterns, including periodic, multi-periodic or chaotic sequences. This complex dynamics arises from the strongly nonlinear hydrodynamic interactions between the particles, that takes place at a junction. To better understand the consequences of this nontrivial coupling, we combined theoretical, numerical and experimental efforts and solved the 3-body problem in a 1D loop network. This apparently simple dynamical system revealed a rich and unexpected dynamics, including coherent spontaneous oscillations along closed orbits. Striking similarities between Hamiltonian systems and this driven dissipative system will be explained.

Dynamics of epidemic diseases on a growing adaptive network

PubMed Central

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-01-01

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists. PMID:28186146

Dynamics of comb-of-comb-network polymers in random layered flows

NASA Astrophysics Data System (ADS)

Katyal, Divya; Kant, Rama

2016-12-01

We analyze the dynamics of comb-of-comb-network polymers in the presence of external random flows. The dynamics of such structures is evaluated through relevant physical quantities, viz., average square displacement (ASD) and the velocity autocorrelation function (VACF). We focus on comparing the dynamics of the comb-of-comb network with the linear polymer. The present work displays an anomalous diffusive behavior of this flexible network in the random layered flows. The effect of the polymer topology on the dynamics is analyzed by varying the number of generations and branch lengths in these networks. In addition, we investigate the influence of external flow on the dynamics by varying flow parameters, like the flow exponent α and flow strength Wα. Our analysis highlights two anomalous power-law regimes, viz., subdiffusive (intermediate-time polymer stretching and flow-induced diffusion) and superdiffusive (long-time flow-induced diffusion). The anomalous long-time dynamics is governed by the temporal exponent ν of ASD, viz., ν =2 -α /2 . Compared to a linear polymer, the comb-of-comb network shows a shorter crossover time (from the subdiffusive to superdiffusive regime) but a reduced magnitude of ASD. Our theory displays an anomalous VACF in the random layered flows that scales as t-α /2. We show that the network with greater total mass moves faster.

Dynamics of Opinion Forming in Structurally Balanced Social Networks

PubMed Central

Altafini, Claudio

2012-01-01

A structurally balanced social network is a social community that splits into two antagonistic factions (typical example being a two-party political system). The process of opinion forming on such a community is most often highly predictable, with polarized opinions reflecting the bipartition of the network. The aim of this paper is to suggest a class of dynamical systems, called monotone systems, as natural models for the dynamics of opinion forming on structurally balanced social networks. The high predictability of the outcome of a decision process is explained in terms of the order-preserving character of the solutions of this class of dynamical systems. If we represent a social network as a signed graph in which individuals are the nodes and the signs of the edges represent friendly or hostile relationships, then the property of structural balance corresponds to the social community being splittable into two antagonistic factions, each containing only friends. PMID:22761667

Applying differential dynamic logic to reconfigurable biological networks.

PubMed

Figueiredo, Daniel; Martins, Manuel A; Chaves, Madalena

2017-09-01

Qualitative and quantitative modeling frameworks are widely used for analysis of biological regulatory networks, the former giving a preliminary overview of the system's global dynamics and the latter providing more detailed solutions. Another approach is to model biological regulatory networks as hybrid systems, i.e., systems which can display both continuous and discrete dynamic behaviors. Actually, the development of synthetic biology has shown that this is a suitable way to think about biological systems, which can often be constructed as networks with discrete controllers, and present hybrid behaviors. In this paper we discuss this approach as a special case of the reconfigurability paradigm, well studied in Computer Science (CS). In CS there are well developed computational tools to reason about hybrid systems. We argue that it is worth applying such tools in a biological context. One interesting tool is differential dynamic logic (dL), which has recently been developed by Platzer and applied to many case-studies. In this paper we discuss some simple examples of biological regulatory networks to illustrate how dL can be used as an alternative, or also as a complement to methods already used. Copyright © 2017 Elsevier Inc. All rights reserved.

Strategic tradeoffs in competitor dynamics on adaptive networks.

PubMed

Hébert-Dufresne, Laurent; Allard, Antoine; Noël, Pierre-André; Young, Jean-Gabriel; Libby, Eric

2017-08-08

Recent empirical work highlights the heterogeneity of social competitions such as political campaigns: proponents of some ideologies seek debate and conversation, others create echo chambers. While symmetric and static network structure is typically used as a substrate to study such competitor dynamics, network structure can instead be interpreted as a signature of the competitor strategies, yielding competition dynamics on adaptive networks. Here we demonstrate that tradeoffs between aggressiveness and defensiveness (i.e., targeting adversaries vs. targeting like-minded individuals) creates paradoxical behaviour such as non-transitive dynamics. And while there is an optimal strategy in a two competitor system, three competitor systems have no such solution; the introduction of extreme strategies can easily affect the outcome of a competition, even if the extreme strategies have no chance of winning. Not only are these results reminiscent of classic paradoxical results from evolutionary game theory, but the structure of social networks created by our model can be mapped to particular forms of payoff matrices. Consequently, social structure can act as a measurable metric for social games which in turn allows us to provide a game theoretical perspective on online political debates.

Introduction of digital object identifiers (DOI) for seismic networks

NASA Astrophysics Data System (ADS)

Evans, Peter; Strollo, Angelo; Clark, Adam; Ahern, Tim; Newman, Rob; Clinton, John; Pequegnat, Catherine; Pedersen, Helle

2015-04-01

Proper attribution for scientific source data is important in promoting transparency and recognising the role of data providers in science. Data sets such as those produced by seismic networks now need to be citable and permanently locatable for research users. Recently the EIDA and IRIS-DMC communities have worked together on development of methods for generation, maintenance and promotion of persistent identifiers for seismic networks. This resulted in a 2014 Recommendation by the International Federation of Digital Seismograph Networks (FDSN) on the use of Digital Object Identifiers (DOI) for seismic networks. These can be cited equivalently to scientific papers, and tools such as DataCite allow the tracking of citations to these datasets. The GEOFON, IRIS and RESIF data centres have now begun to roll-out of these seismic network DOIs. This has involved working with principal investigators to prepare metadata consistent with the FDSN recommendation, preparation of landing pages, and changes to the web sites to promote DOIs where available. This has involved preparing improved descriptions of the data (metadata) and clarifying how individuals and institutions should best be recognised for their contributions to making the data available. We illustrate this process for a few representative networks. We will be in contact with additional network operators to help them establish DOIs for their networks in future.

Boolean dynamics of genetic regulatory networks inferred from microarray time series data

DOE PAGES

Martin, Shawn; Zhang, Zhaoduo; Martino, Anthony; ...

2007-01-31

Methods available for the inference of genetic regulatory networks strive to produce a single network, usually by optimizing some quantity to fit the experimental observations. In this paper we investigate the possibility that multiple networks can be inferred, all resulting in similar dynamics. This idea is motivated by theoretical work which suggests that biological networks are robust and adaptable to change, and that the overall behavior of a genetic regulatory network might be captured in terms of dynamical basins of attraction. We have developed and implemented a method for inferring genetic regulatory networks for time series microarray data. Our methodmore » first clusters and discretizes the gene expression data using k-means and support vector regression. We then enumerate Boolean activation–inhibition networks to match the discretized data. In conclusion, the dynamics of the Boolean networks are examined. We have tested our method on two immunology microarray datasets: an IL-2-stimulated T cell response dataset and a LPS-stimulated macrophage response dataset. In both cases, we discovered that many networks matched the data, and that most of these networks had similar dynamics.« less

Design of multi-phase dynamic chemical networks

NASA Astrophysics Data System (ADS)

Chen, Chenrui; Tan, Junjun; Hsieh, Ming-Chien; Pan, Ting; Goodwin, Jay T.; Mehta, Anil K.; Grover, Martha A.; Lynn, David G.

2017-08-01

Template-directed polymerization reactions enable the accurate storage and processing of nature's biopolymer information. This mutualistic relationship of nucleic acids and proteins, a network known as life's central dogma, is now marvellously complex, and the progressive steps necessary for creating the initial sequence and chain-length-specific polymer templates are lost to time. Here we design and construct dynamic polymerization networks that exploit metastable prion cross-β phases. Mixed-phase environments have been used for constructing synthetic polymers, but these dynamic phases emerge naturally from the growing peptide oligomers and create environments suitable both to nucleate assembly and select for ordered templates. The resulting templates direct the amplification of a phase containing only chain-length-specific peptide-like oligomers. Such multi-phase biopolymer dynamics reveal pathways for the emergence, self-selection and amplification of chain-length- and possibly sequence-specific biopolymers.

Antagonistic Phenomena in Network Dynamics

NASA Astrophysics Data System (ADS)

Motter, Adilson E.; Timme, Marc

2018-03-01

Recent research on the network modeling of complex systems has led to a convenient representation of numerous natural, social, and engineered systems that are now recognized as networks of interacting parts. Such systems can exhibit a wealth of phenomena that not only cannot be anticipated from merely examining their parts, as per the textbook definition of complexity, but also challenge intuition even when considered in the context of what is now known in network science. Here, we review the recent literature on two major classes of such phenomena that have far-reaching implications: (a) antagonistic responses to changes of states or parameters and (b) coexistence of seemingly incongruous behaviors or properties - both deriving from the collective and inherently decentralized nature of the dynamics. They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring across transport and supply networks. They also include remote synchronization, chimera states, and the converse of symmetry breaking in brain, power-grid, and oscillator networks as well as remote control in biological and bioinspired systems. By offering a unified view of these various scenarios, we suggest that they are representative of a yet broader class of unprecedented network phenomena that ought to be revealed and explained by future research.

Dynamic Processes in Network Goods: Modeling, Analysis and Applications

ERIC Educational Resources Information Center

Paothong, Arnut

2013-01-01

The network externality function plays a very important role in the study of economic network industries. Moreover, the consumer group dynamic interactions coupled with network externality concept is going to play a dominant role in the network goods in the 21st century. The existing literature is stemmed on a choice of externality function with…

Infraslow Electroencephalographic and Dynamic Resting State Network Activity

PubMed Central

Grooms, Joshua K.; Thompson, Garth J.; Pan, Wen-Ju; Billings, Jacob; Schumacher, Eric H.; Epstein, Charles M.

2017-01-01

Abstract A number of studies have linked the blood oxygenation level dependent (BOLD) signal to electroencephalographic (EEG) signals in traditional frequency bands (δ, θ, α, β, and γ), but the relationship between BOLD and its direct frequency correlates in the infraslow band (<1 Hz) has been little studied. Previously, work in rodents showed that infraslow local field potentials play a role in functional connectivity, particularly in the dynamic organization of large-scale networks. To examine the relationship between infraslow activity and network dynamics in humans, direct current (DC) EEG and resting state magnetic resonance imaging data were acquired simultaneously. The DC EEG signals were correlated with the BOLD signal in patterns that resembled resting state networks. Subsequent dynamic analysis showed that the correlation between DC EEG and the BOLD signal varied substantially over time, even within individual subjects. The variation in DC EEG appears to reflect the time-varying contribution of different resting state networks. Furthermore, some of the patterns of DC EEG and BOLD correlation are consistent with previous work demonstrating quasiperiodic spatiotemporal patterns of large-scale network activity in resting state. These findings demonstrate that infraslow electrical activity is linked to BOLD fluctuations in humans and that it may provide a basis for large-scale organization comparable to that observed in animal studies. PMID:28462586

Dynamic Neural Networks Supporting Memory Retrieval

PubMed Central

St. Jacques, Peggy L.; Kragel, Philip A.; Rubin, David C.

2011-01-01

How do separate neural networks interact to support complex cognitive processes such as remembrance of the personal past? Autobiographical memory (AM) retrieval recruits a consistent pattern of activation that potentially comprises multiple neural networks. However, it is unclear how such large-scale neural networks interact and are modulated by properties of the memory retrieval process. In the present functional MRI (fMRI) study, we combined independent component analysis (ICA) and dynamic causal modeling (DCM) to understand the neural networks supporting AM retrieval. ICA revealed four task-related components consistent with the previous literature: 1) Medial Prefrontal Cortex (PFC) Network, associated with self-referential processes, 2) Medial Temporal Lobe (MTL) Network, associated with memory, 3) Frontoparietal Network, associated with strategic search, and 4) Cingulooperculum Network, associated with goal maintenance. DCM analysis revealed that the medial PFC network drove activation within the system, consistent with the importance of this network to AM retrieval. Additionally, memory accessibility and recollection uniquely altered connectivity between these neural networks. Recollection modulated the influence of the medial PFC on the MTL network during elaboration, suggesting that greater connectivity among subsystems of the default network supports greater re-experience. In contrast, memory accessibility modulated the influence of frontoparietal and MTL networks on the medial PFC network, suggesting that ease of retrieval involves greater fluency among the multiple networks contributing to AM. These results show the integration between neural networks supporting AM retrieval and the modulation of network connectivity by behavior. PMID:21550407

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.

Social Insects: A Model System for Network Dynamics

NASA Astrophysics Data System (ADS)

Charbonneau, Daniel; Blonder, Benjamin; Dornhaus, Anna

Social insect colonies (ants, bees, wasps, and termites) show sophisticated collective problem-solving in the face of variable constraints. Individuals exchange information and materials such as food. The resulting network structure and dynamics can inform us about the mechanisms by which the insects achieve particular collective behaviors and these can be transposed to man-made and social networks. We discuss how network analysis can answer important questions about social insects, such as how effective task allocation or information flow is realized. We put forward the idea that network analysis methods are under-utilized in social insect research, and that they can provide novel ways to view the complexity of collective behavior, particularly if network dynamics are taken into account. To illustrate this, we present an example of network tasks performed by ant workers, linked by instances of workers switching from one task to another. We show how temporal network analysis can propose and test new hypotheses on mechanisms of task allocation, and how adding temporal elements to static networks can drastically change results. We discuss the benefits of using social insects as models for complex systems in general. There are multiple opportunities emergent technologies and analysis methods in facilitating research on social insect network. The potential for interdisciplinary work could significantly advance diverse fields such as behavioral ecology, computer sciences, and engineering.

Identifying Functional Mechanisms of Gene and Protein Regulatory Networks in Response to a Broader Range of Environmental Stresses

PubMed Central

Li, Cheng-Wei; Chen, Bor-Sen

2010-01-01

Cellular responses to sudden environmental stresses or physiological changes provide living organisms with the opportunity for final survival and further development. Therefore, it is an important topic to understand protective mechanisms against environmental stresses from the viewpoint of gene and protein networks. We propose two coupled nonlinear stochastic dynamic models to reconstruct stress-activated gene and protein regulatory networks via microarray data in response to environmental stresses. According to the reconstructed gene/protein networks, some possible mutual interactions, feedforward and feedback loops are found for accelerating response and filtering noises in these signaling pathways. A bow-tie core network is also identified to coordinate mutual interactions and feedforward loops, feedback inhibitions, feedback activations, and cross talks to cope efficiently with a broader range of environmental stresses with limited proteins and pathways. PMID:20454442

Probing Molecular Mechanisms of the Hsp90 Chaperone: Biophysical Modeling Identifies Key Regulators of Functional Dynamics

PubMed Central

Dixit, Anshuman; Verkhivker, Gennady M.

2012-01-01

Deciphering functional mechanisms of the Hsp90 chaperone machinery is an important objective in cancer biology aiming to facilitate discovery of targeted anti-cancer therapies. Despite significant advances in understanding structure and function of molecular chaperones, organizing molecular principles that control the relationship between conformational diversity and functional mechanisms of the Hsp90 activity lack a sufficient quantitative characterization. We combined molecular dynamics simulations, principal component analysis, the energy landscape model and structure-functional analysis of Hsp90 regulatory interactions to systematically investigate functional dynamics of the molecular chaperone. This approach has identified a network of conserved regions common to the Hsp90 chaperones that could play a universal role in coordinating functional dynamics, principal collective motions and allosteric signaling of Hsp90. We have found that these functional motifs may be utilized by the molecular chaperone machinery to act collectively as central regulators of Hsp90 dynamics and activity, including the inter-domain communications, control of ATP hydrolysis, and protein client binding. These findings have provided support to a long-standing assertion that allosteric regulation and catalysis may have emerged via common evolutionary routes. The interaction networks regulating functional motions of Hsp90 may be determined by the inherent structural architecture of the molecular chaperone. At the same time, the thermodynamics-based “conformational selection” of functional states is likely to be activated based on the nature of the binding partner. This mechanistic model of Hsp90 dynamics and function is consistent with the notion that allosteric networks orchestrating cooperative protein motions can be formed by evolutionary conserved and sparsely connected residue clusters. Hence, allosteric signaling through a small network of distantly connected residue clusters

On the number of different dynamics in Boolean networks with deterministic update schedules.

PubMed

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Mateos, José L.

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

Spontaneous scale-free structure in adaptive networks with synchronously dynamical linking

NASA Astrophysics Data System (ADS)

Yuan, Wu-Jie; Zhou, Jian-Fang; Li, Qun; Chen, De-Bao; Wang, Zhen

2013-08-01

Inspired by the anti-Hebbian learning rule in neural systems, we study how the feedback from dynamical synchronization shapes network structure by adding new links. Through extensive numerical simulations, we find that an adaptive network spontaneously forms scale-free structure, as confirmed in many real systems. Moreover, the adaptive process produces two nontrivial power-law behaviors of deviation strength from mean activity of the network and negative degree correlation, which exists widely in technological and biological networks. Importantly, these scalings are robust to variation of the adaptive network parameters, which may have meaningful implications in the scale-free formation and manipulation of dynamical networks. Our study thus suggests an alternative adaptive mechanism for the formation of scale-free structure with negative degree correlation, which means that nodes of high degree tend to connect, on average, with others of low degree and vice versa. The relevance of the results to structure formation and dynamical property in neural networks is briefly discussed as well.

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport.

PubMed

Riascos, A P; Mateos, José L

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

Data modeling of network dynamics

NASA Astrophysics Data System (ADS)

Jaenisch, Holger M.; Handley, James W.; Faucheux, Jeffery P.; Harris, Brad

2004-01-01

This paper highlights Data Modeling theory and its use for text data mining as a graphical network search engine. Data Modeling is then used to create a real-time filter capable of monitoring network traffic down to the port level for unusual dynamics and changes in business as usual. This is accomplished in an unsupervised fashion without a priori knowledge of abnormal characteristics. Two novel methods for converting streaming binary data into a form amenable to graphics based search and change detection are introduced. These techniques are then successfully applied to 1999 KDD Cup network attack data log-on sessions to demonstrate that Data Modeling can detect attacks without prior training on any form of attack behavior. Finally, two new methods for data encryption using these ideas are proposed.

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.

Dynamic burstiness of word-occurrence and network modularity in textbook systems

NASA Astrophysics Data System (ADS)

Cui, Xue-Mei; Yoon, Chang No; Youn, Hyejin; Lee, Sang Hoon; Jung, Jean S.; Han, Seung Kee

2017-12-01

We show that the dynamic burstiness of word occurrence in textbook systems is attributed to the modularity of the word association networks. At first, a measure of dynamic burstiness is introduced to quantify burstiness of word occurrence in a textbook. The advantage of this measure is that the dynamic burstiness is decomposable into two contributions: one coming from the inter-event variance and the other from the memory effects. Comparing network structures of physics textbook systems with those of surrogate random textbooks without the memory or variance effects are absent, we show that the network modularity increases systematically with the dynamic burstiness. The intra-connectivity of individual word representing the strength of a tie with which a node is bound to a module accordingly increases with the dynamic burstiness, suggesting individual words with high burstiness are strongly bound to one module. Based on the frequency and dynamic burstiness, physics terminology is classified into four categories: fundamental words, topical words, special words, and common words. In addition, we test the correlation between the dynamic burstiness of word occurrence and network modularity using a two-state model of burst generation.

Identifying influential nodes in complex networks: A node information dimension approach

NASA Astrophysics Data System (ADS)

Bian, Tian; Deng, Yong

2018-04-01

In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method.

Dynamic Transcription Factor Networks in Epithelial-Mesenchymal Transition in Breast Cancer Models

PubMed Central

Siletz, Anaar; Schnabel, Michael; Kniazeva, Ekaterina; Schumacher, Andrew J.; Shin, Seungjin; Jeruss, Jacqueline S.; Shea, Lonnie D.

2013-01-01

The epithelial-mesenchymal transition (EMT) is a complex change in cell differentiation that allows breast carcinoma cells to acquire invasive properties. EMT involves a cascade of regulatory changes that destabilize the epithelial phenotype and allow mesenchymal features to manifest. As transcription factors (TFs) are upstream effectors of the genome-wide expression changes that result in phenotypic change, understanding the sequential changes in TF activity during EMT provides rich information on the mechanism of this process. Because molecular interactions will vary as cells progress from an epithelial to a mesenchymal differentiation program, dynamic networks are needed to capture the changing context of molecular processes. In this study we applied an emerging high-throughput, dynamic TF activity array to define TF activity network changes in three cell-based models of EMT in breast cancer based on HMLE Twist ER and MCF-7 mammary epithelial cells. The TF array distinguished conserved from model-specific TF activity changes in the three models. Time-dependent data was used to identify pairs of TF activities with significant positive or negative correlation, indicative of interdependent TF activity throughout the six-day study period. Dynamic TF activity patterns were clustered into groups of TFs that change along a time course of gene expression changes and acquisition of invasive capacity. Time-dependent TF activity data was combined with prior knowledge of TF interactions to construct dynamic models of TF activity networks as epithelial cells acquire invasive characteristics. These analyses show EMT from a unique and targetable vantage and may ultimately contribute to diagnosis and therapy. PMID:23593114

Dynamic transcription factor networks in epithelial-mesenchymal transition in breast cancer models.

PubMed

Siletz, Anaar; Schnabel, Michael; Kniazeva, Ekaterina; Schumacher, Andrew J; Shin, Seungjin; Jeruss, Jacqueline S; Shea, Lonnie D

2013-01-01

The epithelial-mesenchymal transition (EMT) is a complex change in cell differentiation that allows breast carcinoma cells to acquire invasive properties. EMT involves a cascade of regulatory changes that destabilize the epithelial phenotype and allow mesenchymal features to manifest. As transcription factors (TFs) are upstream effectors of the genome-wide expression changes that result in phenotypic change, understanding the sequential changes in TF activity during EMT provides rich information on the mechanism of this process. Because molecular interactions will vary as cells progress from an epithelial to a mesenchymal differentiation program, dynamic networks are needed to capture the changing context of molecular processes. In this study we applied an emerging high-throughput, dynamic TF activity array to define TF activity network changes in three cell-based models of EMT in breast cancer based on HMLE Twist ER and MCF-7 mammary epithelial cells. The TF array distinguished conserved from model-specific TF activity changes in the three models. Time-dependent data was used to identify pairs of TF activities with significant positive or negative correlation, indicative of interdependent TF activity throughout the six-day study period. Dynamic TF activity patterns were clustered into groups of TFs that change along a time course of gene expression changes and acquisition of invasive capacity. Time-dependent TF activity data was combined with prior knowledge of TF interactions to construct dynamic models of TF activity networks as epithelial cells acquire invasive characteristics. These analyses show EMT from a unique and targetable vantage and may ultimately contribute to diagnosis and therapy.

Hydration dynamics of a lipid membrane: Hydrogen bond networks and lipid-lipid associations

NASA Astrophysics Data System (ADS)

Srivastava, Abhinav; Debnath, Ananya

2018-03-01

Dynamics of hydration layers of a dimyristoylphosphatidylcholine (DMPC) bilayer are investigated using an all atom molecular dynamics simulation. Based upon the geometric criteria, continuously residing interface water molecules which form hydrogen bonds solely among themselves and then concertedly hydrogen bonded to carbonyl, phosphate, and glycerol head groups of DMPC are identified. The interface water hydrogen bonded to lipids shows slower relaxation rates for translational and rotational dynamics compared to that of the bulk water and is found to follow sub-diffusive and non-diffusive behaviors, respectively. The mean square displacements and the reorientational auto-correlation functions are slowest for the interfacial waters hydrogen bonded to the carbonyl oxygen since these are buried deep in the hydrophobic core among all interfacial water studied. The intermittent hydrogen bond auto-correlation functions are calculated, which allows breaking and reformations of the hydrogen bonds. The auto-correlation functions for interfacial hydrogen bonded networks develop humps during a transition from cage-like motion to eventual power law behavior of t-3/2. The asymptotic t-3/2 behavior indicates translational diffusion dictated dynamics during hydrogen bond breaking and formation irrespective of the nature of the chemical confinement. Employing reactive flux correlation analysis, the forward rate constant of hydrogen bond breaking and formation is calculated which is used to obtain Gibbs energy of activation of the hydrogen bond breaking. The relaxation rates of the networks buried in the hydrophobic core are slower than the networks near the lipid-water interface which is again slower than bulk due to the higher Gibbs energy of activation. Since hydrogen bond breakage follows a translational diffusion dictated mechanism, chemically confined hydrogen bond networks need an activation energy to diffuse through water depleted hydrophobic environments. Our calculations

Scalable persistent identifier systems for dynamic datasets

NASA Astrophysics Data System (ADS)

Golodoniuc, P.; Cox, S. J. D.; Klump, J. F.

2016-12-01

Reliable and persistent identification of objects, whether tangible or not, is essential in information management. Many Internet-based systems have been developed to identify digital data objects, e.g., PURL, LSID, Handle, ARK. These were largely designed for identification of static digital objects. The amount of data made available online has grown exponentially over the last two decades and fine-grained identification of dynamically generated data objects within large datasets using conventional systems (e.g., PURL) has become impractical. We have compared capabilities of various technological solutions to enable resolvability of data objects in dynamic datasets, and developed a dataset-centric approach to resolution of identifiers. This is particularly important in Semantic Linked Data environments where dynamic frequently changing data is delivered live via web services, so registration of individual data objects to obtain identifiers is impractical. We use identifier patterns and pattern hierarchies for identification of data objects, which allows relationships between identifiers to be expressed, and also provides means for resolving a single identifier into multiple forms (i.e. views or representations of an object). The latter can be implemented through (a) HTTP content negotiation, or (b) use of URI querystring parameters. The pattern and hierarchy approach has been implemented in the Linked Data API supporting the United Nations Spatial Data Infrastructure (UNSDI) initiative and later in the implementation of geoscientific data delivery for the Capricorn Distal Footprints project using International Geo Sample Numbers (IGSN). This enables flexible resolution of multi-view persistent identifiers and provides a scalable solution for large heterogeneous datasets.

Finite-time consensus for controlled dynamical systems in network

NASA Astrophysics Data System (ADS)

Zoghlami, Naim; Mlayeh, Rhouma; Beji, Lotfi; Abichou, Azgal

2018-04-01

The key challenges in networked dynamical systems are the component heterogeneities, nonlinearities, and the high dimension of the formulated vector of state variables. In this paper, the emphasise is put on two classes of systems in network include most controlled driftless systems as well as systems with drift. For each model structure that defines homogeneous and heterogeneous multi-system behaviour, we derive protocols leading to finite-time consensus. For each model evolving in networks forming a homogeneous or heterogeneous multi-system, protocols integrating sufficient conditions are derived leading to finite-time consensus. Likewise, for the networking topology, we make use of fixed directed and undirected graphs. To prove our approaches, finite-time stability theory and Lyapunov methods are considered. As illustrative examples, the homogeneous multi-unicycle kinematics and the homogeneous/heterogeneous multi-second order dynamics in networks are studied.

Distal gap junctions and active dendrites can tune network dynamics.

PubMed

Saraga, Fernanda; Ng, Leo; Skinner, Frances K

2006-03-01

Gap junctions allow direct electrical communication between CNS neurons. From theoretical and modeling studies, it is well known that although gap junctions can act to synchronize network output, they can also give rise to many other dynamic patterns including antiphase and other phase-locked states. The particular network pattern that arises depends on cellular, intrinsic properties that affect firing frequencies as well as the strength and location of the gap junctions. Interneurons or GABAergic neurons in hippocampus are diverse in their cellular characteristics and have been shown to have active dendrites. Furthermore, parvalbumin-positive GABAergic neurons, also known as basket cells, can contact one another via gap junctions on their distal dendrites. Using two-cell network models, we explore how distal electrical connections affect network output. We build multi-compartment models of hippocampal basket cells using NEURON and endow them with varying amounts of active dendrites. Two-cell networks of these model cells as well as reduced versions are explored. The relationship between intrinsic frequency and the level of active dendrites allows us to define three regions based on what sort of network dynamics occur with distal gap junction coupling. Weak coupling theory is used to predict the delineation of these regions as well as examination of phase response curves and distal dendritic polarization levels. We find that a nonmonotonic dependence of network dynamic characteristics (phase lags) on gap junction conductance occurs. This suggests that distal electrical coupling and active dendrite levels can control how sensitive network dynamics are to gap junction modulation. With the extended geometry, gap junctions located at more distal locations must have larger conductances for pure synchrony to occur. Furthermore, based on simulations with heterogeneous networks, it may be that one requires active dendrites if phase-locking is to occur in networks formed

Steering operational synergies in terrestrial observation networks: opportunity for advancing Earth system dynamics modelling

NASA Astrophysics Data System (ADS)

Baatz, Roland; Sullivan, Pamela L.; Li, Li; Weintraub, Samantha R.; Loescher, Henry W.; Mirtl, Michael; Groffman, Peter M.; Wall, Diana H.; Young, Michael; White, Tim; Wen, Hang; Zacharias, Steffen; Kühn, Ingolf; Tang, Jianwu; Gaillardet, Jérôme; Braud, Isabelle; Flores, Alejandro N.; Kumar, Praveen; Lin, Henry; Ghezzehei, Teamrat; Jones, Julia; Gholz, Henry L.; Vereecken, Harry; Van Looy, Kris

2018-05-01

Advancing our understanding of Earth system dynamics (ESD) depends on the development of models and other analytical tools that apply physical, biological, and chemical data. This ambition to increase understanding and develop models of ESD based on site observations was the stimulus for creating the networks of Long-Term Ecological Research (LTER), Critical Zone Observatories (CZOs), and others. We organized a survey, the results of which identified pressing gaps in data availability from these networks, in particular for the future development and evaluation of models that represent ESD processes, and provide insights for improvement in both data collection and model integration. From this survey overview of data applications in the context of LTER and CZO research, we identified three challenges: (1) widen application of terrestrial observation network data in Earth system modelling, (2) develop integrated Earth system models that incorporate process representation and data of multiple disciplines, and (3) identify complementarity in measured variables and spatial extent, and promoting synergies in the existing observational networks. These challenges lead to perspectives and recommendations for an improved dialogue between the observation networks and the ESD modelling community, including co-location of sites in the existing networks and further formalizing these recommendations among these communities. Developing these synergies will enable cross-site and cross-network comparison and synthesis studies, which will help produce insights around organizing principles, classifications, and general rules of coupling processes with environmental conditions.

Stochastic Simulation of Biomolecular Networks in Dynamic Environments

PubMed Central

Voliotis, Margaritis; Thomas, Philipp; Grima, Ramon; Bowsher, Clive G.

2016-01-01

Simulation of biomolecular networks is now indispensable for studying biological systems, from small reaction networks to large ensembles of cells. Here we present a novel approach for stochastic simulation of networks embedded in the dynamic environment of the cell and its surroundings. We thus sample trajectories of the stochastic process described by the chemical master equation with time-varying propensities. A comparative analysis shows that existing approaches can either fail dramatically, or else can impose impractical computational burdens due to numerical integration of reaction propensities, especially when cell ensembles are studied. Here we introduce the Extrande method which, given a simulated time course of dynamic network inputs, provides a conditionally exact and several orders-of-magnitude faster simulation solution. The new approach makes it feasible to demonstrate—using decision-making by a large population of quorum sensing bacteria—that robustness to fluctuations from upstream signaling places strong constraints on the design of networks determining cell fate. Our approach has the potential to significantly advance both understanding of molecular systems biology and design of synthetic circuits. PMID:27248512

Vehicle dynamic analysis using neuronal network algorithms

NASA Astrophysics Data System (ADS)

Oloeriu, Florin; Mocian, Oana

2014-06-01

Theoretical developments of certain engineering areas, the emergence of new investigation tools, which are better and more precise and their implementation on-board the everyday vehicles, all these represent main influence factors that impact the theoretical and experimental study of vehicle's dynamic behavior. Once the implementation of these new technologies onto the vehicle's construction had been achieved, it had led to more and more complex systems. Some of the most important, such as the electronic control of engine, transmission, suspension, steering, braking and traction had a positive impact onto the vehicle's dynamic behavior. The existence of CPU on-board vehicles allows data acquisition and storage and it leads to a more accurate and better experimental and theoretical study of vehicle dynamics. It uses the information offered directly by the already on-board built-in elements of electronic control systems. The technical literature that studies vehicle dynamics is entirely focused onto parametric analysis. This kind of approach adopts two simplifying assumptions. Functional parameters obey certain distribution laws, which are known in classical statistics theory. The second assumption states that the mathematical models are previously known and have coefficients that are not time-dependent. Both the mentioned assumptions are not confirmed in real situations: the functional parameters do not follow any known statistical repartition laws and the mathematical laws aren't previously known and contain families of parameters and are mostly time-dependent. The purpose of the paper is to present a more accurate analysis methodology that can be applied when studying vehicle's dynamic behavior. A method that provides the setting of non-parametrical mathematical models for vehicle's dynamic behavior is relying on neuronal networks. This method contains coefficients that are time-dependent. Neuronal networks are mostly used in various types' system controls, thus

Nonzero-Sum Relationships in Mitigating Urban Carbon Emissions: A Dynamic Network Simulation.

PubMed

Chen, Shaoqing; Chen, Bin; Su, Meirong

2015-10-06

The "stove-pipe" way of thinking has been mostly used in mitigating carbon emissions and managing socioeconomics because of its convenience of implementation. However, systems-oriented approaches become imperative in pursuit of an efficient regulation of carbon emissions from systems as complicated as urban systems. The aim of this paper is to establish a dynamic network approach that is capable of assessing the effectiveness of carbon emissions mitigation in a more holistic way. A carbon metabolic network is constructed by modeling the carbon flows between economic sectors and environment. With the network shocked by interventions to the sectoral carbon flows, indirect emissions from the city are accounted for under certain carbon mitigation strategies. The nonzero-sum relationships between sectors and environmental components are identified based on utility analysis, which synthesize the nature of direct and indirect network interactions. The results of the case study of Beijing suggest that the stove-pipe mitigation strategies targeted the economic sectors might be not as efficient as they were expected. A direct cutting in material or energy import to the sectors may result in a rebound in indirect emissions and thus fails to achieve the carbon mitigation goal of the city as a whole. A promising way of foreseeing the dynamic mechanism of emissions is to analyze the nonzero-sum relationships between important urban components. Thinking cities as systems of interactions, the network approach is potentially a strong tool for appraising and filtering mitigation strategies of carbon emissions.

Information Dynamics as Foundation for Network Management

DTIC Science & Technology

2014-12-04

developed to adapt to channel dynamics in a mobile network environment. We devise a low- complexity online scheduling algorithm integrated with the...has been accepted for the Journal on Network and Systems Management in 2014. - RINC programmable platform for Infrastructure -as-a-Service public... backend servers. Rather than implementing load balancing in dedicated appliances, commodity SDN switches can perform this function. We design

Multi-Topic Tracking Model for dynamic social network

NASA Astrophysics Data System (ADS)

Li, Yuhua; Liu, Changzheng; Zhao, Ming; Li, Ruixuan; Xiao, Hailing; Wang, Kai; Zhang, Jun

2016-07-01

The topic tracking problem has attracted much attention in the last decades. However, existing approaches rarely consider network structures and textual topics together. In this paper, we propose a novel statistical model based on dynamic bayesian network, namely Multi-Topic Tracking Model for Dynamic Social Network (MTTD). It takes influence phenomenon, selection phenomenon, document generative process and the evolution of textual topics into account. Specifically, in our MTTD model, Gibbs Random Field is defined to model the influence of historical status of users in the network and the interdependency between them in order to consider the influence phenomenon. To address the selection phenomenon, a stochastic block model is used to model the link generation process based on the users' interests to topics. Probabilistic Latent Semantic Analysis (PLSA) is used to describe the document generative process according to the users' interests. Finally, the dependence on the historical topic status is also considered to ensure the continuity of the topic itself in topic evolution model. Expectation Maximization (EM) algorithm is utilized to estimate parameters in the proposed MTTD model. Empirical experiments on real datasets show that the MTTD model performs better than Popular Event Tracking (PET) and Dynamic Topic Model (DTM) in generalization performance, topic interpretability performance, topic content evolution and topic popularity evolution performance.

Challenges to inferring causality from viral information dispersion in dynamic social networks

NASA Astrophysics Data System (ADS)

Ternovski, John

2014-06-01

Understanding the mechanism behind large-scale information dispersion through complex networks has important implications for a variety of industries ranging from cyber-security to public health. With the unprecedented availability of public data from online social networks (OSNs) and the low cost nature of most OSN outreach, randomized controlled experiments, the "gold standard" of causal inference methodologies, have been used with increasing regularity to study viral information dispersion. And while these studies have dramatically furthered our understanding of how information disseminates through social networks by isolating causal mechanisms, there are still major methodological concerns that need to be addressed in future research. This paper delineates why modern OSNs are markedly different from traditional sociological social networks and why these differences present unique challenges to experimentalists and data scientists. The dynamic nature of OSNs is particularly troublesome for researchers implementing experimental designs, so this paper identifies major sources of bias arising from network mutability and suggests strategies to circumvent and adjust for these biases. This paper also discusses the practical considerations of data quality and collection, which may adversely impact the efficiency of the estimator. The major experimental methodologies used in the current literature on virality are assessed at length, and their strengths and limits identified. Other, as-yetunsolved threats to the efficiency and unbiasedness of causal estimators--such as missing data--are also discussed. This paper integrates methodologies and learnings from a variety of fields under an experimental and data science framework in order to systematically consolidate and identify current methodological limitations of randomized controlled experiments conducted in OSNs.

Design and Implementation of Decoy Enhanced Dynamic Virtualization Networks

DTIC Science & Technology

2016-12-12

From - To) 12/12/2016 Final 07/01/2015-08/31/2016 4. TITLE AND SUBTITLE Sa. CONTRACT NUMBER Design and Implementation of Decoy Enhanced Dynamic...TELEPHONE NUMBER (Include area code) 703-993-1715 Standard Form 298 (Rev . 8/98) Prescribed by ANSI Std . Z39.18 " Design and Implementation of...8 2 Design and Implementation ofDecoy Enhanced Dynamic Virtualization Networks 1 Major Goals The relatively static configurations of networks and

Restoration of rhythmicity in diffusively coupled dynamical networks.

PubMed

Zou, Wei; Senthilkumar, D V; Nagao, Raphael; Kiss, István Z; Tang, Yang; Koseska, Aneta; Duan, Jinqiao; Kurths, Jürgen

2015-07-15

Oscillatory behaviour is essential for proper functioning of various physical and biological processes. However, diffusive coupling is capable of suppressing intrinsic oscillations due to the manifestation of the phenomena of amplitude and oscillation deaths. Here we present a scheme to revoke these quenching states in diffusively coupled dynamical networks, and demonstrate the approach in experiments with an oscillatory chemical reaction. By introducing a simple feedback factor in the diffusive coupling, we show that the stable (in)homogeneous steady states can be effectively destabilized to restore dynamic behaviours of coupled systems. Even a feeble deviation from the normal diffusive coupling drastically shrinks the death regions in the parameter space. The generality of our method is corroborated in diverse non-linear systems of diffusively coupled paradigmatic models with various death scenarios. Our study provides a general framework to strengthen the robustness of dynamic activity in diffusively coupled dynamical networks.

Coupled disease-behavior dynamics on complex networks: A review.

PubMed

Wang, Zhen; Andrews, Michael A; Wu, Zhi-Xi; Wang, Lin; Bauch, Chris T

2015-12-01

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years. Copyright © 2015 Elsevier B.V. All rights reserved.

Coupled disease-behavior dynamics on complex networks: A review

NASA Astrophysics Data System (ADS)

Wang, Zhen; Andrews, Michael A.; Wu, Zhi-Xi; Wang, Lin; Bauch, Chris T.

2015-12-01

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years.

Matrix product algorithm for stochastic dynamics on networks applied to nonequilibrium Glauber dynamics

NASA Astrophysics Data System (ADS)

Barthel, Thomas; De Bacco, Caterina; Franz, Silvio

2018-01-01

We introduce and apply an efficient method for the precise simulation of stochastic dynamical processes on locally treelike graphs. Networks with cycles are treated in the framework of the cavity method. Such models correspond, for example, to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon ideas from quantum many-body theory, our approach is based on a matrix product approximation of the so-called edge messages—conditional probabilities of vertex variable trajectories. Computation costs and accuracy can be tuned by controlling the matrix dimensions of the matrix product edge messages (MPEM) in truncations. In contrast to Monte Carlo simulations, the algorithm has a better error scaling and works for both single instances as well as the thermodynamic limit. We employ it to examine prototypical nonequilibrium Glauber dynamics in the kinetic Ising model. Because of the absence of cancellation effects, observables with small expectation values can be evaluated accurately, allowing for the study of decay processes and temporal correlations.

Complete characterization of the stability of cluster synchronization in complex dynamical networks.

PubMed

Sorrentino, Francesco; Pecora, Louis M; Hagerstrom, Aaron M; Murphy, Thomas E; Roy, Rajarshi

2016-04-01

Synchronization is an important and prevalent phenomenon in natural and engineered systems. In many dynamical networks, the coupling is balanced or adjusted to admit global synchronization, a condition called Laplacian coupling. Many networks exhibit incomplete synchronization, where two or more clusters of synchronization persist, and computational group theory has recently proved to be valuable in discovering these cluster states based on the topology of the network. In the important case of Laplacian coupling, additional synchronization patterns can exist that would not be predicted from the group theory analysis alone. Understanding how and when clusters form, merge, and persist is essential for understanding collective dynamics, synchronization, and failure mechanisms of complex networks such as electric power grids, distributed control networks, and autonomous swarming vehicles. We describe a method to find and analyze all of the possible cluster synchronization patterns in a Laplacian-coupled network, by applying methods of computational group theory to dynamically equivalent networks. We present a general technique to evaluate the stability of each of the dynamically valid cluster synchronization patterns. Our results are validated in an optoelectronic experiment on a five-node network that confirms the synchronization patterns predicted by the theory.

Identifying the Key Weaknesses in Network Security at Colleges.

ERIC Educational Resources Information Center

Olsen, Florence

2000-01-01

A new study identifies and ranks the 10 security gaps responsible for most outsider attacks on college computer networks. The list is intended to help campus system administrators establish priorities as they work to increase security. One network security expert urges that institutions utilize multiple security layers. (DB)

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.

Spatial aggregation query in dynamic geosensor networks

NASA Astrophysics Data System (ADS)

Yi, Baolin; Feng, Dayang; Xiao, Shisong; Zhao, Erdun

2007-11-01

Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. In many of these applications, the researches mainly aim at building sensor network based systems to leverage the sensed data to applications. However, the existing works seldom exploited spatial aggregation query considering the dynamic characteristics of sensor networks. In this paper, we investigate how to process spatial aggregation query over dynamic geosensor networks where both the sink node and sensor nodes are mobile and propose several novel improvements on enabling techniques. The mobility of sensors makes the existing routing protocol based on information of fixed framework or the neighborhood infeasible. We present an improved location-based stateless implicit geographic forwarding (IGF) protocol for routing a query toward the area specified by query window, a diameter-based window aggregation query (DWAQ) algorithm for query propagation and data aggregation in the query window, finally considering the location changing of the sink node, we present two schemes to forward the result to the sink node. Simulation results show that the proposed algorithms can improve query latency and query accuracy.

Toward a systems-level view of dynamic phosphorylation networks

PubMed Central

Newman, Robert H.; Zhang, Jin; Zhu, Heng

2014-01-01

To better understand how cells sense and respond to their environment, it is important to understand the organization and regulation of the phosphorylation networks that underlie most cellular signal transduction pathways. These networks, which are composed of protein kinases, protein phosphatases and their respective cellular targets, are highly dynamic. Importantly, to achieve signaling specificity, phosphorylation networks must be regulated at several levels, including at the level of protein expression, substrate recognition, and spatiotemporal modulation of enzymatic activity. Here, we briefly summarize some of the traditional methods used to study the phosphorylation status of cellular proteins before focusing our attention on several recent technological advances, such as protein microarrays, quantitative mass spectrometry, and genetically-targetable fluorescent biosensors, that are offering new insights into the organization and regulation of cellular phosphorylation networks. Together, these approaches promise to lead to a systems-level view of dynamic phosphorylation networks. PMID:25177341

Dynamic optimization of metabolic networks coupled with gene expression.