Modeling Endoplasmic Reticulum Network Maintenance in a Plant Cell.

PubMed

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

2017-07-11

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

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.

Estimating spatio-temporal dynamics of stream total phosphate concentration by soft computing techniques.

PubMed

Chang, Fi-John; Chen, Pin-An; Chang, Li-Chiu; Tsai, Yu-Hsuan

2016-08-15

This study attempts to model the spatio-temporal dynamics of total phosphate (TP) concentrations along a river for effective hydro-environmental management. We propose a systematical modeling scheme (SMS), which is an ingenious modeling process equipped with a dynamic neural network and three refined statistical methods, for reliably predicting the TP concentrations along a river simultaneously. Two different types of artificial neural network (BPNN-static neural network; NARX network-dynamic neural network) are constructed in modeling the dynamic system. The Dahan River in Taiwan is used as a study case, where ten-year seasonal water quality data collected at seven monitoring stations along the river are used for model training and validation. Results demonstrate that the NARX network can suitably capture the important dynamic features and remarkably outperforms the BPNN model, and the SMS can effectively identify key input factors, suitably overcome data scarcity, significantly increase model reliability, satisfactorily estimate site-specific TP concentration at seven monitoring stations simultaneously, and adequately reconstruct seasonal TP data into a monthly scale. The proposed SMS can reliably model the dynamic spatio-temporal water pollution variation in a river system for missing, hazardous or costly data of interest. Copyright © 2016 Elsevier B.V. All rights reserved.

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-weighted graphs are discussed. PMID:25856374

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-weighted graphs are discussed.

Risk assessment by dynamic representation of vulnerability, exploitation, and impact

NASA Astrophysics Data System (ADS)

Cam, Hasan

2015-05-01

Assessing and quantifying cyber risk accurately in real-time is essential to providing security and mission assurance in any system and network. This paper presents a modeling and dynamic analysis approach to assessing cyber risk of a network in real-time by representing dynamically its vulnerabilities, exploitations, and impact using integrated Bayesian network and Markov models. Given the set of vulnerabilities detected by a vulnerability scanner in a network, this paper addresses how its risk can be assessed by estimating in real-time the exploit likelihood and impact of vulnerability exploitation on the network, based on real-time observations and measurements over the network. The dynamic representation of the network in terms of its vulnerabilities, sensor measurements, and observations is constructed dynamically using the integrated Bayesian network and Markov models. The transition rates of outgoing and incoming links of states in hidden Markov models are used in determining exploit likelihood and impact of attacks, whereas emission rates help quantify the attack states of vulnerabilities. Simulation results show the quantification and evolving risk scores over time for individual and aggregated vulnerabilities of a network.

Temporal node centrality in complex networks

NASA Astrophysics Data System (ADS)

Kim, Hyoungshick; Anderson, Ross

2012-02-01

Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.

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 neuronal populations also opens new doors to analyze the joint dynamics of multiple interacting networks. PMID:25520644

Polynomial algebra of discrete models in systems biology.

PubMed

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

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.

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.

ChainMail based neural dynamics modeling of soft tissue deformation for surgical simulation.

PubMed

Zhang, Jinao; Zhong, Yongmin; Smith, Julian; Gu, Chengfan

2017-07-20

Realistic and real-time modeling and simulation of soft tissue deformation is a fundamental research issue in the field of surgical simulation. In this paper, a novel cellular neural network approach is presented for modeling and simulation of soft tissue deformation by combining neural dynamics of cellular neural network with ChainMail mechanism. The proposed method formulates the problem of elastic deformation into cellular neural network activities to avoid the complex computation of elasticity. The local position adjustments of ChainMail are incorporated into the cellular neural network as the local connectivity of cells, through which the dynamic behaviors of soft tissue deformation are transformed into the neural dynamics of cellular neural network. Experiments demonstrate that the proposed neural network approach is capable of modeling the soft tissues' nonlinear deformation and typical mechanical behaviors. The proposed method not only improves ChainMail's linear deformation with the nonlinear characteristics of neural dynamics but also enables the cellular neural network to follow the principle of continuum mechanics to simulate soft tissue deformation.

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

Diffusion models for innovation: s-curves, networks, power laws, catastrophes, and entropy.

PubMed

Jacobsen, Joseph J; Guastello, Stephen J

2011-04-01

This article considers models for the diffusion of innovation would be most relevant to the dynamics of early 21st century technologies. The article presents an overview of diffusion models and examines the adoption S-curve, network theories, difference models, influence models, geographical models, a cusp catastrophe model, and self-organizing dynamics that emanate from principles of network configuration and principles of heat diffusion. The diffusion dynamics that are relevant to information technologies and energy-efficient technologies are compared. Finally, principles of nonlinear dynamics for innovation diffusion that could be used to rehabilitate the global economic situation are discussed.

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

NASA Astrophysics Data System (ADS)

Yasami, Yasser; Safaei, Farshad

2018-02-01

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

Simple deterministic models and applications. Comment on "Coupled disease-behavior dynamics on complex networks: A review" by Z. Wang et al.

NASA Astrophysics Data System (ADS)

Yang, Hyun Mo

2015-12-01

Currently, discrete modellings are largely accepted due to the access to computers with huge storage capacity and high performance processors and easy implementation of algorithms, allowing to develop and simulate increasingly sophisticated models. Wang et al. [7] present a review of dynamics in complex networks, focusing on the interaction between disease dynamics and human behavioral and social dynamics. By doing an extensive review regarding to the human behavior responding to disease dynamics, the authors briefly describe the complex dynamics found in the literature: well-mixed populations networks, where spatial structure can be neglected, and other networks considering heterogeneity on spatially distributed populations. As controlling mechanisms are implemented, such as social distancing due 'social contagion', quarantine, non-pharmaceutical interventions and vaccination, adaptive behavior can occur in human population, which can be easily taken into account in the dynamics formulated by networked populations.

A discrete mathematical model of the dynamic evolution of a transportation network

NASA Astrophysics Data System (ADS)

Malinetskii, G. G.; Stepantsov, M. E.

2009-09-01

A dynamic model of the evolution of a transportation network is proposed. The main feature of this model is that the evolution of the transportation network is not a process of centralized transportation optimization. Rather, its dynamic behavior is a result of the system self-organization that occurs in the course of the satisfaction of needs in goods transportation and the evolution of the infrastructure of the network nodes. Nonetheless, the possibility of soft control of the network evolution direction is taken into account.

Temporal efficiency evaluation and small-worldness characterization in temporal networks

PubMed Central

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-01-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks. PMID:27682314

Temporal efficiency evaluation and small-worldness characterization in temporal networks

NASA Astrophysics Data System (ADS)

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-09-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks.

Network traffic behaviour near phase transition point

NASA Astrophysics Data System (ADS)

Lawniczak, A. T.; Tang, X.

2006-03-01

We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnect) Reference Model of packet switching networks. The Network Layer is responsible for routing packets across the network from their sources to their destinations and for control of congestion in data networks. Using the model we investigate spatio-temporal packets traffic dynamics near the phase transition point for various network connection topologies, and static and adaptive routing algorithms. We present selected simulation results and analyze them.

Standard representation and unified stability analysis for dynamic artificial neural network models.

PubMed

Kim, Kwang-Ki K; Patrón, Ernesto Ríos; Braatz, Richard D

2018-02-01

An overview is provided of dynamic artificial neural network models (DANNs) for nonlinear dynamical system identification and control problems, and convex stability conditions are proposed that are less conservative than past results. The three most popular classes of dynamic artificial neural network models are described, with their mathematical representations and architectures followed by transformations based on their block diagrams that are convenient for stability and performance analyses. Classes of nonlinear dynamical systems that are universally approximated by such models are characterized, which include rigorous upper bounds on the approximation errors. A unified framework and linear matrix inequality-based stability conditions are described for different classes of dynamic artificial neural network models that take additional information into account such as local slope restrictions and whether the nonlinearities within the DANNs are odd. A theoretical example shows reduced conservatism obtained by the conditions. Copyright © 2017. Published by Elsevier Ltd.

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

NASA Astrophysics Data System (ADS)

Lu, Qiming

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

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.

A fast community detection method in bipartite networks by distance dynamics

NASA Astrophysics Data System (ADS)

Sun, Hong-liang; Ch'ng, Eugene; Yong, Xi; Garibaldi, Jonathan M.; See, Simon; Chen, Duan-bing

2018-04-01

Many real bipartite networks are found to be divided into two-mode communities. In this paper, we formulate a new two-mode community detection algorithm BiAttractor. It is based on distance dynamics model Attractor proposed by Shao et al. with extension from unipartite to bipartite networks. Since Jaccard coefficient of distance dynamics model is incapable to measure distances of different types of vertices in bipartite networks, our main contribution is to extend distance dynamics model from unipartite to bipartite networks using a novel measure Local Jaccard Distance (LJD). Furthermore, distances between different types of vertices are not affected by common neighbors in the original method. This new idea makes clear assumptions and yields interpretable results in linear time complexity O(| E |) in sparse networks, where | E | is the number of edges. Experiments on synthetic networks demonstrate it is capable to overcome resolution limit compared with existing other methods. Further research on real networks shows that this model can accurately detect interpretable community structures in a short time.

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata

PubMed Central

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-01-01

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research. PMID:28353664

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata.

PubMed

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-03-29

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

Modeling epidemics on adaptively evolving networks: A data-mining perspective.

PubMed

Kattis, Assimakis A; Holiday, Alexander; Stoica, Ana-Andreea; Kevrekidis, Ioannis G

2016-01-01

The exploration of epidemic dynamics on dynamically evolving ("adaptive") networks poses nontrivial challenges to the modeler, such as the determination of a small number of informative statistics of the detailed network state (that is, a few "good observables") that usefully summarize the overall (macroscopic, systems-level) behavior. Obtaining reduced, small size accurate models in terms of these few statistical observables--that is, trying to coarse-grain the full network epidemic model to a small but useful macroscopic one--is even more daunting. Here we describe a data-based approach to solving the first challenge: the detection of a few informative collective observables of the detailed epidemic dynamics. This is accomplished through Diffusion Maps (DMAPS), a recently developed data-mining technique. We illustrate the approach through simulations of a simple mathematical model of epidemics on a network: a model known to exhibit complex temporal dynamics. We discuss potential extensions of the approach, as well as possible shortcomings.

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

PubMed Central

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

2013-01-01

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

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.

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

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

ERIC Educational Resources Information Center

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

2015-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…

Dynamical influence processes on networks: general theory and applications to social contagion.

PubMed

Harris, Kameron Decker; Danforth, Christopher M; Dodds, Peter Sheridan

2013-08-01

We study binary state dynamics on a network where each node acts in response to the average state of its neighborhood. By allowing varying amounts of stochasticity in both the network and node responses, we find different outcomes in random and deterministic versions of the model. In the limit of a large, dense network, however, we show that these dynamics coincide. We construct a general mean-field theory for random networks and show this predicts that the dynamics on the network is a smoothed version of the average response function dynamics. Thus, the behavior of the system can range from steady state to chaotic depending on the response functions, network connectivity, and update synchronicity. As a specific example, we model the competing tendencies of imitation and nonconformity by incorporating an off-threshold into standard threshold models of social contagion. In this way, we attempt to capture important aspects of fashions and societal trends. We compare our theory to extensive simulations of this "limited imitation contagion" model on Poisson random graphs, finding agreement between the mean-field theory and stochastic simulations.

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.

Representing perturbed dynamics in biological network models

NASA Astrophysics Data System (ADS)

Stoll, Gautier; Rougemont, Jacques; Naef, Felix

2007-07-01

We study the dynamics of gene activities in relatively small size biological networks (up to a few tens of nodes), e.g., the activities of cell-cycle proteins during the mitotic cell-cycle progression. Using the framework of deterministic discrete dynamical models, we characterize the dynamical modifications in response to structural perturbations in the network connectivities. In particular, we focus on how perturbations affect the set of fixed points and sizes of the basins of attraction. Our approach uses two analytical measures: the basin entropy H and the perturbation size Δ , a quantity that reflects the distance between the set of fixed points of the perturbed network and that of the unperturbed network. Applying our approach to the yeast-cell-cycle network introduced by Li [Proc. Natl. Acad. Sci. U.S.A. 101, 4781 (2004)] provides a low-dimensional and informative fingerprint of network behavior under large classes of perturbations. We identify interactions that are crucial for proper network function, and also pinpoint functionally redundant network connections. Selected perturbations exemplify the breadth of dynamical responses in this cell-cycle model.

Macroscopic description of complex adaptive networks coevolving with dynamic node states

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

2015-05-01

In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

Macroscopic description of complex adaptive networks coevolving with dynamic node states.

PubMed

Wiedermann, Marc; Donges, Jonathan F; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

2015-05-01

In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

BioJazz: in silico evolution of cellular networks with unbounded complexity using rule-based modeling.

PubMed

Feng, Song; Ollivier, Julien F; Swain, Peter S; Soyer, Orkun S

2015-10-30

Systems biologists aim to decipher the structure and dynamics of signaling and regulatory networks underpinning cellular responses; synthetic biologists can use this insight to alter existing networks or engineer de novo ones. Both tasks will benefit from an understanding of which structural and dynamic features of networks can emerge from evolutionary processes, through which intermediary steps these arise, and whether they embody general design principles. As natural evolution at the level of network dynamics is difficult to study, in silico evolution of network models can provide important insights. However, current tools used for in silico evolution of network dynamics are limited to ad hoc computer simulations and models. Here we introduce BioJazz, an extendable, user-friendly tool for simulating the evolution of dynamic biochemical networks. Unlike previous tools for in silico evolution, BioJazz allows for the evolution of cellular networks with unbounded complexity by combining rule-based modeling with an encoding of networks that is akin to a genome. We show that BioJazz can be used to implement biologically realistic selective pressures and allows exploration of the space of network architectures and dynamics that implement prescribed physiological functions. BioJazz is provided as an open-source tool to facilitate its further development and use. Source code and user manuals are available at: http://oss-lab.github.io/biojazz and http://osslab.lifesci.warwick.ac.uk/BioJazz.aspx. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Model-free inference of direct network interactions from nonlinear collective dynamics.

PubMed

Casadiego, Jose; Nitzan, Mor; Hallerberg, Sarah; Timme, Marc

2017-12-19

The topology of interactions in network dynamical systems fundamentally underlies their function. Accelerating technological progress creates massively available data about collective nonlinear dynamics in physical, biological, and technological systems. Detecting direct interaction patterns from those dynamics still constitutes a major open problem. In particular, current nonlinear dynamics approaches mostly require to know a priori a model of the (often high dimensional) system dynamics. Here we develop a model-independent framework for inferring direct interactions solely from recording the nonlinear collective dynamics generated. Introducing an explicit dependency matrix in combination with a block-orthogonal regression algorithm, the approach works reliably across many dynamical regimes, including transient dynamics toward steady states, periodic and non-periodic dynamics, and chaos. Together with its capabilities to reveal network (two point) as well as hypernetwork (e.g., three point) interactions, this framework may thus open up nonlinear dynamics options of inferring direct interaction patterns across systems where no model is known.

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.

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.

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.

An algebra-based method for inferring gene regulatory networks.

PubMed

Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard

2014-03-26

The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html.

Small-time Scale Network Traffic Prediction Based on Complex-valued Neural Network

NASA Astrophysics Data System (ADS)

Yang, Bin

2017-07-01

Accurate models play an important role in capturing the significant characteristics of the network traffic, analyzing the network dynamic, and improving the forecasting accuracy for system dynamics. In this study, complex-valued neural network (CVNN) model is proposed to further improve the accuracy of small-time scale network traffic forecasting. Artificial bee colony (ABC) algorithm is proposed to optimize the complex-valued and real-valued parameters of CVNN model. Small-scale traffic measurements data namely the TCP traffic data is used to test the performance of CVNN model. Experimental results reveal that CVNN model forecasts the small-time scale network traffic measurement data very accurately

Optimized planning methodologies of ASON implementation

NASA Astrophysics Data System (ADS)

Zhou, Michael M.; Tamil, Lakshman S.

2005-02-01

Advanced network planning concerns effective network-resource allocation for dynamic and open business environment. Planning methodologies of ASON implementation based on qualitative analysis and mathematical modeling are presented in this paper. The methodology includes method of rationalizing technology and architecture, building network and nodal models, and developing dynamic programming for multi-period deployment. The multi-layered nodal architecture proposed here can accommodate various nodal configurations for a multi-plane optical network and the network modeling presented here computes the required network elements for optimizing resource allocation.

SISL and SIRL: Two knowledge dissemination models with leader nodes on cooperative learning networks

NASA Astrophysics Data System (ADS)

Li, Jingjing; Zhang, Yumei; Man, Jiayu; Zhou, Yun; Wu, Xiaojun

2017-02-01

Cooperative learning is one of the most effective teaching methods, which has been widely used. Students' mutual contact forms a cooperative learning network in this process. Our previous research demonstrated that the cooperative learning network has complex characteristics. This study aims to investigating the dynamic spreading process of the knowledge in the cooperative learning network and the inspiration of leaders in this process. To this end, complex network transmission dynamics theory is utilized to construct the knowledge dissemination model of a cooperative learning network. Based on the existing epidemic models, we propose a new susceptible-infected-susceptible-leader (SISL) model that considers both students' forgetting and leaders' inspiration, and a susceptible-infected-removed-leader (SIRL) model that considers students' interest in spreading and leaders' inspiration. The spreading threshold λcand its impact factors are analyzed. Then, numerical simulation and analysis are delivered to reveal the dynamic transmission mechanism of knowledge and leaders' role. This work is of great significance to cooperative learning theory and teaching practice. It also enriches the theory of complex network transmission dynamics.

MSEE: Stochastic Cognitive Linguistic Behavior Models for Semantic Sensing

DTIC Science & Technology

2013-09-01

recognition, a Gaussian Process Dynamic Model with Social Network Analysis (GPDM-SNA) for a small human group action recognition, an extended GPDM-SNA...44  3.2. Small Human Group Activity Modeling Based on Gaussian Process Dynamic Model and Social Network Analysis (SN-GPDM...51  Approved for public release; distribution unlimited. 3 3.2.3. Gaussian Process Dynamical Model and

A neural-network-based model for the dynamic simulation of the tire/suspension system while traversing road irregularities.

PubMed

Guarneri, Paolo; Rocca, Gianpiero; Gobbi, Massimiliano

2008-09-01

This paper deals with the simulation of the tire/suspension dynamics by using recurrent neural networks (RNNs). RNNs are derived from the multilayer feedforward neural networks, by adding feedback connections between output and input layers. The optimal network architecture derives from a parametric analysis based on the optimal tradeoff between network accuracy and size. The neural network can be trained with experimental data obtained in the laboratory from simulated road profiles (cleats). The results obtained from the neural network demonstrate good agreement with the experimental results over a wide range of operation conditions. The NN model can be effectively applied as a part of vehicle system model to accurately predict elastic bushings and tire dynamics behavior. Although the neural network model, as a black-box model, does not provide a good insight of the physical behavior of the tire/suspension system, it is a useful tool for assessing vehicle ride and noise, vibration, harshness (NVH) performance due to its good computational efficiency and accuracy.

Communication Dynamics of Blog Networks

NASA Astrophysics Data System (ADS)

Goldberg, Mark; Kelley, Stephen; Magdon-Ismail, Malik; Mertsalov, Konstantin; Wallace, William (Al)

We study the communication dynamics of Blog networks, focusing on the Russian section of LiveJournal as a case study. Communication (blogger-to-blogger links) in such online communication networks is very dynamic: over 60% of the links in the network are new from one week to the next, though the set of bloggers remains approximately constant. Two fundamental questions are: (i) what models adequately describe such dynamic communication behavior; and (ii) how does one detect the phase transitions, i.e. the changes that go beyond the standard high-level dynamics? We approach these questions through the notion of stable statistics. We give strong experimental evidence to the fact that, despite the extreme amount of communication dynamics, several aggregate statistics are remarkably stable. We use stable statistics to test our models of communication dynamics postulating that any good model should produce values for these statistics which are both stable and close to the observed ones. Stable statistics can also be used to identify phase transitions, since any change in a normally stable statistic indicates a substantial change in the nature of the communication dynamics. We describe models of the communication dynamics in large social networks based on the principle of locality of communication: a node's communication energy is spent mostly within its own "social area," the locality of the node.

Models, Entropy and Information of Temporal Social Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun; Karsai, Márton; Bianconi, Ginestra

Temporal social networks are characterized by heterogeneous duration of contacts, which can either follow a power-law distribution, such as in face-to-face interactions, or a Weibull distribution, such as in mobile-phone communication. Here we model the dynamics of face-to-face interaction and mobile phone communication by a reinforcement dynamics, which explains the data observed in these different types of social interactions. We quantify the information encoded in the dynamics of these networks by the entropy of temporal networks. Finally, we show evidence that human dynamics is able to modulate the information present in social network dynamics when it follows circadian rhythms and when it is interfacing with a new technology such as the mobile-phone communication technology.

Modeling biological pathway dynamics with timed automata.

PubMed

Schivo, Stefano; Scholma, Jetse; Wanders, Brend; Urquidi Camacho, Ricardo A; van der Vet, Paul E; Karperien, Marcel; Langerak, Rom; van de Pol, Jaco; Post, Janine N

2014-05-01

Living cells are constantly subjected to a plethora of environmental stimuli that require integration into an appropriate cellular response. This integration takes place through signal transduction events that form tightly interconnected networks. The understanding of these networks requires capturing their dynamics through computational support and models. ANIMO (analysis of Networks with Interactive Modeling) is a tool that enables the construction and exploration of executable models of biological networks, helping to derive hypotheses and to plan wet-lab experiments. The tool is based on the formalism of Timed Automata, which can be analyzed via the UPPAAL model checker. Thanks to Timed Automata, we can provide a formal semantics for the domain-specific language used to represent signaling networks. This enforces precision and uniformity in the definition of signaling pathways, contributing to the integration of isolated signaling events into complex network models. We propose an approach to discretization of reaction kinetics that allows us to efficiently use UPPAAL as the computational engine to explore the dynamic behavior of the network of interest. A user-friendly interface hides the use of Timed Automata from the user, while keeping the expressive power intact. Abstraction to single-parameter kinetics speeds up construction of models that remain faithful enough to provide meaningful insight. The resulting dynamic behavior of the network components is displayed graphically, allowing for an intuitive and interactive modeling experience.

Research on investment decisions model of trans-regional transmission network based on the theory of NPV

NASA Astrophysics Data System (ADS)

Zai, Wenjiao; Wang, Bo; Liu, Jichun; Shi, Haobo; Zeng, Pingliang

2018-02-01

The investment decision model of trans-regional transmission network in the context of Global Energy Internet was studied in this paper. The key factors affecting the trans-regional transmission network investment income: the income tax rate, the loan interest rate, the expected return on investment of the investment subject, the per capita GDP and so on were considered in the transmission network investment income model. First, according to the principle of system dynamics, the causality diagram of key factors was constructed. Then, the dynamic model of transmission investment decision was established. A case study of the power transmission network between China and Mongolia, through the simulation of the system dynamic model, the influence of the above key factors on the investment returns was analyzed, and the feasibility and effectiveness of the model was proved.

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.

An Adaptive Complex Network Model for Brain Functional Networks

PubMed Central

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

2009-01-01

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

Biologically plausible learning in recurrent neural networks reproduces neural dynamics observed during cognitive tasks

PubMed Central

Miconi, Thomas

2017-01-01

Neural activity during cognitive tasks exhibits complex dynamics that flexibly encode task-relevant variables. Chaotic recurrent networks, which spontaneously generate rich dynamics, have been proposed as a model of cortical computation during cognitive tasks. However, existing methods for training these networks are either biologically implausible, and/or require a continuous, real-time error signal to guide learning. Here we show that a biologically plausible learning rule can train such recurrent networks, guided solely by delayed, phasic rewards at the end of each trial. Networks endowed with this learning rule can successfully learn nontrivial tasks requiring flexible (context-dependent) associations, memory maintenance, nonlinear mixed selectivities, and coordination among multiple outputs. The resulting networks replicate complex dynamics previously observed in animal cortex, such as dynamic encoding of task features and selective integration of sensory inputs. We conclude that recurrent neural networks offer a plausible model of cortical dynamics during both learning and performance of flexible behavior. DOI: http://dx.doi.org/10.7554/eLife.20899.001 PMID:28230528

Biologically plausible learning in recurrent neural networks reproduces neural dynamics observed during cognitive tasks.

PubMed

Miconi, Thomas

2017-02-23

Neural activity during cognitive tasks exhibits complex dynamics that flexibly encode task-relevant variables. Chaotic recurrent networks, which spontaneously generate rich dynamics, have been proposed as a model of cortical computation during cognitive tasks. However, existing methods for training these networks are either biologically implausible, and/or require a continuous, real-time error signal to guide learning. Here we show that a biologically plausible learning rule can train such recurrent networks, guided solely by delayed, phasic rewards at the end of each trial. Networks endowed with this learning rule can successfully learn nontrivial tasks requiring flexible (context-dependent) associations, memory maintenance, nonlinear mixed selectivities, and coordination among multiple outputs. The resulting networks replicate complex dynamics previously observed in animal cortex, such as dynamic encoding of task features and selective integration of sensory inputs. We conclude that recurrent neural networks offer a plausible model of cortical dynamics during both learning and performance of flexible behavior.

Dynamic Infinite Mixed-Membership Stochastic Blockmodel.

PubMed

Fan, Xuhui; Cao, Longbing; Xu, Richard Yi Da

2015-09-01

Directional and pairwise measurements are often used to model interactions in a social network setting. The mixed-membership stochastic blockmodel (MMSB) was a seminal work in this area, and its ability has been extended. However, models such as MMSB face particular challenges in modeling dynamic networks, for example, with the unknown number of communities. Accordingly, this paper proposes a dynamic infinite mixed-membership stochastic blockmodel, a generalized framework that extends the existing work to potentially infinite communities inside a network in dynamic settings (i.e., networks are observed over time). Additional model parameters are introduced to reflect the degree of persistence among one's memberships at consecutive time stamps. Under this framework, two specific models, namely mixture time variant and mixture time invariant models, are proposed to depict two different time correlation structures. Two effective posterior sampling strategies and their results are presented, respectively, using synthetic and real-world data.

Emergence, evolution and scaling of online social networks.

PubMed

Wang, Le-Zhi; Huang, Zi-Gang; Rong, Zhi-Hai; Wang, Xiao-Fan; Lai, Ying-Cheng

2014-01-01

Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Bacterial molecular networks: bridging the gap between functional genomics and dynamical modelling.

PubMed

van Helden, Jacques; Toussaint, Ariane; Thieffry, Denis

2012-01-01

This introductory review synthesizes the contents of the volume Bacterial Molecular Networks of the series Methods in Molecular Biology. This volume gathers 9 reviews and 16 method chapters describing computational protocols for the analysis of metabolic pathways, protein interaction networks, and regulatory networks. Each protocol is documented by concrete case studies dedicated to model bacteria or interacting populations. Altogether, the chapters provide a representative overview of state-of-the-art methods for data integration and retrieval, network visualization, graph analysis, and dynamical modelling.

Extended Kalman Filter for Estimation of Parameters in Nonlinear State-Space Models of Biochemical Networks

PubMed Central

Sun, Xiaodian; Jin, Li; Xiong, Momiao

2008-01-01

It is system dynamics that determines the function of cells, tissues and organisms. To develop mathematical models and estimate their parameters are an essential issue for studying dynamic behaviors of biological systems which include metabolic networks, genetic regulatory networks and signal transduction pathways, under perturbation of external stimuli. In general, biological dynamic systems are partially observed. Therefore, a natural way to model dynamic biological systems is to employ nonlinear state-space equations. Although statistical methods for parameter estimation of linear models in biological dynamic systems have been developed intensively in the recent years, the estimation of both states and parameters of nonlinear dynamic systems remains a challenging task. In this report, we apply extended Kalman Filter (EKF) to the estimation of both states and parameters of nonlinear state-space models. To evaluate the performance of the EKF for parameter estimation, we apply the EKF to a simulation dataset and two real datasets: JAK-STAT signal transduction pathway and Ras/Raf/MEK/ERK signaling transduction pathways datasets. The preliminary results show that EKF can accurately estimate the parameters and predict states in nonlinear state-space equations for modeling dynamic biochemical networks. PMID:19018286

General method to find the attractors of discrete dynamic models of biological systems.

PubMed

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

Cell transmission model of dynamic assignment for urban rail transit networks.

PubMed

Xu, Guangming; Zhao, Shuo; Shi, Feng; Zhang, Feilian

2017-01-01

For urban rail transit network, the space-time flow distribution can play an important role in evaluating and optimizing the space-time resource allocation. For obtaining the space-time flow distribution without the restriction of schedules, a dynamic assignment problem is proposed based on the concept of continuous transmission. To solve the dynamic assignment problem, the cell transmission model is built for urban rail transit networks. The priority principle, queuing process, capacity constraints and congestion effects are considered in the cell transmission mechanism. Then an efficient method is designed to solve the shortest path for an urban rail network, which decreases the computing cost for solving the cell transmission model. The instantaneous dynamic user optimal state can be reached with the method of successive average. Many evaluation indexes of passenger flow can be generated, to provide effective support for the optimization of train schedules and the capacity evaluation for urban rail transit network. Finally, the model and its potential application are demonstrated via two numerical experiments using a small-scale network and the Beijing Metro network.

General method to find the attractors of discrete dynamic models of biological systems

NASA Astrophysics Data System (ADS)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

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.

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.

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.

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.

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.

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

An approximation method for improving dynamic network model fitting.

PubMed

Carnegie, Nicole Bohme; Krivitsky, Pavel N; Hunter, David R; Goodreau, Steven M

There has been a great deal of interest recently in the modeling and simulation of dynamic networks, i.e., networks that change over time. One promising model is the separable temporal exponential-family random graph model (ERGM) of Krivitsky and Handcock, which treats the formation and dissolution of ties in parallel at each time step as independent ERGMs. However, the computational cost of fitting these models can be substantial, particularly for large, sparse networks. Fitting cross-sectional models for observations of a network at a single point in time, while still a non-negligible computational burden, is much easier. This paper examines model fitting when the available data consist of independent measures of cross-sectional network structure and the duration of relationships under the assumption of stationarity. We introduce a simple approximation to the dynamic parameters for sparse networks with relationships of moderate or long duration and show that the approximation method works best in precisely those cases where parameter estimation is most likely to fail-networks with very little change at each time step. We consider a variety of cases: Bernoulli formation and dissolution of ties, independent-tie formation and Bernoulli dissolution, independent-tie formation and dissolution, and dependent-tie formation models.

Friendship Network and Dental Brushing Behavior among Middle School Students: An Agent Based Modeling Approach.

PubMed

Sadeghipour, Maryam; Khoshnevisan, Mohammad Hossein; Jafari, Afshin; Shariatpanahi, Seyed Peyman

2017-01-01

By using a standard questionnaire, the level of dental brushing frequency was assessed among 201 adolescent female middle school students in Tehran. The initial assessment was repeated after 5 months, in order to observe the dynamics in dental health behavior level. Logistic Regression model was used to evaluate the correlation among individuals' dental health behavior in their social network. A significant correlation on dental brushing habits was detected among groups of friends. This correlation was further spread over the network within the 5 months period. Moreover, it was identified that the average brushing level was improved within the 5 months period. Given that there was a significant correlation between social network's nodes' in-degree value, and brushing level, it was suggested that the observed improvement was partially due to more popularity of individuals with better tooth brushing habit. Agent Based Modeling (ABM) was used to demonstrate the dynamics of dental brushing frequency within a sample of friendship network. Two models with static and dynamic assumptions for the network structure were proposed. The model with dynamic network structure successfully described the dynamics of dental health behavior. Based on this model, on average, every 43 weeks a student changes her brushing habit due to learning from her friends. Finally, three training scenarios were tested by these models in order to evaluate their effectiveness. When training more popular students, considerable improvement in total students' brushing frequency was demonstrated by simulation results.

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.

An algebra-based method for inferring gene regulatory networks

PubMed Central

2014-01-01

Background The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. Results This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Conclusions Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html. PMID:24669835

A mathematical model for mesenchymal and chemosensitive cell dynamics.

PubMed

Häcker, Anita

2012-01-01

The structure of an underlying tissue network has a strong impact on cell dynamics. If, in addition, cells alter the network by mechanical and chemical interactions, their movement is called mesenchymal. Important examples for mesenchymal movement include fibroblasts in wound healing and metastatic tumour cells. This paper is focused on the latter. Based on the anisotropic biphasic theory of Barocas and Tranquillo, which models a fibre network and interstitial solution as two-component fluid, a mathematical model for the interactions of cells with a fibre network is developed. A new description for fibre reorientation is given and orientation-dependent proteolysis is added to the model. With respect to cell dynamics, the equation, based on anisotropic diffusion, is extended by haptotaxis and chemotaxis. The chemoattractants are the solute network fragments, emerging from proteolysis, and the epidermal growth factor which may guide the cells to a blood vessel. Moreover the cell migration is impeded at either high or low network density. This new model enables us to study chemotactic cell migration in a complex fibre network and the consequential network deformation. Numerical simulations for the cell migration and network deformation are carried out in two space dimensions. Simulations of cell migration in underlying tissue networks visualise the impact of the network structure on cell dynamics. In a scenario for fibre reorientation between cell clusters good qualitative agreement with experimental results is achieved. The invasion speeds of cells in an aligned and an isotropic fibre network are compared. © Springer-Verlag 2011

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

An opinion-driven behavioral dynamics model for addictive behaviors

NASA Astrophysics Data System (ADS)

Moore, Thomas W.; Finley, Patrick D.; Apelberg, Benjamin J.; Ambrose, Bridget K.; Brodsky, Nancy S.; Brown, Theresa J.; Husten, Corinne; Glass, Robert J.

2015-04-01

We present a model of behavioral dynamics that combines a social network-based opinion dynamics model with behavioral mapping. The behavioral component is discrete and history-dependent to represent situations in which an individual's behavior is initially driven by opinion and later constrained by physiological or psychological conditions that serve to maintain the behavior. Individuals are modeled as nodes in a social network connected by directed edges. Parameter sweeps illustrate model behavior and the effects of individual parameters and parameter interactions on model results. Mapping a continuous opinion variable into a discrete behavioral space induces clustering on directed networks. Clusters provide targets of opportunity for influencing the network state; however, the smaller the network the greater the stochasticity and potential variability in outcomes. This has implications both for behaviors that are influenced by close relationships verses those influenced by societal norms and for the effectiveness of strategies for influencing those behaviors.

Biophysical synaptic dynamics in an analog VLSI network of Hodgkin-Huxley neurons.

PubMed

Yu, Theodore; Cauwenberghs, Gert

2009-01-01

We study synaptic dynamics in a biophysical network of four coupled spiking neurons implemented in an analog VLSI silicon microchip. The four neurons implement a generalized Hodgkin-Huxley model with individually configurable rate-based kinetics of opening and closing of Na+ and K+ ion channels. The twelve synapses implement a rate-based first-order kinetic model of neurotransmitter and receptor dynamics, accounting for NMDA and non-NMDA type chemical synapses. The implemented models on the chip are fully configurable by 384 parameters accounting for conductances, reversal potentials, and pre/post-synaptic voltage-dependence of the channel kinetics. We describe the models and present experimental results from the chip characterizing single neuron dynamics, single synapse dynamics, and multi-neuron network dynamics showing phase-locking behavior as a function of synaptic coupling strength. The 3mm x 3mm microchip consumes 1.29 mW power making it promising for applications including neuromorphic modeling and neural prostheses.

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.

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

PubMed Central

McDonnell, Mark D.; Ward, Lawrence M.

2014-01-01

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

A solution for two-dimensional mazes with use of chaotic dynamics in a recurrent neural network model.

PubMed

Suemitsu, Yoshikazu; Nara, Shigetoshi

2004-09-01

Chaotic dynamics introduced into a neural network model is applied to solving two-dimensional mazes, which are ill-posed problems. A moving object moves from the position at t to t + 1 by simply defined motion function calculated from firing patterns of the neural network model at each time step t. We have embedded several prototype attractors that correspond to the simple motion of the object orienting toward several directions in two-dimensional space in our neural network model. Introducing chaotic dynamics into the network gives outputs sampled from intermediate state points between embedded attractors in a state space, and these dynamics enable the object to move in various directions. System parameter switching between a chaotic and an attractor regime in the state space of the neural network enables the object to move to a set target in a two-dimensional maze. Results of computer simulations show that the success rate for this method over 300 trials is higher than that of random walk. To investigate why the proposed method gives better performance, we calculate and discuss statistical data with respect to dynamical structure.

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.

Can longitudinal generalized estimating equation models distinguish network influence and homophily? An agent-based modeling approach to measurement characteristics.

PubMed

Sauser Zachrison, Kori; Iwashyna, Theodore J; Gebremariam, Achamyeleh; Hutchins, Meghan; Lee, Joyce M

2016-12-28

Connected individuals (or nodes) in a network are more likely to be similar than two randomly selected nodes due to homophily and/or network influence. Distinguishing between these two influences is an important goal in network analysis, and generalized estimating equation (GEE) analyses of longitudinal dyadic network data are an attractive approach. It is not known to what extent such regressions can accurately extract underlying data generating processes. Therefore our primary objective is to determine to what extent, and under what conditions, does the GEE-approach recreate the actual dynamics in an agent-based model. We generated simulated cohorts with pre-specified network characteristics and attachments in both static and dynamic networks, and we varied the presence of homophily and network influence. We then used statistical regression and examined the GEE model performance in each cohort to determine whether the model was able to detect the presence of homophily and network influence. In cohorts with both static and dynamic networks, we find that the GEE models have excellent sensitivity and reasonable specificity for determining the presence or absence of network influence, but little ability to distinguish whether or not homophily is present. The GEE models are a valuable tool to examine for the presence of network influence in longitudinal data, but are quite limited with respect to homophily.

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.

Learning Data Set Influence on Identification Accuracy of Gas Turbine Neural Network Model

NASA Astrophysics Data System (ADS)

Kuznetsov, A. V.; Makaryants, G. M.

2018-01-01

There are many gas turbine engine identification researches via dynamic neural network models. It should minimize errors between model and real object during identification process. Questions about training data set processing of neural networks are usually missed. This article presents a study about influence of data set type on gas turbine neural network model accuracy. The identification object is thermodynamic model of micro gas turbine engine. The thermodynamic model input signal is the fuel consumption and output signal is the engine rotor rotation frequency. Four types input signals was used for creating training and testing data sets of dynamic neural network models - step, fast, slow and mixed. Four dynamic neural networks were created based on these types of training data sets. Each neural network was tested via four types test data sets. In the result 16 transition processes from four neural networks and four test data sets from analogous solving results of thermodynamic model were compared. The errors comparison was made between all neural network errors in each test data set. In the comparison result it was shown error value ranges of each test data set. It is shown that error values ranges is small therefore the influence of data set types on identification accuracy is low.

Maximal switchability of centralized networks

NASA Astrophysics Data System (ADS)

Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu

2016-08-01

We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.

Propagating waves can explain irregular neural dynamics.

PubMed

Keane, Adam; Gong, Pulin

2015-01-28

Cortical neurons in vivo fire quite irregularly. Previous studies about the origin of such irregular neural dynamics have given rise to two major models: a balanced excitation and inhibition model, and a model of highly synchronized synaptic inputs. To elucidate the network mechanisms underlying synchronized synaptic inputs and account for irregular neural dynamics, we investigate a spatially extended, conductance-based spiking neural network model. We show that propagating wave patterns with complex dynamics emerge from the network model. These waves sweep past neurons, to which they provide highly synchronized synaptic inputs. On the other hand, these patterns only emerge from the network with balanced excitation and inhibition; our model therefore reconciles the two major models of irregular neural dynamics. We further demonstrate that the collective dynamics of propagating wave patterns provides a mechanistic explanation for a range of irregular neural dynamics, including the variability of spike timing, slow firing rate fluctuations, and correlated membrane potential fluctuations. In addition, in our model, the distributions of synaptic conductance and membrane potential are non-Gaussian, consistent with recent experimental data obtained using whole-cell recordings. Our work therefore relates the propagating waves that have been widely observed in the brain to irregular neural dynamics. These results demonstrate that neural firing activity, although appearing highly disordered at the single-neuron level, can form dynamical coherent structures, such as propagating waves at the population level. Copyright © 2015 the authors 0270-6474/15/351591-15$15.00/0.

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

NASA Astrophysics Data System (ADS)

Lerman, Kristina; Ghosh, Rumi

2012-08-01

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

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.

Growing complex network of citations of scientific papers: Modeling and measurements

NASA Astrophysics Data System (ADS)

Golosovsky, Michael; Solomon, Sorin

2017-01-01

We consider the network of citations of scientific papers and use a combination of the theoretical and experimental tools to uncover microscopic details of this network growth. Namely, we develop a stochastic model of citation dynamics based on the copying-redirection-triadic closure mechanism. In a complementary and coherent way, the model accounts both for statistics of references of scientific papers and for their citation dynamics. Originating in empirical measurements, the model is cast in such a way that it can be verified quantitatively in every aspect. Such validation is performed by measuring citation dynamics of physics papers. The measurements revealed nonlinear citation dynamics, the nonlinearity being intricately related to network topology. The nonlinearity has far-reaching consequences including nonstationary citation distributions, diverging citation trajectories of similar papers, runaways or "immortal papers" with infinite citation lifetime, etc. Thus nonlinearity in complex network growth is our most important finding. In a more specific context, our results can be a basis for quantitative probabilistic prediction of citation dynamics of individual papers and of the journal impact factor.

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.

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

Convergence dynamics and pseudo almost periodicity of a class of nonautonomous RFDEs with applications

NASA Astrophysics Data System (ADS)

Fan, Meng; Ye, Dan

2005-09-01

This paper studies the dynamics of a system of retarded functional differential equations (i.e., RF=Es), which generalize the Hopfield neural network models, the bidirectional associative memory neural networks, the hybrid network models of the cellular neural network type, and some population growth model. Sufficient criteria are established for the globally exponential stability and the existence and uniqueness of pseudo almost periodic solution. The approaches are based on constructing suitable Lyapunov functionals and the well-known Banach contraction mapping principle. The paper ends with some applications of the main results to some neural network models and population growth models and numerical simulations.

Dynamics of financial crises in the world trade network

NASA Astrophysics Data System (ADS)

Askari, Marziyeh; Shirazi, Homayoun; Aghababaei Samani, Keivan

2018-07-01

A simple dynamical model is introduced to simulate the spreading of financial crises in the world trade network. In this model a directed network is constructed in which a weighted and directed link indicates the export value between two countries. The weights are subject to the change by a simple dynamical rule. The process begins with a crisis, i.e. a sudden decrease in the export value of a certain country and spreads throughout the whole network. We compare our results with the real values corresponding to the global financial crisis of 2008 and show that the results of our model are in good agreement with reality.

Comparison of the dynamics of neural interactions between current-based and conductance-based integrate-and-fire recurrent networks

PubMed Central

Cavallari, Stefano; Panzeri, Stefano; Mazzoni, Alberto

2014-01-01

Models of networks of Leaky Integrate-and-Fire (LIF) neurons are a widely used tool for theoretical investigations of brain function. These models have been used both with current- and conductance-based synapses. However, the differences in the dynamics expressed by these two approaches have been so far mainly studied at the single neuron level. To investigate how these synaptic models affect network activity, we compared the single neuron and neural population dynamics of conductance-based networks (COBNs) and current-based networks (CUBNs) of LIF neurons. These networks were endowed with sparse excitatory and inhibitory recurrent connections, and were tested in conditions including both low- and high-conductance states. We developed a novel procedure to obtain comparable networks by properly tuning the synaptic parameters not shared by the models. The so defined comparable networks displayed an excellent and robust match of first order statistics (average single neuron firing rates and average frequency spectrum of network activity). However, these comparable networks showed profound differences in the second order statistics of neural population interactions and in the modulation of these properties by external inputs. The correlation between inhibitory and excitatory synaptic currents and the cross-neuron correlation between synaptic inputs, membrane potentials and spike trains were stronger and more stimulus-modulated in the COBN. Because of these properties, the spike train correlation carried more information about the strength of the input in the COBN, although the firing rates were equally informative in both network models. Moreover, the network activity of COBN showed stronger synchronization in the gamma band, and spectral information about the input higher and spread over a broader range of frequencies. These results suggest that the second order statistics of network dynamics depend strongly on the choice of synaptic model. PMID:24634645

Comparison of the dynamics of neural interactions between current-based and conductance-based integrate-and-fire recurrent networks.

PubMed

Cavallari, Stefano; Panzeri, Stefano; Mazzoni, Alberto

2014-01-01

Models of networks of Leaky Integrate-and-Fire (LIF) neurons are a widely used tool for theoretical investigations of brain function. These models have been used both with current- and conductance-based synapses. However, the differences in the dynamics expressed by these two approaches have been so far mainly studied at the single neuron level. To investigate how these synaptic models affect network activity, we compared the single neuron and neural population dynamics of conductance-based networks (COBNs) and current-based networks (CUBNs) of LIF neurons. These networks were endowed with sparse excitatory and inhibitory recurrent connections, and were tested in conditions including both low- and high-conductance states. We developed a novel procedure to obtain comparable networks by properly tuning the synaptic parameters not shared by the models. The so defined comparable networks displayed an excellent and robust match of first order statistics (average single neuron firing rates and average frequency spectrum of network activity). However, these comparable networks showed profound differences in the second order statistics of neural population interactions and in the modulation of these properties by external inputs. The correlation between inhibitory and excitatory synaptic currents and the cross-neuron correlation between synaptic inputs, membrane potentials and spike trains were stronger and more stimulus-modulated in the COBN. Because of these properties, the spike train correlation carried more information about the strength of the input in the COBN, although the firing rates were equally informative in both network models. Moreover, the network activity of COBN showed stronger synchronization in the gamma band, and spectral information about the input higher and spread over a broader range of frequencies. These results suggest that the second order statistics of network dynamics depend strongly on the choice of synaptic model.

Modelling opinion formation driven communities in social networks

NASA Astrophysics Data System (ADS)

Iñiguez, Gerardo; Barrio, Rafael A.; Kertész, János; Kaski, Kimmo K.

2011-09-01

In a previous paper we proposed a model to study the dynamics of opinion formation in human societies by a co-evolution process involving two distinct time scales of fast transaction and slower network evolution dynamics. In the transaction dynamics we take into account short range interactions as discussions between individuals and long range interactions to describe the attitude to the overall mood of society. The latter is handled by a uniformly distributed parameter α, assigned randomly to each individual, as quenched personal bias. The network evolution dynamics is realised by rewiring the societal network due to state variable changes as a result of transaction dynamics. The main consequence of this complex dynamics is that communities emerge in the social network for a range of values in the ratio between time scales. In this paper we focus our attention on the attitude parameter α and its influence on the conformation of opinion and the size of the resulting communities. We present numerical studies and extract interesting features of the model that can be interpreted in terms of social behaviour.

Particle Interactions Mediated by Dynamical Networks: Assessment of Macroscopic Descriptions

NASA Astrophysics Data System (ADS)

Barré, J.; Carrillo, J. A.; Degond, P.; Peurichard, D.; Zatorska, E.

2018-02-01

We provide a numerical study of the macroscopic model of Barré et al. (Multiscale Model Simul, 2017, to appear) derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodeling process is very fast, the macroscopic model takes the form of a single aggregation-diffusion equation for the density of particles. The theoretical study of the macroscopic model gives precise criteria for the phase transitions of the steady states, and in the one-dimensional case, we show numerically that the stationary solutions of the microscopic model undergo the same phase transitions and bifurcation types as the macroscopic model. In the two-dimensional case, we show that the numerical simulations of the macroscopic model are in excellent agreement with the predicted theoretical values. This study provides a partial validation of the formal derivation of the macroscopic model from a microscopic formulation and shows that the former is a consistent approximation of an underlying particle dynamics, making it a powerful tool for the modeling of dynamical networks at a large scale.

Particle Interactions Mediated by Dynamical Networks: Assessment of Macroscopic Descriptions.

PubMed

Barré, J; Carrillo, J A; Degond, P; Peurichard, D; Zatorska, E

2018-01-01

We provide a numerical study of the macroscopic model of Barré et al. (Multiscale Model Simul, 2017, to appear) derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodeling process is very fast, the macroscopic model takes the form of a single aggregation-diffusion equation for the density of particles. The theoretical study of the macroscopic model gives precise criteria for the phase transitions of the steady states, and in the one-dimensional case, we show numerically that the stationary solutions of the microscopic model undergo the same phase transitions and bifurcation types as the macroscopic model. In the two-dimensional case, we show that the numerical simulations of the macroscopic model are in excellent agreement with the predicted theoretical values. This study provides a partial validation of the formal derivation of the macroscopic model from a microscopic formulation and shows that the former is a consistent approximation of an underlying particle dynamics, making it a powerful tool for the modeling of dynamical networks at a large scale.

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.

Asymptotic theory of time-varying social networks with heterogeneous activity and tie allocation.

PubMed

Ubaldi, Enrico; Perra, Nicola; Karsai, Márton; Vezzani, Alessandro; Burioni, Raffaella; Vespignani, Alessandro

2016-10-24

The dynamic of social networks is driven by the interplay between diverse mechanisms that still challenge our theoretical and modelling efforts. Amongst them, two are known to play a central role in shaping the networks evolution, namely the heterogeneous propensity of individuals to i) be socially active and ii) establish a new social relationships with their alters. Here, we empirically characterise these two mechanisms in seven real networks describing temporal human interactions in three different settings: scientific collaborations, Twitter mentions, and mobile phone calls. We find that the individuals' social activity and their strategy in choosing ties where to allocate their social interactions can be quantitatively described and encoded in a simple stochastic network modelling framework. The Master Equation of the model can be solved in the asymptotic limit. The analytical solutions provide an explicit description of both the system dynamic and the dynamical scaling laws characterising crucial aspects about the evolution of the networks. The analytical predictions match with accuracy the empirical observations, thus validating the theoretical approach. Our results provide a rigorous dynamical system framework that can be extended to include other processes shaping social dynamics and to generate data driven predictions for the asymptotic behaviour of social networks.

Asymptotic theory of time-varying social networks with heterogeneous activity and tie allocation

NASA Astrophysics Data System (ADS)

Ubaldi, Enrico; Perra, Nicola; Karsai, Márton; Vezzani, Alessandro; Burioni, Raffaella; Vespignani, Alessandro

2016-10-01

The dynamic of social networks is driven by the interplay between diverse mechanisms that still challenge our theoretical and modelling efforts. Amongst them, two are known to play a central role in shaping the networks evolution, namely the heterogeneous propensity of individuals to i) be socially active and ii) establish a new social relationships with their alters. Here, we empirically characterise these two mechanisms in seven real networks describing temporal human interactions in three different settings: scientific collaborations, Twitter mentions, and mobile phone calls. We find that the individuals’ social activity and their strategy in choosing ties where to allocate their social interactions can be quantitatively described and encoded in a simple stochastic network modelling framework. The Master Equation of the model can be solved in the asymptotic limit. The analytical solutions provide an explicit description of both the system dynamic and the dynamical scaling laws characterising crucial aspects about the evolution of the networks. The analytical predictions match with accuracy the empirical observations, thus validating the theoretical approach. Our results provide a rigorous dynamical system framework that can be extended to include other processes shaping social dynamics and to generate data driven predictions for the asymptotic behaviour of social networks.

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 neurons' excitability now varies in time sinuosoidally, thus simulating a parabolic bursting network. This time-varying excitability can lead to the emergence of macroscopic chaos and multistability in the collective behavior of the network. Finally, I expand the single population model described above to examine a two-population neuronal network where each population has its own unique mixture of excitable and spiking neurons, as well as its own coupling strength (either excitatory or inhibitory in nature). Specifically, I consider the situation where the first population is only allowed to influence the second population without any feedback, thus effectively creating a feed-forward "driver-response" system. In this special arrangement, the driver's asymptotic macroscopic dynamics are fully explored in the comprehensive analysis of the single population. Then, in the presence of an influence from the driver, the modified dynamics of the second population, which now acts as a response population, can also be fully analyzed. As in the time-varying model, these modifications give rise to richer dynamics to the response population than those found from the single population formalism, including multi-periodicity and chaos.

Epidemic threshold of the susceptible-infected-susceptible model on complex networks

NASA Astrophysics Data System (ADS)

Lee, Hyun Keun; Shim, Pyoung-Seop; Noh, Jae Dong

2013-06-01

We demonstrate that the susceptible-infected-susceptible (SIS) model on complex networks can have an inactive Griffiths phase characterized by a slow relaxation dynamics. It contrasts with the mean-field theoretical prediction that the SIS model on complex networks is active at any nonzero infection rate. The dynamic fluctuation of infected nodes, ignored in the mean field approach, is responsible for the inactive phase. It is proposed that the question whether the epidemic threshold of the SIS model on complex networks is zero or not can be resolved by the percolation threshold in a model where nodes are occupied in degree-descending order. Our arguments are supported by the numerical studies on scale-free network models.

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 conditions for (1) area aggregation and time-scale modeling in brain networks and for (2) pinning observability of nodes in dynamic graph networks. Simulation examples are given to illustrate the theoretical concepts. PMID:29051730

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 conditions for (1) area aggregation and time-scale modeling in brain networks and for (2) pinning observability of nodes in dynamic graph networks. Simulation examples are given to illustrate the theoretical concepts.

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.

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.

Opinion formation in time-varying social networks: The case of the naming game

NASA Astrophysics Data System (ADS)

Maity, Suman Kalyan; Manoj, T. Venkat; Mukherjee, Animesh

2012-09-01

We study the dynamics of the naming game as an opinion formation model on time-varying social networks. This agent-based model captures the essential features of the agreement dynamics by means of a memory-based negotiation process. Our study focuses on the impact of time-varying properties of the social network of the agents on the naming game dynamics. In particular, we perform a computational exploration of this model using simulations on top of real networks. We investigate the outcomes of the dynamics on two different types of time-varying data: (1) the networks vary on a day-to-day basis and (2) the networks vary within very short intervals of time (20 sec). In the first case, we find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the naming game in these networks maintains clusters of coexisting opinions indefinitely leading to metastability. In the second case, we investigate the evolution of the naming game in perfect synchronization with the time evolution of the underlying social network shedding new light on the traditional emergent properties of the game that differ largely from what has been reported in the existing literature.

Aperiodic dynamics in a deterministic adaptive network model of attitude formation in social groups

NASA Astrophysics Data System (ADS)

Ward, Jonathan A.; Grindrod, Peter

2014-07-01

Adaptive network models, in which node states and network topology coevolve, arise naturally in models of social dynamics that incorporate homophily and social influence. Homophily relates the similarity between pairs of nodes' states to their network coupling strength, whilst social influence causes coupled nodes' states to convergence. In this paper we propose a deterministic adaptive network model of attitude formation in social groups that includes these effects, and in which the attitudinal dynamics are represented by an activato-inhibitor process. We illustrate that consensus, corresponding to all nodes adopting the same attitudinal state and being fully connected, may destabilise via Turing instability, giving rise to aperiodic dynamics with sensitive dependence on initial conditions. These aperiodic dynamics correspond to the formation and dissolution of sub-groups that adopt contrasting attitudes. We discuss our findings in the context of cultural polarisation phenomena. Social influence. This reflects the fact that people tend to modify their behaviour and attitudes in response to the opinions of others [22-26]. We model social influence via diffusion: agents adjust their state according to a weighted sum (dictated by the evolving network) of the differences between their state and the states of their neighbours. Homophily. This relates the similarity of individuals' states to their frequency and strength of interaction [27]. Thus in our model, homophily drives the evolution of the weighted ‘social' network. A precise formulation of our model is given in Section 2. Social influence and homophily underpin models of social dynamics [21], which cover a wide range of sociological phenomena, including the diffusion of innovations [28-32], complex contagions [33-36], collective action [37-39], opinion dynamics [19,20,40,10,11,13,15,41,16], the emergence of social norms [42-44], group stability [45], social differentiation [46] and, of particular relevance here, cultural dissemination [47,12,48].Combining the effects of social influence and homophily naturally gives rise to an adaptive network, since social influence causes the states of agents that are strongly connected to become more similar, while homophily strengthens connections between agents whose states are already similar.1

On the robustness of complex heterogeneous gene expression networks.

PubMed

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

2005-04-01

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

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

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

Modeling Human Dynamics of Face-to-Face Interaction Networks

NASA Astrophysics Data System (ADS)

Starnini, Michele; Baronchelli, Andrea; Pastor-Satorras, Romualdo

2013-04-01

Face-to-face interaction networks describe social interactions in human gatherings, and are the substrate for processes such as epidemic spreading and gossip propagation. The bursty nature of human behavior characterizes many aspects of empirical data, such as the distribution of conversation lengths, of conversations per person, or of interconversation times. Despite several recent attempts, a general theoretical understanding of the global picture emerging from data is still lacking. Here we present a simple model that reproduces quantitatively most of the relevant features of empirical face-to-face interaction networks. The model describes agents that perform a random walk in a two-dimensional space and are characterized by an attractiveness whose effect is to slow down the motion of people around them. The proposed framework sheds light on the dynamics of human interactions and can improve the modeling of dynamical processes taking place on the ensuing dynamical social networks.

Spectra of random networks in the weak clustering regime

NASA Astrophysics Data System (ADS)

Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen; Rodrigues, Francisco A.

2018-03-01

The asymptotic behavior of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of traditional configuration models, networks generated through these models fail to describe many topological features of real-world networks, in particular non-null values of the clustering coefficient. Here we study effects of cycles of order three (triangles) in network spectra. By using recent advances in random matrix theory, we determine the spectral distribution of the network adjacency matrix as a function of the average number of triangles attached to each node for networks without modular structure and degree-degree correlations. Implications to network dynamics are discussed. Our findings can shed light in the study of how particular kinds of subgraphs influence network dynamics.

An ensemble of dynamic neural network identifiers for fault detection and isolation of gas turbine engines.

PubMed

Amozegar, M; Khorasani, K

2016-04-01

In this paper, a new approach for Fault Detection and Isolation (FDI) of gas turbine engines is proposed by developing an ensemble of dynamic neural network identifiers. For health monitoring of the gas turbine engine, its dynamics is first identified by constructing three separate or individual dynamic neural network architectures. Specifically, a dynamic multi-layer perceptron (MLP), a dynamic radial-basis function (RBF) neural network, and a dynamic support vector machine (SVM) are trained to individually identify and represent the gas turbine engine dynamics. Next, three ensemble-based techniques are developed to represent the gas turbine engine dynamics, namely, two heterogeneous ensemble models and one homogeneous ensemble model. It is first shown that all ensemble approaches do significantly improve the overall performance and accuracy of the developed system identification scheme when compared to each of the stand-alone solutions. The best selected stand-alone model (i.e., the dynamic RBF network) and the best selected ensemble architecture (i.e., the heterogeneous ensemble) in terms of their performances in achieving an accurate system identification are then selected for solving the FDI task. The required residual signals are generated by using both a single model-based solution and an ensemble-based solution under various gas turbine engine health conditions. Our extensive simulation studies demonstrate that the fault detection and isolation task achieved by using the residuals that are obtained from the dynamic ensemble scheme results in a significantly more accurate and reliable performance as illustrated through detailed quantitative confusion matrix analysis and comparative studies. Copyright © 2016 Elsevier Ltd. All rights reserved.

A Complex-Valued Firing-Rate Model That Approximates the Dynamics of Spiking Networks

PubMed Central

Schaffer, Evan S.; Ostojic, Srdjan; Abbott, L. F.

2013-01-01

Firing-rate models provide an attractive approach for studying large neural networks because they can be simulated rapidly and are amenable to mathematical analysis. Traditional firing-rate models assume a simple form in which the dynamics are governed by a single time constant. These models fail to replicate certain dynamic features of populations of spiking neurons, especially those involving synchronization. We present a complex-valued firing-rate model derived from an eigenfunction expansion of the Fokker-Planck equation and apply it to the linear, quadratic and exponential integrate-and-fire models. Despite being almost as simple as a traditional firing-rate description, this model can reproduce firing-rate dynamics due to partial synchronization of the action potentials in a spiking model, and it successfully predicts the transition to spike synchronization in networks of coupled excitatory and inhibitory neurons. PMID:24204236

Development of dynamic Bayesian models for web application test management

NASA Astrophysics Data System (ADS)

Azarnova, T. V.; Polukhin, P. V.; Bondarenko, Yu V.; Kashirina, I. L.

2018-03-01

The mathematical apparatus of dynamic Bayesian networks is an effective and technically proven tool that can be used to model complex stochastic dynamic processes. According to the results of the research, mathematical models and methods of dynamic Bayesian networks provide a high coverage of stochastic tasks associated with error testing in multiuser software products operated in a dynamically changing environment. Formalized representation of the discrete test process as a dynamic Bayesian model allows us to organize the logical connection between individual test assets for multiple time slices. This approach gives an opportunity to present testing as a discrete process with set structural components responsible for the generation of test assets. Dynamic Bayesian network-based models allow us to combine in one management area individual units and testing components with different functionalities and a direct influence on each other in the process of comprehensive testing of various groups of computer bugs. The application of the proposed models provides an opportunity to use a consistent approach to formalize test principles and procedures, methods used to treat situational error signs, and methods used to produce analytical conclusions based on test results.

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.

Thinking outside the channel: Modeling nitrogen cycling in networked river ecosystems

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

Helton, Ashley; Poole, Geoffrey C.; Meyer, Judy

2011-01-01

Agricultural and urban development alters nitrogen and other biogeochemical cycles in rivers worldwide. Because such biogeochemical processes cannot be measured empirically across whole river networks, simulation models are critical tools for understanding river-network biogeochemistry. However, limitations inherent in current models restrict our ability to simulate biogeochemical dynamics among diverse river networks. We illustrate these limitations using a river-network model to scale up in situ measures of nitrogen cycling in eight catchments spanning various geophysical and land-use conditions. Our model results provide evidence that catchment characteristics typically excluded from models may control river-network biogeochemistry. Based on our findings, we identify importantmore » components of a revised strategy for simulating biogeochemical dynamics in river networks, including approaches to modeling terrestrial-aquatic linkages, hydrologic exchanges between the channel, floodplain/riparian complex, and subsurface waters, and interactions between coupled biogeochemical cycles.« less

Cognitive Network Modeling as a Basis for Characterizing Human Communication Dynamics and Belief Contagion in Technology Adoption

NASA Technical Reports Server (NTRS)

Hutto, Clayton; Briscoe, Erica; Trewhitt, Ethan

2012-01-01

Societal level macro models of social behavior do not sufficiently capture nuances needed to adequately represent the dynamics of person-to-person interactions. Likewise, individual agent level micro models have limited scalability - even minute parameter changes can drastically affect a model's response characteristics. This work presents an approach that uses agent-based modeling to represent detailed intra- and inter-personal interactions, as well as a system dynamics model to integrate societal-level influences via reciprocating functions. A Cognitive Network Model (CNM) is proposed as a method of quantitatively characterizing cognitive mechanisms at the intra-individual level. To capture the rich dynamics of interpersonal communication for the propagation of beliefs and attitudes, a Socio-Cognitive Network Model (SCNM) is presented. The SCNM uses socio-cognitive tie strength to regulate how agents influence--and are influenced by--one another's beliefs during social interactions. We then present experimental results which support the use of this network analytical approach, and we discuss its applicability towards characterizing and understanding human information processing.

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

PubMed Central

2017-01-01

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

Bifurcation Analysis on Phase-Amplitude Cross-Frequency Coupling in Neural Networks with Dynamic Synapses

PubMed Central

Sase, Takumi; Katori, Yuichi; Komuro, Motomasa; Aihara, Kazuyuki

2017-01-01

We investigate a discrete-time network model composed of excitatory and inhibitory neurons and dynamic synapses with the aim at revealing dynamical properties behind oscillatory phenomena possibly related to brain functions. We use a stochastic neural network model to derive the corresponding macroscopic mean field dynamics, and subsequently analyze the dynamical properties of the network. In addition to slow and fast oscillations arising from excitatory and inhibitory networks, respectively, we show that the interaction between these two networks generates phase-amplitude cross-frequency coupling (CFC), in which multiple different frequency components coexist and the amplitude of the fast oscillation is modulated by the phase of the slow oscillation. Furthermore, we clarify the detailed properties of the oscillatory phenomena by applying the bifurcation analysis to the mean field model, and accordingly show that the intermittent and the continuous CFCs can be characterized by an aperiodic orbit on a closed curve and one on a torus, respectively. These two CFC modes switch depending on the coupling strength from the excitatory to inhibitory networks, via the saddle-node cycle bifurcation of a one-dimensional torus in map (MT1SNC), and may be associated with the function of multi-item representation. We believe that the present model might have potential for studying possible functional roles of phase-amplitude CFC in the cerebral cortex. PMID:28424606

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

An opinion-driven behavioral dynamics model for addictive behaviors

DOE PAGES

Moore, Thomas W.; Finley, Patrick D.; Apelberg, Benjamin J.; ...

2015-04-08

We present a model of behavioral dynamics that combines a social network-based opinion dynamics model with behavioral mapping. The behavioral component is discrete and history-dependent to represent situations in which an individual’s behavior is initially driven by opinion and later constrained by physiological or psychological conditions that serve to maintain the behavior. Additionally, individuals are modeled as nodes in a social network connected by directed edges. Parameter sweeps illustrate model behavior and the effects of individual parameters and parameter interactions on model results. Mapping a continuous opinion variable into a discrete behavioral space induces clustering on directed networks. Clusters providemore » targets of opportunity for influencing the network state; however, the smaller the network the greater the stochasticity and potential variability in outcomes. Furthermore, this has implications both for behaviors that are influenced by close relationships verses those influenced by societal norms and for the effectiveness of strategies for influencing those behaviors.« less

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.

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 with distal gap junctions.

Oscillatory network with self-organized dynamical connections for synchronization-based image segmentation.

PubMed

Kuzmina, Margarita; Manykin, Eduard; Surina, Irina

2004-01-01

An oscillatory network of columnar architecture located in 3D spatial lattice was recently designed by the authors as oscillatory model of the brain visual cortex. Single network oscillator is a relaxational neural oscillator with internal dynamics tunable by visual image characteristics - local brightness and elementary bar orientation. It is able to demonstrate either activity state (stable undamped oscillations) or "silence" (quickly damped oscillations). Self-organized nonlocal dynamical connections of oscillators depend on oscillator activity levels and orientations of cortical receptive fields. Network performance consists in transfer into a state of clusterized synchronization. At current stage grey-level image segmentation tasks are carried out by 2D oscillatory network, obtained as a limit version of the source model. Due to supplemented network coupling strength control the 2D reduced network provides synchronization-based image segmentation. New results on segmentation of brightness and texture images presented in the paper demonstrate accurate network performance and informative visualization of segmentation results, inherent in the model.

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

Ng, B

This survey gives an overview of popular generative models used in the modeling of stochastic temporal systems. In particular, this survey is organized into two parts. The first part discusses the discrete-time representations of dynamic Bayesian networks and dynamic relational probabilistic models, while the second part discusses the continuous-time representation of continuous-time Bayesian networks.

Dynamic Bayesian Network Modeling of Game Based Diagnostic Assessments. CRESST Report 837

ERIC Educational Resources Information Center

Levy, Roy

2014-01-01

Digital games offer an appealing environment for assessing student proficiencies, including skills and misconceptions in a diagnostic setting. This paper proposes a dynamic Bayesian network modeling approach for observations of student performance from an educational video game. A Bayesian approach to model construction, calibration, and use in…

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.

Overlapping community detection based on link graph using distance dynamics

NASA Astrophysics Data System (ADS)

Chen, Lei; Zhang, Jing; Cai, Li-Jun

2018-01-01

The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

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.

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

PubMed

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

2012-08-01

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

Heterogeneous network promotes species coexistence: metapopulation model for rock-paper-scissors game.

PubMed

Nagatani, Takashi; Ichinose, Genki; Tainaka, Kei-Ichi

2018-05-04

Understanding mechanisms of biodiversity has been a central question in ecology. The coexistence of three species in rock-paper-scissors (RPS) systems are discussed by many authors; however, the relation between coexistence and network structure is rarely discussed. Here we present a metapopulation model for RPS game. The total population is assumed to consist of three subpopulations (nodes). Each individual migrates by random walk; the destination of migration is randomly determined. From reaction-migration equations, we obtain the population dynamics. It is found that the dynamic highly depends on network structures. When a network is homogeneous, the dynamics are neutrally stable: each node has a periodic solution, and the oscillations synchronize in all nodes. However, when a network is heterogeneous, the dynamics approach stable focus and all nodes reach equilibriums with different densities. Hence, the heterogeneity of the network promotes biodiversity.

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.

Multiple tipping points and optimal repairing in interacting networks

PubMed Central

Majdandzic, Antonio; Braunstein, Lidia A.; Curme, Chester; Vodenska, Irena; Levy-Carciente, Sary; Eugene Stanley, H.; Havlin, Shlomo

2016-01-01

Systems composed of many interacting dynamical networks—such as the human body with its biological networks or the global economic network consisting of regional clusters—often exhibit complicated collective dynamics. Three fundamental processes that are typically present are failure, damage spread and recovery. Here we develop a model for such systems and find a very rich phase diagram that becomes increasingly more complex as the number of interacting networks increases. In the simplest example of two interacting networks we find two critical points, four triple points, ten allowed transitions and two ‘forbidden' transitions, as well as complex hysteresis loops. Remarkably, we find that triple points play the dominant role in constructing the optimal repairing strategy in damaged interacting systems. To test our model, we analyse an example of real interacting financial networks and find evidence of rapid dynamical transitions between well-defined states, in agreement with the predictions of our model. PMID:26926803

Mathematical modeling and computational prediction of cancer drug resistance.

PubMed

Sun, Xiaoqiang; Hu, Bin

2017-06-23

Diverse forms of resistance to anticancer drugs can lead to the failure of chemotherapy. Drug resistance is one of the most intractable issues for successfully treating cancer in current clinical practice. Effective clinical approaches that could counter drug resistance by restoring the sensitivity of tumors to the targeted agents are urgently needed. As numerous experimental results on resistance mechanisms have been obtained and a mass of high-throughput data has been accumulated, mathematical modeling and computational predictions using systematic and quantitative approaches have become increasingly important, as they can potentially provide deeper insights into resistance mechanisms, generate novel hypotheses or suggest promising treatment strategies for future testing. In this review, we first briefly summarize the current progress of experimentally revealed resistance mechanisms of targeted therapy, including genetic mechanisms, epigenetic mechanisms, posttranslational mechanisms, cellular mechanisms, microenvironmental mechanisms and pharmacokinetic mechanisms. Subsequently, we list several currently available databases and Web-based tools related to drug sensitivity and resistance. Then, we focus primarily on introducing some state-of-the-art computational methods used in drug resistance studies, including mechanism-based mathematical modeling approaches (e.g. molecular dynamics simulation, kinetic model of molecular networks, ordinary differential equation model of cellular dynamics, stochastic model, partial differential equation model, agent-based model, pharmacokinetic-pharmacodynamic model, etc.) and data-driven prediction methods (e.g. omics data-based conventional screening approach for node biomarkers, static network approach for edge biomarkers and module biomarkers, dynamic network approach for dynamic network biomarkers and dynamic module network biomarkers, etc.). Finally, we discuss several further questions and future directions for the use of computational methods for studying drug resistance, including inferring drug-induced signaling networks, multiscale modeling, drug combinations and precision medicine. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Forecasting influenza-like illness dynamics for military populations using neural networks and social media

DOE PAGES

Volkova, Svitlana; Ayton, Ellyn; Porterfield, Katherine; ...

2017-12-15

This work is the first to take advantage of recurrent neural networks to predict influenza-like-illness (ILI) dynamics from various linguistic signals extracted from social media data. Unlike other approaches that rely on timeseries analysis of historical ILI data [1, 2] and the state-of-the-art machine learning models [3, 4], we build and evaluate the predictive power of Long Short Term Memory (LSTMs) architectures capable of nowcasting (predicting in \\real-time") and forecasting (predicting the future) ILI dynamics in the 2011 { 2014 influenza seasons. To build our models we integrate information people post in social media e.g., topics, stylistic and syntactic patterns,more » emotions and opinions, and communication behavior. We then quantitatively evaluate the predictive power of different social media signals and contrast the performance of the-state-of-the-art regression models with neural networks. Finally, we combine ILI and social media signals to build joint neural network models for ILI dynamics prediction. Unlike the majority of the existing work, we specifically focus on developing models for local rather than national ILI surveillance [1], specifically for military rather than general populations [3] in 26 U.S. and six international locations. Our approach demonstrates several advantages: (a) Neural network models learned from social media data yield the best performance compared to previously used regression models. (b) Previously under-explored language and communication behavior features are more predictive of ILI dynamics than syntactic and stylistic signals expressed in social media. (c) Neural network models learned exclusively from social media signals yield comparable or better performance to the models learned from ILI historical data, thus, signals from social media can be potentially used to accurately forecast ILI dynamics for the regions where ILI historical data is not available. (d) Neural network models learned from combined ILI and social media signals significantly outperform models that rely solely on ILI historical data, which adds to a great potential of alternative public sources for ILI dynamics prediction. (e) Location-specific models outperform previously used location-independent models e.g., U.S. only. (f) Prediction results significantly vary across geolocations depending on the amount of social media data available and ILI activity patterns.« less

Forecasting influenza-like illness dynamics for military populations using neural networks and social media

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

Volkova, Svitlana; Ayton, Ellyn; Porterfield, Katherine

This work is the first to take advantage of recurrent neural networks to predict influenza-like-illness (ILI) dynamics from various linguistic signals extracted from social media data. Unlike other approaches that rely on timeseries analysis of historical ILI data [1, 2] and the state-of-the-art machine learning models [3, 4], we build and evaluate the predictive power of Long Short Term Memory (LSTMs) architectures capable of nowcasting (predicting in \\real-time") and forecasting (predicting the future) ILI dynamics in the 2011 { 2014 influenza seasons. To build our models we integrate information people post in social media e.g., topics, stylistic and syntactic patterns,more » emotions and opinions, and communication behavior. We then quantitatively evaluate the predictive power of different social media signals and contrast the performance of the-state-of-the-art regression models with neural networks. Finally, we combine ILI and social media signals to build joint neural network models for ILI dynamics prediction. Unlike the majority of the existing work, we specifically focus on developing models for local rather than national ILI surveillance [1], specifically for military rather than general populations [3] in 26 U.S. and six international locations. Our approach demonstrates several advantages: (a) Neural network models learned from social media data yield the best performance compared to previously used regression models. (b) Previously under-explored language and communication behavior features are more predictive of ILI dynamics than syntactic and stylistic signals expressed in social media. (c) Neural network models learned exclusively from social media signals yield comparable or better performance to the models learned from ILI historical data, thus, signals from social media can be potentially used to accurately forecast ILI dynamics for the regions where ILI historical data is not available. (d) Neural network models learned from combined ILI and social media signals significantly outperform models that rely solely on ILI historical data, which adds to a great potential of alternative public sources for ILI dynamics prediction. (e) Location-specific models outperform previously used location-independent models e.g., U.S. only. (f) Prediction results significantly vary across geolocations depending on the amount of social media data available and ILI activity patterns.« less

Forecasting influenza-like illness dynamics for military populations using neural networks and social media

PubMed Central

Ayton, Ellyn; Porterfield, Katherine; Corley, Courtney D.

2017-01-01

This work is the first to take advantage of recurrent neural networks to predict influenza-like illness (ILI) dynamics from various linguistic signals extracted from social media data. Unlike other approaches that rely on timeseries analysis of historical ILI data and the state-of-the-art machine learning models, we build and evaluate the predictive power of neural network architectures based on Long Short Term Memory (LSTMs) units capable of nowcasting (predicting in “real-time”) and forecasting (predicting the future) ILI dynamics in the 2011 – 2014 influenza seasons. To build our models we integrate information people post in social media e.g., topics, embeddings, word ngrams, stylistic patterns, and communication behavior using hashtags and mentions. We then quantitatively evaluate the predictive power of different social media signals and contrast the performance of the-state-of-the-art regression models with neural networks using a diverse set of evaluation metrics. Finally, we combine ILI and social media signals to build a joint neural network model for ILI dynamics prediction. Unlike the majority of the existing work, we specifically focus on developing models for local rather than national ILI surveillance, specifically for military rather than general populations in 26 U.S. and six international locations., and analyze how model performance depends on the amount of social media data available per location. Our approach demonstrates several advantages: (a) Neural network architectures that rely on LSTM units trained on social media data yield the best performance compared to previously used regression models. (b) Previously under-explored language and communication behavior features are more predictive of ILI dynamics than stylistic and topic signals expressed in social media. (c) Neural network models learned exclusively from social media signals yield comparable or better performance to the models learned from ILI historical data, thus, signals from social media can be potentially used to accurately forecast ILI dynamics for the regions where ILI historical data is not available. (d) Neural network models learned from combined ILI and social media signals significantly outperform models that rely solely on ILI historical data, which adds to a great potential of alternative public sources for ILI dynamics prediction. (e) Location-specific models outperform previously used location-independent models e.g., U.S. only. (f) Prediction results significantly vary across geolocations depending on the amount of social media data available and ILI activity patterns. (g) Model performance improves with more tweets available per geo-location e.g., the error gets lower and the Pearson score gets higher for locations with more tweets. PMID:29244814

Forecasting influenza-like illness dynamics for military populations using neural networks and social media.

PubMed

Volkova, Svitlana; Ayton, Ellyn; Porterfield, Katherine; Corley, Courtney D

2017-01-01

This work is the first to take advantage of recurrent neural networks to predict influenza-like illness (ILI) dynamics from various linguistic signals extracted from social media data. Unlike other approaches that rely on timeseries analysis of historical ILI data and the state-of-the-art machine learning models, we build and evaluate the predictive power of neural network architectures based on Long Short Term Memory (LSTMs) units capable of nowcasting (predicting in "real-time") and forecasting (predicting the future) ILI dynamics in the 2011 - 2014 influenza seasons. To build our models we integrate information people post in social media e.g., topics, embeddings, word ngrams, stylistic patterns, and communication behavior using hashtags and mentions. We then quantitatively evaluate the predictive power of different social media signals and contrast the performance of the-state-of-the-art regression models with neural networks using a diverse set of evaluation metrics. Finally, we combine ILI and social media signals to build a joint neural network model for ILI dynamics prediction. Unlike the majority of the existing work, we specifically focus on developing models for local rather than national ILI surveillance, specifically for military rather than general populations in 26 U.S. and six international locations., and analyze how model performance depends on the amount of social media data available per location. Our approach demonstrates several advantages: (a) Neural network architectures that rely on LSTM units trained on social media data yield the best performance compared to previously used regression models. (b) Previously under-explored language and communication behavior features are more predictive of ILI dynamics than stylistic and topic signals expressed in social media. (c) Neural network models learned exclusively from social media signals yield comparable or better performance to the models learned from ILI historical data, thus, signals from social media can be potentially used to accurately forecast ILI dynamics for the regions where ILI historical data is not available. (d) Neural network models learned from combined ILI and social media signals significantly outperform models that rely solely on ILI historical data, which adds to a great potential of alternative public sources for ILI dynamics prediction. (e) Location-specific models outperform previously used location-independent models e.g., U.S. only. (f) Prediction results significantly vary across geolocations depending on the amount of social media data available and ILI activity patterns. (g) Model performance improves with more tweets available per geo-location e.g., the error gets lower and the Pearson score gets higher for locations with more tweets.

The many faces of graph dynamics

NASA Astrophysics Data System (ADS)

Pignolet, Yvonne Anne; Roy, Matthieu; Schmid, Stefan; Tredan, Gilles

2017-06-01

The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

Heteroclinic dynamics of coupled semiconductor lasers with optoelectronic feedback.

PubMed

Shahin, S; Vallini, F; Monifi, F; Rabinovich, M; Fainman, Y

2016-11-15

Generalized Lotka-Volterra (GLV) equations are important equations used in various areas of science to describe competitive dynamics among a population of N interacting nodes in a network topology. In this Letter, we introduce a photonic network consisting of three optoelectronically cross-coupled semiconductor lasers to realize a GLV model. In such a network, the interaction of intensity and carrier inversion rates, as well as phases of laser oscillator nodes, result in various dynamics. We study the influence of asymmetric coupling strength and frequency detuning between semiconductor lasers and show that inhibitory asymmetric coupling is required to achieve consecutive amplitude oscillations of the laser nodes. These studies were motivated primarily by the dynamical models used to model brain cognitive activities and their correspondence with dynamics obtained among coupled laser oscillators.

Hybrid discrete-time neural networks.

PubMed

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

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. Moreover, we show what minimal microscopic interaction rules determine whether the transition to collective motion is continuous or discontinuous. Second, we consider a model of opinion formation in groups of individuals, where we focus on the effect of directed links in adaptive networks. Extending the adaptive voter model to directed networks, we find a novel fragmentation mechanism, by which the network breaks into distinct components of opposing agents. This fragmentation is mediated by the formation of self-stabilizing structures in the network, which do not occur in the undirected case. We find that they are related to degree correlations stemming from the interplay of link directionality and adaptive topological change. Third, we discuss a model for the evolution of cooperation among self-interested agents, in which the adaptive nature of their interaction network gives rise to a novel dynamical mechanism promoting cooperation. We show that even full cooperation can be achieved asymptotically if the networks' adaptive response to the agents' dynamics is sufficiently fast.

A Neural Network Model of the Structure and Dynamics of Human Personality

ERIC Educational Resources Information Center

Read, Stephen J.; Monroe, Brian M.; Brownstein, Aaron L.; Yang, Yu; Chopra, Gurveen; Miller, Lynn C.

2010-01-01

We present a neural network model that aims to bridge the historical gap between dynamic and structural approaches to personality. The model integrates work on the structure of the trait lexicon, the neurobiology of personality, temperament, goal-based models of personality, and an evolutionary analysis of motives. It is organized in terms of two…

Deconstructing the core dynamics from a complex time-lagged regulatory biological circuit.

PubMed

Eriksson, O; Brinne, B; Zhou, Y; Björkegren, J; Tegnér, J

2009-03-01

Complex regulatory dynamics is ubiquitous in molecular networks composed of genes and proteins. Recent progress in computational biology and its application to molecular data generate a growing number of complex networks. Yet, it has been difficult to understand the governing principles of these networks beyond graphical analysis or extensive numerical simulations. Here the authors exploit several simplifying biological circumstances which thereby enable to directly detect the underlying dynamical regularities driving periodic oscillations in a dynamical nonlinear computational model of a protein-protein network. System analysis is performed using the cell cycle, a mathematically well-described complex regulatory circuit driven by external signals. By introducing an explicit time delay and using a 'tearing-and-zooming' approach the authors reduce the system to a piecewise linear system with two variables that capture the dynamics of this complex network. A key step in the analysis is the identification of functional subsystems by identifying the relations between state-variables within the model. These functional subsystems are referred to as dynamical modules operating as sensitive switches in the original complex model. By using reduced mathematical representations of the subsystems the authors derive explicit conditions on how the cell cycle dynamics depends on system parameters, and can, for the first time, analyse and prove global conditions for system stability. The approach which includes utilising biological simplifying conditions, identification of dynamical modules and mathematical reduction of the model complexity may be applicable to other well-characterised biological regulatory circuits. [Includes supplementary material].

Generalized Tavis-Cummings models and quantum networks

NASA Astrophysics Data System (ADS)

Gorokhov, A. V.

2018-04-01

The properties of quantum networks based on generalized Tavis-Cummings models are theoretically investigated. We have calculated the information transfer success rate from one node to another in a simple model of a quantum network realized with two-level atoms placed in the cavities and interacting with an external laser field and cavity photons. The method of dynamical group of the Hamiltonian and technique of corresponding coherent states were used for investigation of the temporal dynamics of the two nodes model.

Modeling socio-cultural processes in network-centric environments

NASA Astrophysics Data System (ADS)

Santos, Eunice E.; Santos, Eugene, Jr.; Korah, John; George, Riya; Gu, Qi; Kim, Keumjoo; Li, Deqing; Russell, Jacob; Subramanian, Suresh

2012-05-01

The major focus in the field of modeling & simulation for network centric environments has been on the physical layer while making simplifications for the human-in-the-loop. However, the human element has a big impact on the capabilities of network centric systems. Taking into account the socio-behavioral aspects of processes such as team building, group decision-making, etc. are critical to realistically modeling and analyzing system performance. Modeling socio-cultural processes is a challenge because of the complexity of the networks, dynamism in the physical and social layers, feedback loops and uncertainty in the modeling data. We propose an overarching framework to represent, model and analyze various socio-cultural processes within network centric environments. The key innovation in our methodology is to simultaneously model the dynamism in both the physical and social layers while providing functional mappings between them. We represent socio-cultural information such as friendships, professional relationships and temperament by leveraging the Culturally Infused Social Network (CISN) framework. The notion of intent is used to relate the underlying socio-cultural factors to observed behavior. We will model intent using Bayesian Knowledge Bases (BKBs), a probabilistic reasoning network, which can represent incomplete and uncertain socio-cultural information. We will leverage previous work on a network performance modeling framework called Network-Centric Operations Performance and Prediction (N-COPP) to incorporate dynamism in various aspects of the physical layer such as node mobility, transmission parameters, etc. We validate our framework by simulating a suitable scenario, incorporating relevant factors and providing analyses of the results.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator.

PubMed

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator

PubMed Central

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation. PMID:28596730

Bayesian switching factor analysis for estimating time-varying functional connectivity in fMRI.

PubMed

Taghia, Jalil; Ryali, Srikanth; Chen, Tianwen; Supekar, Kaustubh; Cai, Weidong; Menon, Vinod

2017-07-15

There is growing interest in understanding the dynamical properties of functional interactions between distributed brain regions. However, robust estimation of temporal dynamics from functional magnetic resonance imaging (fMRI) data remains challenging due to limitations in extant multivariate methods for modeling time-varying functional interactions between multiple brain areas. Here, we develop a Bayesian generative model for fMRI time-series within the framework of hidden Markov models (HMMs). The model is a dynamic variant of the static factor analysis model (Ghahramani and Beal, 2000). We refer to this model as Bayesian switching factor analysis (BSFA) as it integrates factor analysis into a generative HMM in a unified Bayesian framework. In BSFA, brain dynamic functional networks are represented by latent states which are learnt from the data. Crucially, BSFA is a generative model which estimates the temporal evolution of brain states and transition probabilities between states as a function of time. An attractive feature of BSFA is the automatic determination of the number of latent states via Bayesian model selection arising from penalization of excessively complex models. Key features of BSFA are validated using extensive simulations on carefully designed synthetic data. We further validate BSFA using fingerprint analysis of multisession resting-state fMRI data from the Human Connectome Project (HCP). Our results show that modeling temporal dependencies in the generative model of BSFA results in improved fingerprinting of individual participants. Finally, we apply BSFA to elucidate the dynamic functional organization of the salience, central-executive, and default mode networks-three core neurocognitive systems with central role in cognitive and affective information processing (Menon, 2011). Across two HCP sessions, we demonstrate a high level of dynamic interactions between these networks and determine that the salience network has the highest temporal flexibility among the three networks. Our proposed methods provide a novel and powerful generative model for investigating dynamic brain connectivity. Copyright © 2017 Elsevier Inc. All rights reserved.

A model of gene expression based on random dynamical systems reveals modularity properties of gene regulatory networks.

PubMed

Antoneli, Fernando; Ferreira, Renata C; Briones, Marcelo R S

2016-06-01

Here we propose a new approach to modeling gene expression based on the theory of random dynamical systems (RDS) that provides a general coupling prescription between the nodes of any given regulatory network given the dynamics of each node is modeled by a RDS. The main virtues of this approach are the following: (i) it provides a natural way to obtain arbitrarily large networks by coupling together simple basic pieces, thus revealing the modularity of regulatory networks; (ii) the assumptions about the stochastic processes used in the modeling are fairly general, in the sense that the only requirement is stationarity; (iii) there is a well developed mathematical theory, which is a blend of smooth dynamical systems theory, ergodic theory and stochastic analysis that allows one to extract relevant dynamical and statistical information without solving the system; (iv) one may obtain the classical rate equations form the corresponding stochastic version by averaging the dynamic random variables (small noise limit). It is important to emphasize that unlike the deterministic case, where coupling two equations is a trivial matter, coupling two RDS is non-trivial, specially in our case, where the coupling is performed between a state variable of one gene and the switching stochastic process of another gene and, hence, it is not a priori true that the resulting coupled system will satisfy the definition of a random dynamical system. We shall provide the necessary arguments that ensure that our coupling prescription does indeed furnish a coupled regulatory network of random dynamical systems. Finally, the fact that classical rate equations are the small noise limit of our stochastic model ensures that any validation or prediction made on the basis of the classical theory is also a validation or prediction of our model. We illustrate our framework with some simple examples of single-gene system and network motifs. Copyright © 2016 Elsevier Inc. All rights reserved.

Proximity Networks and Epidemics

NASA Astrophysics Data System (ADS)

Guclu, Hasan; Toroczkai, Zoltán

2007-03-01

We presented the basis of a framework to account for the dynamics of contacts in epidemic processes, through the notion of dynamic proximity graphs. By varying the integration time-parameter T, which is the period of infectivity one can give a simple account for some of the differences in the observed contact networks for different diseases, such as smallpox, or AIDS. Our simplistic model also seems to shed some light on the shape of the degree distribution of the measured people-people contact network from the EPISIM data. We certainly do not claim that the simplistic graph integration model above is a good model for dynamic contact graphs. It only contains the essential ingredients for such processes to produce a qualitative agreement with some observations. We expect that further refinements and extensions to this picture, in particular deriving the link-probabilities in the dynamic proximity graph from more realistic contact dynamics should improve the agreement between models and data.

Dynamics of cullin-RING ubiquitin ligase network revealed by systematic quantitative proteomics

PubMed Central

Bennett, Eric J.; Rush, John; Gygi, Steven P.; Harper, J. Wade

2010-01-01

Dynamic reorganization of signaling systems frequently accompany pathway perturbations, yet quantitative studies of network remodeling by pathway stimuli are lacking. Here, we report the development of a quantitative proteomics platform centered on multiplex Absolute Quantification (AQUA) technology to elucidate the architecture of the cullin-RING ubiquitin ligase (CRL) network and to evaluate current models of dynamic CRL remodeling. Current models suggest that CRL complexes are controlled by cycles of CRL deneddylation and CAND1 binding. Contrary to expectations, acute CRL inhibition with MLN4924, an inhibitor of the NEDD8-activating enzyme, does not result in a global reorganization of the CRL network. Examination of CRL complex stoichiometry reveals that, independent of cullin neddylation, a large fraction of cullins are assembled with adaptor modules while only a small fraction are associated with CAND1. These studies suggest an alternative model of CRL dynamicity where the abundance of adaptor modules, rather than cycles of neddylation and CAND1 binding, drives CRL network organization. PMID:21145461

Dynamics of cullin-RING ubiquitin ligase network revealed by systematic quantitative proteomics.

PubMed

Bennett, Eric J; Rush, John; Gygi, Steven P; Harper, J Wade

2010-12-10

Dynamic reorganization of signaling systems frequently accompanies pathway perturbations, yet quantitative studies of network remodeling by pathway stimuli are lacking. Here, we report the development of a quantitative proteomics platform centered on multiplex absolute quantification (AQUA) technology to elucidate the architecture of the cullin-RING ubiquitin ligase (CRL) network and to evaluate current models of dynamic CRL remodeling. Current models suggest that CRL complexes are controlled by cycles of CRL deneddylation and CAND1 binding. Contrary to expectations, acute CRL inhibition with MLN4924, an inhibitor of the NEDD8-activating enzyme, does not result in a global reorganization of the CRL network. Examination of CRL complex stoichiometry reveals that, independent of cullin neddylation, a large fraction of cullins are assembled with adaptor modules, whereas only a small fraction are associated with CAND1. These studies suggest an alternative model of CRL dynamicity where the abundance of adaptor modules, rather than cycles of neddylation and CAND1 binding, drives CRL network organization. Copyright © 2010 Elsevier Inc. All rights reserved.

A model for simulating adaptive, dynamic flows on networks: Application to petroleum infrastructure

DOE PAGES

Corbet, Thomas F.; Beyeler, Walt; Wilson, Michael L.; ...

2017-10-03

Simulation models can greatly improve decisions meant to control the consequences of disruptions to critical infrastructures. We describe a dynamic flow model on networks purposed to inform analyses by those concerned about consequences of disruptions to infrastructures and to help policy makers design robust mitigations. We conceptualize the adaptive responses of infrastructure networks to perturbations as market transactions and business decisions of operators. We approximate commodity flows in these networks by a diffusion equation, with nonlinearities introduced to model capacity limits. To illustrate the behavior and scalability of the model, we show its application first on two simple networks, thenmore » on petroleum infrastructure in the United States, where we analyze the effects of a hypothesized earthquake.« less

A model for simulating adaptive, dynamic flows on networks: Application to petroleum infrastructure

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

Corbet, Thomas F.; Beyeler, Walt; Wilson, Michael L.

Simulation models can greatly improve decisions meant to control the consequences of disruptions to critical infrastructures. We describe a dynamic flow model on networks purposed to inform analyses by those concerned about consequences of disruptions to infrastructures and to help policy makers design robust mitigations. We conceptualize the adaptive responses of infrastructure networks to perturbations as market transactions and business decisions of operators. We approximate commodity flows in these networks by a diffusion equation, with nonlinearities introduced to model capacity limits. To illustrate the behavior and scalability of the model, we show its application first on two simple networks, thenmore » on petroleum infrastructure in the United States, where we analyze the effects of a hypothesized earthquake.« less

Dynamic behavior of the interaction between epidemics and cascades on heterogeneous networks

NASA Astrophysics Data System (ADS)

Jiang, Lurong; Jin, Xinyu; Xia, Yongxiang; Ouyang, Bo; Wu, Duanpo

2014-12-01

Epidemic spreading and cascading failure are two important dynamical processes on complex networks. They have been investigated separately for a long time. But in the real world, these two dynamics sometimes may interact with each other. In this paper, we explore a model combined with the SIR epidemic spreading model and a local load sharing cascading failure model. There exists a critical value of the tolerance parameter for which the epidemic with high infection probability can spread out and infect a fraction of the network in this model. When the tolerance parameter is smaller than the critical value, the cascading failure cuts off the abundance of paths and blocks the spreading of the epidemic locally. While the tolerance parameter is larger than the critical value, the epidemic spreads out and infects a fraction of the network. A method for estimating the critical value is proposed. In simulations, we verify the effectiveness of this method in the uncorrelated configuration model (UCM) scale-free networks.

Balancing building and maintenance costs in growing transport networks

NASA Astrophysics Data System (ADS)

Bottinelli, Arianna; Louf, Rémi; Gherardi, Marco

2017-09-01

The costs associated to the length of links impose unavoidable constraints to the growth of natural and artificial transport networks. When future network developments cannot be predicted, the costs of building and maintaining connections cannot be minimized simultaneously, requiring competing optimization mechanisms. Here, we study a one-parameter nonequilibrium model driven by an optimization functional, defined as the convex combination of building cost and maintenance cost. By varying the coefficient of the combination, the model interpolates between global and local length minimization, i.e., between minimum spanning trees and a local version known as dynamical minimum spanning trees. We show that cost balance within this ensemble of dynamical networks is a sufficient ingredient for the emergence of tradeoffs between the network's total length and transport efficiency, and of optimal strategies of construction. At the transition between two qualitatively different regimes, the dynamics builds up power-law distributed waiting times between global rearrangements, indicating a point of nonoptimality. Finally, we use our model as a framework to analyze empirical ant trail networks, showing its relevance as a null model for cost-constrained network formation.

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…

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.

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

PubMed

Nochomovitz, Yigal D; Li, Hao

2006-03-14

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

Self-organizing radial basis function networks for adaptive flight control and aircraft engine state estimation

NASA Astrophysics Data System (ADS)

Shankar, Praveen

The performance of nonlinear control algorithms such as feedback linearization and dynamic inversion is heavily dependent on the fidelity of the dynamic model being inverted. Incomplete or incorrect knowledge of the dynamics results in reduced performance and may lead to instability. Augmenting the baseline controller with approximators which utilize a parametrization structure that is adapted online reduces the effect of this error between the design model and actual dynamics. However, currently existing parameterizations employ a fixed set of basis functions that do not guarantee arbitrary tracking error performance. To address this problem, we develop a self-organizing parametrization structure that is proven to be stable and can guarantee arbitrary tracking error performance. The training algorithm to grow the network and adapt the parameters is derived from Lyapunov theory. In addition to growing the network of basis functions, a pruning strategy is incorporated to keep the size of the network as small as possible. This algorithm is implemented on a high performance flight vehicle such as F-15 military aircraft. The baseline dynamic inversion controller is augmented with a Self-Organizing Radial Basis Function Network (SORBFN) to minimize the effect of the inversion error which may occur due to imperfect modeling, approximate inversion or sudden changes in aircraft dynamics. The dynamic inversion controller is simulated for different situations including control surface failures, modeling errors and external disturbances with and without the adaptive network. A performance measure of maximum tracking error is specified for both the controllers a priori. Excellent tracking error minimization to a pre-specified level using the adaptive approximation based controller was achieved while the baseline dynamic inversion controller failed to meet this performance specification. The performance of the SORBFN based controller is also compared to a fixed RBF network based adaptive controller. While the fixed RBF network based controller which is tuned to compensate for control surface failures fails to achieve the same performance under modeling uncertainty and disturbances, the SORBFN is able to achieve good tracking convergence under all error conditions.

Diffusion in Colocation Contact Networks: The Impact of Nodal Spatiotemporal Dynamics.

PubMed

Thomas, Bryce; Jurdak, Raja; Zhao, Kun; Atkinson, Ian

2016-01-01

Temporal contact networks are studied to understand dynamic spreading phenomena such as communicable diseases or information dissemination. To establish how spatiotemporal dynamics of nodes impact spreading potential in colocation contact networks, we propose "inducement-shuffling" null models which break one or more correlations between times, locations and nodes. By reconfiguring the time and/or location of each node's presence in the network, these models induce alternative sets of colocation events giving rise to contact networks with varying spreading potential. This enables second-order causal reasoning about how correlations in nodes' spatiotemporal preferences not only lead to a given contact network but ultimately influence the network's spreading potential. We find the correlation between nodes and times to be the greatest impediment to spreading, while the correlation between times and locations slightly catalyzes spreading. Under each of the presented null models we measure both the number of contacts and infection prevalence as a function of time, with the surprising finding that the two have no direct causality.

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.

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. PMID:29883447

An integrated approach to infer dynamic protein-gene interactions - A case study of the human P53 protein.

PubMed

Wang, Junbai; Wu, Qianqian; Hu, Xiaohua Tony; Tian, Tianhai

2016-11-01

Investigating the dynamics of genetic regulatory networks through high throughput experimental data, such as microarray gene expression profiles, is a very important but challenging task. One of the major hindrances in building detailed mathematical models for genetic regulation is the large number of unknown model parameters. To tackle this challenge, a new integrated method is proposed by combining a top-down approach and a bottom-up approach. First, the top-down approach uses probabilistic graphical models to predict the network structure of DNA repair pathway that is regulated by the p53 protein. Two networks are predicted, namely a network of eight genes with eight inferred interactions and an extended network of 21 genes with 17 interactions. Then, the bottom-up approach using differential equation models is developed to study the detailed genetic regulations based on either a fully connected regulatory network or a gene network obtained by the top-down approach. Model simulation error, parameter identifiability and robustness property are used as criteria to select the optimal network. Simulation results together with permutation tests of input gene network structures indicate that the prediction accuracy and robustness property of the two predicted networks using the top-down approach are better than those of the corresponding fully connected networks. In particular, the proposed approach reduces computational cost significantly for inferring model parameters. Overall, the new integrated method is a promising approach for investigating the dynamics of genetic regulation. Copyright © 2016 Elsevier Inc. All rights reserved.

Transportation and dynamic networks: Models, theory, and applications to supply chains, electric power, and financial networks

NASA Astrophysics Data System (ADS)

Liu, Zugang

Network systems, including transportation and logistic systems, electric power generation and distribution networks as well as financial networks, provide the critical infrastructure for the functioning of our societies and economies. The understanding of the dynamic behavior of such systems is also crucial to national security and prosperity. The identification of new connections between distinct network systems is the inspiration for the research in this dissertation. In particular, I answer two questions raised by Beckmann, McGuire, and Winsten (1956) and Copeland (1952) over half a century ago, which are, respectively, how are electric power flows related to transportation flows and does money flow like water or electricity? In addition, in this dissertation, I achieve the following: (1) I establish the relationships between transportation networks and three other classes of complex network systems: supply chain networks, electric power generation and transmission networks, and financial networks with intermediation. The establishment of such connections provides novel theoretical insights as well as new pricing mechanisms, and efficient computational methods. (2) I develop new modeling frameworks based on evolutionary variational inequality theory that capture the dynamics of such network systems in terms of the time-varying flows and incurred costs, prices, and, where applicable, profits. This dissertation studies the dynamics of such network systems by addressing both internal competition and/or cooperation, and external changes, such as varying costs and demands. (3) I focus, in depth, on electric power supply chains. By exploiting the relationships between transportation networks and electric power supply chains, I develop a large-scale network model that integrates electric power supply chains and fuel supply markets. The model captures both the economic transactions as well as the physical transmission constraints. The model is then applied to the New England electric power supply chain consisting of 6 states, 5 fuel types, 82 power generators, with a total of 573 generating units, and 10 demand markets. The empirical case study demonstrates that the regional electricity prices simulated by the model match very well the actual electricity prices in New England. I also utilize the model to study interactions between electric power supply chains and energy fuel markets.

Functional complexity emerging from anatomical constraints in the brain: the significance of network modularity and rich-clubs

NASA Astrophysics Data System (ADS)

Zamora-López, Gorka; Chen, Yuhan; Deco, Gustavo; Kringelbach, Morten L.; Zhou, Changsong

2016-12-01

The large-scale structural ingredients of the brain and neural connectomes have been identified in recent years. These are, similar to the features found in many other real networks: the arrangement of brain regions into modules and the presence of highly connected regions (hubs) forming rich-clubs. Here, we examine how modules and hubs shape the collective dynamics on networks and we find that both ingredients lead to the emergence of complex dynamics. Comparing the connectomes of C. elegans, cats, macaques and humans to surrogate networks in which either modules or hubs are destroyed, we find that functional complexity always decreases in the perturbed networks. A comparison between simulated and empirically obtained resting-state functional connectivity indicates that the human brain, at rest, lies in a dynamical state that reflects the largest complexity its anatomical connectome can host. Last, we generalise the topology of neural connectomes into a new hierarchical network model that successfully combines modular organisation with rich-club forming hubs. This is achieved by centralising the cross-modular connections through a preferential attachment rule. Our network model hosts more complex dynamics than other hierarchical models widely used as benchmarks.

Functional complexity emerging from anatomical constraints in the brain: the significance of network modularity and rich-clubs

PubMed Central

Zamora-López, Gorka; Chen, Yuhan; Deco, Gustavo; Kringelbach, Morten L.; Zhou, Changsong

2016-01-01

The large-scale structural ingredients of the brain and neural connectomes have been identified in recent years. These are, similar to the features found in many other real networks: the arrangement of brain regions into modules and the presence of highly connected regions (hubs) forming rich-clubs. Here, we examine how modules and hubs shape the collective dynamics on networks and we find that both ingredients lead to the emergence of complex dynamics. Comparing the connectomes of C. elegans, cats, macaques and humans to surrogate networks in which either modules or hubs are destroyed, we find that functional complexity always decreases in the perturbed networks. A comparison between simulated and empirically obtained resting-state functional connectivity indicates that the human brain, at rest, lies in a dynamical state that reflects the largest complexity its anatomical connectome can host. Last, we generalise the topology of neural connectomes into a new hierarchical network model that successfully combines modular organisation with rich-club forming hubs. This is achieved by centralising the cross-modular connections through a preferential attachment rule. Our network model hosts more complex dynamics than other hierarchical models widely used as benchmarks. PMID:27917958

Analysis of structural patterns in the brain with the complex network approach

NASA Astrophysics Data System (ADS)

Maksimenko, Vladimir A.; Makarov, Vladimir V.; Kharchenko, Alexander A.; Pavlov, Alexey N.; Khramova, Marina V.; Koronovskii, Alexey A.; Hramov, Alexander E.

2015-03-01

In this paper we study mechanisms of the phase synchronization in a model network of Van der Pol oscillators and in the neural network of the brain by consideration of macroscopic parameters of these networks. As the macroscopic characteristics of the model network we consider a summary signal produced by oscillators. Similar to the model simulations, we study EEG signals reflecting the macroscopic dynamics of neural network. We show that the appearance of the phase synchronization leads to an increased peak in the wavelet spectrum related to the dynamics of synchronized oscillators. The observed correlation between the phase relations of individual elements and the macroscopic characteristics of the whole network provides a way to detect phase synchronization in the neural networks in the cases of normal and pathological activity.

How to turn a genetic circuit into a synthetic tunable oscillator, or a bistable switch.

PubMed

Marucci, Lucia; Barton, David A W; Cantone, Irene; Ricci, Maria Aurelia; Cosma, Maria Pia; Santini, Stefania; di Bernardo, Diego; di Bernardo, Mario

2009-12-07

Systems and Synthetic Biology use computational models of biological pathways in order to study in silico the behaviour of biological pathways. Mathematical models allow to verify biological hypotheses and to predict new possible dynamical behaviours. Here we use the tools of non-linear analysis to understand how to change the dynamics of the genes composing a novel synthetic network recently constructed in the yeast Saccharomyces cerevisiae for In-vivo Reverse-engineering and Modelling Assessment (IRMA). Guided by previous theoretical results that make the dynamics of a biological network depend on its topological properties, through the use of simulation and continuation techniques, we found that the network can be easily turned into a robust and tunable synthetic oscillator or a bistable switch. Our results provide guidelines to properly re-engineering in vivo the network in order to tune its dynamics.

SIR model on a dynamical network and the endemic state of an infectious disease

NASA Astrophysics Data System (ADS)

Dottori, M.; Fabricius, G.

2015-09-01

In this work we performed a numerical study of an epidemic model that mimics the endemic state of whooping cough in the pre-vaccine era. We considered a stochastic SIR model on dynamical networks that involve local and global contacts among individuals and analysed the influence of the network properties on the characterization of the quasi-stationary state. We computed probability density functions (PDF) for infected fraction of individuals and found that they are well fitted by gamma functions, excepted the tails of the distributions that are q-exponentials. We also computed the fluctuation power spectra of infective time series for different networks. We found that network effects can be partially absorbed by rescaling the rate of infective contacts of the model. An explicit relation between the effective transmission rate of the disease and the correlation of susceptible individuals with their infective nearest neighbours was obtained. This relation quantifies the known screening of infective individuals observed in these networks. We finally discuss the goodness and limitations of the SIR model with homogeneous mixing and parameters taken from epidemiological data to describe the dynamic behaviour observed in the networks studied.

Dynamics of a network-based SIS epidemic model with nonmonotone incidence rate

NASA Astrophysics Data System (ADS)

Li, Chun-Hsien

2015-06-01

This paper studies the dynamics of a network-based SIS epidemic model with nonmonotone incidence rate. This type of nonlinear incidence can be used to describe the psychological effect of certain diseases spread in a contact network at high infective levels. We first find a threshold value for the transmission rate. This value completely determines the dynamics of the model and interestingly, the threshold is not dependent on the functional form of the nonlinear incidence rate. Furthermore, if the transmission rate is less than or equal to the threshold value, the disease will die out. Otherwise, it will be permanent. Numerical experiments are given to illustrate the theoretical results. We also consider the effect of the nonlinear incidence on the epidemic dynamics.

Boolean Networks in Inference and Dynamic Modeling of Biological Systems at the Molecular and Physiological Level

NASA Astrophysics Data System (ADS)

Thakar, Juilee; Albert, Réka

The following sections are included: * Introduction * Boolean Network Concepts and History * Extensions of the Classical Boolean Framework * Boolean Inference Methods and Examples in Biology * Dynamic Boolean Models: Examples in Plant Biology, Developmental Biology and Immunology * Conclusions * References

Development of a system dynamics model for financially sustainable management of municipal watermain networks.

PubMed

Rehan, R; Knight, M A; Unger, A J A; Haas, C T

2013-12-15

This paper develops causal loop diagrams and a system dynamics model for financially sustainable management of urban water distribution networks. The developed causal loop diagrams are a novel contribution in that it illustrates the unique characteristics and feedback loops for financially self-sustaining water distribution networks. The system dynamics model is a mathematical realization of the developed interactions among system variables over time and is comprised of three sectors namely watermains network, consumer, and finance. This is the first known development of a water distribution network system dynamics model. The watermains network sector accounts for the unique characteristics of watermain pipes such as service life, deterioration progression, pipe breaks, and water leakage. The finance sector allows for cash reserving by the utility in addition to the pay-as-you-go and borrowing strategies. The consumer sector includes controls to model water fee growth as a function of service performance and a household's financial burden due to water fees. A series of policy levers are provided that allow the impact of various financing strategies to be evaluated in terms of financial sustainability and household affordability. The model also allows for examination of the impact of different management strategies on the water fee in terms of consistency and stability over time. The paper concludes with a discussion on how the developed system dynamics water model can be used by water utilities to achieve a variety of utility short and long-term objectives and to establish realistic and defensible water utility policies. It also discusses how the model can be used by regulatory bodies, government agencies, the financial industry, and researchers. Crown Copyright © 2013. Published by Elsevier Ltd. All rights reserved.

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.

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.

OSI Network-layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

NASA Astrophysics Data System (ADS)

Lawniczak, Anna T.; Gerisch, Alf; Di Stefano, Bruno

2005-06-01

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path-length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathered using Netzwerk-1, a C++ simulation tool that we developed for our abstraction.

Modeling of Receptor Tyrosine Kinase Signaling: Computational and Experimental Protocols.

PubMed

Fey, Dirk; Aksamitiene, Edita; Kiyatkin, Anatoly; Kholodenko, Boris N

2017-01-01

The advent of systems biology has convincingly demonstrated that the integration of experiments and dynamic modelling is a powerful approach to understand the cellular network biology. Here we present experimental and computational protocols that are necessary for applying this integrative approach to the quantitative studies of receptor tyrosine kinase (RTK) signaling networks. Signaling by RTKs controls multiple cellular processes, including the regulation of cell survival, motility, proliferation, differentiation, glucose metabolism, and apoptosis. We describe methods of model building and training on experimentally obtained quantitative datasets, as well as experimental methods of obtaining quantitative dose-response and temporal dependencies of protein phosphorylation and activities. The presented methods make possible (1) both the fine-grained modeling of complex signaling dynamics and identification of salient, course-grained network structures (such as feedback loops) that bring about intricate dynamics, and (2) experimental validation of dynamic models.

Network inoculation: Heteroclinics and phase transitions in an epidemic model

NASA Astrophysics Data System (ADS)

Yang, Hui; Rogers, Tim; Gross, Thilo

2016-08-01

In epidemiological modelling, dynamics on networks, and, in particular, adaptive and heterogeneous networks have recently received much interest. Here, we present a detailed analysis of a previously proposed model that combines heterogeneity in the individuals with adaptive rewiring of the network structure in response to a disease. We show that in this model, qualitative changes in the dynamics occur in two phase transitions. In a macroscopic description, one of these corresponds to a local bifurcation, whereas the other one corresponds to a non-local heteroclinic bifurcation. This model thus provides a rare example of a system where a phase transition is caused by a non-local bifurcation, while both micro- and macro-level dynamics are accessible to mathematical analysis. The bifurcation points mark the onset of a behaviour that we call network inoculation. In the respective parameter region, exposure of the system to a pathogen will lead to an outbreak that collapses but leaves the network in a configuration where the disease cannot reinvade, despite every agent returning to the susceptible class. We argue that this behaviour and the associated phase transitions can be expected to occur in a wide class of models of sufficient complexity.

Influence of neural adaptation on dynamics and equilibrium state of neural activities in a ring neural network

NASA Astrophysics Data System (ADS)

Takiyama, Ken

2017-12-01

How neural adaptation affects neural information processing (i.e. the dynamics and equilibrium state of neural activities) is a central question in computational neuroscience. In my previous works, I analytically clarified the dynamics and equilibrium state of neural activities in a ring-type neural network model that is widely used to model the visual cortex, motor cortex, and several other brain regions. The neural dynamics and the equilibrium state in the neural network model corresponded to a Bayesian computation and statistically optimal multiple information integration, respectively, under a biologically inspired condition. These results were revealed in an analytically tractable manner; however, adaptation effects were not considered. Here, I analytically reveal how the dynamics and equilibrium state of neural activities in a ring neural network are influenced by spike-frequency adaptation (SFA). SFA is an adaptation that causes gradual inhibition of neural activity when a sustained stimulus is applied, and the strength of this inhibition depends on neural activities. I reveal that SFA plays three roles: (1) SFA amplifies the influence of external input in neural dynamics; (2) SFA allows the history of the external input to affect neural dynamics; and (3) the equilibrium state corresponds to the statistically optimal multiple information integration independent of the existence of SFA. In addition, the equilibrium state in a ring neural network model corresponds to the statistically optimal integration of multiple information sources under biologically inspired conditions, independent of the existence of SFA.

Smart social adaptation prevents catastrophic ecological regime shifts in networks of myopic harvesters

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Lucht, Wolfgang; Wiedermann, Marc; Heitzig, Jobst; Kurths, Jürgen

2015-04-01

In the anthropocene, the rise of global social and economic networks with ever increasing connectivity and speed of interactions, e.g., the internet or global financial markets, is a key challenge for sustainable development. The spread of opinions, values or technologies on these networks, in conjunction with the coevolution of the network structures themselves, underlies nexuses of current concern such as anthropogenic climate change, biodiversity loss or global land use change. To isolate and quantitatively study the effects and implications of network dynamics for sustainable development, we propose an agent-based model of information flow on adaptive networks between myopic harvesters that exploit private renewable resources. In this conceptual model of a network of socio-ecological systems, information on management practices flows between agents via boundedly rational imitation depending on the state of the resource stocks involved in an interaction. Agents can also adapt the structure of their social network locally by preferentially connecting to culturally similar agents with identical management practices and, at the same time, disconnecting from culturally dissimilar agents. Investigating in detail the statistical mechanics of this model, we find that an increasing rate of information flow through faster imitation dynamics or growing density of network connectivity leads to a marked increase in the likelihood of environmental resource collapse. However, we show that an optimal rate of social network adaptation can mitigate this negative effect without loss of social cohesion through network fragmentation. Our results highlight that seemingly immaterial network dynamics of spreading opinions or values can be of large relevance for the sustainable management of socio-ecological systems and suggest smartly conservative network adaptation as a strategy for mitigating environmental collapse. Hence, facing the great acceleration, these network dynamics should be more routinely incorporated in standard models of economic development or integrated assessment models used for evaluating anthropogenic climate change.

Dynamic optimization of metabolic networks coupled with gene expression.

PubMed

Waldherr, Steffen; Oyarzún, Diego A; Bockmayr, Alexander

2015-01-21

The regulation of metabolic activity by tuning enzyme expression levels is crucial to sustain cellular growth in changing environments. Metabolic networks are often studied at steady state using constraint-based models and optimization techniques. However, metabolic adaptations driven by changes in gene expression cannot be analyzed by steady state models, as these do not account for temporal changes in biomass composition. Here we present a dynamic optimization framework that integrates the metabolic network with the dynamics of biomass production and composition. An approximation by a timescale separation leads to a coupled model of quasi-steady state constraints on the metabolic reactions, and differential equations for the substrate concentrations and biomass composition. We propose a dynamic optimization approach to determine reaction fluxes for this model, explicitly taking into account enzyme production costs and enzymatic capacity. In contrast to the established dynamic flux balance analysis, our approach allows predicting dynamic changes in both the metabolic fluxes and the biomass composition during metabolic adaptations. Discretization of the optimization problems leads to a linear program that can be efficiently solved. We applied our algorithm in two case studies: a minimal nutrient uptake network, and an abstraction of core metabolic processes in bacteria. In the minimal model, we show that the optimized uptake rates reproduce the empirical Monod growth for bacterial cultures. For the network of core metabolic processes, the dynamic optimization algorithm predicted commonly observed metabolic adaptations, such as a diauxic switch with a preference ranking for different nutrients, re-utilization of waste products after depletion of the original substrate, and metabolic adaptation to an impending nutrient depletion. These examples illustrate how dynamic adaptations of enzyme expression can be predicted solely from an optimization principle. Copyright © 2014 Elsevier Ltd. All rights reserved.

Neural network adaptive control of wing-rock motion of aircraft model mounted on three-degree-of-freedom dynamic rig in wind tunnel

NASA Astrophysics Data System (ADS)

Ignatyev, D. I.

2018-06-01

High-angles-of-attack dynamics of aircraft are complicated with dangerous phenomena such as wing rock, stall, and spin. Autonomous dynamically scaled aircraft model mounted in three-degree-of-freedom (3DoF) dynamic rig is proposed for studying aircraft dynamics and prototyping of control laws in wind tunnel. Dynamics of the scaled aircraft model in 3DoF manoeuvre rig in wind tunnel is considered. The model limit-cycle oscillations are obtained at high angles of attack. A neural network (NN) adaptive control suppressing wing rock motion is designed. The wing rock suppression with the proposed control law is validated using nonlinear time-domain simulations.

A model for the multiplex dynamics of two-mode and one-mode networks, with an application to employment preference, friendship, and advice

PubMed Central

Snijders, Tom A.B.; Lomi, Alessandro; Torló, Vanina Jasmine

2012-01-01

We propose a new stochastic actor-oriented model for the co-evolution of two-mode and one-mode networks. The model posits that activities of a set of actors, represented in the two-mode network, co-evolve with exchanges and interactions between the actors, as represented in the one-mode network. The model assumes that the actors, not the activities, have agency. The empirical value of the model is demonstrated by examining how employment preferences co-evolve with friendship and advice relations in a group of seventy-five MBA students. The analysis shows that activity in the two-mode network, as expressed by number of employment preferences, is related to activity in the friendship network, as expressed by outdegrees. Further, advice ties between students lead to agreement with respect to employment preferences. In addition, considering the multiplexity of advice and friendship ties yields a better understanding of the dynamics of the advice relation: tendencies to reciprocation and homophily in advice relations are mediated to an important extent by friendship relations. The discussion pays attention to the implications of this study in the broader context of current efforts to model the co-evolutionary dynamics of social networks and individual behavior. PMID:23690653

CADLIVE toolbox for MATLAB: automatic dynamic modeling of biochemical networks with comprehensive system analysis.

PubMed

Inoue, Kentaro; Maeda, Kazuhiro; Miyabe, Takaaki; Matsuoka, Yu; Kurata, Hiroyuki

2014-09-01

Mathematical modeling has become a standard technique to understand the dynamics of complex biochemical systems. To promote the modeling, we had developed the CADLIVE dynamic simulator that automatically converted a biochemical map into its associated mathematical model, simulated its dynamic behaviors and analyzed its robustness. To enhance the feasibility by CADLIVE and extend its functions, we propose the CADLIVE toolbox available for MATLAB, which implements not only the existing functions of the CADLIVE dynamic simulator, but also the latest tools including global parameter search methods with robustness analysis. The seamless, bottom-up processes consisting of biochemical network construction, automatic construction of its dynamic model, simulation, optimization, and S-system analysis greatly facilitate dynamic modeling, contributing to the research of systems biology and synthetic biology. This application can be freely downloaded from http://www.cadlive.jp/CADLIVE_MATLAB/ together with an instruction.

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

NASA Astrophysics Data System (ADS)

Lawniczak, A. T.; Tang, X.

2006-05-01

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

Influence of network dynamics on the spread of sexually transmitted diseases.

PubMed

Risau-Gusman, Sebastián

2012-06-07

Network epidemiology often assumes that the relationships defining the social network of a population are static. The dynamics of relationships is only taken indirectly into account by assuming that the relevant information to study epidemic spread is encoded in the network obtained, by considering numbers of partners accumulated over periods of time roughly proportional to the infectious period of the disease. On the other hand, models explicitly including social dynamics are often too schematic to provide a reasonable representation of a real population, or so detailed that no general conclusions can be drawn from them. Here, we present a model of social dynamics that is general enough so its parameters can be obtained by fitting data from surveys about sexual behaviour, but that can still be studied analytically, using mean-field techniques. This allows us to obtain some general results about epidemic spreading. We show that using accumulated network data to estimate the static epidemic threshold lead to a significant underestimation of that threshold. We also show that, for a dynamic network, the relative epidemic threshold is an increasing function of the infectious period of the disease, implying that the static value is a lower bound to the real threshold. A practical example is given of how to apply the model to the study of a real population.

Influence of network dynamics on the spread of sexually transmitted diseases

PubMed Central

Risau-Gusman, Sebastián

2012-01-01

Network epidemiology often assumes that the relationships defining the social network of a population are static. The dynamics of relationships is only taken indirectly into account by assuming that the relevant information to study epidemic spread is encoded in the network obtained, by considering numbers of partners accumulated over periods of time roughly proportional to the infectious period of the disease. On the other hand, models explicitly including social dynamics are often too schematic to provide a reasonable representation of a real population, or so detailed that no general conclusions can be drawn from them. Here, we present a model of social dynamics that is general enough so its parameters can be obtained by fitting data from surveys about sexual behaviour, but that can still be studied analytically, using mean-field techniques. This allows us to obtain some general results about epidemic spreading. We show that using accumulated network data to estimate the static epidemic threshold lead to a significant underestimation of that threshold. We also show that, for a dynamic network, the relative epidemic threshold is an increasing function of the infectious period of the disease, implying that the static value is a lower bound to the real threshold. A practical example is given of how to apply the model to the study of a real population. PMID:22112655

Deterministic ripple-spreading model for complex networks.

PubMed

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

2011-04-01

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

a New Dynamic Community Model for Social Networks

NASA Astrophysics Data System (ADS)

Lu, Zhe-Ming; Wu, Zhen; Guo, Shi-Ze; Chen, Zhe; Song, Guang-Hua

2014-09-01

In this paper, based on the phenomenon that individuals join into and jump from the organizations in the society, we propose a dynamic community model to construct social networks. Two parameters are adopted in our model, one is the communication rate Pa that denotes the connection strength in the organization and the other is the turnover rate Pb, that stands for the frequency of jumping among the organizations. Based on simulations, we analyze not only the degree distribution, the clustering coefficient, the average distance and the network diameter but also the group distribution which is closely related to their community structure. Moreover, we discover that the networks generated by the proposed model possess the small-world property and can well reproduce the networks of social contacts.

Data-driven reverse engineering of signaling pathways using ensembles of dynamic models.

PubMed

Henriques, David; Villaverde, Alejandro F; Rocha, Miguel; Saez-Rodriguez, Julio; Banga, Julio R

2017-02-01

Despite significant efforts and remarkable progress, the inference of signaling networks from experimental data remains very challenging. The problem is particularly difficult when the objective is to obtain a dynamic model capable of predicting the effect of novel perturbations not considered during model training. The problem is ill-posed due to the nonlinear nature of these systems, the fact that only a fraction of the involved proteins and their post-translational modifications can be measured, and limitations on the technologies used for growing cells in vitro, perturbing them, and measuring their variations. As a consequence, there is a pervasive lack of identifiability. To overcome these issues, we present a methodology called SELDOM (enSEmbLe of Dynamic lOgic-based Models), which builds an ensemble of logic-based dynamic models, trains them to experimental data, and combines their individual simulations into an ensemble prediction. It also includes a model reduction step to prune spurious interactions and mitigate overfitting. SELDOM is a data-driven method, in the sense that it does not require any prior knowledge of the system: the interaction networks that act as scaffolds for the dynamic models are inferred from data using mutual information. We have tested SELDOM on a number of experimental and in silico signal transduction case-studies, including the recent HPN-DREAM breast cancer challenge. We found that its performance is highly competitive compared to state-of-the-art methods for the purpose of recovering network topology. More importantly, the utility of SELDOM goes beyond basic network inference (i.e. uncovering static interaction networks): it builds dynamic (based on ordinary differential equation) models, which can be used for mechanistic interpretations and reliable dynamic predictions in new experimental conditions (i.e. not used in the training). For this task, SELDOM's ensemble prediction is not only consistently better than predictions from individual models, but also often outperforms the state of the art represented by the methods used in the HPN-DREAM challenge.

Data-driven reverse engineering of signaling pathways using ensembles of dynamic models

PubMed Central

Henriques, David; Villaverde, Alejandro F.; Banga, Julio R.

2017-01-01

Despite significant efforts and remarkable progress, the inference of signaling networks from experimental data remains very challenging. The problem is particularly difficult when the objective is to obtain a dynamic model capable of predicting the effect of novel perturbations not considered during model training. The problem is ill-posed due to the nonlinear nature of these systems, the fact that only a fraction of the involved proteins and their post-translational modifications can be measured, and limitations on the technologies used for growing cells in vitro, perturbing them, and measuring their variations. As a consequence, there is a pervasive lack of identifiability. To overcome these issues, we present a methodology called SELDOM (enSEmbLe of Dynamic lOgic-based Models), which builds an ensemble of logic-based dynamic models, trains them to experimental data, and combines their individual simulations into an ensemble prediction. It also includes a model reduction step to prune spurious interactions and mitigate overfitting. SELDOM is a data-driven method, in the sense that it does not require any prior knowledge of the system: the interaction networks that act as scaffolds for the dynamic models are inferred from data using mutual information. We have tested SELDOM on a number of experimental and in silico signal transduction case-studies, including the recent HPN-DREAM breast cancer challenge. We found that its performance is highly competitive compared to state-of-the-art methods for the purpose of recovering network topology. More importantly, the utility of SELDOM goes beyond basic network inference (i.e. uncovering static interaction networks): it builds dynamic (based on ordinary differential equation) models, which can be used for mechanistic interpretations and reliable dynamic predictions in new experimental conditions (i.e. not used in the training). For this task, SELDOM’s ensemble prediction is not only consistently better than predictions from individual models, but also often outperforms the state of the art represented by the methods used in the HPN-DREAM challenge. PMID:28166222

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.

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.

Theory of rumour spreading in complex social networks

NASA Astrophysics Data System (ADS)

Nekovee, M.; Moreno, Y.; Bianconi, G.; Marsili, M.

2007-01-01

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet.

The importance of including dynamic social networks when modeling epidemics of airborne infections: does increasing complexity increase accuracy?

PubMed

Blower, Sally; Go, Myong-Hyun

2011-07-19

Mathematical models are useful tools for understanding and predicting epidemics. A recent innovative modeling study by Stehle and colleagues addressed the issue of how complex models need to be to ensure accuracy. The authors collected data on face-to-face contacts during a two-day conference. They then constructed a series of dynamic social contact networks, each of which was used to model an epidemic generated by a fast-spreading airborne pathogen. Intriguingly, Stehle and colleagues found that increasing model complexity did not always increase accuracy. Specifically, the most detailed contact network and a simplified version of this network generated very similar results. These results are extremely interesting and require further exploration to determine their generalizability.

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

PubMed

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

2010-12-28

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

Dynamically induced cascading failures in power grids.

PubMed

Schäfer, Benjamin; Witthaut, Dirk; Timme, Marc; Latora, Vito

2018-05-17

Reliable functioning of infrastructure networks is essential for our modern society. Cascading failures are the cause of most large-scale network outages. Although cascading failures often exhibit dynamical transients, the modeling of cascades has so far mainly focused on the analysis of sequences of steady states. In this article, we focus on electrical transmission networks and introduce a framework that takes into account both the event-based nature of cascades and the essentials of the network dynamics. We find that transients of the order of seconds in the flows of a power grid play a crucial role in the emergence of collective behaviors. We finally propose a forecasting method to identify critical lines and components in advance or during operation. Overall, our work highlights the relevance of dynamically induced failures on the synchronization dynamics of national power grids of different European countries and provides methods to predict and model cascading failures.

Complexities’ day-to-day dynamic evolution analysis and prediction for a Didi taxi trip network based on complex network theory

NASA Astrophysics Data System (ADS)

Zhang, Lin; Lu, Jian; Zhou, Jialin; Zhu, Jinqing; Li, Yunxuan; Wan, Qian

2018-03-01

Didi Dache is the most popular taxi order mobile app in China, which provides online taxi-hailing service. The obtained big database from this app could be used to analyze the complexities’ day-to-day dynamic evolution of Didi taxi trip network (DTTN) from the level of complex network dynamics. First, this paper proposes the data cleaning and modeling methods for expressing Nanjing’s DTTN as a complex network. Second, the three consecutive weeks’ data are cleaned to establish 21 DTTNs based on the proposed big data processing technology. Then, multiple topology measures that characterize the complexities’ day-to-day dynamic evolution of these networks are provided. Third, these measures of 21 DTTNs are calculated and subsequently explained with actual implications. They are used as a training set for modeling the BP neural network which is designed for predicting DTTN complexities evolution. Finally, the reliability of the designed BP neural network is verified by comparing with the actual data and the results obtained from ARIMA method simultaneously. Because network complexities are the basis for modeling cascading failures and conducting link prediction in complex system, this proposed research framework not only provides a novel perspective for analyzing DTTN from the level of system aggregated behavior, but can also be used to improve the DTTN management level.

Feedback control stabilization of critical dynamics via resource transport on multilayer networks: How glia enable learning dynamics in the brain

NASA Astrophysics Data System (ADS)

Virkar, Yogesh S.; Shew, Woodrow L.; Restrepo, Juan G.; Ott, Edward

2016-10-01

Learning and memory are acquired through long-lasting changes in synapses. In the simplest models, such synaptic potentiation typically leads to runaway excitation, but in reality there must exist processes that robustly preserve overall stability of the neural system dynamics. How is this accomplished? Various approaches to this basic question have been considered. Here we propose a particularly compelling and natural mechanism for preserving stability of learning neural systems. This mechanism is based on the global processes by which metabolic resources are distributed to the neurons by glial cells. Specifically, we introduce and study a model composed of two interacting networks: a model neural network interconnected by synapses that undergo spike-timing-dependent plasticity; and a model glial network interconnected by gap junctions that diffusively transport metabolic resources among the glia and, ultimately, to neural synapses where they are consumed. Our main result is that the biophysical constraints imposed by diffusive transport of metabolic resources through the glial network can prevent runaway growth of synaptic strength, both during ongoing activity and during learning. Our findings suggest a previously unappreciated role for glial transport of metabolites in the feedback control stabilization of neural network dynamics during learning.

A Continuum Model of Actin Waves in Dictyostelium discoideum

PubMed Central

Khamviwath, Varunyu; Hu, Jifeng; Othmer, Hans G.

2013-01-01

Actin waves are complex dynamical patterns of the dendritic network of filamentous actin in eukaryotes. We developed a model of actin waves in PTEN-deficient Dictyostelium discoideum by deriving an approximation of the dynamics of discrete actin filaments and combining it with a signaling pathway that controls filament branching. This signaling pathway, together with the actin network, contains a positive feedback loop that drives the actin waves. Our model predicts the structure, composition, and dynamics of waves that are consistent with existing experimental evidence, as well as the biochemical dependence on various protein partners. Simulation suggests that actin waves are initiated when local actin network activity, caused by an independent process, exceeds a certain threshold. Moreover, diffusion of proteins that form a positive feedback loop with the actin network alone is sufficient for propagation of actin waves at the observed speed of . Decay of the wave back can be caused by scarcity of network components, and the shape of actin waves is highly dependent on the filament disassembly rate. The model allows retraction of actin waves and captures formation of new wave fronts in broken waves. Our results demonstrate that a delicate balance between a positive feedback, filament disassembly, and local availability of network components is essential for the complex dynamics of actin waves. PMID:23741312

Dynamical analysis of Parkinsonian state emulated by hybrid Izhikevich neuron models

NASA Astrophysics Data System (ADS)

Liu, Chen; Wang, Jiang; Yu, Haitao; Deng, Bin; Wei, Xile; Li, Huiyan; Loparo, Kenneth A.; Fietkiewicz, Chris

2015-11-01

Computational models play a significant role in exploring novel theories to complement the findings of physiological experiments. Various computational models have been developed to reveal the mechanisms underlying brain functions. Particularly, in the development of therapies to modulate behavioral and pathological abnormalities, computational models provide the basic foundations to exhibit transitions between physiological and pathological conditions. Considering the significant roles of the intrinsic properties of the globus pallidus and the coupling connections between neurons in determining the firing patterns and the dynamical activities of the basal ganglia neuronal network, we propose a hypothesis that pathological behaviors under the Parkinsonian state may originate from combined effects of intrinsic properties of globus pallidus neurons and synaptic conductances in the whole neuronal network. In order to establish a computational efficient network model, hybrid Izhikevich neuron model is used due to its capacity of capturing the dynamical characteristics of the biological neuronal activities. Detailed analysis of the individual Izhikevich neuron model can assist in understanding the roles of model parameters, which then facilitates the establishment of the basal ganglia-thalamic network model, and contributes to a further exploration of the underlying mechanisms of the Parkinsonian state. Simulation results show that the hybrid Izhikevich neuron model is capable of capturing many of the dynamical properties of the basal ganglia-thalamic neuronal network, such as variations of the firing rates and emergence of synchronous oscillations under the Parkinsonian condition, despite the simplicity of the two-dimensional neuronal model. It may suggest that the computational efficient hybrid Izhikevich neuron model can be used to explore basal ganglia normal and abnormal functions. Especially it provides an efficient way of emulating the large-scale neuron network and potentially contributes to development of improved therapy for neurological disorders such as Parkinson's disease.

Model for disease dynamics of a waterborne pathogen on a random network.

PubMed

Li, Meili; Ma, Junling; van den Driessche, P

2015-10-01

A network epidemic SIWR model for cholera and other diseases that can be transmitted via the environment is developed and analyzed. The person-to-person contacts are modeled by a random contact network, and the contagious environment is modeled by an external node that connects to every individual. The model is adapted from the Miller network SIR model, and in the homogeneous mixing limit becomes the Tien and Earn deterministic cholera model without births and deaths. The dynamics of our model shows excellent agreement with stochastic simulations. The basic reproduction number [Formula: see text] is computed, and on a Poisson network shown to be the sum of the basic reproduction numbers of the person-to-person and person-to-water-to-person transmission pathways. However, on other networks, [Formula: see text] depends nonlinearly on the transmission along the two pathways. Type reproduction numbers are computed and quantify measures to control the disease. Equations giving the final epidemic size are obtained.

Effect of node attributes on the temporal dynamics of network structure

NASA Astrophysics Data System (ADS)

Momeni, Naghmeh; Fotouhi, Babak

2017-03-01

Many natural and social networks evolve in time and their structures are dynamic. In most networks, nodes are heterogeneous, and their roles in the evolution of structure differ. This paper focuses on the role of individual attributes on the temporal dynamics of network structure. We focus on a basic model for growing networks that incorporates node attributes (which we call "quality"), and we focus on the problem of forecasting the structural properties of the network in arbitrary times for an arbitrary initial network. That is, we address the following question: If we are given a certain initial network with given arbitrary structure and known node attributes, then how does the structure change in time as new nodes with given distribution of attributes join the network? We solve the model analytically and obtain the quality-degree joint distribution and degree correlations. We characterize the role of individual attributes in the position of individual nodes in the hierarchy of connections. We confirm the theoretical findings with Monte Carlo simulations.

Cultural propagation on social networks

NASA Astrophysics Data System (ADS)

Kuperman, M. N.

2006-04-01

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

Extraordinary variability and sharp transitions in a maximally frustrated dynamic network

NASA Astrophysics Data System (ADS)

Liu, Wenjia; Schmittmann, Beate; Zia, R. K. P.

2013-03-01

Most previous studies of complex networks have focused on single, static networks. However, in the real world, networks are dynamic and interconnected. Inspired by the presence of extroverts and introverts in the general population, we investigate a highly simplified model of a social network, involving two types of nodes: one preferring the highest degree possible, and one preferring no connections whatsoever. There are only two control parameters in the model: the number of ``introvert'' and ``extrovert'' nodes, NI and NE. Our key findings are as follows: As a function of NI and NE, the system exhibits a highly unusual transition, displaying extraordinary fluctuations (as in 2nd order transitions) and discontinuous jumps (characteristic of 1st order transitions). Most remarkably, the system can be described by an Ising-like Hamiltonian with long-range multi-spin interactions and some of its properties can be obtained analytically. This is in stark contrast with other dynamic network models which rely almost exclusively on simulations. NSF-DMR-1005417/1244666 and and ICTAS Virginia Tech

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.

Identifying and tracking dynamic processes in social networks

NASA Astrophysics Data System (ADS)

Chung, Wayne; Savell, Robert; Schütt, Jan-Peter; Cybenko, George

2006-05-01

The detection and tracking of embedded malicious subnets in an active social network can be computationally daunting due to the quantity of transactional data generated in the natural interaction of large numbers of actors comprising a network. In addition, detection of illicit behavior may be further complicated by evasive strategies designed to camouflage the activities of the covert subnet. In this work, we move beyond traditional static methods of social network analysis to develop a set of dynamic process models which encode various modes of behavior in active social networks. These models will serve as the basis for a new application of the Process Query System (PQS) to the identification and tracking of covert dynamic processes in social networks. We present a preliminary result from application of our technique in a real-world data stream-- the Enron email corpus.

Temporal networks

NASA Astrophysics Data System (ADS)

Holme, Petter; Saramäki, Jari

2012-10-01

A great variety of systems in nature, society and technology-from the web of sexual contacts to the Internet, from the nervous system to power grids-can be modeled as graphs of vertices coupled by edges. The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems. In many cases, however, the edges are not continuously active. As an example, in networks of communication via e-mail, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts. In some cases, edges are active for non-negligible periods of time: e.g., the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward. Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network. In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself. Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks. The study of temporal networks is very interdisciplinary in nature. Reflecting this, even the object of study has many names-temporal graphs, evolving graphs, time-varying graphs, time-aggregated graphs, time-stamped graphs, dynamic networks, dynamic graphs, dynamical graphs, and so on. This review covers different fields where temporal graphs are considered, but does not attempt to unify related terminology-rather, we want to make papers readable across disciplines.

Effects of patch quality and network structure on patch occupancy dynamics of a yellow-bellied marmot metapopulation.

PubMed

Ozgul, Arpat; Armitage, Kenneth B; Blumstein, Daniel T; Vanvuren, Dirk H; Oli, Madan K

2006-01-01

1. The presence/absence of a species at a particular site is the simplest form of data that can be collected during ecological field studies. We used 13 years (1990-2002) of survey data to parameterize a stochastic patch occupancy model for a metapopulation of the yellow-bellied marmot in Colorado, and investigated the significance of particular patches and the influence of site quality, network characteristics and regional stochasticity on the metapopulation persistence. 2. Persistence of the yellow-bellied marmot metapopulation was strongly dependent on the high quality colony sites, and persistence probability was highly sensitive to small changes in the quality of these sites. 3. A relatively small number of colony sites was ultimately responsible for the regional persistence. However, lower quality satellite sites also made a significant contribution to long-term metapopulation persistence, especially when regional stochasticity was high. 4. The northern network of the marmot metapopulation was more stable compared to the southern network, and the persistence of the southern network depended heavily on the northern network. 5. Although complex models of metapopulation dynamics may provide a more accurate description of metapopulation dynamics, such models are data-intensive. Our study, one of the very few applications of stochastic patch occupancy models to a mammalian species, suggests that stochastic patch occupancy models can provide important insights into metapopulation dynamics using data that are easy to collect.

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.

Signaling mechanisms underlying the robustness and tunability of the plant immune network

PubMed Central

Kim, Yungil; Tsuda, Kenichi; Igarashi, Daisuke; Hillmer, Rachel A.; Sakakibara, Hitoshi; Myers, Chad L.; Katagiri, Fumiaki

2014-01-01

Summary How does robust and tunable behavior emerge in a complex biological network? We sought to understand this for the signaling network controlling pattern-triggered immunity (PTI) in Arabidopsis. A dynamic network model containing four major signaling sectors, the jasmonate, ethylene, PAD4, and salicylate sectors, which together explain up to 80% of the PTI level, was built using data for dynamic sector activities and PTI levels under exhaustive combinatorial sector perturbations. Our regularized multiple regression model had a high level of predictive power and captured known and unexpected signal flows in the network. The sole inhibitory sector in the model, the ethylene sector, was central to the network robustness via its inhibition of the jasmonate sector. The model's multiple input sites linked specific signal input patterns varying in strength and timing to different network response patterns, indicating a mechanism enabling tunability. PMID:24439900

A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

PubMed Central

Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry

2015-01-01

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701

A stochastic agent-based model of pathogen propagation in dynamic multi-relational social networks

PubMed Central

Khan, Bilal; Dombrowski, Kirk; Saad, Mohamed

2015-01-01

We describe a general framework for modeling and stochastic simulation of epidemics in realistic dynamic social networks, which incorporates heterogeneity in the types of individuals, types of interconnecting risk-bearing relationships, and types of pathogens transmitted across them. Dynamism is supported through arrival and departure processes, continuous restructuring of risk relationships, and changes to pathogen infectiousness, as mandated by natural history; dynamism is regulated through constraints on the local agency of individual nodes and their risk behaviors, while simulation trajectories are validated using system-wide metrics. To illustrate its utility, we present a case study that applies the proposed framework towards a simulation of HIV in artificial networks of intravenous drug users (IDUs) modeled using data collected in the Social Factors for HIV Risk survey. PMID:25859056

Modeling Epidemics Spreading on Social Contact Networks.

PubMed

Zhang, Zhaoyang; Wang, Honggang; Wang, Chonggang; Fang, Hua

2015-09-01

Social contact networks and the way people interact with each other are the key factors that impact on epidemics spreading. However, it is challenging to model the behavior of epidemics based on social contact networks due to their high dynamics. Traditional models such as susceptible-infected-recovered (SIR) model ignore the crowding or protection effect and thus has some unrealistic assumption. In this paper, we consider the crowding or protection effect and develop a novel model called improved SIR model. Then, we use both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks. The results from both simulations and real data set conclude that the epidemics are more likely to outbreak on social contact networks with higher average degree. We also present some potential immunization strategies, such as random set immunization, dominating set immunization, and high degree set immunization to further prove the conclusion.

Modeling Epidemics Spreading on Social Contact Networks

PubMed Central

ZHANG, ZHAOYANG; WANG, HONGGANG; WANG, CHONGGANG; FANG, HUA

2016-01-01

Social contact networks and the way people interact with each other are the key factors that impact on epidemics spreading. However, it is challenging to model the behavior of epidemics based on social contact networks due to their high dynamics. Traditional models such as susceptible-infected-recovered (SIR) model ignore the crowding or protection effect and thus has some unrealistic assumption. In this paper, we consider the crowding or protection effect and develop a novel model called improved SIR model. Then, we use both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks. The results from both simulations and real data set conclude that the epidemics are more likely to outbreak on social contact networks with higher average degree. We also present some potential immunization strategies, such as random set immunization, dominating set immunization, and high degree set immunization to further prove the conclusion. PMID:27722037

The relationship between structure and function in locally observed complex networks

NASA Astrophysics Data System (ADS)

Comin, Cesar H.; Viana, Matheus P.; Costa, Luciano da F.

2013-01-01

Recently, studies looking at the small scale interactions taking place in complex networks have started to unveil the wealth of interactions that occur between groups of nodes. Such findings make the claim for a new systematic methodology to quantify, at node level, how dynamics are influenced (or differentiated) by the structure of the underlying system. Here we define a new measure that, based on the dynamical characteristics obtained for a large set of initial conditions, compares the dynamical behavior of the nodes present in the system. Through this measure, we find that the geographic and Barabási-Albert models have a high capacity for generating networks that exhibit groups of nodes with distinct dynamics compared to the rest of the network. The application of our methodology is illustrated with respect to two real systems. In the first we use the neuronal network of the nematode Caenorhabditis elegans to show that the interneurons of the ventral cord of the nematode present a very large dynamical differentiation when compared to the rest of the network. The second application concerns the SIS epidemic model on an airport network, where we quantify how different the distribution of infection times of high and low degree nodes can be, when compared to the expected value for the network.

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.

a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection

NASA Astrophysics Data System (ADS)

Li, Ping; Zhao, Qingzhen; Wang, Haitang

2013-05-01

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.

System Identification for Nonlinear Control Using Neural Networks

NASA Technical Reports Server (NTRS)

Stengel, Robert F.; Linse, Dennis J.

1990-01-01

An approach to incorporating artificial neural networks in nonlinear, adaptive control systems is described. The controller contains three principal elements: a nonlinear inverse dynamic control law whose coefficients depend on a comprehensive model of the plant, a neural network that models system dynamics, and a state estimator whose outputs drive the control law and train the neural network. Attention is focused on the system identification task, which combines an extended Kalman filter with generalized spline function approximation. Continual learning is possible during normal operation, without taking the system off line for specialized training. Nonlinear inverse dynamic control requires smooth derivatives as well as function estimates, imposing stringent goals on the approximating technique.

Analytical solution for a class of network dynamics with mechanical and financial applications

NASA Astrophysics Data System (ADS)

Krejčí, P.; Lamba, H.; Melnik, S.; Rachinskii, D.

2014-09-01

We show that for a certain class of dynamics at the nodes the response of a network of any topology to arbitrary inputs is defined in a simple way by its response to a monotone input. The nodes may have either a discrete or continuous set of states and there is no limit on the complexity of the network. The results provide both an efficient numerical method and the potential for accurate analytic approximation of the dynamics on such networks. As illustrative applications, we introduce a quasistatic mechanical model with objects interacting via frictional forces and a financial market model with avalanches and critical behavior that are generated by momentum trading strategies.

Suppressing disease spreading by using information diffusion on multiplex networks.

PubMed

Wang, Wei; Liu, Quan-Hui; Cai, Shi-Min; Tang, Ming; Braunstein, Lidia A; Stanley, H Eugene

2016-07-06

Although there is always an interplay between the dynamics of information diffusion and disease spreading, the empirical research on the systemic coevolution mechanisms connecting these two spreading dynamics is still lacking. Here we investigate the coevolution mechanisms and dynamics between information and disease spreading by utilizing real data and a proposed spreading model on multiplex network. Our empirical analysis finds asymmetrical interactions between the information and disease spreading dynamics. Our results obtained from both the theoretical framework and extensive stochastic numerical simulations suggest that an information outbreak can be triggered in a communication network by its own spreading dynamics or by a disease outbreak on a contact network, but that the disease threshold is not affected by information spreading. Our key finding is that there is an optimal information transmission rate that markedly suppresses the disease spreading. We find that the time evolution of the dynamics in the proposed model qualitatively agrees with the real-world spreading processes at the optimal information transmission rate.

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 individuals protect themselves by disconnecting their links to infected neighbors with probability w and reconnecting them to other susceptible individuals chosen at random. Starting from a single infected individual, we show by an analytical approach and simulations that there is a phase transition at a critical rewiring (quarantine) threshold wc separating a phase (w < wc) where the disease reaches a large fraction of the population from a phase (w > wc) where the disease does not spread out. We find that in our model the topology of the network strongly affects the size of the propagation and that wc increases with the mean degree and heterogeneity of the network. We also find that wc is reduced if we perform a preferential rewiring, in which the rewiring probability is proportional to the degree of infected nodes. In the fourth chapter, we study epidemic processes on interconnected network systems, and find two distinct regimes. In strongly-coupled network systems, epidemics occur simultaneously across the entire system at a critical value betac. In contrast, in weakly-coupled network systems, a mixed phase exists below betac where an epidemic occurs in one network but does not spread to the coupled network. We derive an expression for the network and disease parameters that allow this mixed phase and verify it numerically. Public health implications of communities comprising these two classes of network systems are also mentioned.

A Dynamic Bayesian Network Based Structural Learning towards Automated Handwritten Digit Recognition

NASA Astrophysics Data System (ADS)

Pauplin, Olivier; Jiang, Jianmin

Pattern recognition using Dynamic Bayesian Networks (DBNs) is currently a growing area of study. In this paper, we present DBN models trained for classification of handwritten digit characters. The structure of these models is partly inferred from the training data of each class of digit before performing parameter learning. Classification results are presented for the four described models.

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

Dmitriev, Alexander S.; Yemelyanov, Ruslan Yu.; Moscow Institute of Physics and Technology

The paper deals with a new multi-element processor platform assigned for modelling the behaviour of interacting dynamical systems, i.e., active wireless network. Experimentally, this ensemble is implemented in an active network, the active nodes of which include direct chaotic transceivers and special actuator boards containing microcontrollers for modelling the dynamical systems and an information display unit (colored LEDs). The modelling technique and experimental results are described and analyzed.

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

NASA Astrophysics Data System (ADS)

Yaghoubi, Saeed; Noori, Siamak; Mazdeh, Mohammad Mahdavi

2013-06-01

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.

Hideen Markov Models and Neural Networks for Fault Detection in Dynamic Systems

NASA Technical Reports Server (NTRS)

Smyth, Padhraic

1994-01-01

None given. (From conclusion): Neural networks plus Hidden Markov Models(HMM)can provide excellene detection and false alarm rate performance in fault detection applications. Modified models allow for novelty detection. Also covers some key contributions of neural network model, and application status.

Signal Processing in Periodically Forced Gradient Frequency Neural Networks

PubMed Central

Kim, Ji Chul; Large, Edward W.

2015-01-01

Oscillatory instability at the Hopf bifurcation is a dynamical phenomenon that has been suggested to characterize active non-linear processes observed in the auditory system. Networks of oscillators poised near Hopf bifurcation points and tuned to tonotopically distributed frequencies have been used as models of auditory processing at various levels, but systematic investigation of the dynamical properties of such oscillatory networks is still lacking. Here we provide a dynamical systems analysis of a canonical model for gradient frequency neural networks driven by a periodic signal. We use linear stability analysis to identify various driven behaviors of canonical oscillators for all possible ranges of model and forcing parameters. The analysis shows that canonical oscillators exhibit qualitatively different sets of driven states and transitions for different regimes of model parameters. We classify the parameter regimes into four main categories based on their distinct signal processing capabilities. This analysis will lead to deeper understanding of the diverse behaviors of neural systems under periodic forcing and can inform the design of oscillatory network models of auditory signal processing. PMID:26733858

A biophysical model of dynamic balancing of excitation and inhibition in fast oscillatory large-scale networks

PubMed Central

Sotiropoulos, Stamatios N.; Brookes, Matthew J.; Woolrich, Mark W.

2018-01-01

Over long timescales, neuronal dynamics can be robust to quite large perturbations, such as changes in white matter connectivity and grey matter structure through processes including learning, aging, development and certain disease processes. One possible explanation is that robust dynamics are facilitated by homeostatic mechanisms that can dynamically rebalance brain networks. In this study, we simulate a cortical brain network using the Wilson-Cowan neural mass model with conduction delays and noise, and use inhibitory synaptic plasticity (ISP) to dynamically achieve a spatially local balance between excitation and inhibition. Using MEG data from 55 subjects we find that ISP enables us to simultaneously achieve high correlation with multiple measures of functional connectivity, including amplitude envelope correlation and phase locking. Further, we find that ISP successfully achieves local E/I balance, and can consistently predict the functional connectivity computed from real MEG data, for a much wider range of model parameters than is possible with a model without ISP. PMID:29474352

A system of recurrent neural networks for modularising, parameterising and dynamic analysis of cell signalling networks.

PubMed

Samarasinghe, S; Ling, H

In this paper, we show how to extend our previously proposed novel continuous time Recurrent Neural Networks (RNN) approach that retains the advantage of continuous dynamics offered by Ordinary Differential Equations (ODE) while enabling parameter estimation through adaptation, to larger signalling networks using a modular approach. Specifically, the signalling network is decomposed into several sub-models based on important temporal events in the network. Each sub-model is represented by the proposed RNN and trained using data generated from the corresponding ODE model. Trained sub-models are assembled into a whole system RNN which is then subjected to systems dynamics and sensitivity analyses. The concept is illustrated by application to G1/S transition in cell cycle using Iwamoto et al. (2008) ODE model. We decomposed the G1/S network into 3 sub-models: (i) E2F transcription factor release; (ii) E2F and CycE positive feedback loop for elevating cyclin levels; and (iii) E2F and CycA negative feedback to degrade E2F. The trained sub-models accurately represented system dynamics and parameters were in good agreement with the ODE model. The whole system RNN however revealed couple of parameters contributing to compounding errors due to feedback and required refinement to sub-model 2. These related to the reversible reaction between CycE/CDK2 and p27, its inhibitor. The revised whole system RNN model very accurately matched dynamics of the ODE system. Local sensitivity analysis of the whole system model further revealed the most dominant influence of the above two parameters in perturbing G1/S transition, giving support to a recent hypothesis that the release of inhibitor p27 from Cyc/CDK complex triggers cell cycle stage transition. To make the model useful in a practical setting, we modified each RNN sub-model with a time relay switch to facilitate larger interval input data (≈20min) (original model used data for 30s or less) and retrained them that produced parameters and protein concentrations similar to the original RNN system. Results thus demonstrated the reliability of the proposed RNN method for modelling relatively large networks by modularisation for practical settings. Advantages of the method are its ability to represent accurate continuous system dynamics and ease of: parameter estimation through training with data from a practical setting, model analysis (40% faster than ODE), fine tuning parameters when more data are available, sub-model extension when new elements and/or interactions come to light and model expansion with addition of sub-models. Copyright © 2017 Elsevier B.V. All rights reserved.

A Neural Network Model to Learn Multiple Tasks under Dynamic Environments

NASA Astrophysics Data System (ADS)

Tsumori, Kenji; Ozawa, Seiichi

When environments are dynamically changed for agents, the knowledge acquired in an environment might be useless in future. In such dynamic environments, agents should be able to not only acquire new knowledge but also modify old knowledge in learning. However, modifying all knowledge acquired before is not efficient because the knowledge once acquired may be useful again when similar environment reappears and some knowledge can be shared among different environments. To learn efficiently in such environments, we propose a neural network model that consists of the following modules: resource allocating network, long-term & short-term memory, and environment change detector. We evaluate the model under a class of dynamic environments where multiple function approximation tasks are sequentially given. The experimental results demonstrate that the proposed model possesses stable incremental learning, accurate environmental change detection, proper association and recall of old knowledge, and efficient knowledge transfer.

Modeling Day-to-day Flow Dynamics on Degradable Transport Network

PubMed Central

Gao, Bo; Zhang, Ronghui; Lou, Xiaoming

2016-01-01

Stochastic link capacity degradations are common phenomena in transport network which can cause travel time variations and further can affect travelers’ daily route choice behaviors. This paper formulates a deterministic dynamic model, to capture the day-to-day (DTD) flow evolution process in the presence of degraded link capacity degradations. The aggregated network flow dynamics are driven by travelers’ study of uncertain travel time and their choice of risky routes. This paper applies the exponential-smoothing filter to describe travelers’ study of travel time variations, and meanwhile formulates risk attitude parameter updating equation to reflect travelers’ endogenous risk attitude evolution schema. In addition, this paper conducts theoretical analyses to investigate several significant mathematical characteristics implied in the proposed DTD model, including fixed point existence, uniqueness, stability and irreversibility. Numerical experiments are used to demonstrate the effectiveness of the DTD model and verify some important dynamic system properties. PMID:27959903

An investigation of emotion dynamics in major depressive disorder patients and healthy persons using sparse longitudinal networks.

PubMed

de Vos, Stijn; Wardenaar, Klaas J; Bos, Elisabeth H; Wit, Ernst C; Bouwmans, Mara E J; de Jonge, Peter

2017-01-01

Differences in within-person emotion dynamics may be an important source of heterogeneity in depression. To investigate these dynamics, researchers have previously combined multilevel regression analyses with network representations. However, sparse network methods, specifically developed for longitudinal network analyses, have not been applied. Therefore, this study used this approach to investigate population-level and individual-level emotion dynamics in healthy and depressed persons and compared this method with the multilevel approach. Time-series data were collected in pair-matched healthy persons and major depressive disorder (MDD) patients (n = 54). Seven positive affect (PA) and seven negative affect (NA) items were administered electronically at 90 times (30 days; thrice per day). The population-level (healthy vs. MDD) and individual-level time series were analyzed using a sparse longitudinal network model based on vector autoregression. The population-level model was also estimated with a multilevel approach. Effects of different preprocessing steps were evaluated as well. The characteristics of the longitudinal networks were investigated to gain insight into the emotion dynamics. In the population-level networks, longitudinal network connectivity was strongest in the healthy group, with nodes showing more and stronger longitudinal associations with each other. Individually estimated networks varied strongly across individuals. Individual variations in network connectivity were unrelated to baseline characteristics (depression status, neuroticism, severity). A multilevel approach applied to the same data showed higher connectivity in the MDD group, which seemed partly related to the preprocessing approach. The sparse network approach can be useful for the estimation of networks with multiple nodes, where overparameterization is an issue, and for individual-level networks. However, its current inability to model random effects makes it less useful as a population-level approach in case of large heterogeneity. Different preprocessing strategies appeared to strongly influence the results, complicating inferences about network density.

Dynamical modeling and analysis of large cellular regulatory networks

NASA Astrophysics Data System (ADS)

Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.

2013-06-01

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Generalized Adaptive Artificial Neural Networks

NASA Technical Reports Server (NTRS)

Tawel, Raoul

1993-01-01

Mathematical model of supervised learning by artificial neural network provides for simultaneous adjustments of both temperatures of neurons and synaptic weights, and includes feedback as well as feedforward synaptic connections. Extension of mathematical model described in "Adaptive Neurons For Artificial Neural Networks" (NPO-17803). Dynamics of neural network represented in new model by less-restrictive continuous formalism.

Transformation of Context-dependent Sensory Dynamics into Motor Behavior

PubMed Central

Latorre, Roberto; Levi, Rafael; Varona, Pablo

2013-01-01

The intrinsic dynamics of sensory networks play an important role in the sensory-motor transformation. In this paper we use conductance based models and electrophysiological recordings to address the study of the dual role of a sensory network to organize two behavioral context-dependent motor programs in the mollusk Clione limacina. We show that: (i) a winner take-all dynamics in the gravimetric sensory network model drives the typical repetitive rhythm in the wing central pattern generator (CPG) during routine swimming; (ii) the winnerless competition dynamics of the same sensory network organizes the irregular pattern observed in the wing CPG during hunting behavior. Our model also shows that although the timing of the activity is irregular, the sequence of the switching among the sensory cells is preserved whenever the same set of neurons are activated in a given time window. These activation phase locks in the sensory signals are transformed into specific events in the motor activity. The activation phase locks can play an important role in motor coordination driven by the intrinsic dynamics of a multifunctional sensory organ. PMID:23459114

Network Events on Multiple Space and Time Scales in Cultured Neural Networks and in a Stochastic Rate Model

PubMed Central

Gigante, Guido; Deco, Gustavo; Marom, Shimon; Del Giudice, Paolo

2015-01-01

Cortical networks, in-vitro as well as in-vivo, can spontaneously generate a variety of collective dynamical events such as network spikes, UP and DOWN states, global oscillations, and avalanches. Though each of them has been variously recognized in previous works as expression of the excitability of the cortical tissue and the associated nonlinear dynamics, a unified picture of the determinant factors (dynamical and architectural) is desirable and not yet available. Progress has also been partially hindered by the use of a variety of statistical measures to define the network events of interest. We propose here a common probabilistic definition of network events that, applied to the firing activity of cultured neural networks, highlights the co-occurrence of network spikes, power-law distributed avalanches, and exponentially distributed ‘quasi-orbits’, which offer a third type of collective behavior. A rate model, including synaptic excitation and inhibition with no imposed topology, synaptic short-term depression, and finite-size noise, accounts for all these different, coexisting phenomena. We find that their emergence is largely regulated by the proximity to an oscillatory instability of the dynamics, where the non-linear excitable behavior leads to a self-amplification of activity fluctuations over a wide range of scales in space and time. In this sense, the cultured network dynamics is compatible with an excitation-inhibition balance corresponding to a slightly sub-critical regime. Finally, we propose and test a method to infer the characteristic time of the fatigue process, from the observed time course of the network’s firing rate. Unlike the model, possessing a single fatigue mechanism, the cultured network appears to show multiple time scales, signalling the possible coexistence of different fatigue mechanisms. PMID:26558616

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.

EEG-Based Quantification of Cortical Current Density and Dynamic Causal Connectivity Generalized across Subjects Performing BCI-Monitored Cognitive Tasks

PubMed Central

Courellis, Hristos; Mullen, Tim; Poizner, Howard; Cauwenberghs, Gert; Iversen, John R.

2017-01-01

Quantification of dynamic causal interactions among brain regions constitutes an important component of conducting research and developing applications in experimental and translational neuroscience. Furthermore, cortical networks with dynamic causal connectivity in brain-computer interface (BCI) applications offer a more comprehensive view of brain states implicated in behavior than do individual brain regions. However, models of cortical network dynamics are difficult to generalize across subjects because current electroencephalography (EEG) signal analysis techniques are limited in their ability to reliably localize sources across subjects. We propose an algorithmic and computational framework for identifying cortical networks across subjects in which dynamic causal connectivity is modeled among user-selected cortical regions of interest (ROIs). We demonstrate the strength of the proposed framework using a “reach/saccade to spatial target” cognitive task performed by 10 right-handed individuals. Modeling of causal cortical interactions was accomplished through measurement of cortical activity using (EEG), application of independent component clustering to identify cortical ROIs as network nodes, estimation of cortical current density using cortically constrained low resolution electromagnetic brain tomography (cLORETA), multivariate autoregressive (MVAR) modeling of representative cortical activity signals from each ROI, and quantification of the dynamic causal interaction among the identified ROIs using the Short-time direct Directed Transfer function (SdDTF). The resulting cortical network and the computed causal dynamics among its nodes exhibited physiologically plausible behavior, consistent with past results reported in the literature. This physiological plausibility of the results strengthens the framework's applicability in reliably capturing complex brain functionality, which is required by applications, such as diagnostics and BCI. PMID:28566997

Robust sequential working memory recall in heterogeneous cognitive networks

PubMed Central

Rabinovich, Mikhail I.; Sokolov, Yury; Kozma, Robert

2014-01-01

Psychiatric disorders are often caused by partial heterogeneous disinhibition in cognitive networks, controlling sequential and spatial working memory (SWM). Such dynamic connectivity changes suggest that the normal relationship between the neuronal components within the network deteriorates. As a result, competitive network dynamics is qualitatively altered. This dynamics defines the robust recall of the sequential information from memory and, thus, the SWM capacity. To understand pathological and non-pathological bifurcations of the sequential memory dynamics, here we investigate the model of recurrent inhibitory-excitatory networks with heterogeneous inhibition. We consider the ensemble of units with all-to-all inhibitory connections, in which the connection strengths are monotonically distributed at some interval. Based on computer experiments and studying the Lyapunov exponents, we observed and analyzed the new phenomenon—clustered sequential dynamics. The results are interpreted in the context of the winnerless competition principle. Accordingly, clustered sequential dynamics is represented in the phase space of the model by two weakly interacting quasi-attractors. One of them is similar to the sequential heteroclinic chain—the regular image of SWM, while the other is a quasi-chaotic attractor. Coexistence of these quasi-attractors means that the recall of the normal information sequence is intermittently interrupted by episodes with chaotic dynamics. We indicate potential dynamic ways for augmenting damaged working memory and other cognitive functions. PMID:25452717

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…

Neural Networks for Rapid Design and Analysis

NASA Technical Reports Server (NTRS)

Sparks, Dean W., Jr.; Maghami, Peiman G.

1998-01-01

Artificial neural networks have been employed for rapid and efficient dynamics and control analysis of flexible systems. Specifically, feedforward neural networks are designed to approximate nonlinear dynamic components over prescribed input ranges, and are used in simulations as a means to speed up the overall time response analysis process. To capture the recursive nature of dynamic components with artificial neural networks, recurrent networks, which use state feedback with the appropriate number of time delays, as inputs to the networks, are employed. Once properly trained, neural networks can give very good approximations to nonlinear dynamic components, and by their judicious use in simulations, allow the analyst the potential to speed up the analysis process considerably. To illustrate this potential speed up, an existing simulation model of a spacecraft reaction wheel system is executed, first conventionally, and then with an artificial neural network in place.

Near real-time traffic routing

NASA Technical Reports Server (NTRS)

Yang, Chaowei (Inventor); Xie, Jibo (Inventor); Zhou, Bin (Inventor); Cao, Ying (Inventor)

2012-01-01

A near real-time physical transportation network routing system comprising: a traffic simulation computing grid and a dynamic traffic routing service computing grid. The traffic simulator produces traffic network travel time predictions for a physical transportation network using a traffic simulation model and common input data. The physical transportation network is divided into a multiple sections. Each section has a primary zone and a buffer zone. The traffic simulation computing grid includes multiple of traffic simulation computing nodes. The common input data includes static network characteristics, an origin-destination data table, dynamic traffic information data and historical traffic data. The dynamic traffic routing service computing grid includes multiple dynamic traffic routing computing nodes and generates traffic route(s) using the traffic network travel time predictions.

An Evolutionary Game Theory Model of Spontaneous Brain Functioning.

PubMed

Madeo, Dario; Talarico, Agostino; Pascual-Leone, Alvaro; Mocenni, Chiara; Santarnecchi, Emiliano

2017-11-22

Our brain is a complex system of interconnected regions spontaneously organized into distinct networks. The integration of information between and within these networks is a continuous process that can be observed even when the brain is at rest, i.e. not engaged in any particular task. Moreover, such spontaneous dynamics show predictive value over individual cognitive profile and constitute a potential marker in neurological and psychiatric conditions, making its understanding of fundamental importance in modern neuroscience. Here we present a theoretical and mathematical model based on an extension of evolutionary game theory on networks (EGN), able to capture brain's interregional dynamics by balancing emulative and non-emulative attitudes among brain regions. This results in the net behavior of nodes composing resting-state networks identified using functional magnetic resonance imaging (fMRI), determining their moment-to-moment level of activation and inhibition as expressed by positive and negative shifts in BOLD fMRI signal. By spontaneously generating low-frequency oscillatory behaviors, the EGN model is able to mimic functional connectivity dynamics, approximate fMRI time series on the basis of initial subset of available data, as well as simulate the impact of network lesions and provide evidence of compensation mechanisms across networks. Results suggest evolutionary game theory on networks as a new potential framework for the understanding of human brain network dynamics.

Application of network methods for understanding evolutionary dynamics in discrete habitats.

PubMed

Greenbaum, Gili; Fefferman, Nina H

2017-06-01

In populations occupying discrete habitat patches, gene flow between habitat patches may form an intricate population structure. In such structures, the evolutionary dynamics resulting from interaction of gene-flow patterns with other evolutionary forces may be exceedingly complex. Several models describing gene flow between discrete habitat patches have been presented in the population-genetics literature; however, these models have usually addressed relatively simple settings of habitable patches and have stopped short of providing general methodologies for addressing nontrivial gene-flow patterns. In the last decades, network theory - a branch of discrete mathematics concerned with complex interactions between discrete elements - has been applied to address several problems in population genetics by modelling gene flow between habitat patches using networks. Here, we present the idea and concepts of modelling complex gene flows in discrete habitats using networks. Our goal is to raise awareness to existing network theory applications in molecular ecology studies, as well as to outline the current and potential contribution of network methods to the understanding of evolutionary dynamics in discrete habitats. We review the main branches of network theory that have been, or that we believe potentially could be, applied to population genetics and molecular ecology research. We address applications to theoretical modelling and to empirical population-genetic studies, and we highlight future directions for extending the integration of network science with molecular ecology. © 2017 John Wiley & Sons Ltd.

Exploring Classroom Interaction with Dynamic Social Network Analysis

ERIC Educational Resources Information Center

Bokhove, Christian

2018-01-01

This article reports on an exploratory project in which technology and dynamic social network analysis (SNA) are used for modelling classroom interaction. SNA focuses on the links between social actors, draws on graphic imagery to reveal and display the patterning of those links, and develops mathematical and computational models to describe and…

Scalable Online Network Modeling and Simulation

DTIC Science & Technology

2005-08-01

ONLINE NETWORK MODELING AND SIMULATION 6. AUTHOR(S) Boleslaw Szymanski , Shivkumar Kalyanaraman, Biplab Sikdar and Christopher Carothers 5...performance for a wide range of parameter values (parameter sensitivity), understanding of protocol stability and dynamics, and studying feature ...a wide range of parameter values (parameter sensitivity), understanding of protocol stability and dynamics, and studying feature interactions

Functional connectivity dynamically evolves on multiple time-scales over a static structural connectome: Models and mechanisms.

PubMed

Cabral, Joana; Kringelbach, Morten L; Deco, Gustavo

2017-10-15

Over the last decade, we have observed a revolution in brain structural and functional Connectomics. On one hand, we have an ever-more detailed characterization of the brain's white matter structural connectome. On the other, we have a repertoire of consistent functional networks that form and dissipate over time during rest. Despite the evident spatial similarities between structural and functional connectivity, understanding how different time-evolving functional networks spontaneously emerge from a single structural network requires analyzing the problem from the perspective of complex network dynamics and dynamical system's theory. In that direction, bottom-up computational models are useful tools to test theoretical scenarios and depict the mechanisms at the genesis of resting-state activity. Here, we provide an overview of the different mechanistic scenarios proposed over the last decade via computational models. Importantly, we highlight the need of incorporating additional model constraints considering the properties observed at finer temporal scales with MEG and the dynamical properties of FC in order to refresh the list of candidate scenarios. Copyright © 2017 Elsevier Inc. All rights reserved.

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

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

Liu, Guodong; Ollis, Thomas B.; Xiao, Bailu

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF)more » model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.« less

Emergent behaviors of the Schrödinger-Lohe model on cooperative-competitive networks

NASA Astrophysics Data System (ADS)

Huh, Hyungjin; Ha, Seung-Yeal; Kim, Dohyun

2017-12-01

We present several sufficient frameworks leading to the emergent behaviors of the coupled Schrödinger-Lohe (S-L) model under the same one-body external potential on cooperative-competitive networks. The S-L model was first introduced as a possible phenomenological model exhibiting quantum synchronization and its emergent dynamics on all-to-all cooperative networks has been treated via two distinct approaches, Lyapunov functional approach and the finite-dimensional reduction based on pairwise correlations. In this paper, we further generalize the finite-dimensional dynamical systems approach for pairwise correlation functions on cooperative-competitive networks and provide several sufficient frameworks leading to the collective exponential synchronization. For small systems consisting of three and four quantum subsystem, we also show that the system for pairwise correlations can be reduced to the Lotka-Volterra model with cooperative and competitive interactions, in which lots of interesting dynamical patterns appear, e.g., existence of closed orbits and limit-cycles.

Model and Dynamic Behavior of Malware Propagation over Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Song, Yurong; Jiang, Guo-Ping

Based on the inherent characteristics of wireless sensor networks (WSN), the dynamic behavior of malware propagation in flat WSN is analyzed and investigated. A new model is proposed using 2-D cellular automata (CA), which extends the traditional definition of CA and establishes whole transition rules for malware propagation in WSN. Meanwhile, the validations of the model are proved through theoretical analysis and simulations. The theoretical analysis yields closed-form expressions which show good agreement with the simulation results of the proposed model. It is shown that the malware propaga-tion in WSN unfolds neighborhood saturation, which dominates the effects of increasing infectivity and limits the spread of the malware. MAC mechanism of wireless sensor networks greatly slows down the speed of malware propagation and reduces the risk of large-scale malware prevalence in these networks. The proposed model can describe accurately the dynamic behavior of malware propagation over WSN, which can be applied in developing robust and efficient defense system on WSN.

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

DOE PAGES

Liu, Guodong; Ollis, Thomas B.; Xiao, Bailu; ...

2017-10-10

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF)more » model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.« less

Dynamics of functional failures and recovery in complex road networks

NASA Astrophysics Data System (ADS)

Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.

2017-11-01

We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

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

Quasispecies dynamics on a network of interacting genotypes and idiotypes: formulation of the model

NASA Astrophysics Data System (ADS)

Barbosa, Valmir C.; Donangelo, Raul; Souza, Sergio R.

2015-01-01

A quasispecies is the stationary state of a set of interrelated genotypes that evolve according to the usual principles of selection and mutation. Quasispecies studies have for the most part concentrated on the possibility of errors during genotype replication and their role in promoting either the survival or the demise of the quasispecies. In a previous work, we introduced a network model of quasispecies dynamics, based on a single probability parameter (p) and capable of addressing several plausibility issues of previous models. Here we extend that model by pairing its network with another one aimed at modeling the dynamics of the immune system when confronted with the quasispecies. The new network is based on the idiotypic-network model of immunity and, together with the previous one, constitutes a network model of interacting genotypes and idiotypes. The resulting model requires further parameters and as a consequence leads to a vast phase space. We have focused on a particular niche in which it is possible to observe the trade-offs involved in the quasispecies' survival or destruction. Within this niche, we give simulation results that highlight some key preconditions for quasispecies survival. These include a minimum initial abundance of genotypes relative to that of the idiotypes and a minimum value of p. The latter, in particular, is to be contrasted with the stand-alone quasispecies network of our previous work, in which arbitrarily low values of p constitute a guarantee of quasispecies survival.

Accounting for system dynamics in reserve design.

PubMed

Leroux, Shawn J; Schmiegelow, Fiona K A; Cumming, Steve G; Lessard, Robert B; Nagy, John

2007-10-01

Systematic conservation plans have only recently considered the dynamic nature of ecosystems. Methods have been developed to incorporate climate change, population dynamics, and uncertainty in reserve design, but few studies have examined how to account for natural disturbance. Considering natural disturbance in reserve design may be especially important for the world's remaining intact areas, which still experience active natural disturbance regimes. We developed a spatially explicit, dynamic simulation model, CONSERV, which simulates patch dynamics and fire, and used it to evaluate the efficacy of hypothetical reserve networks in northern Canada. We designed six networks based on conventional reserve design methods, with different conservation targets for woodland caribou habitat, high-quality wetlands, vegetation, water bodies, and relative connectedness. We input the six reserve networks into CONSERV and tracked the ability of each to maintain initial conservation targets through time under an active natural disturbance regime. None of the reserve networks maintained all initial targets, and some over-represented certain features, suggesting that both effectiveness and efficiency of reserve design could be improved through use of spatially explicit dynamic simulation during the planning process. Spatial simulation models of landscape dynamics are commonly used in natural resource management, but we provide the first illustration of their potential use for reserve design. Spatial simulation models could be used iteratively to evaluate competing reserve designs and select targets that have a higher likelihood of being maintained through time. Such models could be combined with dynamic planning techniques to develop a general theory for reserve design in an uncertain world.

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

A Multilayer Naïve Bayes Model for Analyzing User's Retweeting Sentiment Tendency.

PubMed

Wang, Mengmeng; Zuo, Wanli; Wang, Ying

2015-01-01

Today microblogging has increasingly become a means of information diffusion via user's retweeting behavior. Since retweeting content, as context information of microblogging, is an understanding of microblogging, hence, user's retweeting sentiment tendency analysis has gradually become a hot research topic. Targeted at online microblogging, a dynamic social network, we investigate how to exploit dynamic retweeting sentiment features in retweeting sentiment tendency analysis. On the basis of time series of user's network structure information and published text information, we first model dynamic retweeting sentiment features. Then we build Naïve Bayes models from profile-, relationship-, and emotion-based dimensions, respectively. Finally, we build a multilayer Naïve Bayes model based on multidimensional Naïve Bayes models to analyze user's retweeting sentiment tendency towards a microblog. Experiments on real-world dataset demonstrate the effectiveness of the proposed framework. Further experiments are conducted to understand the importance of dynamic retweeting sentiment features and temporal information in retweeting sentiment tendency analysis. What is more, we provide a new train of thought for retweeting sentiment tendency analysis in dynamic social networks.

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 single-path assumption, but also by demonstrating the importance of considering temporal dynamics, and specifically introducing the usefulness of Boolean network models and also reviewing some key properties of network approaches. PMID:22645556

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.

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.

A study on predicting network corrections in PPP-RTK processing

NASA Astrophysics Data System (ADS)

Wang, Kan; Khodabandeh, Amir; Teunissen, Peter

2017-10-01

In PPP-RTK processing, the network corrections including the satellite clocks, the satellite phase biases and the ionospheric delays are provided to the users to enable fast single-receiver integer ambiguity resolution. To solve the rank deficiencies in the undifferenced observation equations, the estimable parameters are formed to generate full-rank design matrix. In this contribution, we firstly discuss the interpretation of the estimable parameters without and with a dynamic satellite clock model incorporated in a Kalman filter during the network processing. The functionality of the dynamic satellite clock model is tested in the PPP-RTK processing. Due to the latency generated by the network processing and data transfer, the network corrections are delayed for the real-time user processing. To bridge the latencies, we discuss and compare two prediction approaches making use of the network corrections without and with the dynamic satellite clock model, respectively. The first prediction approach is based on the polynomial fitting of the estimated network parameters, while the second approach directly follows the dynamic model in the Kalman filter of the network processing and utilises the satellite clock drifts estimated in the network processing. Using 1 Hz data from two networks in Australia, the influences of the two prediction approaches on the user positioning results are analysed and compared for latencies ranging from 3 to 10 s. The accuracy of the positioning results decreases with the increasing latency of the network products. For a latency of 3 s, the RMS of the horizontal and the vertical coordinates (with respect to the ground truth) do not show large differences applying both prediction approaches. For a latency of 10 s, the prediction approach making use of the satellite clock model has generated slightly better positioning results with the differences of the RMS at mm-level. Further advantages and disadvantages of both prediction approaches are also discussed in this contribution.

Synaptic dynamics regulation in response to high frequency stimulation in neuronal networks

NASA Astrophysics Data System (ADS)

Su, Fei; Wang, Jiang; Li, Huiyan; Wei, Xile; Yu, Haitao; Deng, Bin

2018-02-01

High frequency stimulation (HFS) has confirmed its ability in modulating the pathological neural activities. However its detailed mechanism is unclear. This study aims to explore the effects of HFS on neuronal networks dynamics. First, the two-neuron FitzHugh-Nagumo (FHN) networks with static coupling strength and the small-world FHN networks with spike-time-dependent plasticity (STDP) modulated synaptic coupling strength are constructed. Then, the multi-scale method is used to transform the network models into equivalent averaged models, where the HFS intensity is modeled as the ratio between stimulation amplitude and frequency. Results show that in static two-neuron networks, there is still synaptic current projected to the postsynaptic neuron even if the presynaptic neuron is blocked by the HFS. In the small-world networks, the effects of the STDP adjusting rate parameter on the inactivation ratio and synchrony degree increase with the increase of HFS intensity. However, only when the HFS intensity becomes very large can the STDP time window parameter affect the inactivation ratio and synchrony index. Both simulation and numerical analysis demonstrate that the effects of HFS on neuronal network dynamics are realized through the adjustment of synaptic variable and conductance.

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.

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.

Resilience and Controllability of Dynamic Collective Behaviors

PubMed Central

Komareji, Mohammad; Bouffanais, Roland

2013-01-01

The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics. PMID:24358209

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.

Optimal control of epidemic information dissemination over networks.

PubMed

Chen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng

2014-12-01

Information dissemination control is of crucial importance to facilitate reliable and efficient data delivery, especially in networks consisting of time-varying links or heterogeneous links. Since the abstraction of information dissemination much resembles the spread of epidemics, epidemic models are utilized to characterize the collective dynamics of information dissemination over networks. From a systematic point of view, we aim to explore the optimal control policy for information dissemination given that the control capability is a function of its distribution time, which is a more realistic model in many applications. The main contributions of this paper are to provide an analytically tractable model for information dissemination over networks, to solve the optimal control signal distribution time for minimizing the accumulated network cost via dynamic programming, and to establish a parametric plug-in model for information dissemination control. In particular, we evaluate its performance in mobile and generalized social networks as typical examples.

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.

A Highly Flexible and Efficient Passive Optical Network Employing Dynamic Wavelength Allocation

NASA Astrophysics Data System (ADS)

Hsueh, Yu-Li; Rogge, Matthew S.; Yamamoto, Shu; Kazovsky, Leonid G.

2005-01-01

A novel and high-performance passive optical network (PON), the SUCCESS-DWA PON, employs dynamic wavelength allocation to provide bandwidth sharing across multiple physical PONs. In the downstream, tunable lasers, an arrayed waveguide grating, and coarse/fine filtering combine to create a flexible new optical access solution. In the upstream, several distributed and centralized schemes are proposed and investigated. The network performance is compared to conventional TDM-PONs under different traffic models, including the self-similar traffic model and the transaction-oriented model. Broadcast support and deployment issues are addressed. The network's excellent scalability can bridge the gap between conventional TDM-PONs and WDM-PONs. The powerful architecture is a promising candidate for next generation optical access networks.

On neural networks in identification and control of dynamic systems

NASA Technical Reports Server (NTRS)

Phan, Minh; Juang, Jer-Nan; Hyland, David C.

1993-01-01

This paper presents a discussion of the applicability of neural networks in the identification and control of dynamic systems. Emphasis is placed on the understanding of how the neural networks handle linear systems and how the new approach is related to conventional system identification and control methods. Extensions of the approach to nonlinear systems are then made. The paper explains the fundamental concepts of neural networks in their simplest terms. Among the topics discussed are feed forward and recurrent networks in relation to the standard state-space and observer models, linear and nonlinear auto-regressive models, linear, predictors, one-step ahead control, and model reference adaptive control for linear and nonlinear systems. Numerical examples are presented to illustrate the application of these important concepts.

SDN-Enabled Dynamic Feedback Control and Sensing in Agile Optical Networks

NASA Astrophysics Data System (ADS)

Lin, Likun

Fiber optic networks are no longer just pipelines for transporting data in the long haul backbone. Exponential growth in traffic in metro-regional areas has pushed higher capacity fiber toward the edge of the network, and highly dynamic patterns of heterogeneous traffic have emerged that are often bursty, severely stressing the historical "fat and dumb pipe" static optical network, which would need to be massively over-provisioned to deal with these loads. What is required is a more intelligent network with a span of control over the optical as well as electrical transport mechanisms which enables handling of service requests in a fast and efficient way that guarantees quality of service (QoS) while optimizing capacity efficiency. An "agile" optical network is a reconfigurable optical network comprised of high speed intelligent control system fed by real-time in situ network sensing. It provides fast response in the control and switching of optical signals in response to changing traffic demands and network conditions. This agile control of optical signals is enabled by pushing switching decisions downward in the network stack to the physical layer. Implementing such agility is challenging due to the response dynamics and interactions of signals in the physical layer. Control schemes must deal with issues such as dynamic power equalization, EDFA transients and cascaded noise effects, impairments due to self-phase modulation and dispersion, and channel-to-channel cross talk. If these issues are not properly predicted and mitigated, attempts at dynamic control can drive the optical network into an unstable state. In order to enable high speed actuation of signal modulators and switches, the network controller must be able to make decisions based on predictive models. In this thesis, we consider how to take advantage of Software Defined Networking (SDN) capabilities for network reconfiguration, combined with embedded models that access updates from deployed network monitoring sensors. In order to maintain signal quality while optimizing network resources, we find that it is essential to model and update estimates of the physical link impairments in real-time. In this thesis, we consider the key elements required to enable an agile optical network, with contributions as follows: • Control Framework: extended the SDN concept to include the optical transport network through extensions to the OpenFlow (OF) protocol. A unified SDN control plane is built to facilitate control and management capability across the electrical/packet-switched and optical/circuit-switched portions of the network seamlessly. The SDN control plane serves as a platform to abstract the resources of multilayer/multivendor networks. Through this platform, applications can dynamically request the network resources to meet their service requirements. • Use of In-situ Monitors: enabled real-time physical impairment sensing in the control plane using in-situ Optical Performance Monitoring (OPM) and bit error rate (BER) analyzers. OPM and BER values are used as quantitative indicators of the link status and are fed to the control plane through a high-speed data collection interface to form a closed-loop feedback system to enable adaptive resource allocation. • Predictive Network Model: used a network model embedded in the control layer to study the link status. The estimated results of network status is fed into the control decisions to precompute the network resources. The performance of the network model can be enhanced by the sensing results. • Real-Time Control Algorithms: investigated various dynamic resource allocation mechanisms supporting an agile optical network. Intelligent routing and wavelength switching for recovering from traffic impairments is achieved experimentally in the agile optical network within one second. A distance-adaptive spectrum allocation scheme to address transmission impairments caused by cascaded Wavelength Selective Switches (WSS) is proposed and evaluated for improving network spectral efficiency.

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.

Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

PubMed Central

Lähdesmäki, Harri; Hautaniemi, Sampsa; Shmulevich, Ilya; Yli-Harja, Olli

2006-01-01

A significant amount of attention has recently been focused on modeling of gene regulatory networks. Two frequently used large-scale modeling frameworks are Bayesian networks (BNs) and Boolean networks, the latter one being a special case of its recent stochastic extension, probabilistic Boolean networks (PBNs). PBN is a promising model class that generalizes the standard rule-based interactions of Boolean networks into the stochastic setting. Dynamic Bayesian networks (DBNs) is a general and versatile model class that is able to represent complex temporal stochastic processes and has also been proposed as a model for gene regulatory systems. In this paper, we concentrate on these two model classes and demonstrate that PBNs and a certain subclass of DBNs can represent the same joint probability distribution over their common variables. The major benefit of introducing the relationships between the models is that it opens up the possibility of applying the standard tools of DBNs to PBNs and vice versa. Hence, the standard learning tools of DBNs can be applied in the context of PBNs, and the inference methods give a natural way of handling the missing values in PBNs which are often present in gene expression measurements. Conversely, the tools for controlling the stationary behavior of the networks, tools for projecting networks onto sub-networks, and efficient learning schemes can be used for DBNs. In other words, the introduced relationships between the models extend the collection of analysis tools for both model classes. PMID:17415411

A nonlinear dynamical system for combustion instability in a pulse model combustor

NASA Astrophysics Data System (ADS)

Takagi, Kazushi; Gotoda, Hiroshi

2016-11-01

We theoretically and numerically study the bifurcation phenomena of nonlinear dynamical system describing combustion instability in a pulse model combustor on the basis of dynamical system theory and complex network theory. The dynamical behavior of pressure fluctuations undergoes a significant transition from steady-state to deterministic chaos via the period-doubling cascade process known as Feigenbaum scenario with decreasing the characteristic flow time. Recurrence plots and recurrence networks analysis we adopted in this study can quantify the significant changes in dynamic behavior of combustion instability that cannot be captured in the bifurcation diagram.

Multivariate machine learning distinguishes cross-network dynamic functional connectivity patterns in state and trait neuropathic pain.

PubMed

Cheng, J C; Rogachov, A; Hemington, K S; Kucyi, A; Bosma, R L; Lindquist, M A; Inman, R D; Davis, K D

2018-04-26

Communication within the brain is dynamic. Chronic pain can also be dynamic, with varying intensities experienced over time. Little is known of how brain dynamics are disrupted in chronic pain, or relates to patients' pain assessed at various time-scales (e.g., short-term state versus long-term trait). Patients experience pain "traits" indicative of their general condition, but also pain "states" that vary day to day. Here, we used network-based multivariate machine learning to determine how patterns in dynamic and static brain communication are related to different characteristics and timescales of chronic pain. Our models were based on resting state dynamic and static functional connectivity (dFC, sFC) in patients with chronic neuropathic pain (NP) or non-NP. The most prominent networks in the models were the default mode, salience, and executive control networks. We also found that cross-network measures of dFC rather than sFC were better associated with patients' pain, but only in those with NP features. These associations were also more highly and widely associated with measures of trait rather than state pain. Furthermore, greater dynamic connectivity with executive control networks was associated with milder neuropathic pain, but greater dynamic connectivity with limbic networks was associated greater neuropathic pain. Compared with healthy individuals, the dFC features most highly related to trait neuropathic pain were also more abnormal in patients with greater pain. Our findings indicate that dFC reflects patients' overall pain condition (i.e., trait pain), not just their current state, and is impacted by complexities in pain features beyond intensity.

Emergence of diversity in homogeneous coupled Boolean networks

NASA Astrophysics Data System (ADS)

Kang, Chris; Aguilar, Boris; Shmulevich, Ilya

2018-05-01

The origin of multicellularity in metazoa is one of the fundamental questions of evolutionary biology. We have modeled the generic behaviors of gene regulatory networks in isogenic cells as stochastic nonlinear dynamical systems—coupled Boolean networks with perturbation. Model simulations under a variety of dynamical regimes suggest that the central characteristic of multicellularity, permanent spatial differentiation (diversification), indeed can arise. Additionally, we observe that diversification is more likely to occur near the critical regime of Lyapunov stability.

Synaptic dynamics and neuronal network connectivity are reflected in the distribution of times in Up states.

PubMed

Dao Duc, Khanh; Parutto, Pierre; Chen, Xiaowei; Epsztein, Jérôme; Konnerth, Arthur; Holcman, David

2015-01-01

The dynamics of neuronal networks connected by synaptic dynamics can sustain long periods of depolarization that can last for hundreds of milliseconds such as Up states recorded during sleep or anesthesia. Yet the underlying mechanism driving these periods remain unclear. We show here within a mean-field model that the residence time of the neuronal membrane potential in cortical Up states does not follow a Poissonian law, but presents several peaks. Furthermore, the present modeling approach allows extracting some information about the neuronal network connectivity from the time distribution histogram. Based on a synaptic-depression model, we find that these peaks, that can be observed in histograms of patch-clamp recordings are not artifacts of electrophysiological measurements, but rather are an inherent property of the network dynamics. Analysis of the equations reveals a stable focus located close to the unstable limit cycle, delimiting a region that defines the Up state. The model further shows that the peaks observed in the Up state time distribution are due to winding around the focus before escaping from the basin of attraction. Finally, we use in vivo recordings of intracellular membrane potential and we recover from the peak distribution, some information about the network connectivity. We conclude that it is possible to recover the network connectivity from the distribution of times that the neuronal membrane voltage spends in Up states.

Networked dynamical systems with linear coupling: synchronisation patterns, coherence and other behaviours.

PubMed

Judd, Kevin

2013-12-01

Many physical and biochemical systems are well modelled as a network of identical non-linear dynamical elements with linear coupling between them. An important question is how network structure affects chaotic dynamics, for example, by patterns of synchronisation and coherence. It is shown that small networks can be characterised precisely into patterns of exact synchronisation and large networks characterised by partial synchronisation at the local and global scale. Exact synchronisation modes are explained using tools of symmetry groups and invariance, and partial synchronisation is explained by finite-time shadowing of exact synchronisation modes.

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.

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.

Joint physical and numerical modeling of water distribution networks.

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

Zimmerman, Adam; O'Hern, Timothy John; Orear, Leslie Jr.

2009-01-01

This report summarizes the experimental and modeling effort undertaken to understand solute mixing in a water distribution network conducted during the last year of a 3-year project. The experimental effort involves measurement of extent of mixing within different configurations of pipe networks, measurement of dynamic mixing in a single mixing tank, and measurement of dynamic solute mixing in a combined network-tank configuration. High resolution analysis of turbulence mixing is carried out via high speed photography as well as 3D finite-volume based Large Eddy Simulation turbulence models. Macroscopic mixing rules based on flow momentum balance are also explored, and in somemore » cases, implemented in EPANET. A new version EPANET code was developed to yield better mixing predictions. The impact of a storage tank on pipe mixing in a combined pipe-tank network during diurnal fill-and-drain cycles is assessed. Preliminary comparison between dynamic pilot data and EPANET-BAM is also reported.« less

Geographical influences of an emerging network of gang rivalries

NASA Astrophysics Data System (ADS)

Hegemann, Rachel A.; Smith, Laura M.; Barbaro, Alethea B. T.; Bertozzi, Andrea L.; Reid, Shannon E.; Tita, George E.

2011-10-01

We propose an agent-based model to simulate the creation of street gang rivalries. The movement dynamics of agents are coupled to an evolving network of gang rivalries, which is determined by previous interactions among agents in the system. Basic gang data, geographic information, and behavioral dynamics suggested by the criminology literature are integrated into the model. The major highways, rivers, and the locations of gangs’ centers of activity influence the agents’ motion. We use a policing division of the Los Angeles Police Department as a case study to test our model. We apply common metrics from graph theory to analyze our model, comparing networks produced by our simulations and an instance of a Geographical Threshold Graph to the existing network from the criminology literature.

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.

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-gene relationships. Taken together, construction and analysis of the GDI network can be a useful approach to identify novel gene-gene relationships in terms of the dynamical influence.

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

Dynamics of bounded confidence opinion in heterogeneous social networks: Concord against partial antagonism

NASA Astrophysics Data System (ADS)

Kurmyshev, Evguenii; Juárez, Héctor A.; González-Silva, Ricardo A.

2011-08-01

Bounded confidence models of opinion dynamics in social networks have been actively studied in recent years, in particular, opinion formation and extremism propagation along with other aspects of social dynamics. In this work, after an analysis of limitations of the Deffuant-Weisbuch (DW) bounded confidence, relative agreement model, we propose the mixed model that takes into account two psychological types of individuals. Concord agents (C-agents) are friendly people; they interact in a way that their opinions always get closer. Agents of the other psychological type show partial antagonism in their interaction (PA-agents). Opinion dynamics in heterogeneous social groups, consisting of agents of the two types, was studied on different social networks: Erdös-Rényi random graphs, small-world networks and complete graphs. Limit cases of the mixed model, pure C- and PA-societies, were also studied. We found that group opinion formation is, qualitatively, almost independent of the topology of networks used in this work. Opinion fragmentation, polarization and consensus are observed in the mixed model at different proportions of PA- and C-agents, depending on the value of initial opinion tolerance of agents. As for the opinion formation and arising of “dissidents”, the opinion dynamics of the C-agents society was found to be similar to that of the DW model, except for the rate of opinion convergence. Nevertheless, mixed societies showed dynamics and bifurcation patterns notably different to those of the DW model. The influence of biased initial conditions over opinion formation in heterogeneous social groups was also studied versus the initial value of opinion uncertainty, varying the proportion of the PA- to C-agents. Bifurcation diagrams showed an impressive evolution of collective opinion, in particular, radical changes of left to right consensus or vice versa at an opinion uncertainty value equal to 0.7 in the model with the PA/C mixture of population near 50/50.

Markov Task Network: A Framework for Service Composition under Uncertainty in Cyber-Physical Systems.

PubMed

Mohammed, Abdul-Wahid; Xu, Yang; Hu, Haixiao; Agyemang, Brighter

2016-09-21

In novel collaborative systems, cooperative entities collaborate services to achieve local and global objectives. With the growing pervasiveness of cyber-physical systems, however, such collaboration is hampered by differences in the operations of the cyber and physical objects, and the need for the dynamic formation of collaborative functionality given high-level system goals has become practical. In this paper, we propose a cross-layer automation and management model for cyber-physical systems. This models the dynamic formation of collaborative services pursuing laid-down system goals as an ontology-oriented hierarchical task network. Ontological intelligence provides the semantic technology of this model, and through semantic reasoning, primitive tasks can be dynamically composed from high-level system goals. In dealing with uncertainty, we further propose a novel bridge between hierarchical task networks and Markov logic networks, called the Markov task network. This leverages the efficient inference algorithms of Markov logic networks to reduce both computational and inferential loads in task decomposition. From the results of our experiments, high-precision service composition under uncertainty can be achieved using this approach.

Corruption dynamics model

NASA Astrophysics Data System (ADS)

Malafeyev, O. A.; Nemnyugin, S. A.; Rylow, D.; Kolpak, E. P.; Awasthi, Achal

2017-07-01

The corruption dynamics is analyzed by means of the lattice model which is similar to the three-dimensional Ising model. Agents placed at nodes of the corrupt network periodically choose to perfom or not to perform the act of corruption at gain or loss while making decisions based on the process history. The gain value and its dynamics are defined by means of the Markov stochastic process modelling with parameters established in accordance with the influence of external and individual factors on the agent's gain. The model is formulated algorithmically and is studied by means of the computer simulation. Numerical results are obtained which demonstrate asymptotic behaviour of the corruption network under various conditions.

Complex Networks/Foundations of Information Systems

DTIC Science & Technology

2013-03-06

the benefit of feedback or dynamic correlations in coding and protocol. Using Renyi correlation analysis and entropy to model this wider class of...dynamic heterogeneous conditions. Lizhong Zheng, MIT Renyi Channel Correlation Analysis (connected to geometric curvature) Network Channel

A gene regulatory network model for floral transition of the shoot apex in maize and its dynamic modeling.

PubMed

Dong, Zhanshan; Danilevskaya, Olga; Abadie, Tabare; Messina, Carlos; Coles, Nathan; Cooper, Mark

2012-01-01

The transition from the vegetative to reproductive development is a critical event in the plant life cycle. The accurate prediction of flowering time in elite germplasm is important for decisions in maize breeding programs and best agronomic practices. The understanding of the genetic control of flowering time in maize has significantly advanced in the past decade. Through comparative genomics, mutant analysis, genetic analysis and QTL cloning, and transgenic approaches, more than 30 flowering time candidate genes in maize have been revealed and the relationships among these genes have been partially uncovered. Based on the knowledge of the flowering time candidate genes, a conceptual gene regulatory network model for the genetic control of flowering time in maize is proposed. To demonstrate the potential of the proposed gene regulatory network model, a first attempt was made to develop a dynamic gene network model to predict flowering time of maize genotypes varying for specific genes. The dynamic gene network model is composed of four genes and was built on the basis of gene expression dynamics of the two late flowering id1 and dlf1 mutants, the early flowering landrace Gaspe Flint and the temperate inbred B73. The model was evaluated against the phenotypic data of the id1 dlf1 double mutant and the ZMM4 overexpressed transgenic lines. The model provides a working example that leverages knowledge from model organisms for the utilization of maize genomic information to predict a whole plant trait phenotype, flowering time, of maize genotypes.

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.

Cascading failures in interconnected networks with dynamical redistribution of loads

NASA Astrophysics Data System (ADS)

Zhao, Zhuang; Zhang, Peng; Yang, Hujiang

2015-09-01

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

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.

Disease spreading in real-life networks

NASA Astrophysics Data System (ADS)

Gallos, Lazaros; Argyrakis, Panos

2002-08-01

In recent years the scientific community has shown a vivid interest in the network structure and dynamics of real-life organized systems. Many such systems, covering an extremely wide range of applications, have been recently shown to exhibit scale-free character in their connectivity distribution, meaning that they obey a power law. Modeling of epidemics on lattices and small-world networks suffers from the presence of a critical infection threshold, above which the entire population is infected. For scale-free networks, the original assumption was that the formation of a giant cluster would lead to an epidemic spreading in the same way as in simpler networks. Here we show that modeling epidemics on a scale-free network can greatly improve the predictions on the rate and efficiency of spreading, as compared to lattice models and small-world networks. We also show that the dynamics of a disease are greatly influenced by the underlying population structure. The exact same model can describe a plethora of networks, such as social networks, virus spreading in the Web, rumor spreading, signal transmission etc.

Network evolution by nonlinear preferential rewiring of edges

NASA Astrophysics Data System (ADS)

Xu, Xin-Jian; Hu, Xiao-Ming; Zhang, Li-Jie

2011-06-01

The mathematical framework for small-world networks proposed in a seminal paper by Watts and Strogatz sparked a widespread interest in modeling complex networks in the past decade. However, most of research contributing to static models is in contrast to real-world dynamic networks, such as social and biological networks, which are characterized by rearrangements of connections among agents. In this paper, we study dynamic networks evolved by nonlinear preferential rewiring of edges. The total numbers of vertices and edges of the network are conserved, but edges are continuously rewired according to the nonlinear preference. Assuming power-law kernels with exponents α and β, the network structures in stationary states display a distinct behavior, depending only on β. For β>1, the network is highly heterogeneous with the emergence of starlike structures. For β<1, the network is widely homogeneous with a typical connectivity. At β=1, the network is scale free with an exponential cutoff.

Stochastic Models of Emerging Infectious Disease Transmission on Adaptive Random Networks

PubMed Central

Pipatsart, Navavat; Triampo, Wannapong

2017-01-01

We presented adaptive random network models to describe human behavioral change during epidemics and performed stochastic simulations of SIR (susceptible-infectious-recovered) epidemic models on adaptive random networks. The interplay between infectious disease dynamics and network adaptation dynamics was investigated in regard to the disease transmission and the cumulative number of infection cases. We found that the cumulative case was reduced and associated with an increasing network adaptation probability but was increased with an increasing disease transmission probability. It was found that the topological changes of the adaptive random networks were able to reduce the cumulative number of infections and also to delay the epidemic peak. Our results also suggest the existence of a critical value for the ratio of disease transmission and adaptation probabilities below which the epidemic cannot occur. PMID:29075314

Dynamic Trust Models between Users over Social Networks

DTIC Science & Technology

2016-03-30

SUPPLEMENTARY NOTES 14. ABSTRACT In this project, by focusing on a number of word -of- mouth communication websites, we attempted to...analyzed evolution of trust networks in social media sites from a perspective of mediators. To this end, we proposed two stochastic models that...focusing on a number of word -of- mouth communication websites, we first attempt to construct dynamic trust models between users that enable to explain trust

Identifying Dynamic Functional Connectivity Changes in Dementia with Lewy Bodies Based on Product Hidden Markov Models.

PubMed

Sourty, Marion; Thoraval, Laurent; Roquet, Daniel; Armspach, Jean-Paul; Foucher, Jack; Blanc, Frédéric

2016-01-01

Exploring time-varying connectivity networks in neurodegenerative disorders is a recent field of research in functional MRI. Dementia with Lewy bodies (DLB) represents 20% of the neurodegenerative forms of dementia. Fluctuations of cognition and vigilance are the key symptoms of DLB. To date, no dynamic functional connectivity (DFC) investigations of this disorder have been performed. In this paper, we refer to the concept of connectivity state as a piecewise stationary configuration of functional connectivity between brain networks. From this concept, we propose a new method for group-level as well as for subject-level studies to compare and characterize connectivity state changes between a set of resting-state networks (RSNs). Dynamic Bayesian networks, statistical and graph theory-based models, enable one to learn dependencies between interacting state-based processes. Product hidden Markov models (PHMM), an instance of dynamic Bayesian networks, are introduced here to capture both statistical and temporal aspects of DFC of a set of RSNs. This analysis was based on sliding-window cross-correlations between seven RSNs extracted from a group independent component analysis performed on 20 healthy elderly subjects and 16 patients with DLB. Statistical models of DFC differed in patients compared to healthy subjects for the occipito-parieto-frontal network, the medial occipital network and the right fronto-parietal network. In addition, pairwise comparisons of DFC of RSNs revealed a decrease of dependency between these two visual networks (occipito-parieto-frontal and medial occipital networks) and the right fronto-parietal control network. The analysis of DFC state changes thus pointed out networks related to the cognitive functions that are known to be impaired in DLB: visual processing as well as attentional and executive functions. Besides this context, product HMM applied to RSNs cross-correlations offers a promising new approach to investigate structural and temporal aspects of brain DFC.

Network Reconstruction Using Nonparametric Additive ODE Models

PubMed Central

Henderson, James; Michailidis, George

2014-01-01

Network representations of biological systems are widespread and reconstructing unknown networks from data is a focal problem for computational biologists. For example, the series of biochemical reactions in a metabolic pathway can be represented as a network, with nodes corresponding to metabolites and edges linking reactants to products. In a different context, regulatory relationships among genes are commonly represented as directed networks with edges pointing from influential genes to their targets. Reconstructing such networks from data is a challenging problem receiving much attention in the literature. There is a particular need for approaches tailored to time-series data and not reliant on direct intervention experiments, as the former are often more readily available. In this paper, we introduce an approach to reconstructing directed networks based on dynamic systems models. Our approach generalizes commonly used ODE models based on linear or nonlinear dynamics by extending the functional class for the functions involved from parametric to nonparametric models. Concomitantly we limit the complexity by imposing an additive structure on the estimated slope functions. Thus the submodel associated with each node is a sum of univariate functions. These univariate component functions form the basis for a novel coupling metric that we define in order to quantify the strength of proposed relationships and hence rank potential edges. We show the utility of the method by reconstructing networks using simulated data from computational models for the glycolytic pathway of Lactocaccus Lactis and a gene network regulating the pluripotency of mouse embryonic stem cells. For purposes of comparison, we also assess reconstruction performance using gene networks from the DREAM challenges. We compare our method to those that similarly rely on dynamic systems models and use the results to attempt to disentangle the distinct roles of linearity, sparsity, and derivative estimation. PMID:24732037

Topology Property and Dynamic Behavior of a Growing Spatial Network

NASA Astrophysics Data System (ADS)

Cao, Xian-Bin; Du, Wen-Bo; Hu, Mao-Bin; Rong, Zhi-Hai; Sun, Peng; Chen, Cai-Long

In this paper, we propose a growing spatial network (GSN) model and investigate its topology properties and dynamical behaviors. The model is generated by adding one node i with m links into a square lattice at each time step and the new node i is connected to the existing nodes with probabilities proportional to: ({kj})α /dij2, where kj is the degree of node j, α is the tunable parameter and dij is the Euclidean distance between i and j. It is found that both the degree heterogeneity and the clustering coefficient monotonously increase with the increment of α, while the average shortest path length monotonously decreases. Moreover, the evolutionary game dynamics and network traffic dynamics are investigated. Simulation results show that the value of α can also greatly influence the dynamic behaviors.

Synchronisation of chaos and its applications

NASA Astrophysics Data System (ADS)

Eroglu, Deniz; Lamb, Jeroen S. W.; Pereira, Tiago

2017-07-01

Dynamical networks are important models for the behaviour of complex systems, modelling physical, biological and societal systems, including the brain, food webs, epidemic disease in populations, power grids and many other. Such dynamical networks can exhibit behaviour in which deterministic chaos, exhibiting unpredictability and disorder, coexists with synchronisation, a classical paradigm of order. We survey the main theory behind complete, generalised and phase synchronisation phenomena in simple as well as complex networks and discuss applications to secure communications, parameter estimation and the anticipation of chaos.

Quantification of Interactions between Dynamic Cellular Network Functionalities by Cascaded Layering

PubMed Central

Prescott, Thomas P.; Lang, Moritz; Papachristodoulou, Antonis

2015-01-01

Large, naturally evolved biomolecular networks typically fulfil multiple functions. When modelling or redesigning such systems, functional subsystems are often analysed independently first, before subsequent integration into larger-scale computational models. In the design and analysis process, it is therefore important to quantitatively analyse and predict the dynamics of the interactions between integrated subsystems; in particular, how the incremental effect of integrating a subsystem into a network depends on the existing dynamics of that network. In this paper we present a framework for simulating the contribution of any given functional subsystem when integrated together with one or more other subsystems. This is achieved through a cascaded layering of a network into functional subsystems, where each layer is defined by an appropriate subset of the reactions. We exploit symmetries in our formulation to exhaustively quantify each subsystem’s incremental effects with minimal computational effort. When combining subsystems, their isolated behaviour may be amplified, attenuated, or be subject to more complicated effects. We propose the concept of mutual dynamics to quantify such nonlinear phenomena, thereby defining the incompatibility and cooperativity between all pairs of subsystems when integrated into any larger network. We exemplify our theoretical framework by analysing diverse behaviours in three dynamic models of signalling and metabolic pathways: the effect of crosstalk mechanisms on the dynamics of parallel signal transduction pathways; reciprocal side-effects between several integral feedback mechanisms and the subsystems they stabilise; and consequences of nonlinear interactions between elementary flux modes in glycolysis for metabolic engineering strategies. Our analysis shows that it is not sufficient to just specify subsystems and analyse their pairwise interactions; the environment in which the interaction takes place must also be explicitly defined. Our framework provides a natural representation of nonlinear interaction phenomena, and will therefore be an important tool for modelling large-scale evolved or synthetic biomolecular networks. PMID:25933116

Complex Rotation Quantum Dynamic Neural Networks (CRQDNN) using Complex Quantum Neuron (CQN): Applications to time series prediction.

PubMed

Cui, Yiqian; Shi, Junyou; Wang, Zili

2015-11-01

Quantum Neural Networks (QNN) models have attracted great attention since it innovates a new neural computing manner based on quantum entanglement. However, the existing QNN models are mainly based on the real quantum operations, and the potential of quantum entanglement is not fully exploited. In this paper, we proposes a novel quantum neuron model called Complex Quantum Neuron (CQN) that realizes a deep quantum entanglement. Also, a novel hybrid networks model Complex Rotation Quantum Dynamic Neural Networks (CRQDNN) is proposed based on Complex Quantum Neuron (CQN). CRQDNN is a three layer model with both CQN and classical neurons. An infinite impulse response (IIR) filter is embedded in the Networks model to enable the memory function to process time series inputs. The Levenberg-Marquardt (LM) algorithm is used for fast parameter learning. The networks model is developed to conduct time series predictions. Two application studies are done in this paper, including the chaotic time series prediction and electronic remaining useful life (RUL) prediction. Copyright © 2015 Elsevier Ltd. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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

2014-03-01

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

General Dynamics of Topology and Traffic on Weighted Technological Networks

NASA Astrophysics Data System (ADS)

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

2005-05-01

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

Spreading dynamics on complex networks: a general stochastic approach.

PubMed

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

2014-12-01

Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our framework and the fact that its assumptions are explicitly stated suggests that it could be used as a common ground for comparing existing epidemics models too complex for direct comparison, such as agent-based computer simulations. We provide many examples for the special cases of susceptible-infectious-susceptible and susceptible-infectious-removed dynamics (e.g., epidemics propagation) and we observe multiple situations where accurate results may be obtained at low computational cost. Our perspective reveals a subtle balance between the complex requirements of a realistic model and its basic assumptions.

A model of metastable dynamics during ongoing and evoked cortical activity

NASA Astrophysics Data System (ADS)

La Camera, Giancarlo

The dynamics of simultaneously recorded spike trains in alert animals often evolve through temporal sequences of metastable states. Little is known about the network mechanisms responsible for the genesis of such sequences, or their potential role in neural coding. In the gustatory cortex of alert rates, state sequences can be observed also in the absence of overt sensory stimulation, and thus form the basis of the so-called `ongoing activity'. This activity is characterized by a partial degree of coordination among neurons, sharp transitions among states, and multi-stability of single neurons' firing rates. A recurrent spiking network model with clustered topology can account for both the spontaneous generation of state sequences and the (network-generated) multi-stability. In the model, each network state results from the activation of specific neural clusters with potentiated intra-cluster connections. A mean field solution of the model shows a large number of stable states, each characterized by a subset of simultaneously active clusters. The firing rate in each cluster during ongoing activity depends on the number of active clusters, so that the same neuron can have different firing rates depending on the state of the network. Because of dense intra-cluster connectivity and recurrent inhibition, in finite networks the stable states lose stability due to finite size effects. Simulations of the dynamics show that the model ensemble activity continuously hops among the different states, reproducing the ongoing dynamics observed in the data. Moreover, when probed with external stimuli, the model correctly predicts the quenching of single neuron multi-stability into bi-stability, the reduction of dimensionality of the population activity, the reduction of trial-to-trial variability, and a potential role for metastable states in the anticipation of expected events. Altogether, these results provide a unified mechanistic model of ongoing and evoked cortical dynamics. NSF IIS-1161852, NIDCD K25-DC013557, NIDCD R01-DC010389.

Counting and classifying attractors in high dimensional dynamical systems.

PubMed

Bagley, R J; Glass, L

1996-12-07

Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.

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.

Coarse-Grained Descriptions of Dynamics for Networks with Both Intrinsic and Structural Heterogeneities

PubMed Central

Bertalan, Tom; Wu, Yan; Laing, Carlo; Gear, C. William; Kevrekidis, Ioannis G.

2017-01-01

Finding accurate reduced descriptions for large, complex, dynamically evolving networks is a crucial enabler to their simulation, analysis, and ultimately design. Here, we propose and illustrate a systematic and powerful approach to obtaining good collective coarse-grained observables—variables successfully summarizing the detailed state of such networks. Finding such variables can naturally lead to successful reduced dynamic models for the networks. The main premise enabling our approach is the assumption that the behavior of a node in the network depends (after a short initial transient) on the node identity: a set of descriptors that quantify the node properties, whether intrinsic (e.g., parameters in the node evolution equations) or structural (imparted to the node by its connectivity in the particular network structure). The approach creates a natural link with modeling and “computational enabling technology” developed in the context of Uncertainty Quantification. In our case, however, we will not focus on ensembles of different realizations of a problem, each with parameters randomly selected from a distribution. We will instead study many coupled heterogeneous units, each characterized by randomly assigned (heterogeneous) parameter value(s). One could then coin the term Heterogeneity Quantification for this approach, which we illustrate through a model dynamic network consisting of coupled oscillators with one intrinsic heterogeneity (oscillator individual frequency) and one structural heterogeneity (oscillator degree in the undirected network). The computational implementation of the approach, its shortcomings and possible extensions are also discussed. PMID:28659781

Testing of information condensation in a model reverberating spiking neural network.

PubMed

Vidybida, Alexander

2011-06-01

Information about external world is delivered to the brain in the form of structured in time spike trains. During further processing in higher areas, information is subjected to a certain condensation process, which results in formation of abstract conceptual images of external world, apparently, represented as certain uniform spiking activity partially independent on the input spike trains details. Possible physical mechanism of condensation at the level of individual neuron was discussed recently. In a reverberating spiking neural network, due to this mechanism the dynamics should settle down to the same uniform/ periodic activity in response to a set of various inputs. Since the same periodic activity may correspond to different input spike trains, we interpret this as possible candidate for information condensation mechanism in a network. Our purpose is to test this possibility in a network model consisting of five fully connected neurons, particularly, the influence of geometric size of the network, on its ability to condense information. Dynamics of 20 spiking neural networks of different geometric sizes are modelled by means of computer simulation. Each network was propelled into reverberating dynamics by applying various initial input spike trains. We run the dynamics until it becomes periodic. The Shannon's formula is used to calculate the amount of information in any input spike train and in any periodic state found. As a result, we obtain explicit estimate of the degree of information condensation in the networks, and conclude that it depends strongly on the net's geometric size.

Reconstruction of an Immune Dynamic Model to Simulate the Contrasting Role of Auxin and Cytokinin in Plant Immunity.

PubMed

Kaltdorf, Martin; Dandekar, Thomas; Naseem, Muhammad

2017-01-01

In order to increase our understanding of biological dependencies in plant immune signaling pathways, the known interactions involved in plant immune networks are modeled. This allows computational analysis to predict the functions of growth related hormones in plant-pathogen interaction. The SQUAD (Standardized Qualitative Dynamical Systems) algorithm first determines stable system states in the network and then use them to compute continuous dynamical system states. Our reconstructed Boolean model encompassing hormone immune networks of Arabidopsis thaliana (Arabidopsis) and pathogenicity factors injected by model pathogen Pseudomonas syringae pv. tomato DC3000 (Pst DC3000) can be exploited to determine the impact of growth hormones in plant immunity. We describe a detailed working protocol how to use the modified SQUAD-package by exemplifying the contrasting effects of auxin and cytokinins in shaping plant-pathogen interaction.

Logical Modeling and Dynamical Analysis of Cellular Networks

PubMed Central

Abou-Jaoudé, Wassim; Traynard, Pauline; Monteiro, Pedro T.; Saez-Rodriguez, Julio; Helikar, Tomáš; Thieffry, Denis; Chaouiya, Claudine

2016-01-01

The logical (or logic) formalism is increasingly used to model regulatory and signaling networks. Complementing these applications, several groups contributed various methods and tools to support the definition and analysis of logical models. After an introduction to the logical modeling framework and to several of its variants, we review here a number of recent methodological advances to ease the analysis of large and intricate networks. In particular, we survey approaches to determine model attractors and their reachability properties, to assess the dynamical impact of variations of external signals, and to consistently reduce large models. To illustrate these developments, we further consider several published logical models for two important biological processes, namely the differentiation of T helper cells and the control of mammalian cell cycle. PMID:27303434

Computational model of electrically coupled, intrinsically distinct pacemaker neurons.

PubMed

Soto-Treviño, Cristina; Rabbah, Pascale; Marder, Eve; Nadim, Farzan

2005-07-01

Electrical coupling between neurons with similar properties is often studied. Nonetheless, the role of electrical coupling between neurons with widely different intrinsic properties also occurs, but is less well understood. Inspired by the pacemaker group of the crustacean pyloric network, we developed a multicompartment, conductance-based model of a small network of intrinsically distinct, electrically coupled neurons. In the pyloric network, a small intrinsically bursting neuron, through gap junctions, drives 2 larger, tonically spiking neurons to reliably burst in-phase with it. Each model neuron has 2 compartments, one responsible for spike generation and the other for producing a slow, large-amplitude oscillation. We illustrate how these compartments interact and determine the dynamics of the model neurons. Our model captures the dynamic oscillation range measured from the isolated and coupled biological neurons. At the network level, we explore the range of coupling strengths for which synchronous bursting oscillations are possible. The spatial segregation of ionic currents significantly enhances the ability of the 2 neurons to burst synchronously, and the oscillation range of the model pacemaker network depends not only on the strength of the electrical synapse but also on the identity of the neuron receiving inputs. We also compare the activity of the electrically coupled, distinct neurons with that of a network of coupled identical bursting neurons. For small to moderate coupling strengths, the network of identical elements, when receiving asymmetrical inputs, can have a smaller dynamic range of oscillation than that of its constituent neurons in isolation.

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

PubMed Central

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

2017-01-01

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

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

PubMed

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

2017-08-01

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

Competition-Driven Network Dynamics: Emergence of a Scale-Free Leadership Structure and Collective Efficiency

NASA Astrophysics Data System (ADS)

Anghel, M.; Toroczkai, Zoltán; Bassler, Kevin E.; Korniss, G.

2004-02-01

Using the minority game as a model for competition dynamics, we investigate the effects of interagent communications across a network on the global evolution of the game. Agent communication across this network leads to the formation of an influence network, which is dynamically coupled to the evolution of the game, and it is responsible for the information flow driving the agents' actions. We show that the influence network spontaneously develops hubs with a broad distribution of in-degrees, defining a scale-free robust leadership structure. Furthermore, in realistic parameter ranges, facilitated by information exchange on the network, agents can generate a high degree of cooperation making the collective almost maximally efficient.

Network simulations of optical illusions

NASA Astrophysics Data System (ADS)

Shinbrot, Troy; Lazo, Miguel Vivar; Siu, Theo

We examine a dynamical network model of visual processing that reproduces several aspects of a well-known optical illusion, including subtle dependencies on curvature and scale. The model uses a genetic algorithm to construct the percept of an image, and we show that this percept evolves dynamically so as to produce the illusions reported. We find that the perceived illusions are hardwired into the model architecture and we propose that this approach may serve as an archetype to distinguish behaviors that are due to nature (i.e. a fixed network architecture) from those subject to nurture (that can be plastically altered through learning).

Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

NASA Astrophysics Data System (ADS)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

AST: Activity-Security-Trust driven modeling of time varying networks.

PubMed

Wang, Jian; Xu, Jiake; Liu, Yanheng; Deng, Weiwen

2016-02-18

Network modeling is a flexible mathematical structure that enables to identify statistical regularities and structural principles hidden in complex systems. The majority of recent driving forces in modeling complex networks are originated from activity, in which an activity potential of a time invariant function is introduced to identify agents' interactions and to construct an activity-driven model. However, the new-emerging network evolutions are already deeply coupled with not only the explicit factors (e.g. activity) but also the implicit considerations (e.g. security and trust), so more intrinsic driving forces behind should be integrated into the modeling of time varying networks. The agents undoubtedly seek to build a time-dependent trade-off among activity, security, and trust in generating a new connection to another. Thus, we reasonably propose the Activity-Security-Trust (AST) driven model through synthetically considering the explicit and implicit driving forces (e.g. activity, security, and trust) underlying the decision process. AST-driven model facilitates to more accurately capture highly dynamical network behaviors and figure out the complex evolution process, allowing a profound understanding of the effects of security and trust in driving network evolution, and improving the biases induced by only involving activity representations in analyzing the dynamical processes.

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

Dynamical origins of the community structure of an online multi-layer society

NASA Astrophysics Data System (ADS)

Klimek, Peter; Diakonova, Marina; Eguíluz, Víctor M.; San Miguel, Maxi; Thurner, Stefan

2016-08-01

Social structures emerge as a result of individuals managing a variety of different social relationships. Societies can be represented as highly structured dynamic multiplex networks. Here we study the dynamical origins of the specific community structures of a large-scale social multiplex network of a human society that interacts in a virtual world of a massive multiplayer online game. There we find substantial differences in the community structures of different social actions, represented by the various layers in the multiplex network. Community sizes distributions are either fat-tailed or appear to be centered around a size of 50 individuals. To understand these observations we propose a voter model that is built around the principle of triadic closure. It explicitly models the co-evolution of node- and link-dynamics across different layers of the multiplex network. Depending on link and node fluctuation probabilities, the model exhibits an anomalous shattered fragmentation transition, where one layer fragments from one large component into many small components. The observed community size distributions are in good agreement with the predicted fragmentation in the model. This suggests that several detailed features of the fragmentation in societies can be traced back to the triadic closure processes.

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.

Successful Reconstruction of a Physiological Circuit with Known Connectivity from Spiking Activity Alone

PubMed Central

Gerhard, Felipe; Kispersky, Tilman; Gutierrez, Gabrielle J.; Marder, Eve; Kramer, Mark; Eden, Uri

2013-01-01

Identifying the structure and dynamics of synaptic interactions between neurons is the first step to understanding neural network dynamics. The presence of synaptic connections is traditionally inferred through the use of targeted stimulation and paired recordings or by post-hoc histology. More recently, causal network inference algorithms have been proposed to deduce connectivity directly from electrophysiological signals, such as extracellularly recorded spiking activity. Usually, these algorithms have not been validated on a neurophysiological data set for which the actual circuitry is known. Recent work has shown that traditional network inference algorithms based on linear models typically fail to identify the correct coupling of a small central pattern generating circuit in the stomatogastric ganglion of the crab Cancer borealis. In this work, we show that point process models of observed spike trains can guide inference of relative connectivity estimates that match the known physiological connectivity of the central pattern generator up to a choice of threshold. We elucidate the necessary steps to derive faithful connectivity estimates from a model that incorporates the spike train nature of the data. We then apply the model to measure changes in the effective connectivity pattern in response to two pharmacological interventions, which affect both intrinsic neural dynamics and synaptic transmission. Our results provide the first successful application of a network inference algorithm to a circuit for which the actual physiological synapses between neurons are known. The point process methodology presented here generalizes well to larger networks and can describe the statistics of neural populations. In general we show that advanced statistical models allow for the characterization of effective network structure, deciphering underlying network dynamics and estimating information-processing capabilities. PMID:23874181

Modeling Epidemics with Dynamic Small-World Networks

NASA Astrophysics Data System (ADS)

Kaski, Kimmo; Saramäki, Jari

2005-06-01

In this presentation a minimal model for describing the spreading of an infectious disease, such as influenza, is discussed. Here it is assumed that spreading takes place on a dynamic small-world network comprising short- and long-range infection events. Approximate equations for the epidemic threshold as well as the spreading dynamics are derived and they agree well with numerical discrete time-step simulations. Also the dependence of the epidemic saturation time on the initial conditions is analysed and a comparison with real-world data is made.

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.

Qualitative validation of the reduction from two reciprocally coupled neurons to one self-coupled neuron in a respiratory network model.

PubMed

Dunmyre, Justin R

2011-06-01

The pre-Bötzinger complex of the mammalian brainstem is a heterogeneous neuronal network, and individual neurons within the network have varying strengths of the persistent sodium and calcium-activated nonspecific cationic currents. Individually, these currents have been the focus of modeling efforts. Previously, Dunmyre et al. (J Comput Neurosci 1-24, 2011) proposed a model and studied the interactions of these currents within one self-coupled neuron. In this work, I consider two identical, reciprocally coupled model neurons and validate the reduction to the self-coupled case. I find that all of the dynamics of the two model neuron network and the regions of parameter space where these distinct dynamics are found are qualitatively preserved in the reduction to the self-coupled case.

Cyber Physical System Modelling of Distribution Power Systems for Dynamic Demand Response

NASA Astrophysics Data System (ADS)

Chu, Xiaodong; Zhang, Rongxiang; Tang, Maosen; Huang, Haoyi; Zhang, Lei

2018-01-01

Dynamic demand response (DDR) is a package of control methods to enhance power system security. A CPS modelling and simulation platform for DDR in distribution power systems is presented in this paper. CPS modelling requirements of distribution power systems are analyzed. A coupled CPS modelling platform is built for assessing DDR in the distribution power system, which combines seamlessly modelling tools of physical power networks and cyber communication networks. Simulations results of IEEE 13-node test system demonstrate the effectiveness of the modelling and simulation platform.

Dynamics of an SAITS alcoholism model on unweighted and weighted networks

NASA Astrophysics Data System (ADS)

Huo, Hai-Feng; Cui, Fang-Fang; Xiang, Hong

2018-04-01

A novel SAITS alcoholism model on networks is introduced, in which alcoholics are divided into light problem alcoholics and heavy problem alcoholics. Susceptible individuals can enter into the compartment of heavy problem alcoholics directly by contacting with light problem alcoholics or heavy problem alcoholics and the heavy problem alcoholics who receive treatment can relapse into the compartment of heavy problem alcoholics are also considered. First, the dynamics of our model on unweighted networks, including the basic reproduction number, existence and stability of equilibria are studied. Second, the models with fixed weighted and adaptive weighted networks are introduced and investigated. At last, some simulations are presented to illustrate and extend our results. Our results show that it is very important to treat alcoholics to quit the drinking.

Adaptive Network Dynamics - Modeling and Control of Time-Dependent Social Contacts

PubMed Central

Schwartz, Ira B.; Shaw, Leah B.; Shkarayev, Maxim S.

2013-01-01

Real networks consisting of social contacts do not possess static connections. That is, social connections may be time dependent due to a variety of individual behavioral decisions based on current network connections. Examples of adaptive networks occur in epidemics, where information about infectious individuals may change the rewiring of healthy people, or in the recruitment of individuals to a cause or fad, where rewiring may optimize recruitment of susceptible individuals. In this paper, we will review some of the dynamical properties of adaptive networks, and show how they predict novel phenomena as well as yield insight into new controls. The applications will be control of epidemic outbreaks and terrorist recruitment modeling. PMID:25414913

Associative memory in phasing neuron networks

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

Nair, Niketh S; Bochove, Erik J.; Braiman, Yehuda

2014-01-01

We studied pattern formation in a network of coupled Hindmarsh-Rose model neurons and introduced a new model for associative memory retrieval using networks of Kuramoto oscillators. Hindmarsh-Rose Neural Networks can exhibit a rich set of collective dynamics that can be controlled by their connectivity. Specifically, we showed an instance of Hebb's rule where spiking was correlated with network topology. Based on this, we presented a simple model of associative memory in coupled phase oscillators.

Automated adaptive inference of phenomenological dynamical models.

PubMed

Daniels, Bryan C; Nemenman, Ilya

2015-08-21

Dynamics of complex systems is often driven by large and intricate networks of microscopic interactions, whose sheer size obfuscates understanding. With limited experimental data, many parameters of such dynamics are unknown, and thus detailed, mechanistic models risk overfitting and making faulty predictions. At the other extreme, simple ad hoc models often miss defining features of the underlying systems. Here we develop an approach that instead constructs phenomenological, coarse-grained models of network dynamics that automatically adapt their complexity to the available data. Such adaptive models produce accurate predictions even when microscopic details are unknown. The approach is computationally tractable, even for a relatively large number of dynamical variables. Using simulated data, it correctly infers the phase space structure for planetary motion, avoids overfitting in a biological signalling system and produces accurate predictions for yeast glycolysis with tens of data points and over half of the interacting species unobserved.

Automated adaptive inference of phenomenological dynamical models

PubMed Central

Daniels, Bryan C.; Nemenman, Ilya

2015-01-01

Dynamics of complex systems is often driven by large and intricate networks of microscopic interactions, whose sheer size obfuscates understanding. With limited experimental data, many parameters of such dynamics are unknown, and thus detailed, mechanistic models risk overfitting and making faulty predictions. At the other extreme, simple ad hoc models often miss defining features of the underlying systems. Here we develop an approach that instead constructs phenomenological, coarse-grained models of network dynamics that automatically adapt their complexity to the available data. Such adaptive models produce accurate predictions even when microscopic details are unknown. The approach is computationally tractable, even for a relatively large number of dynamical variables. Using simulated data, it correctly infers the phase space structure for planetary motion, avoids overfitting in a biological signalling system and produces accurate predictions for yeast glycolysis with tens of data points and over half of the interacting species unobserved. PMID:26293508

Observability and synchronization of neuron models.

PubMed

Aguirre, Luis A; Portes, Leonardo L; Letellier, Christophe

2017-10-01

Observability is the property that enables recovering the state of a dynamical system from a reduced number of measured variables. In high-dimensional systems, it is therefore important to make sure that the variable recorded to perform the analysis conveys good observability of the system dynamics. The observability of a network of neuron models depends nontrivially on the observability of the node dynamics and on the topology of the network. The aim of this paper is twofold. First, to perform a study of observability using four well-known neuron models by computing three different observability coefficients. This not only clarifies observability properties of the models but also shows the limitations of applicability of each type of coefficients in the context of such models. Second, to study the emergence of phase synchronization in networks composed of neuron models. This is done performing multivariate singular spectrum analysis which, to the best of the authors' knowledge, has not been used in the context of networks of neuron models. It is shown that it is possible to detect phase synchronization: (i) without having to measure all the state variables, but only one (that provides greatest observability) from each node and (ii) without having to estimate the phase.

Synergistic effects in threshold models on networks.

PubMed

Juul, Jonas S; Porter, Mason A

2018-01-01

Network structure can have a significant impact on the propagation of diseases, memes, and information on social networks. Different types of spreading processes (and other dynamical processes) are affected by network architecture in different ways, and it is important to develop tractable models of spreading processes on networks to explore such issues. In this paper, we incorporate the idea of synergy into a two-state ("active" or "passive") threshold model of social influence on networks. Our model's update rule is deterministic, and the influence of each meme-carrying (i.e., active) neighbor can-depending on a parameter-either be enhanced or inhibited by an amount that depends on the number of active neighbors of a node. Such a synergistic system models social behavior in which the willingness to adopt either accelerates or saturates in a way that depends on the number of neighbors who have adopted that behavior. We illustrate that our model's synergy parameter has a crucial effect on system dynamics, as it determines whether degree-k nodes are possible or impossible to activate. We simulate synergistic meme spreading on both random-graph models and networks constructed from empirical data. Using a heterogeneous mean-field approximation, which we derive under the assumption that a network is locally tree-like, we are able to determine which synergy-parameter values allow degree-k nodes to be activated for many networks and for a broad family of synergistic models.

Synergistic effects in threshold models on networks

NASA Astrophysics Data System (ADS)

Juul, Jonas S.; Porter, Mason A.

2018-01-01

Network structure can have a significant impact on the propagation of diseases, memes, and information on social networks. Different types of spreading processes (and other dynamical processes) are affected by network architecture in different ways, and it is important to develop tractable models of spreading processes on networks to explore such issues. In this paper, we incorporate the idea of synergy into a two-state ("active" or "passive") threshold model of social influence on networks. Our model's update rule is deterministic, and the influence of each meme-carrying (i.e., active) neighbor can—depending on a parameter—either be enhanced or inhibited by an amount that depends on the number of active neighbors of a node. Such a synergistic system models social behavior in which the willingness to adopt either accelerates or saturates in a way that depends on the number of neighbors who have adopted that behavior. We illustrate that our model's synergy parameter has a crucial effect on system dynamics, as it determines whether degree-k nodes are possible or impossible to activate. We simulate synergistic meme spreading on both random-graph models and networks constructed from empirical data. Using a heterogeneous mean-field approximation, which we derive under the assumption that a network is locally tree-like, we are able to determine which synergy-parameter values allow degree-k nodes to be activated for many networks and for a broad family of synergistic models.

Set selection dynamical system neural networks with partial memories, with applications to Sudoku and KenKen puzzles.

PubMed

Boreland, B; Clement, G; Kunze, H

2015-08-01

After reviewing set selection and memory model dynamical system neural networks, we introduce a neural network model that combines set selection with partial memories (stored memories on subsets of states in the network). We establish that feasible equilibria with all states equal to ± 1 correspond to answers to a particular set theoretic problem. We show that KenKen puzzles can be formulated as a particular case of this set theoretic problem and use the neural network model to solve them; in addition, we use a similar approach to solve Sudoku. We illustrate the approach in examples. As a heuristic experiment, we use online or print resources to identify the difficulty of the puzzles and compare these difficulties to the number of iterations used by the appropriate neural network solver, finding a strong relationship. Copyright © 2015 Elsevier Ltd. All rights reserved.

Centralized Networks to Generate Human Body Motions

PubMed Central

Vakulenko, Sergei; Radulescu, Ovidiu; Morozov, Ivan

2017-01-01

We consider continuous-time recurrent neural networks as dynamical models for the simulation of human body motions. These networks consist of a few centers and many satellites connected to them. The centers evolve in time as periodical oscillators with different frequencies. The center states define the satellite neurons’ states by a radial basis function (RBF) network. To simulate different motions, we adjust the parameters of the RBF networks. Our network includes a switching module that allows for turning from one motion to another. Simulations show that this model allows us to simulate complicated motions consisting of many different dynamical primitives. We also use the model for learning human body motion from markers’ trajectories. We find that center frequencies can be learned from a small number of markers and can be transferred to other markers, such that our technique seems to be capable of correcting for missing information resulting from sparse control marker settings. PMID:29240694

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.

Centralized Networks to Generate Human Body Motions.

PubMed

Vakulenko, Sergei; Radulescu, Ovidiu; Morozov, Ivan; Weber, Andres

2017-12-14

We consider continuous-time recurrent neural networks as dynamical models for the simulation of human body motions. These networks consist of a few centers and many satellites connected to them. The centers evolve in time as periodical oscillators with different frequencies. The center states define the satellite neurons' states by a radial basis function (RBF) network. To simulate different motions, we adjust the parameters of the RBF networks. Our network includes a switching module that allows for turning from one motion to another. Simulations show that this model allows us to simulate complicated motions consisting of many different dynamical primitives. We also use the model for learning human body motion from markers' trajectories. We find that center frequencies can be learned from a small number of markers and can be transferred to other markers, such that our technique seems to be capable of correcting for missing information resulting from sparse control marker settings.

Altered Micro-RNA Degradation Promotes Tumor Heterogeneity: A Result from Boolean Network Modeling.

PubMed

Wu, Yunyi; Krueger, Gerhard R F; Wang, Guanyu

2016-02-01

Cancer heterogeneity may reflect differential dynamical outcomes of the regulatory network encompassing biomolecules at both transcriptional and post-transcriptional levels. In other words, differential gene-expression profiles may correspond to different stable steady states of a mathematical model for simulation of biomolecular networks. To test this hypothesis, we simplified a regulatory network that is important for soft-tissue sarcoma metastasis and heterogeneity, comprising of transcription factors, micro-RNAs, and signaling components of the NOTCH pathway. We then used a Boolean network model to simulate the dynamics of this network, and particularly investigated the consequences of differential miRNA degradation modes. We found that efficient miRNA degradation is crucial for sustaining a homogenous and healthy phenotype, while defective miRNA degradation may lead to multiple stable steady states and ultimately to carcinogenesis and heterogeneity. Copyright© 2016 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.

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.

The experimental identification of magnetorheological dampers and evaluation of their controllers

NASA Astrophysics Data System (ADS)

Metered, H.; Bonello, P.; Oyadiji, S. O.

2010-05-01

Magnetorheological (MR) fluid dampers are semi-active control devices that have been applied over a wide range of practical vibration control applications. This paper concerns the experimental identification of the dynamic behaviour of an MR damper and the use of the identified parameters in the control of such a damper. Feed-forward and recurrent neural networks are used to model both the direct and inverse dynamics of the damper. Training and validation of the proposed neural networks are achieved by using the data generated through dynamic tests with the damper mounted on a tensile testing machine. The validation test results clearly show that the proposed neural networks can reliably represent both the direct and inverse dynamic behaviours of an MR damper. The effect of the cylinder's surface temperature on both the direct and inverse dynamics of the damper is studied, and the neural network model is shown to be reasonably robust against significant temperature variation. The inverse recurrent neural network model is introduced as a damper controller and experimentally evaluated against alternative controllers proposed in the literature. The results reveal that the neural-based damper controller offers superior damper control. This observation and the added advantages of low-power requirement, extended service life of the damper and the minimal use of sensors, indicate that a neural-based damper controller potentially offers the most cost-effective vibration control solution among the controllers investigated.

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

Computational modeling of spiking neural network with learning rules from STDP and intrinsic plasticity

NASA Astrophysics Data System (ADS)

Li, Xiumin; Wang, Wei; Xue, Fangzheng; Song, Yongduan

2018-02-01

Recently there has been continuously increasing interest in building up computational models of spiking neural networks (SNN), such as the Liquid State Machine (LSM). The biologically inspired self-organized neural networks with neural plasticity can enhance the capability of computational performance, with the characteristic features of dynamical memory and recurrent connection cycles which distinguish them from the more widely used feedforward neural networks. Despite a variety of computational models for brain-like learning and information processing have been proposed, the modeling of self-organized neural networks with multi-neural plasticity is still an important open challenge. The main difficulties lie in the interplay among different forms of neural plasticity rules and understanding how structures and dynamics of neural networks shape the computational performance. In this paper, we propose a novel approach to develop the models of LSM with a biologically inspired self-organizing network based on two neural plasticity learning rules. The connectivity among excitatory neurons is adapted by spike-timing-dependent plasticity (STDP) learning; meanwhile, the degrees of neuronal excitability are regulated to maintain a moderate average activity level by another learning rule: intrinsic plasticity (IP). Our study shows that LSM with STDP+IP performs better than LSM with a random SNN or SNN obtained by STDP alone. The noticeable improvement with the proposed method is due to the better reflected competition among different neurons in the developed SNN model, as well as the more effectively encoded and processed relevant dynamic information with its learning and self-organizing mechanism. This result gives insights to the optimization of computational models of spiking neural networks with neural plasticity.

Hybrid modeling and empirical analysis of automobile supply chain network

NASA Astrophysics Data System (ADS)

Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying

2017-05-01

Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.

Automatic Screening for Perturbations in Boolean Networks.

PubMed

Schwab, Julian D; Kestler, Hans A

2018-01-01

A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology. Boolean network models allow simulating the qualitative behavior of the modeled processes. A central objective in the simulation of Boolean networks is the computation of their long-term behavior-so-called attractors. These attractors are of special interest as they can often be linked to biologically relevant behaviors. Changing internal and external conditions can influence the long-term behavior of the Boolean network model. Perturbation of a Boolean network by stripping a component of the system or simulating a surplus of another element can lead to different attractors. Apparently, the number of possible perturbations and combinations of perturbations increases exponentially with the size of the network. Manually screening a set of possible components for combinations that have a desired effect on the long-term behavior can be very time consuming if not impossible. We developed a method to automatically screen for perturbations that lead to a user-specified change in the network's functioning. This method is implemented in the visual simulation framework ViSiBool utilizing satisfiability (SAT) solvers for fast exhaustive attractor search.

Estimation of Dynamic Systems for Gene Regulatory Networks from Dependent Time-Course Data.

PubMed

Kim, Yoonji; Kim, Jaejik

2018-06-15

Dynamic system consisting of ordinary differential equations (ODEs) is a well-known tool for describing dynamic nature of gene regulatory networks (GRNs), and the dynamic features of GRNs are usually captured through time-course gene expression data. Owing to high-throughput technologies, time-course gene expression data have complex structures such as heteroscedasticity, correlations between genes, and time dependence. Since gene experiments typically yield highly noisy data with small sample size, for a more accurate prediction of the dynamics, the complex structures should be taken into account in ODE models. Hence, this study proposes an ODE model considering such data structures and a fast and stable estimation method for the ODE parameters based on the generalized profiling approach with data smoothing techniques. The proposed method also provides statistical inference for the ODE estimator and it is applied to a zebrafish retina cell network.

Integrating association data and disease dynamics: an illustration using African Buffalo in Kruger National Park

USGS Publications Warehouse

Cross, Paul C.; James O, Lloyd-Smith; Bowers, Justin A.; Hay, Craig T.; Hofmeyr, Markus; Getz, Wayne M.

2004-01-01

Recognition is a prerequisite for non-random association amongst individuals. We explore how non-random association patterns (i.e. who spends time with whom) affect disease dynamics. We estimated the amount of time individuals spent together per month using radio-tracking data from African buffalo and incorporated these data into a dynamic social network model. The dynamic nature of the network has a strong influence on simulated disease dynamics particularly for diseases with shorter infectious periods. Cluster analyses of the association data demonstrated that buffalo herds were not as well defined as previously thought. Associations were more tightly clustered in 2002 than 2003, perhaps due to drier conditions in 2003. As a result, diseases may spread faster during drought conditions due to increased population mixing. Association data are often collected but this is the first use of empirical data in a network disease model in a wildlife population.

Novel indexes based on network structure to indicate financial market

NASA Astrophysics Data System (ADS)

Zhong, Tao; Peng, Qinke; Wang, Xiao; Zhang, Jing

2016-02-01

There have been various achievements to understand and to analyze the financial market by complex network model. However, current studies analyze the financial network model but seldom present quantified indexes to indicate or forecast the price action of market. In this paper, the stock market is modeled as a dynamic network, in which the vertices refer to listed companies and edges refer to their rank-based correlation based on price series. Characteristics of the network are analyzed and then novel indexes are introduced into market analysis, which are calculated from maximum and fully-connected subnets. The indexes are compared with existing ones and the results confirm that our indexes perform better to indicate the daily trend of market composite index in advance. Via investment simulation, the performance of our indexes is analyzed in detail. The results indicate that the dynamic complex network model could not only serve as a structural description of the financial market, but also work to predict the market and guide investment by indexes.

Cellular automata simulation of topological effects on the dynamics of feed-forward motifs

PubMed Central

Apte, Advait A; Cain, John W; Bonchev, Danail G; Fong, Stephen S

2008-01-01

Background Feed-forward motifs are important functional modules in biological and other complex networks. The functionality of feed-forward motifs and other network motifs is largely dictated by the connectivity of the individual network components. While studies on the dynamics of motifs and networks are usually devoted to the temporal or spatial description of processes, this study focuses on the relationship between the specific architecture and the overall rate of the processes of the feed-forward family of motifs, including double and triple feed-forward loops. The search for the most efficient network architecture could be of particular interest for regulatory or signaling pathways in biology, as well as in computational and communication systems. Results Feed-forward motif dynamics were studied using cellular automata and compared with differential equation modeling. The number of cellular automata iterations needed for a 100% conversion of a substrate into a target product was used as an inverse measure of the transformation rate. Several basic topological patterns were identified that order the specific feed-forward constructions according to the rate of dynamics they enable. At the same number of network nodes and constant other parameters, the bi-parallel and tri-parallel motifs provide higher network efficacy than single feed-forward motifs. Additionally, a topological property of isodynamicity was identified for feed-forward motifs where different network architectures resulted in the same overall rate of the target production. Conclusion It was shown for classes of structural motifs with feed-forward architecture that network topology affects the overall rate of a process in a quantitatively predictable manner. These fundamental results can be used as a basis for simulating larger networks as combinations of smaller network modules with implications on studying synthetic gene circuits, small regulatory systems, and eventually dynamic whole-cell models. PMID:18304325

Space-Time Neural Networks

NASA Technical Reports Server (NTRS)

Villarreal, James A.; Shelton, Robert O.

1992-01-01

Concept of space-time neural network affords distributed temporal memory enabling such network to model complicated dynamical systems mathematically and to recognize temporally varying spatial patterns. Digital filters replace synaptic-connection weights of conventional back-error-propagation neural network.

Synchronization transition in neuronal networks composed of chaotic or non-chaotic oscillators.

PubMed

Xu, Kesheng; Maidana, Jean Paul; Castro, Samy; Orio, Patricio

2018-05-30

Chaotic dynamics has been shown in the dynamics of neurons and neural networks, in experimental data and numerical simulations. Theoretical studies have proposed an underlying role of chaos in neural systems. Nevertheless, whether chaotic neural oscillators make a significant contribution to network behaviour and whether the dynamical richness of neural networks is sensitive to the dynamics of isolated neurons, still remain open questions. We investigated synchronization transitions in heterogeneous neural networks of neurons connected by electrical coupling in a small world topology. The nodes in our model are oscillatory neurons that - when isolated - can exhibit either chaotic or non-chaotic behaviour, depending on conductance parameters. We found that the heterogeneity of firing rates and firing patterns make a greater contribution than chaos to the steepness of the synchronization transition curve. We also show that chaotic dynamics of the isolated neurons do not always make a visible difference in the transition to full synchrony. Moreover, macroscopic chaos is observed regardless of the dynamics nature of the neurons. However, performing a Functional Connectivity Dynamics analysis, we show that chaotic nodes can promote what is known as multi-stable behaviour, where the network dynamically switches between a number of different semi-synchronized, metastable states.

Models for the modern power grid

NASA Astrophysics Data System (ADS)

Nardelli, Pedro H. J.; Rubido, Nicolas; Wang, Chengwei; Baptista, Murilo S.; Pomalaza-Raez, Carlos; Cardieri, Paulo; Latva-aho, Matti

2014-10-01

This article reviews different kinds of models for the electric power grid that can be used to understand the modern power system, the smart grid. From the physical network to abstract energy markets, we identify in the literature different aspects that co-determine the spatio-temporal multilayer dynamics of power system. We start our review by showing how the generation, transmission and distribution characteristics of the traditional power grids are already subject to complex behaviour appearing as a result of the the interplay between dynamics of the nodes and topology, namely synchronisation and cascade effects. When dealing with smart grids, the system complexity increases even more: on top of the physical network of power lines and controllable sources of electricity, the modernisation brings information networks, renewable intermittent generation, market liberalisation, prosumers, among other aspects. In this case, we forecast a dynamical co-evolution of the smart grid and other kind of networked systems that cannot be understood isolated. This review compiles recent results that model electric power grids as complex systems, going beyond pure technological aspects. From this perspective, we then indicate possible ways to incorporate the diverse co-evolving systems into the smart grid model using, for example, network theory and multi-agent simulation.

A reduction for spiking integrate-and-fire network dynamics ranging from homogeneity to synchrony.

PubMed

Zhang, J W; Rangan, A V

2015-04-01

In this paper we provide a general methodology for systematically reducing the dynamics of a class of integrate-and-fire networks down to an augmented 4-dimensional system of ordinary-differential-equations. The class of integrate-and-fire networks we focus on are homogeneously-structured, strongly coupled, and fluctuation-driven. Our reduction succeeds where most current firing-rate and population-dynamics models fail because we account for the emergence of 'multiple-firing-events' involving the semi-synchronous firing of many neurons. These multiple-firing-events are largely responsible for the fluctuations generated by the network and, as a result, our reduction faithfully describes many dynamic regimes ranging from homogeneous to synchronous. Our reduction is based on first principles, and provides an analyzable link between the integrate-and-fire network parameters and the relatively low-dimensional dynamics underlying the 4-dimensional augmented ODE.

Effect of memory in non-Markovian Boolean networks illustrated with a case study: A cell cycling process

NASA Astrophysics Data System (ADS)

Ebadi, H.; Saeedian, M.; Ausloos, M.; Jafari, G. R.

2016-11-01

The Boolean network is one successful model to investigate discrete complex systems such as the gene interacting phenomenon. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self-organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function —one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of the yeast cell cycle network, we discover a power-law-like memory with a more robust dynamics than the Markovian dynamics.

Mapping the ecological networks of microbial communities.

PubMed

Xiao, Yandong; Angulo, Marco Tulio; Friedman, Jonathan; Waldor, Matthew K; Weiss, Scott T; Liu, Yang-Yu

2017-12-11

Mapping the ecological networks of microbial communities is a necessary step toward understanding their assembly rules and predicting their temporal behavior. However, existing methods require assuming a particular population dynamics model, which is not known a priori. Moreover, those methods require fitting longitudinal abundance data, which are often not informative enough for reliable inference. To overcome these limitations, here we develop a new method based on steady-state abundance data. Our method can infer the network topology and inter-taxa interaction types without assuming any particular population dynamics model. Additionally, when the population dynamics is assumed to follow the classic Generalized Lotka-Volterra model, our method can infer the inter-taxa interaction strengths and intrinsic growth rates. We systematically validate our method using simulated data, and then apply it to four experimental data sets. Our method represents a key step towards reliable modeling of complex, real-world microbial communities, such as the human gut microbiota.

Robust model predictive control of nonlinear systems with unmodeled dynamics and bounded uncertainties based on neural networks.

PubMed

Yan, Zheng; Wang, Jun

2014-03-01

This paper presents a neural network approach to robust model predictive control (MPC) for constrained discrete-time nonlinear systems with unmodeled dynamics affected by bounded uncertainties. The exact nonlinear model of underlying process is not precisely known, but a partially known nominal model is available. This partially known nonlinear model is first decomposed to an affine term plus an unknown high-order term via Jacobian linearization. The linearization residue combined with unmodeled dynamics is then modeled using an extreme learning machine via supervised learning. The minimax methodology is exploited to deal with bounded uncertainties. The minimax optimization problem is reformulated as a convex minimization problem and is iteratively solved by a two-layer recurrent neural network. The proposed neurodynamic approach to nonlinear MPC improves the computational efficiency and sheds a light for real-time implementability of MPC technology. Simulation results are provided to substantiate the effectiveness and characteristics of the proposed approach.

Modeling genome-wide dynamic regulatory network in mouse lungs with influenza infection using high-dimensional ordinary differential equations.

PubMed

Wu, Shuang; Liu, Zhi-Ping; Qiu, Xing; Wu, Hulin

2014-01-01

The immune response to viral infection is regulated by an intricate network of many genes and their products. The reverse engineering of gene regulatory networks (GRNs) using mathematical models from time course gene expression data collected after influenza infection is key to our understanding of the mechanisms involved in controlling influenza infection within a host. A five-step pipeline: detection of temporally differentially expressed genes, clustering genes into co-expressed modules, identification of network structure, parameter estimate refinement, and functional enrichment analysis, is developed for reconstructing high-dimensional dynamic GRNs from genome-wide time course gene expression data. Applying the pipeline to the time course gene expression data from influenza-infected mouse lungs, we have identified 20 distinct temporal expression patterns in the differentially expressed genes and constructed a module-based dynamic network using a linear ODE model. Both intra-module and inter-module annotations and regulatory relationships of our inferred network show some interesting findings and are highly consistent with existing knowledge about the immune response in mice after influenza infection. The proposed method is a computationally efficient, data-driven pipeline bridging experimental data, mathematical modeling, and statistical analysis. The application to the influenza infection data elucidates the potentials of our pipeline in providing valuable insights into systematic modeling of complicated biological processes.

Ensemble Kalman Filter for Dynamic State Estimation of Power Grids Stochastically Driven by Time-correlated Mechanical Input Power

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

Rosenthal, William Steven; Tartakovsky, Alex; Huang, Zhenyu

State and parameter estimation of power transmission networks is important for monitoring power grid operating conditions and analyzing transient stability. Wind power generation depends on fluctuating input power levels, which are correlated in time and contribute to uncertainty in turbine dynamical models. The ensemble Kalman filter (EnKF), a standard state estimation technique, uses a deterministic forecast and does not explicitly model time-correlated noise in parameters such as mechanical input power. However, this uncertainty affects the probability of fault-induced transient instability and increased prediction bias. Here a novel approach is to model input power noise with time-correlated stochastic fluctuations, and integratemore » them with the network dynamics during the forecast. While the EnKF has been used to calibrate constant parameters in turbine dynamical models, the calibration of a statistical model for a time-correlated parameter has not been investigated. In this study, twin experiments on a standard transmission network test case are used to validate our time-correlated noise model framework for state estimation of unsteady operating conditions and transient stability analysis, and a methodology is proposed for the inference of the mechanical input power time-correlation length parameter using time-series data from PMUs monitoring power dynamics at generator buses.« less

Ensemble Kalman Filter for Dynamic State Estimation of Power Grids Stochastically Driven by Time-correlated Mechanical Input Power

DOE PAGES

Rosenthal, William Steven; Tartakovsky, Alex; Huang, Zhenyu

2017-10-31

State and parameter estimation of power transmission networks is important for monitoring power grid operating conditions and analyzing transient stability. Wind power generation depends on fluctuating input power levels, which are correlated in time and contribute to uncertainty in turbine dynamical models. The ensemble Kalman filter (EnKF), a standard state estimation technique, uses a deterministic forecast and does not explicitly model time-correlated noise in parameters such as mechanical input power. However, this uncertainty affects the probability of fault-induced transient instability and increased prediction bias. Here a novel approach is to model input power noise with time-correlated stochastic fluctuations, and integratemore » them with the network dynamics during the forecast. While the EnKF has been used to calibrate constant parameters in turbine dynamical models, the calibration of a statistical model for a time-correlated parameter has not been investigated. In this study, twin experiments on a standard transmission network test case are used to validate our time-correlated noise model framework for state estimation of unsteady operating conditions and transient stability analysis, and a methodology is proposed for the inference of the mechanical input power time-correlation length parameter using time-series data from PMUs monitoring power dynamics at generator buses.« less

Methods of information geometry in computational system biology (consistency between chemical and biological evolution).

PubMed

Astakhov, Vadim

2009-01-01

Interest in simulation of large-scale metabolic networks, species development, and genesis of various diseases requires new simulation techniques to accommodate the high complexity of realistic biological networks. Information geometry and topological formalisms are proposed to analyze information processes. We analyze the complexity of large-scale biological networks as well as transition of the system functionality due to modification in the system architecture, system environment, and system components. The dynamic core model is developed. The term dynamic core is used to define a set of causally related network functions. Delocalization of dynamic core model provides a mathematical formalism to analyze migration of specific functions in biosystems which undergo structure transition induced by the environment. The term delocalization is used to describe these processes of migration. We constructed a holographic model with self-poetic dynamic cores which preserves functional properties under those transitions. Topological constraints such as Ricci flow and Pfaff dimension were found for statistical manifolds which represent biological networks. These constraints can provide insight on processes of degeneration and recovery which take place in large-scale networks. We would like to suggest that therapies which are able to effectively implement estimated constraints, will successfully adjust biological systems and recover altered functionality. Also, we mathematically formulate the hypothesis that there is a direct consistency between biological and chemical evolution. Any set of causal relations within a biological network has its dual reimplementation in the chemistry of the system environment.

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

PubMed

Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

2016-11-01

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Boolean Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

PubMed

Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R

2017-01-01

Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.

Comparison of RF spectrum prediction methods for dynamic spectrum access

NASA Astrophysics Data System (ADS)

Kovarskiy, Jacob A.; Martone, Anthony F.; Gallagher, Kyle A.; Sherbondy, Kelly D.; Narayanan, Ram M.

2017-05-01

Dynamic spectrum access (DSA) refers to the adaptive utilization of today's busy electromagnetic spectrum. Cognitive radio/radar technologies require DSA to intelligently transmit and receive information in changing environments. Predicting radio frequency (RF) activity reduces sensing time and energy consumption for identifying usable spectrum. Typical spectrum prediction methods involve modeling spectral statistics with Hidden Markov Models (HMM) or various neural network structures. HMMs describe the time-varying state probabilities of Markov processes as a dynamic Bayesian network. Neural Networks model biological brain neuron connections to perform a wide range of complex and often non-linear computations. This work compares HMM, Multilayer Perceptron (MLP), and Recurrent Neural Network (RNN) algorithms and their ability to perform RF channel state prediction. Monte Carlo simulations on both measured and simulated spectrum data evaluate the performance of these algorithms. Generalizing spectrum occupancy as an alternating renewal process allows Poisson random variables to generate simulated data while energy detection determines the occupancy state of measured RF spectrum data for testing. The results suggest that neural networks achieve better prediction accuracy and prove more adaptable to changing spectral statistics than HMMs given sufficient training data.

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.

Simulation of noisy dynamical system by Deep Learning

NASA Astrophysics Data System (ADS)

Yeo, Kyongmin

2017-11-01

Deep learning has attracted huge attention due to its powerful representation capability. However, most of the studies on deep learning have been focused on visual analytics or language modeling and the capability of the deep learning in modeling dynamical systems is not well understood. In this study, we use a recurrent neural network to model noisy nonlinear dynamical systems. In particular, we use a long short-term memory (LSTM) network, which constructs internal nonlinear dynamics systems. We propose a cross-entropy loss with spatial ridge regularization to learn a non-stationary conditional probability distribution from a noisy nonlinear dynamical system. A Monte Carlo procedure to perform time-marching simulations by using the LSTM is presented. The behavior of the LSTM is studied by using noisy, forced Van der Pol oscillator and Ikeda equation.

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 changes that produce the different seizure dynamics in the networks. This provides possible mechanisms for seizure generation. Because seizures arise as attractors in a multi-state system, the system may possibly be returned to its baseline state through some particular stimulation. The ability of stimulation to terminate seizure dynamics in the local and distributed models is studied. We systematically examine when this may occur and the form of the stimulation necessary for the range of seizure dynamics. In both the local and distributed network models, termination is possible for all seizure types observed by stimulation possessing some particular configuration of spatial and temporal characteristics.

Blackmail propagation on small-world networks

NASA Astrophysics Data System (ADS)

Shao, Zhi-Gang; Jian-Ping Sang; Zou, Xian-Wu; Tan, Zhi-Jie; Jin, Zhun-Zhi

2005-06-01

The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability λ the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. The transition takes place at the critical network randomness pc=1/N, where N is the total number of nodes in the network. For a given network randomness p the dynamical behavior of blackmail propagation transits from exponential decrease type to logistical growth one with the transmitting probability λ increases. The transition occurs at the critical transmitting probability λc=1/, where is the average number of the nearest neighbors. The present work will be useful for understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Interacting opinion and disease dynamics in multiplex networks: Discontinuous phase transition and nonmonotonic consensus times

NASA Astrophysics Data System (ADS)

Velásquez-Rojas, Fátima; Vazquez, Federico

2017-05-01

Opinion formation and disease spreading are among the most studied dynamical processes on complex networks. In real societies, it is expected that these two processes depend on and affect each other. However, little is known about the effects of opinion dynamics over disease dynamics and vice versa, since most studies treat them separately. In this work we study the dynamics of the voter model for opinion formation intertwined with that of the contact process for disease spreading, in a population of agents that interact via two types of connections, social and contact. These two interacting dynamics take place on two layers of networks, coupled through a fraction q of links present in both networks. The probability that an agent updates its state depends on both the opinion and disease states of the interacting partner. We find that the opinion dynamics has striking consequences on the statistical properties of disease spreading. The most important is that the smooth (continuous) transition from a healthy to an endemic phase observed in the contact process, as the infection probability increases beyond a threshold, becomes abrupt (discontinuous) in the two-layer system. Therefore, disregarding the effects of social dynamics on epidemics propagation may lead to a misestimation of the real magnitude of the spreading. Also, an endemic-healthy discontinuous transition is found when the coupling q overcomes a threshold value. Furthermore, we show that the disease dynamics delays the opinion consensus, leading to a consensus time that varies nonmonotonically with q in a large range of the model's parameters. A mean-field approach reveals that the coupled dynamics of opinions and disease can be approximately described by the dynamics of the voter model decoupled from that of the contact process, with effective probabilities of opinion and disease transmission.

Dynamical network interactions in distributed control of robots

NASA Astrophysics Data System (ADS)

Buscarino, Arturo; Fortuna, Luigi; Frasca, Mattia; Rizzo, Alessandro

2006-03-01

In this paper the dynamical network model of the interactions within a group of mobile robots is investigated and proposed as a possible strategy for controlling the robots without central coordination. Motivated by the results of the analysis of our simple model, we show that the system performance in the presence of noise can be improved by including long-range connections between the robots. Finally, a suitable strategy based on this model to control exploration and transport is introduced.

A neural network model of metaphor understanding with dynamic interaction based on a statistical language analysis: targeting a human-like model.

PubMed

Terai, Asuka; Nakagawa, Masanori

2007-08-01

The purpose of this paper is to construct a model that represents the human process of understanding metaphors, focusing specifically on similes of the form an "A like B". Generally speaking, human beings are able to generate and understand many sorts of metaphors. This study constructs the model based on a probabilistic knowledge structure for concepts which is computed from a statistical analysis of a large-scale corpus. Consequently, this model is able to cover the many kinds of metaphors that human beings can generate. Moreover, the model implements the dynamic process of metaphor understanding by using a neural network with dynamic interactions. Finally, the validity of the model is confirmed by comparing model simulations with the results from a psychological experiment.

Hybrid regulatory models: a statistically tractable approach to model regulatory network dynamics.

PubMed

Ocone, Andrea; Millar, Andrew J; Sanguinetti, Guido

2013-04-01

Computational modelling of the dynamics of gene regulatory networks is a central task of systems biology. For networks of small/medium scale, the dominant paradigm is represented by systems of coupled non-linear ordinary differential equations (ODEs). ODEs afford great mechanistic detail and flexibility, but calibrating these models to data is often an extremely difficult statistical problem. Here, we develop a general statistical inference framework for stochastic transcription-translation networks. We use a coarse-grained approach, which represents the system as a network of stochastic (binary) promoter and (continuous) protein variables. We derive an exact inference algorithm and an efficient variational approximation that allows scalable inference and learning of the model parameters. We demonstrate the power of the approach on two biological case studies, showing that the method allows a high degree of flexibility and is capable of testable novel biological predictions. http://homepages.inf.ed.ac.uk/gsanguin/software.html. Supplementary data are available at Bioinformatics online.

Dynamic Functional Connectivity States Between the Dorsal and Ventral Sensorimotor Networks Revealed by Dynamic Conditional Correlation Analysis of Resting-State Functional Magnetic Resonance Imaging.

PubMed

Syed, Maleeha F; Lindquist, Martin A; Pillai, Jay J; Agarwal, Shruti; Gujar, Sachin K; Choe, Ann S; Caffo, Brian; Sair, Haris I

2017-12-01

Functional connectivity in resting-state functional magnetic resonance imaging (rs-fMRI) has received substantial attention since the initial findings of Biswal et al. Traditional network correlation metrics assume that the functional connectivity in the brain remains stationary over time. However, recent studies have shown that robust temporal fluctuations of functional connectivity among as well as within functional networks exist, challenging this assumption. In this study, these dynamic correlation differences were investigated between the dorsal and ventral sensorimotor networks by applying the dynamic conditional correlation model to rs-fMRI data of 20 healthy subjects. k-Means clustering was used to determine an optimal number of discrete connectivity states (k = 10) of the sensorimotor system across all subjects. Our analysis confirms the existence of differences in dynamic correlation between the dorsal and ventral networks, with highest connectivity found within the ventral motor network.

A network-base analysis of CMIP5 "historical" experiments

NASA Astrophysics Data System (ADS)

Bracco, A.; Foudalis, I.; Dovrolis, C.

2012-12-01

In computer science, "complex network analysis" refers to a set of metrics, modeling tools and algorithms commonly used in the study of complex nonlinear dynamical systems. Its main premise is that the underlying topology or network structure of a system has a strong impact on its dynamics and evolution. By allowing to investigate local and non-local statistical interaction, network analysis provides a powerful, but only marginally explored, framework to validate climate models and investigate teleconnections, assessing their strength, range, and impacts on the climate system. In this work we propose a new, fast, robust and scalable methodology to examine, quantify, and visualize climate sensitivity, while constraining general circulation models (GCMs) outputs with observations. The goal of our novel approach is to uncover relations in the climate system that are not (or not fully) captured by more traditional methodologies used in climate science and often adopted from nonlinear dynamical systems analysis, and to explain known climate phenomena in terms of the network structure or its metrics. Our methodology is based on a solid theoretical framework and employs mathematical and statistical tools, exploited only tentatively in climate research so far. Suitably adapted to the climate problem, these tools can assist in visualizing the trade-offs in representing global links and teleconnections among different data sets. Here we present the methodology, and compare network properties for different reanalysis data sets and a suite of CMIP5 coupled GCM outputs. With an extensive model intercomparison in terms of the climate network that each model leads to, we quantify how each model reproduces major teleconnections, rank model performances, and identify common or specific errors in comparing model outputs and observations.

Interplay between spatially explicit sediment sourcing, hierarchical river-network structure, and in-channel bed material sediment transport and storage dynamics

NASA Astrophysics Data System (ADS)

Czuba, Jonathan A.; Foufoula-Georgiou, Efi; Gran, Karen B.; Belmont, Patrick; Wilcock, Peter R.

2017-05-01

Understanding how sediment moves along source to sink pathways through watersheds—from hillslopes to channels and in and out of floodplains—is a fundamental problem in geomorphology. We contribute to advancing this understanding by modeling the transport and in-channel storage dynamics of bed material sediment on a river network over a 600 year time period. Specifically, we present spatiotemporal changes in bed sediment thickness along an entire river network to elucidate how river networks organize and process sediment supply. We apply our model to sand transport in the agricultural Greater Blue Earth River Basin in Minnesota. By casting the arrival of sediment to links of the network as a Poisson process, we derive analytically (under supply-limited conditions) the time-averaged probability distribution function of bed sediment thickness for each link of the river network for any spatial distribution of inputs. Under transport-limited conditions, the analytical assumptions of the Poisson arrival process are violated (due to in-channel storage dynamics) where we find large fluctuations and periodicity in the time series of bed sediment thickness. The time series of bed sediment thickness is the result of dynamics on a network in propagating, altering, and amalgamating sediment inputs in sometimes unexpected ways. One key insight gleaned from the model is that there can be a small fraction of reaches with relatively low-transport capacity within a nonequilibrium river network acting as "bottlenecks" that control sediment to downstream reaches, whereby fluctuations in bed elevation can dissociate from signals in sediment supply.

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

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

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

The dynamical analysis of modified two-compartment neuron model and FPGA implementation

NASA Astrophysics Data System (ADS)

Lin, Qianjin; Wang, Jiang; Yang, Shuangming; Yi, Guosheng; Deng, Bin; Wei, Xile; Yu, Haitao

2017-10-01

The complexity of neural models is increasing with the investigation of larger biological neural network, more various ionic channels and more detailed morphologies, and the implementation of biological neural network is a task with huge computational complexity and power consumption. This paper presents an efficient digital design using piecewise linearization on field programmable gate array (FPGA), to succinctly implement the reduced two-compartment model which retains essential features of more complicated models. The design proposes an approximate neuron model which is composed of a set of piecewise linear equations, and it can reproduce different dynamical behaviors to depict the mechanisms of a single neuron model. The consistency of hardware implementation is verified in terms of dynamical behaviors and bifurcation analysis, and the simulation results including varied ion channel characteristics coincide with the biological neuron model with a high accuracy. Hardware synthesis on FPGA demonstrates that the proposed model has reliable performance and lower hardware resource compared with the original two-compartment model. These investigations are conducive to scalability of biological neural network in reconfigurable large-scale neuromorphic system.

Research on robust optimization of emergency logistics network considering the time dependence characteristic

NASA Astrophysics Data System (ADS)

WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

2017-06-01

Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

Stationary and structural control in gene regulatory networks: basic concepts

NASA Astrophysics Data System (ADS)

Dougherty, Edward R.; Pal, Ranadip; Qian, Xiaoning; Bittner, Michael L.; Datta, Aniruddha

2010-01-01

A major reason for constructing gene regulatory networks is to use them as models for determining therapeutic intervention strategies by deriving ways of altering their long-run dynamics in such a way as to reduce the likelihood of entering undesirable states. In general, two paradigms have been taken for gene network intervention: (1) stationary external control is based on optimally altering the status of a control gene (or genes) over time to drive network dynamics; and (2) structural intervention involves an optimal one-time change of the network structure (wiring) to beneficially alter the long-run behaviour of the network. These intervention approaches have mainly been developed within the context of the probabilistic Boolean network model for gene regulation. This article reviews both types of intervention and applies them to reducing the metastatic competence of cells via intervention in a melanoma-related network.

Flory-Stockmayer analysis on reprocessable polymer networks

NASA Astrophysics Data System (ADS)

Li, Lingqiao; Chen, Xi; Jin, Kailong; Torkelson, John

Reprocessable polymer networks can undergo structure rearrangement through dynamic chemistries under proper conditions, making them a promising candidate for recyclable crosslinked materials, e.g. tires. This research field has been focusing on various chemistries. However, there has been lacking of an essential physical theory explaining the relationship between abundancy of dynamic linkages and reprocessability. Based on the classical Flory-Stockmayer analysis on network gelation, we developed a similar analysis on reprocessable polymer networks to quantitatively predict the critical condition for reprocessability. Our theory indicates that it is unnecessary for all bonds to be dynamic to make the resulting network reprocessable. As long as there is no percolated permanent network in the system, the material can fully rearrange. To experimentally validate our theory, we used a thiol-epoxy network model system with various dynamic linkage compositions. The stress relaxation behavior of resulting materials supports our theoretical prediction: only 50 % of linkages between crosslinks need to be dynamic for a tri-arm network to be reprocessable. Therefore, this analysis provides the first fundamental theoretical platform for designing and evaluating reprocessable polymer networks. We thank McCormick Research Catalyst Award Fund and ISEN cluster fellowship (L. L.) for funding support.

Dealing with uncertainty in modeling intermittent water supply

NASA Astrophysics Data System (ADS)

Lieb, A. M.; Rycroft, C.; Wilkening, J.

2015-12-01

Intermittency in urban water supply affects hundreds of millions of people in cities around the world, impacting water quality and infrastructure. Building on previous work to dynamically model the transient flows in water distribution networks undergoing frequent filling and emptying, we now consider the hydraulic implications of uncertain input data. Water distribution networks undergoing intermittent supply are often poorly mapped, and household metering frequently ranges from patchy to nonexistent. In the face of uncertain pipe material, pipe slope, network connectivity, and outflow, we investigate how uncertainty affects dynamical modeling results. We furthermore identify which parameters exert the greatest influence on uncertainty, helping to prioritize data collection.

Lattice Boltzmann simulation of CO2 reactive transport in network fractured media

NASA Astrophysics Data System (ADS)

Tian, Zhiwei; Wang, Junye

2017-08-01

Carbon dioxide (CO2) geological sequestration plays an important role in mitigating CO2 emissions for climate change. Understanding interactions of the injected CO2 with network fractures and hydrocarbons is key for optimizing and controlling CO2 geological sequestration and evaluating its risks to ground water. However, there is a well-known, difficult process in simulating the dynamic interaction of fracture-matrix, such as dynamic change of matrix porosity, unsaturated processes in rock matrix, and effect of rock mineral properties. In this paper, we develop an explicit model of the fracture-matrix interactions using multilayer bounce-back treatment as a first attempt to simulate CO2 reactive transport in network fractured media through coupling the Dardis's LBM porous model for a new interface treatment. Two kinds of typical fracture networks in porous media are simulated: straight cross network fractures and interleaving network fractures. The reaction rate and porosity distribution are illustrated and well-matched patterns are found. The species concentration distribution and evolution with time steps are also analyzed and compared with different transport properties. The results demonstrate the capability of this model to investigate the complex processes of CO2 geological injection and reactive transport in network fractured media, such as dynamic change of matrix porosity.

Analyzing complex networks evolution through Information Theory quantifiers

NASA Astrophysics Data System (ADS)

Carpi, Laura C.; Rosso, Osvaldo A.; Saco, Patricia M.; Ravetti, Martín Gómez

2011-01-01

A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Niño/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.

A mathematical model for adaptive transport network in path finding by true slime mold.

PubMed

Tero, Atsushi; Kobayashi, Ryo; Nakagaki, Toshiyuki

2007-02-21

We describe here a mathematical model of the adaptive dynamics of a transport network of the true slime mold Physarum polycephalum, an amoeboid organism that exhibits path-finding behavior in a maze. This organism possesses a network of tubular elements, by means of which nutrients and signals circulate through the plasmodium. When the organism is put in a maze, the network changes its shape to connect two exits by the shortest path. This process of path-finding is attributed to an underlying physiological mechanism: a tube thickens as the flux through it increases. The experimental evidence for this is, however, only qualitative. We constructed a mathematical model of the general form of the tube dynamics. Our model contains a key parameter corresponding to the extent of the feedback regulation between the thickness of a tube and the flux through it. We demonstrate the dependence of the behavior of the model on this parameter.

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

Modeling of cortical signals using echo state networks

NASA Astrophysics Data System (ADS)

Zhou, Hanying; Wang, Yongji; Huang, Jiangshuai

2009-10-01

Diverse modeling frameworks have been utilized with the ultimate goal of translating brain cortical signals into prediction of visible behavior. The inputs to these models are usually multidimensional neural recordings collected from relevant regions of a monkey's brain while the outputs are the associated behavior which is typically the 2-D or 3-D hand position of a primate. Here our task is to set up a proper model in order to figure out the move trajectories by input the neural signals which are simultaneously collected in the experiment. In this paper, we propose to use Echo State Networks (ESN) to map the neural firing activities into hand positions. ESN is a newly developed recurrent neural network(RNN) model. Besides its dynamic property and short term memory just as other recurrent neural networks have, it has a special echo state property which endows it with the ability to model nonlinear dynamic systems powerfully. What distinguished it from transitional recurrent neural networks most significantly is its special learning method. In this paper we train this net with a refined version of its typical training method and get a better model.

Stochastic Dynamical Model of a Growing Citation Network Based on a Self-Exciting Point Process

NASA Astrophysics Data System (ADS)

Golosovsky, Michael; Solomon, Sorin

2012-08-01

We put under experimental scrutiny the preferential attachment model that is commonly accepted as a generating mechanism of the scale-free complex networks. To this end we chose a citation network of physics papers and traced the citation history of 40 195 papers published in one year. Contrary to common belief, we find that the citation dynamics of the individual papers follows the superlinear preferential attachment, with the exponent α=1.25-1.3. Moreover, we show that the citation process cannot be described as a memoryless Markov chain since there is a substantial correlation between the present and recent citation rates of a paper. Based on our findings we construct a stochastic growth model of the citation network, perform numerical simulations based on this model and achieve an excellent agreement with the measured citation distributions.

Construction and modelling of an inducible positive feedback loop stably integrated in a mammalian cell-line.

PubMed

Siciliano, Velia; Menolascina, Filippo; Marucci, Lucia; Fracassi, Chiara; Garzilli, Immacolata; Moretti, Maria Nicoletta; di Bernardo, Diego

2011-06-01

Understanding the relationship between topology and dynamics of transcriptional regulatory networks in mammalian cells is essential to elucidate the biology of complex regulatory and signaling pathways. Here, we characterised, via a synthetic biology approach, a transcriptional positive feedback loop (PFL) by generating a clonal population of mammalian cells (CHO) carrying a stable integration of the construct. The PFL network consists of the Tetracycline-controlled transactivator (tTA), whose expression is regulated by a tTA responsive promoter (CMV-TET), thus giving rise to a positive feedback. The same CMV-TET promoter drives also the expression of a destabilised yellow fluorescent protein (d2EYFP), thus the dynamic behaviour can be followed by time-lapse microscopy. The PFL network was compared to an engineered version of the network lacking the positive feedback loop (NOPFL), by expressing the tTA mRNA from a constitutive promoter. Doxycycline was used to repress tTA activation (switch off), and the resulting changes in fluorescence intensity for both the PFL and NOPFL networks were followed for up to 43 h. We observed a striking difference in the dynamics of the PFL and NOPFL networks. Using non-linear dynamical models, able to recapitulate experimental observations, we demonstrated a link between network topology and network dynamics. Namely, transcriptional positive autoregulation can significantly slow down the "switch off" times, as compared to the non-autoregulated system. Doxycycline concentration can modulate the response times of the PFL, whereas the NOPFL always switches off with the same dynamics. Moreover, the PFL can exhibit bistability for a range of Doxycycline concentrations. Since the PFL motif is often found in naturally occurring transcriptional and signaling pathways, we believe our work can be instrumental to characterise their behaviour.

Hopf bifurcation of an (n + 1) -neuron bidirectional associative memory neural network model with delays.

PubMed

Xiao, Min; Zheng, Wei Xing; Cao, Jinde

2013-01-01

Recent studies on Hopf bifurcations of neural networks with delays are confined to simplified neural network models consisting of only two, three, four, five, or six neurons. It is well known that neural networks are complex and large-scale nonlinear dynamical systems, so the dynamics of the delayed neural networks are very rich and complicated. Although discussing the dynamics of networks with a few neurons may help us to understand large-scale networks, there are inevitably some complicated problems that may be overlooked if simplified networks are carried over to large-scale networks. In this paper, a general delayed bidirectional associative memory neural network model with n + 1 neurons is considered. By analyzing the associated characteristic equation, the local stability of the trivial steady state is examined, and then the existence of the Hopf bifurcation at the trivial steady state is established. By applying the normal form theory and the center manifold reduction, explicit formulae are derived to determine the direction and stability of the bifurcating periodic solution. Furthermore, the paper highlights situations where the Hopf bifurcations are particularly critical, in the sense that the amplitude and the period of oscillations are very sensitive to errors due to tolerances in the implementation of neuron interconnections. It is shown that the sensitivity is crucially dependent on the delay and also significantly influenced by the feature of the number of neurons. Numerical simulations are carried out to illustrate the main results.

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.

Modelling and analysis of gene regulatory network using feedback control theory

NASA Astrophysics Data System (ADS)

El-Samad, H.; Khammash, M.

2010-01-01

Molecular pathways are a part of a remarkable hierarchy of regulatory networks that operate at all levels of organisation. These regulatory networks are responsible for much of the biological complexity within the cell. The dynamic character of these pathways and the prevalence of feedback regulation strategies in their operation make them amenable to systematic mathematical analysis using the same tools that have been used with success in analysing and designing engineering control systems. In this article, we aim at establishing this strong connection through various examples where the behaviour exhibited by gene networks is explained in terms of their underlying control strategies. We complement our analysis by a survey of mathematical techniques commonly used to model gene regulatory networks and analyse their dynamic behaviour.

Bayesian state space models for dynamic genetic network construction across multiple tissues.

PubMed

Liang, Yulan; Kelemen, Arpad

2016-08-01

Construction of gene-gene interaction networks and potential pathways is a challenging and important problem in genomic research for complex diseases while estimating the dynamic changes of the temporal correlations and non-stationarity are the keys in this process. In this paper, we develop dynamic state space models with hierarchical Bayesian settings to tackle this challenge for inferring the dynamic profiles and genetic networks associated with disease treatments. We treat both the stochastic transition matrix and the observation matrix time-variant and include temporal correlation structures in the covariance matrix estimations in the multivariate Bayesian state space models. The unevenly spaced short time courses with unseen time points are treated as hidden state variables. Hierarchical Bayesian approaches with various prior and hyper-prior models with Monte Carlo Markov Chain and Gibbs sampling algorithms are used to estimate the model parameters and the hidden state variables. We apply the proposed Hierarchical Bayesian state space models to multiple tissues (liver, skeletal muscle, and kidney) Affymetrix time course data sets following corticosteroid (CS) drug administration. Both simulation and real data analysis results show that the genomic changes over time and gene-gene interaction in response to CS treatment can be well captured by the proposed models. The proposed dynamic Hierarchical Bayesian state space modeling approaches could be expanded and applied to other large scale genomic data, such as next generation sequence (NGS) combined with real time and time varying electronic health record (EHR) for more comprehensive and robust systematic and network based analysis in order to transform big biomedical data into predictions and diagnostics for precision medicine and personalized healthcare with better decision making and patient outcomes.

Critical dynamics on a large human Open Connectome network

NASA Astrophysics Data System (ADS)

Ódor, Géza

2016-12-01

Extended numerical simulations of threshold models have been performed on a human brain network with N =836 733 connected nodes available from the Open Connectome Project. While in the case of simple threshold models a sharp discontinuous phase transition without any critical dynamics arises, variable threshold models exhibit extended power-law scaling regions. This is attributed to fact that Griffiths effects, stemming from the topological or interaction heterogeneity of the network, can become relevant if the input sensitivity of nodes is equalized. I have studied the effects of link directness, as well as the consequence of inhibitory connections. Nonuniversal power-law avalanche size and time distributions have been found with exponents agreeing with the values obtained in electrode experiments of the human brain. The dynamical critical region occurs in an extended control parameter space without the assumption of self-organized criticality.

A Dynamic Connectome Supports the Emergence of Stable Computational Function of Neural Circuits through Reward-Based Learning.

PubMed

Kappel, David; Legenstein, Robert; Habenschuss, Stefan; Hsieh, Michael; Maass, Wolfgang

2018-01-01

Synaptic connections between neurons in the brain are dynamic because of continuously ongoing spine dynamics, axonal sprouting, and other processes. In fact, it was recently shown that the spontaneous synapse-autonomous component of spine dynamics is at least as large as the component that depends on the history of pre- and postsynaptic neural activity. These data are inconsistent with common models for network plasticity and raise the following questions: how can neural circuits maintain a stable computational function in spite of these continuously ongoing processes, and what could be functional uses of these ongoing processes? Here, we present a rigorous theoretical framework for these seemingly stochastic spine dynamics and rewiring processes in the context of reward-based learning tasks. We show that spontaneous synapse-autonomous processes, in combination with reward signals such as dopamine, can explain the capability of networks of neurons in the brain to configure themselves for specific computational tasks, and to compensate automatically for later changes in the network or task. Furthermore, we show theoretically and through computer simulations that stable computational performance is compatible with continuously ongoing synapse-autonomous changes. After reaching good computational performance it causes primarily a slow drift of network architecture and dynamics in task-irrelevant dimensions, as observed for neural activity in motor cortex and other areas. On the more abstract level of reinforcement learning the resulting model gives rise to an understanding of reward-driven network plasticity as continuous sampling of network configurations.

A Dynamic Connectome Supports the Emergence of Stable Computational Function of Neural Circuits through Reward-Based Learning

PubMed Central

Habenschuss, Stefan; Hsieh, Michael

2018-01-01

Synaptic connections between neurons in the brain are dynamic because of continuously ongoing spine dynamics, axonal sprouting, and other processes. In fact, it was recently shown that the spontaneous synapse-autonomous component of spine dynamics is at least as large as the component that depends on the history of pre- and postsynaptic neural activity. These data are inconsistent with common models for network plasticity and raise the following questions: how can neural circuits maintain a stable computational function in spite of these continuously ongoing processes, and what could be functional uses of these ongoing processes? Here, we present a rigorous theoretical framework for these seemingly stochastic spine dynamics and rewiring processes in the context of reward-based learning tasks. We show that spontaneous synapse-autonomous processes, in combination with reward signals such as dopamine, can explain the capability of networks of neurons in the brain to configure themselves for specific computational tasks, and to compensate automatically for later changes in the network or task. Furthermore, we show theoretically and through computer simulations that stable computational performance is compatible with continuously ongoing synapse-autonomous changes. After reaching good computational performance it causes primarily a slow drift of network architecture and dynamics in task-irrelevant dimensions, as observed for neural activity in motor cortex and other areas. On the more abstract level of reinforcement learning the resulting model gives rise to an understanding of reward-driven network plasticity as continuous sampling of network configurations. PMID:29696150

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-5 gene expression. Our model also predicted the key regulatory networks for the ESC-MES, MES-CP and CP-CM transitions. We report a novel method to systematically integrate multi-dimensional -omics data and reconstruct the gene regulatory networks. This method will allow one to rapidly determine the cis-modules that regulate key genes during cardiac differentiation.

What's in a crowd? Analysis of face-to-face behavioral networks.

PubMed

Isella, Lorenzo; Stehlé, Juliette; Barrat, Alain; Cattuto, Ciro; Pinton, Jean-François; Van den Broeck, Wouter

2011-02-21

The availability of new data sources on human mobility is opening new avenues for investigating the interplay of social networks, human mobility and dynamical processes such as epidemic spreading. Here we analyze data on the time-resolved face-to-face proximity of individuals in large-scale real-world scenarios. We compare two settings with very different properties, a scientific conference and a long-running museum exhibition. We track the behavioral networks of face-to-face proximity, and characterize them from both a static and a dynamic point of view, exposing differences and similarities. We use our data to investigate the dynamics of a susceptible-infected model for epidemic spreading that unfolds on the dynamical networks of human proximity. The spreading patterns are markedly different for the conference and the museum case, and they are strongly impacted by the causal structure of the network data. A deeper study of the spreading paths shows that the mere knowledge of static aggregated networks would lead to erroneous conclusions about the transmission paths on the dynamical networks. Copyright © 2010 Elsevier Ltd. All rights reserved.

AST: Activity-Security-Trust driven modeling of time varying networks

PubMed Central

Wang, Jian; Xu, Jiake; Liu, Yanheng; Deng, Weiwen

2016-01-01

Network modeling is a flexible mathematical structure that enables to identify statistical regularities and structural principles hidden in complex systems. The majority of recent driving forces in modeling complex networks are originated from activity, in which an activity potential of a time invariant function is introduced to identify agents’ interactions and to construct an activity-driven model. However, the new-emerging network evolutions are already deeply coupled with not only the explicit factors (e.g. activity) but also the implicit considerations (e.g. security and trust), so more intrinsic driving forces behind should be integrated into the modeling of time varying networks. The agents undoubtedly seek to build a time-dependent trade-off among activity, security, and trust in generating a new connection to another. Thus, we reasonably propose the Activity-Security-Trust (AST) driven model through synthetically considering the explicit and implicit driving forces (e.g. activity, security, and trust) underlying the decision process. AST-driven model facilitates to more accurately capture highly dynamical network behaviors and figure out the complex evolution process, allowing a profound understanding of the effects of security and trust in driving network evolution, and improving the biases induced by only involving activity representations in analyzing the dynamical processes. PMID:26888717

Efficient digital implementation of a conductance-based globus pallidus neuron and the dynamics analysis

NASA Astrophysics Data System (ADS)

Yang, Shuangming; Wei, Xile; Deng, Bin; Liu, Chen; Li, Huiyan; Wang, Jiang

2018-03-01

Balance between biological plausibility of dynamical activities and computational efficiency is one of challenging problems in computational neuroscience and neural system engineering. This paper proposes a set of efficient methods for the hardware realization of the conductance-based neuron model with relevant dynamics, targeting reproducing the biological behaviors with low-cost implementation on digital programmable platform, which can be applied in wide range of conductance-based neuron models. Modified GP neuron models for efficient hardware implementation are presented to reproduce reliable pallidal dynamics, which decode the information of basal ganglia and regulate the movement disorder related voluntary activities. Implementation results on a field-programmable gate array (FPGA) demonstrate that the proposed techniques and models can reduce the resource cost significantly and reproduce the biological dynamics accurately. Besides, the biological behaviors with weak network coupling are explored on the proposed platform, and theoretical analysis is also made for the investigation of biological characteristics of the structured pallidal oscillator and network. The implementation techniques provide an essential step towards the large-scale neural network to explore the dynamical mechanisms in real time. Furthermore, the proposed methodology enables the FPGA-based system a powerful platform for the investigation on neurodegenerative diseases and real-time control of bio-inspired neuro-robotics.

Self-organized Criticality in Hierarchical Brain Network

NASA Astrophysics Data System (ADS)

Yang, Qiu-Ying; Zhang, Ying-Yue; Chen, Tian-Lun

2008-11-01

It is shown that the cortical brain network of the macaque displays a hierarchically clustered organization and the neuron network shows small-world properties. Now the two factors will be considered in our model and the dynamical behavior of the model will be studied. We study the characters of the model and find that the distribution of avalanche size of the model follows power-law behavior.

Optimizing Natural Gas Networks through Dynamic Manifold Theory and a Decentralized Algorithm: Belgium Case Study

NASA Astrophysics Data System (ADS)

Koch, Caleb; Winfrey, Leigh

2014-10-01

Natural Gas is a major energy source in Europe, yet political instabilities have the potential to disrupt access and supply. Energy resilience is an increasingly essential construct and begins with transmission network design. This study proposes a new way of thinking about modelling natural gas flow. Rather than relying on classical economic models, this problem is cast into a time-dependent Hamiltonian dynamics discussion. Traditional Natural Gas constraints, including inelastic demand and maximum/minimum pipe flows, are portrayed as energy functions and built into the dynamics of each pipe flow. Doing so allows the constraints to be built into the dynamics of each pipeline. As time progresses in the model, natural gas flow rates find the minimum energy, thus the optimal gas flow rates. The most important result of this study is using dynamical principles to ensure the output of natural gas at demand nodes remains constant, which is important for country to country natural gas transmission. Another important step in this study is building the dynamics of each flow in a decentralized algorithm format. Decentralized regulation has solved congestion problems for internet data flow, traffic flow, epidemiology, and as demonstrated in this study can solve the problem of Natural Gas congestion. A mathematical description is provided for how decentralized regulation leads to globally optimized network flow. Furthermore, the dynamical principles and decentralized algorithm are applied to a case study of the Fluxys Belgium Natural Gas Network.

A reanalysis of "Two types of asynchronous activity in networks of excitatory and inhibitory spiking neurons".

PubMed

Engelken, Rainer; Farkhooi, Farzad; Hansel, David; van Vreeswijk, Carl; Wolf, Fred

2016-01-01

Neuronal activity in the central nervous system varies strongly in time and across neuronal populations. It is a longstanding proposal that such fluctuations generically arise from chaotic network dynamics. Various theoretical studies predict that the rich dynamics of rate models operating in the chaotic regime can subserve circuit computation and learning. Neurons in the brain, however, communicate via spikes and it is a theoretical challenge to obtain similar rate fluctuations in networks of spiking neuron models. A recent study investigated spiking balanced networks of leaky integrate and fire (LIF) neurons and compared their dynamics to a matched rate network with identical topology, where single unit input-output functions were chosen from isolated LIF neurons receiving Gaussian white noise input. A mathematical analogy between the chaotic instability in networks of rate units and the spiking network dynamics was proposed. Here we revisit the behavior of the spiking LIF networks and these matched rate networks. We find expected hallmarks of a chaotic instability in the rate network: For supercritical coupling strength near the transition point, the autocorrelation time diverges. For subcritical coupling strengths, we observe critical slowing down in response to small external perturbations. In the spiking network, we found in contrast that the timescale of the autocorrelations is insensitive to the coupling strength and that rate deviations resulting from small input perturbations rapidly decay. The decay speed even accelerates for increasing coupling strength. In conclusion, our reanalysis demonstrates fundamental differences between the behavior of pulse-coupled spiking LIF networks and rate networks with matched topology and input-output function. In particular there is no indication of a corresponding chaotic instability in the spiking network.

In vitro large-scale experimental and theoretical studies for the realization of bi-directional brain-prostheses.

PubMed

Bonifazi, Paolo; Difato, Francesco; Massobrio, Paolo; Breschi, Gian L; Pasquale, Valentina; Levi, Timothée; Goldin, Miri; Bornat, Yannick; Tedesco, Mariateresa; Bisio, Marta; Kanner, Sivan; Galron, Ronit; Tessadori, Jacopo; Taverna, Stefano; Chiappalone, Michela

2013-01-01

Brain-machine interfaces (BMI) were born to control "actions from thoughts" in order to recover motor capability of patients with impaired functional connectivity between the central and peripheral nervous system. The final goal of our studies is the development of a new proof-of-concept BMI-a neuromorphic chip for brain repair-to reproduce the functional organization of a damaged part of the central nervous system. To reach this ambitious goal, we implemented a multidisciplinary "bottom-up" approach in which in vitro networks are the paradigm for the development of an in silico model to be incorporated into a neuromorphic device. In this paper we present the overall strategy and focus on the different building blocks of our studies: (i) the experimental characterization and modeling of "finite size networks" which represent the smallest and most general self-organized circuits capable of generating spontaneous collective dynamics; (ii) the induction of lesions in neuronal networks and the whole brain preparation with special attention on the impact on the functional organization of the circuits; (iii) the first production of a neuromorphic chip able to implement a real-time model of neuronal networks. A dynamical characterization of the finite size circuits with single cell resolution is provided. A neural network model based on Izhikevich neurons was able to replicate the experimental observations. Changes in the dynamics of the neuronal circuits induced by optical and ischemic lesions are presented respectively for in vitro neuronal networks and for a whole brain preparation. Finally the implementation of a neuromorphic chip reproducing the network dynamics in quasi-real time (10 ns precision) is presented.

Dynamic Modeling of Systemic Risk in Financial Networks

NASA Astrophysics Data System (ADS)

Avakian, Adam

Modern financial networks are complicated structures that can contain multiple types of nodes and connections between those nodes. Banks, governments and even individual people weave into an intricate network of debt, risk correlations and many other forms of interconnectedness. We explore multiple types of financial network models with a focus on understanding the dynamics and causes of cascading failures in such systems. In particular, we apply real-world data from multiple sources to these models to better understand real-world financial networks. We use the results of the Federal Reserve "Banking Organization Systemic Risk Report" (FR Y-15), which surveys the largest US banks on their level of interconnectedness, to find relationships between various measures of network connectivity and systemic risk in the US financial sector. This network model is then stress-tested under a number of scenarios to determine systemic risks inherent in the various network structures. We also use detailed historical balance sheet data from the Venezuelan banking system to build a bipartite network model and find relationships between the changing network structure over time and the response of the system to various shocks. We find that the relationship between interconnectedness and systemic risk is highly dependent on the system and model but that it is always a significant one. These models are useful tools that add value to regulators in creating new measurements of systemic risk in financial networks. These models could be used as macroprudential tools for monitoring the health of the entire banking system as a whole rather than only of individual banks.

A dynamic ventilation model for gravity sewer networks.

PubMed

Wang, Y C; Nobi, N; Nguyen, T; Vorreiter, L

2012-01-01

To implement any effective odour and corrosion control technology in the sewer network, it is imperative that the airflow through gravity sewer airspaces be quantified. This paper presents a full dynamic airflow model for gravity sewer systems. The model, which is developed using the finite element method, is a compressible air transport model. The model has been applied to the North Head Sewerage Ocean Outfall System (NSOOS) and calibrated using the air pressure and airflow data collected during October 2008. Although the calibration is focused on forced ventilation, the model can be applied to natural ventilation as well.

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.

Dynamics of wood in stream networks of the western Cascades Range, Oregon

Treesearch

Nicole M. Czarnomski; David M. Dreher; Kai U. Snyder; Julia A. Jones; Frederick J. Swanson

2008-01-01

We develop and test a conceptual model of wood dynamics in stream networks that considers legacies of forest management practices, floods, and debris flows. We combine an observational study of wood in 25 km of 2nd- through 5th-order streams in a steep, forested watershed of the western Cascade Range of Oregon with whole-network studies of forest cutting, roads, and...

Analytical Computation of the Epidemic Threshold on Temporal Networks

NASA Astrophysics Data System (ADS)

Valdano, Eugenio; Ferreri, Luca; Poletto, Chiara; Colizza, Vittoria

2015-04-01

The time variation of contacts in a networked system may fundamentally alter the properties of spreading processes and affect the condition for large-scale propagation, as encoded in the epidemic threshold. Despite the great interest in the problem for the physics, applied mathematics, computer science, and epidemiology communities, a full theoretical understanding is still missing and currently limited to the cases where the time-scale separation holds between spreading and network dynamics or to specific temporal network models. We consider a Markov chain description of the susceptible-infectious-susceptible process on an arbitrary temporal network. By adopting a multilayer perspective, we develop a general analytical derivation of the epidemic threshold in terms of the spectral radius of a matrix that encodes both network structure and disease dynamics. The accuracy of the approach is confirmed on a set of temporal models and empirical networks and against numerical results. In addition, we explore how the threshold changes when varying the overall time of observation of the temporal network, so as to provide insights on the optimal time window for data collection of empirical temporal networked systems. Our framework is of both fundamental and practical interest, as it offers novel understanding of the interplay between temporal networks and spreading dynamics.

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.

Process-driven inference of biological network structure: feasibility, minimality, and multiplicity

NASA Astrophysics Data System (ADS)

Zeng, Chen

2012-02-01

For a given dynamic process, identifying the putative interaction networks to achieve it is the inference problem. In this talk, we address the computational complexity of inference problem in the context of Boolean networks under dominant inhibition condition. The first is a proof that the feasibility problem (is there a network that explains the dynamics?) can be solved in polynomial-time. Second, while the minimality problem (what is the smallest network that explains the dynamics?) is shown to be NP-hard, a simple polynomial-time heuristic is shown to produce near-minimal solutions, as demonstrated by simulation. Third, the theoretical framework also leads to a fast polynomial-time heuristic to estimate the number of network solutions with reasonable accuracy. We will apply these approaches to two simplified Boolean network models for the cell cycle process of budding yeast (Li 2004) and fission yeast (Davidich 2008). Our results demonstrate that each of these networks contains a giant backbone motif spanning all the network nodes that provides the desired main functionality, while the remaining edges in the network form smaller motifs whose role is to confer stability properties rather than provide function. Moreover, we show that the bioprocesses of these two cell cycle models differ considerably from a typically generated process and are intrinsically cascade-like.

Three-Dimensional Multiscale Modeling of Dendritic Spacing Selection During Al-Si Directional Solidification

NASA Astrophysics Data System (ADS)

Tourret, Damien; Clarke, Amy J.; Imhoff, Seth D.; Gibbs, Paul J.; Gibbs, John W.; Karma, Alain

2015-08-01

We present a three-dimensional extension of the multiscale dendritic needle network (DNN) model. This approach enables quantitative simulations of the unsteady dynamics of complex hierarchical networks in spatially extended dendritic arrays. We apply the model to directional solidification of Al-9.8 wt.%Si alloy and directly compare the model predictions with measurements from experiments with in situ x-ray imaging. We focus on the dynamical selection of primary spacings over a range of growth velocities, and the influence of sample geometry on the selection of spacings. Simulation results show good agreement with experiments. The computationally efficient DNN model opens new avenues for investigating the dynamics of large dendritic arrays at scales relevant to solidification experiments and processes.

Hidden long evolutionary memory in a model biochemical network

NASA Astrophysics Data System (ADS)

Ali, Md. Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

2018-04-01

We introduce a minimal model for the evolution of functional protein-interaction networks using a sequence-based mutational algorithm, and apply the model to study neutral drift in networks that yield oscillatory dynamics. Starting with a functional core module, random evolutionary drift increases network complexity even in the absence of specific selective pressures. Surprisingly, we uncover a hidden order in sequence space that gives rise to long-term evolutionary memory, implying strong constraints on network evolution due to the topology of accessible sequence space.

Spreading Activation in an Attractor Network with Latching Dynamics: Automatic Semantic Priming Revisited

PubMed Central

Lerner, Itamar; Bentin, Shlomo; Shriki, Oren

2012-01-01

Localist models of spreading activation (SA) and models assuming distributed-representations offer very different takes on semantic priming, a widely investigated paradigm in word recognition and semantic memory research. In the present study we implemented SA in an attractor neural network model with distributed representations and created a unified framework for the two approaches. Our models assumes a synaptic depression mechanism leading to autonomous transitions between encoded memory patterns (latching dynamics), which account for the major characteristics of automatic semantic priming in humans. Using computer simulations we demonstrated how findings that challenged attractor-based networks in the past, such as mediated and asymmetric priming, are a natural consequence of our present model’s dynamics. Puzzling results regarding backward priming were also given a straightforward explanation. In addition, the current model addresses some of the differences between semantic and associative relatedness and explains how these differences interact with stimulus onset asynchrony in priming experiments. PMID:23094718

Clusters in nonsmooth oscillator networks

NASA Astrophysics Data System (ADS)

Nicks, Rachel; Chambon, Lucie; Coombes, Stephen

2018-03-01

For coupled oscillator networks with Laplacian coupling, the master stability function (MSF) has proven a particularly powerful tool for assessing the stability of the synchronous state. Using tools from group theory, this approach has recently been extended to treat more general cluster states. However, the MSF and its generalizations require the determination of a set of Floquet multipliers from variational equations obtained by linearization around a periodic orbit. Since closed form solutions for periodic orbits are invariably hard to come by, the framework is often explored using numerical techniques. Here, we show that further insight into network dynamics can be obtained by focusing on piecewise linear (PWL) oscillator models. Not only do these allow for the explicit construction of periodic orbits, their variational analysis can also be explicitly performed. The price for adopting such nonsmooth systems is that many of the notions from smooth dynamical systems, and in particular linear stability, need to be modified to take into account possible jumps in the components of Jacobians. This is naturally accommodated with the use of saltation matrices. By augmenting the variational approach for studying smooth dynamical systems with such matrices we show that, for a wide variety of networks that have been used as models of biological systems, cluster states can be explicitly investigated. By way of illustration, we analyze an integrate-and-fire network model with event-driven synaptic coupling as well as a diffusively coupled network built from planar PWL nodes, including a reduction of the popular Morris-Lecar neuron model. We use these examples to emphasize that the stability of network cluster states can depend as much on the choice of single node dynamics as it does on the form of network structural connectivity. Importantly, the procedure that we present here, for understanding cluster synchronization in networks, is valid for a wide variety of systems in biology, physics, and engineering that can be described by PWL oscillators.

Dynamical organization towards consensus in the Axelrod model on complex networks

NASA Astrophysics Data System (ADS)

Guerra, Beniamino; Poncela, Julia; Gómez-Gardeñes, Jesús; Latora, Vito; Moreno, Yamir

2010-05-01

We analyze the dynamics toward cultural consensus in the Axelrod model on scale-free networks. By looking at the microscopic dynamics of the model, we are able to show how culture traits spread across different cultural features. We compare the diffusion at the level of cultural features to the growth of cultural consensus at the global level, finding important differences between these two processes. In particular, we show that even when most of the cultural features have reached macroscopic consensus, there are still no signals of globalization. Finally, we analyze the topology of consensus clusters both for global culture and at the feature level of representation.

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.

Opinion dynamics on an adaptive random network

NASA Astrophysics Data System (ADS)

Benczik, I. J.; Benczik, S. Z.; Schmittmann, B.; Zia, R. K. P.

2009-04-01

We revisit the classical model for voter dynamics in a two-party system with two basic modifications. In contrast to the original voter model studied in regular lattices, we implement the opinion formation process in a random network of agents in which interactions are no longer restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion, or rather with opponents. In this way, the network is built in an adaptive manner, in the sense that its structure is correlated and evolves with the dynamics of the agents. The simplicity of the model allows us to examine several issues analytically. We establish criteria to determine whether consensus or polarization will be the outcome of the dynamics and on what time scales these states will be reached. In finite systems consensus is typical, while in infinite systems a disordered metastable state can emerge and persist for infinitely long time before consensus is reached.

Dynamics of Competition between Subnetworks of Spiking Neuronal Networks in the Balanced State.

PubMed

Lagzi, Fereshteh; Rotter, Stefan

2015-01-01

We explore and analyze the nonlinear switching dynamics of neuronal networks with non-homogeneous connectivity. The general significance of such transient dynamics for brain function is unclear; however, for instance decision-making processes in perception and cognition have been implicated with it. The network under study here is comprised of three subnetworks of either excitatory or inhibitory leaky integrate-and-fire neurons, of which two are of the same type. The synaptic weights are arranged to establish and maintain a balance between excitation and inhibition in case of a constant external drive. Each subnetwork is randomly connected, where all neurons belonging to a particular population have the same in-degree and the same out-degree. Neurons in different subnetworks are also randomly connected with the same probability; however, depending on the type of the pre-synaptic neuron, the synaptic weight is scaled by a factor. We observed that for a certain range of the "within" versus "between" connection weights (bifurcation parameter), the network activation spontaneously switches between the two sub-networks of the same type. This kind of dynamics has been termed "winnerless competition", which also has a random component here. In our model, this phenomenon is well described by a set of coupled stochastic differential equations of Lotka-Volterra type that imply a competition between the subnetworks. The associated mean-field model shows the same dynamical behavior as observed in simulations of large networks comprising thousands of spiking neurons. The deterministic phase portrait is characterized by two attractors and a saddle node, its stochastic component is essentially given by the multiplicative inherent noise of the system. We find that the dwell time distribution of the active states is exponential, indicating that the noise drives the system randomly from one attractor to the other. A similar model for a larger number of populations might suggest a general approach to study the dynamics of interacting populations of spiking networks.

Dynamics of Competition between Subnetworks of Spiking Neuronal Networks in the Balanced State

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2015-01-01

We explore and analyze the nonlinear switching dynamics of neuronal networks with non-homogeneous connectivity. The general significance of such transient dynamics for brain function is unclear; however, for instance decision-making processes in perception and cognition have been implicated with it. The network under study here is comprised of three subnetworks of either excitatory or inhibitory leaky integrate-and-fire neurons, of which two are of the same type. The synaptic weights are arranged to establish and maintain a balance between excitation and inhibition in case of a constant external drive. Each subnetwork is randomly connected, where all neurons belonging to a particular population have the same in-degree and the same out-degree. Neurons in different subnetworks are also randomly connected with the same probability; however, depending on the type of the pre-synaptic neuron, the synaptic weight is scaled by a factor. We observed that for a certain range of the “within” versus “between” connection weights (bifurcation parameter), the network activation spontaneously switches between the two sub-networks of the same type. This kind of dynamics has been termed “winnerless competition”, which also has a random component here. In our model, this phenomenon is well described by a set of coupled stochastic differential equations of Lotka-Volterra type that imply a competition between the subnetworks. The associated mean-field model shows the same dynamical behavior as observed in simulations of large networks comprising thousands of spiking neurons. The deterministic phase portrait is characterized by two attractors and a saddle node, its stochastic component is essentially given by the multiplicative inherent noise of the system. We find that the dwell time distribution of the active states is exponential, indicating that the noise drives the system randomly from one attractor to the other. A similar model for a larger number of populations might suggest a general approach to study the dynamics of interacting populations of spiking networks. PMID:26407178

Reconstructing the regulatory network controlling commitment and sporulation in Physarum polycephalum based on hierarchical Petri Net modelling and simulation.

PubMed

Marwan, Wolfgang; Sujatha, Arumugam; Starostzik, Christine

2005-10-21

We reconstruct the regulatory network controlling commitment and sporulation of Physarum polycephalum from experimental results using a hierarchical Petri Net-based modelling and simulation framework. The stochastic Petri Net consistently describes the structure and simulates the dynamics of the molecular network as analysed by genetic, biochemical and physiological experiments within a single coherent model. The Petri Net then is extended to simulate time-resolved somatic complementation experiments performed by mixing the cytoplasms of mutants altered in the sporulation response, to systematically explore the network structure and to probe its dynamics. This reverse engineering approach presumably can be employed to explore other molecular or genetic signalling systems where the activity of genes or their products can be experimentally controlled in a time-resolved manner.

Allosteric mechanism of quinoline inhibitors for HIV RT-associated RNase with MD simulation and dynamics fluctuation network.

PubMed

Cai, Yi; Liu, Hao; Chen, Haifeng

2018-03-01

The human immunodeficiency virus (HIV) is a retrovirus which infects T lymphocyte of human body and causes immunodeficiency. Reverse transcriptase inhibitors (RTIs) can inhibit some functions of RT, preventing virus synthesis (double-stranded DNA), so that HIV virus replication can be reduced. Experimental results indicate a series of benzimidazole-based inhibitors which target HIV RT-associated RNase to inhibit the reverse transcription of HIV virus. However, the allosteric mechanism is still unclear. Here, molecular dynamics simulations and dynamics fluctuation network analysis were used to reveal the binding mode between the inhibitors and RT-associated RNase. The most active molecule has more hydrophobic and electrostatic interactions than the less active inhibitor. Dynamics correlation network analysis indicates that the most active inhibitor perturbs the network of RT-associated RNase and decreases the correlation of nodes. 3D-QSAR model suggests that two robust and reliable models were constructed and validated by independent test set. 3D-QSAR model also shows that bulky negatively charged or hydrophilic substituent is favorable to bioactivity. These results reveal the allosteric mechanism of quinoline inhibitors and help to improve the bioactivity. © 2017 John Wiley & Sons A/S.

Modeling Dynamic Evolution of Online Friendship Network

NASA Astrophysics Data System (ADS)

Wu, Lian-Ren; Yan, Qiang

2012-10-01

In this paper, we study the dynamic evolution of friendship network in SNS (Social Networking Site). Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community, but also on the friendship network generated by those friends. In addition, we propose a model which is based on two processes: first, connecting nearest neighbors; second, strength driven attachment mechanism. The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes which have larger weights and interactions, a phenomenon called strength driven attachment (also called weight driven attachment). From the simulation results, we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data.

Inferring Time-Varying Network Topologies from Gene Expression Data

PubMed Central

2007-01-01

Most current methods for gene regulatory network identification lead to the inference of steady-state networks, that is, networks prevalent over all times, a hypothesis which has been challenged. There has been a need to infer and represent networks in a dynamic, that is, time-varying fashion, in order to account for different cellular states affecting the interactions amongst genes. In this work, we present an approach, regime-SSM, to understand gene regulatory networks within such a dynamic setting. The approach uses a clustering method based on these underlying dynamics, followed by system identification using a state-space model for each learnt cluster—to infer a network adjacency matrix. We finally indicate our results on the mouse embryonic kidney dataset as well as the T-cell activation-based expression dataset and demonstrate conformity with reported experimental evidence. PMID:18309363

Inferring time-varying network topologies from gene expression data.

PubMed

Rao, Arvind; Hero, Alfred O; States, David J; Engel, James Douglas

2007-01-01

Most current methods for gene regulatory network identification lead to the inference of steady-state networks, that is, networks prevalent over all times, a hypothesis which has been challenged. There has been a need to infer and represent networks in a dynamic, that is, time-varying fashion, in order to account for different cellular states affecting the interactions amongst genes. In this work, we present an approach, regime-SSM, to understand gene regulatory networks within such a dynamic setting. The approach uses a clustering method based on these underlying dynamics, followed by system identification using a state-space model for each learnt cluster--to infer a network adjacency matrix. We finally indicate our results on the mouse embryonic kidney dataset as well as the T-cell activation-based expression dataset and demonstrate conformity with reported experimental evidence.

Neural network application to aircraft control system design

NASA Technical Reports Server (NTRS)

Troudet, Terry; Garg, Sanjay; Merrill, Walter C.

1991-01-01

The feasibility of using artificial neural networks as control systems for modern, complex aerospace vehicles is investigated via an example aircraft control design study. The problem considered is that of designing a controller for an integrated airframe/propulsion longitudinal dynamics model of a modern fighter aircraft to provide independent control of pitch rate and airspeed responses to pilot command inputs. An explicit model following controller using H infinity control design techniques is first designed to gain insight into the control problem as well as to provide a baseline for evaluation of the neurocontroller. Using the model of the desired dynamics as a command generator, a multilayer feedforward neural network is trained to control the vehicle model within the physical limitations of the actuator dynamics. This is achieved by minimizing an objective function which is a weighted sum of tracking errors and control input commands and rates. To gain insight in the neurocontrol, linearized representations of the nonlinear neurocontroller are analyzed along a commanded trajectory. Linear robustness analysis tools are then applied to the linearized neurocontroller models and to the baseline H infinity based controller. Future areas of research are identified to enhance the practical applicability of neural networks to flight control design.

Neural network application to aircraft control system design

NASA Technical Reports Server (NTRS)

Troudet, Terry; Garg, Sanjay; Merrill, Walter C.

1991-01-01

The feasibility of using artificial neural network as control systems for modern, complex aerospace vehicles is investigated via an example aircraft control design study. The problem considered is that of designing a controller for an integrated airframe/propulsion longitudinal dynamics model of a modern fighter aircraft to provide independent control of pitch rate and airspeed responses to pilot command inputs. An explicit model following controller using H infinity control design techniques is first designed to gain insight into the control problem as well as to provide a baseline for evaluation of the neurocontroller. Using the model of the desired dynamics as a command generator, a multilayer feedforward neural network is trained to control the vehicle model within the physical limitations of the actuator dynamics. This is achieved by minimizing an objective function which is a weighted sum of tracking errors and control input commands and rates. To gain insight in the neurocontrol, linearized representations of the nonlinear neurocontroller are analyzed along a commanded trajectory. Linear robustness analysis tools are then applied to the linearized neurocontroller models and to the baseline H infinity based controller. Future areas of research identified to enhance the practical applicability of neural networks to flight control design.

The importance of accurately modelling human interactions. Comment on "Coupled disease-behavior dynamics on complex networks: A review" by Z. Wang et al.

NASA Astrophysics Data System (ADS)

Rosati, Dora P.; Molina, Chai; Earn, David J. D.

2015-12-01

Human behaviour and disease dynamics can greatly influence each other. In particular, people often engage in self-protective behaviours that affect epidemic patterns (e.g., vaccination, use of barrier precautions, isolation, etc.). Self-protective measures usually have a mitigating effect on an epidemic [16], but can in principle have negative impacts at the population level [12,15,18]. The structure of underlying social and biological contact networks can significantly influence the specific ways in which population-level effects are manifested. Using a different contact network in a disease dynamics model-keeping all else equal-can yield very different epidemic patterns. For example, it has been shown that when individuals imitate their neighbours' vaccination decisions with some probability, this can lead to herd immunity in some networks [9], yet for other networks it can preserve clusters of susceptible individuals that can drive further outbreaks of infectious disease [12].

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

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.

Evolution of regulatory networks towards adaptability and stability in a changing environment

NASA Astrophysics Data System (ADS)

Lee, Deok-Sun

2014-11-01

Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

Random walks on activity-driven networks with attractiveness

NASA Astrophysics Data System (ADS)

Alessandretti, Laura; Sun, Kaiyuan; Baronchelli, Andrea; Perra, Nicola

2017-05-01

Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterized by these two features. We study how these properties affect random-walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first-passage time of the process, and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems, such as heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.

Network dynamics of 3D engineered neuronal cultures: a new experimental model for in-vitro electrophysiology.

PubMed

Frega, Monica; Tedesco, Mariateresa; Massobrio, Paolo; Pesce, Mattia; Martinoia, Sergio

2014-06-30

Despite the extensive use of in-vitro models for neuroscientific investigations and notwithstanding the growing field of network electrophysiology, all studies on cultured cells devoted to elucidate neurophysiological mechanisms and computational properties, are based on 2D neuronal networks. These networks are usually grown onto specific rigid substrates (also with embedded electrodes) and lack of most of the constituents of the in-vivo like environment: cell morphology, cell-to-cell interaction and neuritic outgrowth in all directions. Cells in a brain region develop in a 3D space and interact with a complex multi-cellular environment and extracellular matrix. Under this perspective, 3D networks coupled to micro-transducer arrays, represent a new and powerful in-vitro model capable of better emulating in-vivo physiology. In this work, we present a new experimental paradigm constituted by 3D hippocampal networks coupled to Micro-Electrode-Arrays (MEAs) and we show how the features of the recorded network dynamics differ from the corresponding 2D network model. Further development of the proposed 3D in-vitro model by adding embedded functionalized scaffolds might open new prospects for manipulating, stimulating and recording the neuronal activity to elucidate neurophysiological mechanisms and to design bio-hybrid microsystems.

Network dynamics of 3D engineered neuronal cultures: a new experimental model for in-vitro electrophysiology

PubMed Central

Frega, Monica; Tedesco, Mariateresa; Massobrio, Paolo; Pesce, Mattia; Martinoia, Sergio

2014-01-01

Despite the extensive use of in-vitro models for neuroscientific investigations and notwithstanding the growing field of network electrophysiology, all studies on cultured cells devoted to elucidate neurophysiological mechanisms and computational properties, are based on 2D neuronal networks. These networks are usually grown onto specific rigid substrates (also with embedded electrodes) and lack of most of the constituents of the in-vivo like environment: cell morphology, cell-to-cell interaction and neuritic outgrowth in all directions. Cells in a brain region develop in a 3D space and interact with a complex multi-cellular environment and extracellular matrix. Under this perspective, 3D networks coupled to micro-transducer arrays, represent a new and powerful in-vitro model capable of better emulating in-vivo physiology. In this work, we present a new experimental paradigm constituted by 3D hippocampal networks coupled to Micro-Electrode-Arrays (MEAs) and we show how the features of the recorded network dynamics differ from the corresponding 2D network model. Further development of the proposed 3D in-vitro model by adding embedded functionalized scaffolds might open new prospects for manipulating, stimulating and recording the neuronal activity to elucidate neurophysiological mechanisms and to design bio-hybrid microsystems. PMID:24976386

The network organization of protein interactions in the spliceosome is reproduced by the simple rules of food-web models

PubMed Central

Pires, Mathias M.; Cantor, Maurício; Guimarães, Paulo R.; de Aguiar, Marcus A. M.; dos Reis, Sérgio F.; Coltri, Patricia P.

2015-01-01

The network structure of biological systems provides information on the underlying processes shaping their organization and dynamics. Here we examined the structure of the network depicting protein interactions within the spliceosome, the macromolecular complex responsible for splicing in eukaryotic cells. We show the interactions of less connected spliceosome proteins are nested subsets of the connections of the highly connected proteins. At the same time, the network has a modular structure with groups of proteins sharing similar interaction patterns. We then investigated the role of affinity and specificity in shaping the spliceosome network by adapting a probabilistic model originally designed to reproduce food webs. This food-web model was as successful in reproducing the structure of protein interactions as it is in reproducing interactions among species. The good performance of the model suggests affinity and specificity, partially determined by protein size and the timing of association to the complex, may be determining network structure. Moreover, because network models allow building ensembles of realistic networks while encompassing uncertainty they can be useful to examine the dynamics and vulnerability of intracelullar processes. Unraveling the mechanisms organizing the spliceosome interactions is important to characterize the role of individual proteins on splicing catalysis and regulation. PMID:26443080

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

PubMed

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

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

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

PubMed Central

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

2017-01-01

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

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

PubMed

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

2017-02-10

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

Selection on Network Dynamics Drives Differential Rates of Protein Domain Evolution

PubMed Central

Mannakee, Brian K.; Gutenkunst, Ryan N.

2016-01-01

The long-held principle that functionally important proteins evolve slowly has recently been challenged by studies in mice and yeast showing that the severity of a protein knockout only weakly predicts that protein’s rate of evolution. However, the relevance of these studies to evolutionary changes within proteins is unknown, because amino acid substitutions, unlike knockouts, often only slightly perturb protein activity. To quantify the phenotypic effect of small biochemical perturbations, we developed an approach to use computational systems biology models to measure the influence of individual reaction rate constants on network dynamics. We show that this dynamical influence is predictive of protein domain evolutionary rate within networks in vertebrates and yeast, even after controlling for expression level and breadth, network topology, and knockout effect. Thus, our results not only demonstrate the importance of protein domain function in determining evolutionary rate, but also the power of systems biology modeling to uncover unanticipated evolutionary forces. PMID:27380265

Self-organization in Balanced State Networks by STDP and Homeostatic Plasticity

PubMed Central

Effenberger, Felix; Jost, Jürgen; Levina, Anna

2015-01-01

Structural inhomogeneities in synaptic efficacies have a strong impact on population response dynamics of cortical networks and are believed to play an important role in their functioning. However, little is known about how such inhomogeneities could evolve by means of synaptic plasticity. Here we present an adaptive model of a balanced neuronal network that combines two different types of plasticity, STDP and synaptic scaling. The plasticity rules yield both long-tailed distributions of synaptic weights and firing rates. Simultaneously, a highly connected subnetwork of driver neurons with strong synapses emerges. Coincident spiking activity of several driver cells can evoke population bursts and driver cells have similar dynamical properties as leader neurons found experimentally. Our model allows us to observe the delicate interplay between structural and dynamical properties of the emergent inhomogeneities. It is simple, robust to parameter changes and able to explain a multitude of different experimental findings in one basic network. PMID:26335425

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

NASA Astrophysics Data System (ADS)

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

2017-02-01

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

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 evidence for the chaotic behavior of the system, and by suggesting candidate molecules driving chaos in the system. The results of our chaos analysis can increase our understanding of the intricacies of the regulatory network under analysis, and suggest experimental work to refine our behavior of the mechanisms underlying B. subtilis sporulation initiation control.

Location-Based Services in Vehicular Networks

ERIC Educational Resources Information Center

Wu, Di

2013-01-01

Location-based services have been identified as a promising communication paradigm in highly mobile and dynamic vehicular networks. However, existing mobile ad hoc networking cannot be directly applied to vehicular networking due to differences in traffic conditions, mobility models and network topologies. On the other hand, hybrid architectures…

Dynamics of networks of excitatory and inhibitory neurons in response to time-dependent inputs.

PubMed

Ledoux, Erwan; Brunel, Nicolas

2011-01-01

We investigate the dynamics of recurrent networks of excitatory (E) and inhibitory (I) neurons in the presence of time-dependent inputs. The dynamics is characterized by the network dynamical transfer function, i.e., how the population firing rate is modulated by sinusoidal inputs at arbitrary frequencies. Two types of networks are studied and compared: (i) a Wilson-Cowan type firing rate model; and (ii) a fully connected network of leaky integrate-and-fire (LIF) neurons, in a strong noise regime. We first characterize the region of stability of the "asynchronous state" (a state in which population activity is constant in time when external inputs are constant) in the space of parameters characterizing the connectivity of the network. We then systematically characterize the qualitative behaviors of the dynamical transfer function, as a function of the connectivity. We find that the transfer function can be either low-pass, or with a single or double resonance, depending on the connection strengths and synaptic time constants. Resonances appear when the system is close to Hopf bifurcations, that can be induced by two separate mechanisms: the I-I connectivity and the E-I connectivity. Double resonances can appear when excitatory delays are larger than inhibitory delays, due to the fact that two distinct instabilities exist with a finite gap between the corresponding frequencies. In networks of LIF neurons, changes in external inputs and external noise are shown to be able to change qualitatively the network transfer function. Firing rate models are shown to exhibit the same diversity of transfer functions as the LIF network, provided delays are present. They can also exhibit input-dependent changes of the transfer function, provided a suitable static non-linearity is incorporated.

A Dynamic Bayesian Network Model for the Production and Inventory Control

NASA Astrophysics Data System (ADS)

Shin, Ji-Sun; Takazaki, Noriyuki; Lee, Tae-Hong; Kim, Jin-Il; Lee, Hee-Hyol

In general, the production quantities and delivered goods are changed randomly and then the total stock is also changed randomly. This paper deals with the production and inventory control using the Dynamic Bayesian Network. Bayesian Network is a probabilistic model which represents the qualitative dependence between two or more random variables by the graph structure, and indicates the quantitative relations between individual variables by the conditional probability. The probabilistic distribution of the total stock is calculated through the propagation of the probability on the network. Moreover, an adjusting rule of the production quantities to maintain the probability of a lower limit and a ceiling of the total stock to certain values is shown.

The Dynamics of Networks of Identical Theta Neurons.

PubMed

Laing, Carlo R

2018-02-05

We consider finite and infinite all-to-all coupled networks of identical theta neurons. Two types of synaptic interactions are investigated: instantaneous and delayed (via first-order synaptic processing). Extensive use is made of the Watanabe/Strogatz (WS) ansatz for reducing the dimension of networks of identical sinusoidally-coupled oscillators. As well as the degeneracy associated with the constants of motion of the WS ansatz, we also find continuous families of solutions for instantaneously coupled neurons, resulting from the reversibility of the reduced model and the form of the synaptic input. We also investigate a number of similar related models. We conclude that the dynamics of networks of all-to-all coupled identical neurons can be surprisingly complicated.

Digital Signal Processing and Control for the Study of Gene Networks

NASA Astrophysics Data System (ADS)

Shin, Yong-Jun

2016-04-01

Thanks to the digital revolution, digital signal processing and control has been widely used in many areas of science and engineering today. It provides practical and powerful tools to model, simulate, analyze, design, measure, and control complex and dynamic systems such as robots and aircrafts. Gene networks are also complex dynamic systems which can be studied via digital signal processing and control. Unlike conventional computational methods, this approach is capable of not only modeling but also controlling gene networks since the experimental environment is mostly digital today. The overall aim of this article is to introduce digital signal processing and control as a useful tool for the study of gene networks.

Digital Signal Processing and Control for the Study of Gene Networks.

PubMed

Shin, Yong-Jun

2016-04-22

Thanks to the digital revolution, digital signal processing and control has been widely used in many areas of science and engineering today. It provides practical and powerful tools to model, simulate, analyze, design, measure, and control complex and dynamic systems such as robots and aircrafts. Gene networks are also complex dynamic systems which can be studied via digital signal processing and control. Unlike conventional computational methods, this approach is capable of not only modeling but also controlling gene networks since the experimental environment is mostly digital today. The overall aim of this article is to introduce digital signal processing and control as a useful tool for the study of gene networks.

Digital Signal Processing and Control for the Study of Gene Networks

PubMed Central

Shin, Yong-Jun

2016-01-01

Thanks to the digital revolution, digital signal processing and control has been widely used in many areas of science and engineering today. It provides practical and powerful tools to model, simulate, analyze, design, measure, and control complex and dynamic systems such as robots and aircrafts. Gene networks are also complex dynamic systems which can be studied via digital signal processing and control. Unlike conventional computational methods, this approach is capable of not only modeling but also controlling gene networks since the experimental environment is mostly digital today. The overall aim of this article is to introduce digital signal processing and control as a useful tool for the study of gene networks. PMID:27102828

Synchronization and coordination of sequences in two neural ensembles

NASA Astrophysics Data System (ADS)

Venaille, Antoine; Varona, Pablo; Rabinovich, Mikhail I.

2005-06-01

There are many types of neural networks involved in the sequential motor behavior of animals. For high species, the control and coordination of the network dynamics is a function of the higher levels of the central nervous system, in particular the cerebellum. However, in many cases, especially for invertebrates, such coordination is the result of direct synaptic connections between small circuits. We show here that even the chaotic sequential activity of small model networks can be coordinated by electrotonic synapses connecting one or several pairs of neurons that belong to two different networks. As an example, we analyzed the coordination and synchronization of the sequential activity of two statocyst model networks of the marine mollusk Clione. The statocysts are gravity sensory organs that play a key role in postural control of the animal and the generation of a complex hunting motor program. Each statocyst network was modeled by a small ensemble of neurons with Lotka-Volterra type dynamics and nonsymmetric inhibitory interactions. We studied how two such networks were synchronized by electrical coupling in the presence of an external signal which lead to winnerless competition among the neurons. We found that as a function of the number and the strength of connections between the two networks, it is possible to coordinate and synchronize the sequences that each network generates with its own chaotic dynamics. In spite of the chaoticity, the coordination of the signals is established through an activation sequence lock for those neurons that are active at a particular instant of time.

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

Reverse-engineering of gene networks for regulating early blood development from single-cell measurements.

PubMed

Wei, Jiangyong; Hu, Xiaohua; Zou, Xiufen; Tian, Tianhai

2017-12-28

Recent advances in omics technologies have raised great opportunities to study large-scale regulatory networks inside the cell. In addition, single-cell experiments have measured the gene and protein activities in a large number of cells under the same experimental conditions. However, a significant challenge in computational biology and bioinformatics is how to derive quantitative information from the single-cell observations and how to develop sophisticated mathematical models to describe the dynamic properties of regulatory networks using the derived quantitative information. This work designs an integrated approach to reverse-engineer gene networks for regulating early blood development based on singel-cell experimental observations. The wanderlust algorithm is initially used to develop the pseudo-trajectory for the activities of a number of genes. Since the gene expression data in the developed pseudo-trajectory show large fluctuations, we then use Gaussian process regression methods to smooth the gene express data in order to obtain pseudo-trajectories with much less fluctuations. The proposed integrated framework consists of both bioinformatics algorithms to reconstruct the regulatory network and mathematical models using differential equations to describe the dynamics of gene expression. The developed approach is applied to study the network regulating early blood cell development. A graphic model is constructed for a regulatory network with forty genes and a dynamic model using differential equations is developed for a network of nine genes. Numerical results suggests that the proposed model is able to match experimental data very well. We also examine the networks with more regulatory relations and numerical results show that more regulations may exist. We test the possibility of auto-regulation but numerical simulations do not support the positive auto-regulation. In addition, robustness is used as an importantly additional criterion to select candidate networks. The research results in this work shows that the developed approach is an efficient and effective method to reverse-engineer gene networks using single-cell experimental observations.

Low-Dimensional Models of "Neuro-Glio-Vascular Unit" for Describing Neural Dynamics under Normal and Energy-Starved Conditions.

PubMed

Chhabria, Karishma; Chakravarthy, V Srinivasa

2016-01-01

The motivation of developing simple minimal models for neuro-glio-vascular (NGV) system arises from a recent modeling study elucidating the bidirectional information flow within the NGV system having 89 dynamic equations (1). While this was one of the first attempts at formulating a comprehensive model for neuro-glio-vascular system, it poses severe restrictions in scaling up to network levels. On the contrary, low--dimensional models are convenient devices in simulating large networks that also provide an intuitive understanding of the complex interactions occurring within the NGV system. The key idea underlying the proposed models is to describe the glio-vascular system as a lumped system, which takes neural firing rate as input and returns an "energy" variable (analogous to ATP) as output. To this end, we present two models: biophysical neuro-energy (Model 1 with five variables), comprising KATP channel activity governed by neuronal ATP dynamics, and the dynamic threshold (Model 2 with three variables), depicting the dependence of neural firing threshold on the ATP dynamics. Both the models show different firing regimes, such as continuous spiking, phasic, and tonic bursting depending on the ATP production coefficient, ɛp, and external current. We then demonstrate that in a network comprising such energy-dependent neuron units, ɛp could modulate the local field potential (LFP) frequency and amplitude. Interestingly, low-frequency LFP dominates under low ɛp conditions, which is thought to be reminiscent of seizure-like activity observed in epilepsy. The proposed "neuron-energy" unit may be implemented in building models of NGV networks to simulate data obtained from multimodal neuroimaging systems, such as functional near infrared spectroscopy coupled to electroencephalogram and functional magnetic resonance imaging coupled to electroencephalogram. Such models could also provide a theoretical basis for devising optimal neurorehabilitation strategies, such as non-invasive brain stimulation for stroke patients.

Neural network identification of aircraft nonlinear aerodynamic characteristics

NASA Astrophysics Data System (ADS)

Egorchev, M. V.; Tiumentsev, Yu V.

2018-02-01

The simulation problem for the controlled aircraft motion is considered in the case of imperfect knowledge of the modeling object and its operating conditions. The work aims to develop a class of modular semi-empirical dynamic models that combine the capabilities of theoretical and neural network modeling. We consider the use of semi-empirical neural network models for solving the problem of identifying aerodynamic characteristics of an aircraft. We also discuss the formation problem for a representative set of data characterizing the behavior of a simulated dynamic system, which is one of the critical tasks in the synthesis of ANN-models. The effectiveness of the proposed approach is demonstrated using a simulation example of the aircraft angular motion and identifying the corresponding coefficients of aerodynamic forces and moments.

Optimization of matrix tablets controlled drug release using Elman dynamic neural networks and decision trees.

PubMed

Petrović, Jelena; Ibrić, Svetlana; Betz, Gabriele; Đurić, Zorica

2012-05-30

The main objective of the study was to develop artificial intelligence methods for optimization of drug release from matrix tablets regardless of the matrix type. Static and dynamic artificial neural networks of the same topology were developed to model dissolution profiles of different matrix tablets types (hydrophilic/lipid) using formulation composition, compression force used for tableting and tablets porosity and tensile strength as input data. Potential application of decision trees in discovering knowledge from experimental data was also investigated. Polyethylene oxide polymer and glyceryl palmitostearate were used as matrix forming materials for hydrophilic and lipid matrix tablets, respectively whereas selected model drugs were diclofenac sodium and caffeine. Matrix tablets were prepared by direct compression method and tested for in vitro dissolution profiles. Optimization of static and dynamic neural networks used for modeling of drug release was performed using Monte Carlo simulations or genetic algorithms optimizer. Decision trees were constructed following discretization of data. Calculated difference (f(1)) and similarity (f(2)) factors for predicted and experimentally obtained dissolution profiles of test matrix tablets formulations indicate that Elman dynamic neural networks as well as decision trees are capable of accurate predictions of both hydrophilic and lipid matrix tablets dissolution profiles. Elman neural networks were compared to most frequently used static network, Multi-layered perceptron, and superiority of Elman networks have been demonstrated. Developed methods allow simple, yet very precise way of drug release predictions for both hydrophilic and lipid matrix tablets having controlled drug release. Copyright © 2012 Elsevier B.V. All rights reserved.

Information Dynamics in Networks: Models and Algorithms

DTIC Science & Technology

2016-09-13

Twitter ; we investigated how to detect spam accounts on Facebook and other social networks by graph analytics; and finally we investigated how to design...networks. We investigated the appropriateness of existing mathematical models for explaining the structure of retweet cascades on Twitter ; we investigated...Received Paper 1.00 2.00 3.00 . A Note on Modeling Retweet Cascades on Twitter , Workshop on Algorithms and Models for the Web Graph. 09-DEC-15

Statistical inference to advance network models in epidemiology.

PubMed

Welch, David; Bansal, Shweta; Hunter, David R

2011-03-01

Contact networks are playing an increasingly important role in the study of epidemiology. Most of the existing work in this area has focused on considering the effect of underlying network structure on epidemic dynamics by using tools from probability theory and computer simulation. This work has provided much insight on the role that heterogeneity in host contact patterns plays on infectious disease dynamics. Despite the important understanding afforded by the probability and simulation paradigm, this approach does not directly address important questions about the structure of contact networks such as what is the best network model for a particular mode of disease transmission, how parameter values of a given model should be estimated, or how precisely the data allow us to estimate these parameter values. We argue that these questions are best answered within a statistical framework and discuss the role of statistical inference in estimating contact networks from epidemiological data. Copyright © 2011 Elsevier B.V. All rights reserved.

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

D'Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D.; Lohmann, Johannes

Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delaysmore » between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.« less

Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach

NASA Astrophysics Data System (ADS)

Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru

2014-12-01

Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.

Spatiotemporal Dynamics and Reliable Computations in Recurrent Spiking Neural Networks

NASA Astrophysics Data System (ADS)

Pyle, Ryan; Rosenbaum, Robert

2017-01-01

Randomly connected networks of excitatory and inhibitory spiking neurons provide a parsimonious model of neural variability, but are notoriously unreliable for performing computations. We show that this difficulty is overcome by incorporating the well-documented dependence of connection probability on distance. Spatially extended spiking networks exhibit symmetry-breaking bifurcations and generate spatiotemporal patterns that can be trained to perform dynamical computations under a reservoir computing framework.

Routing UAVs to Co-Optimize Mission Effectiveness and Network Performance with Dynamic Programming

DTIC Science & Technology

2011-03-01

Heuristics on Hexagonal Connected Dominating Sets to Model Routing Dissemination," in Communication Theory, Reliability, and Quality of Service (CTRQ...24] Matthew Capt. USAF Compton, Improving the Quality of Service and Security of Military Networks with a Network Tasking Order Process, 2010. [25...Wesley, 2006. [32] James Haught, "Adaptive Quality of Service Engine with Dynamic Queue Control," Air Force Institute of Technology, Wright

Framework for cascade size calculations on random networks

NASA Astrophysics Data System (ADS)

Burkholz, Rebekka; Schweitzer, Frank

2018-04-01

We present a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size. Our method is exact and applies to network ensembles with almost arbitrary degree distribution, degree-degree correlations, and, in case of threshold models, for arbitrary threshold distribution. With our approach, we shift the perspective from the known branching process approximations to the iterative update of suitable probability distributions. Such distributions are key to capture cascade dynamics that involve possibly continuous quantities and that depend on the cascade history, e.g., if load is accumulated over time. As a proof of concept, we provide two examples: (a) Constant load models that cover many of the analytically tractable casacade models, and, as a highlight, (b) a fiber bundle model that was not tractable by branching process approximations before. Our derivations cover the whole cascade dynamics, not only their steady state. This allows us to include interventions in time or further model complexity in the analysis.

Age structure and cooperation in coevolutionary games on dynamic network

NASA Astrophysics Data System (ADS)

Qin, Zilong; Hu, Zhenhua; Zhou, Xiaoping; Yi, Jingzhang

2015-04-01

Our proposed model imitates the growth of a population and describes the age structure and the level of cooperation in games on dynamic network with continuous changes of structure and topology. The removal of nodes and links caused by age-dependent attack, together with the nodes addition standing for the newborns of population, badly ruins Matthew effect in this coevolutionary process. Though the network is generated by growth and preferential attachment, it degenerates into random network and it is no longer heterogeneous. When the removal of nodes and links is equal to the addition of nodes and links, the size of dynamic network is maintained in steady-state, so is the low level of cooperation. Severe structure variation, homogeneous topology and continuous invasion of new defection jointly make dynamic network unsuitable for the survival of cooperator even when the probability with which the newborn players initially adopt the strategy cooperation is high, while things change slightly when the connections of newborn players are restricted. Fortunately, moderate interactions in a generation trigger an optimal recovering process to encourage cooperation. The model developed in this paper outlines an explanation of the cohesion changes in the development process of an organization. Some suggestions for cooperative behavior improvement are given in the end.

Role of local network oscillations in resting-state functional connectivity.

PubMed

Cabral, Joana; Hugues, Etienne; Sporns, Olaf; Deco, Gustavo

2011-07-01

Spatio-temporally organized low-frequency fluctuations (<0.1 Hz), observed in BOLD fMRI signal during rest, suggest the existence of underlying network dynamics that emerge spontaneously from intrinsic brain processes. Furthermore, significant correlations between distinct anatomical regions-or functional connectivity (FC)-have led to the identification of several widely distributed resting-state networks (RSNs). This slow dynamics seems to be highly structured by anatomical connectivity but the mechanism behind it and its relationship with neural activity, particularly in the gamma frequency range, remains largely unknown. Indeed, direct measurements of neuronal activity have revealed similar large-scale correlations, particularly in slow power fluctuations of local field potential gamma frequency range oscillations. To address these questions, we investigated neural dynamics in a large-scale model of the human brain's neural activity. A key ingredient of the model was a structural brain network defined by empirically derived long-range brain connectivity together with the corresponding conduction delays. A neural population, assumed to spontaneously oscillate in the gamma frequency range, was placed at each network node. When these oscillatory units are integrated in the network, they behave as weakly coupled oscillators. The time-delayed interaction between nodes is described by the Kuramoto model of phase oscillators, a biologically-based model of coupled oscillatory systems. For a realistic setting of axonal conduction speed, we show that time-delayed network interaction leads to the emergence of slow neural activity fluctuations, whose patterns correlate significantly with the empirically measured FC. The best agreement of the simulated FC with the empirically measured FC is found for a set of parameters where subsets of nodes tend to synchronize although the network is not globally synchronized. Inside such clusters, the simulated BOLD signal between nodes is found to be correlated, instantiating the empirically observed RSNs. Between clusters, patterns of positive and negative correlations are observed, as described in experimental studies. These results are found to be robust with respect to a biologically plausible range of model parameters. In conclusion, our model suggests how resting-state neural activity can originate from the interplay between the local neural dynamics and the large-scale structure of the brain. Copyright © 2011 Elsevier Inc. All rights reserved.

Enzyme Sequestration as a Tuning Point in Controlling Response Dynamics of Signalling Networks

PubMed Central

Ollivier, Julien F.; Soyer, Orkun S.

2016-01-01

Signalling networks result from combinatorial interactions among many enzymes and scaffolding proteins. These complex systems generate response dynamics that are often essential for correct decision-making in cells. Uncovering biochemical design principles that underpin such response dynamics is a prerequisite to understand evolved signalling networks and to design synthetic ones. Here, we use in silico evolution to explore the possible biochemical design space for signalling networks displaying ultrasensitive and adaptive response dynamics. By running evolutionary simulations mimicking different biochemical scenarios, we find that enzyme sequestration emerges as a key mechanism for enabling such dynamics. Inspired by these findings, and to test the role of sequestration, we design a generic, minimalist model of a signalling cycle, featuring two enzymes and a single scaffolding protein. We show that this simple system is capable of displaying both ultrasensitive and adaptive response dynamics. Furthermore, we find that tuning the concentration or kinetics of the sequestering protein can shift system dynamics between these two response types. These empirical results suggest that enzyme sequestration through scaffolding proteins is exploited by evolution to generate diverse response dynamics in signalling networks and could provide an engineering point in synthetic biology applications. PMID:27163612

Mean Field Analysis of Large-Scale Interacting Populations of Stochastic Conductance-Based Spiking Neurons Using the Klimontovich Method

NASA Astrophysics Data System (ADS)

Gandolfo, Daniel; Rodriguez, Roger; Tuckwell, Henry C.

2017-03-01

We investigate the dynamics of large-scale interacting neural populations, composed of conductance based, spiking model neurons with modifiable synaptic connection strengths, which are possibly also subjected to external noisy currents. The network dynamics is controlled by a set of neural population probability distributions (PPD) which are constructed along the same lines as in the Klimontovich approach to the kinetic theory of plasmas. An exact non-closed, nonlinear, system of integro-partial differential equations is derived for the PPDs. As is customary, a closing procedure leads to a mean field limit. The equations we have obtained are of the same type as those which have been recently derived using rigorous techniques of probability theory. The numerical solutions of these so called McKean-Vlasov-Fokker-Planck equations, which are only valid in the limit of infinite size networks, actually shows that the statistical measures as obtained from PPDs are in good agreement with those obtained through direct integration of the stochastic dynamical system for large but finite size networks. Although numerical solutions have been obtained for networks of Fitzhugh-Nagumo model neurons, which are often used to approximate Hodgkin-Huxley model neurons, the theory can be readily applied to networks of general conductance-based model neurons of arbitrary dimension.

Deep Potential Molecular Dynamics: A Scalable Model with the Accuracy of Quantum Mechanics

NASA Astrophysics Data System (ADS)

Zhang, Linfeng; Han, Jiequn; Wang, Han; Car, Roberto; E, Weinan

2018-04-01

We introduce a scheme for molecular simulations, the deep potential molecular dynamics (DPMD) method, based on a many-body potential and interatomic forces generated by a carefully crafted deep neural network trained with ab initio data. The neural network model preserves all the natural symmetries in the problem. It is first-principles based in the sense that there are no ad hoc components aside from the network model. We show that the proposed scheme provides an efficient and accurate protocol in a variety of systems, including bulk materials and molecules. In all these cases, DPMD gives results that are essentially indistinguishable from the original data, at a cost that scales linearly with system size.

Optimizing performance of hybrid FSO/RF networks in realistic dynamic scenarios

NASA Astrophysics Data System (ADS)

Llorca, Jaime; Desai, Aniket; Baskaran, Eswaran; Milner, Stuart; Davis, Christopher

2005-08-01

Hybrid Free Space Optical (FSO) and Radio Frequency (RF) networks promise highly available wireless broadband connectivity and quality of service (QoS), particularly suitable for emerging network applications involving extremely high data rate transmissions such as high quality video-on-demand and real-time surveillance. FSO links are prone to atmospheric obscuration (fog, clouds, snow, etc) and are difficult to align over long distances due the use of narrow laser beams and the effect of atmospheric turbulence. These problems can be mitigated by using adjunct directional RF links, which provide backup connectivity. In this paper, methodologies for modeling and simulation of hybrid FSO/RF networks are described. Individual link propagation models are derived using scattering theory, as well as experimental measurements. MATLAB is used to generate realistic atmospheric obscuration scenarios, including moving cloud layers at different altitudes. These scenarios are then imported into a network simulator (OPNET) to emulate mobile hybrid FSO/RF networks. This framework allows accurate analysis of the effects of node mobility, atmospheric obscuration and traffic demands on network performance, and precise evaluation of topology reconfiguration algorithms as they react to dynamic changes in the network. Results show how topology reconfiguration algorithms, together with enhancements to TCP/IP protocols which reduce the network response time, enable the network to rapidly detect and act upon link state changes in highly dynamic environments, ensuring optimized network performance and availability.

Estimating dynamic permeability in fractal pore network saturated by Maxwellian fluid

NASA Astrophysics Data System (ADS)

Sun, W.

2017-12-01

The frequency dependent flow of fluid in porous media is an important issue in geophysical prospecting. Oscillating flow in pipe leads to frequency dependent dynamic permeability and has been studied in pore network containing Newtonian fluid. But there is little work on oscillating complex fluid in pipe network, especially in irregular network. Here we formulated frequency dependent permeability for Maxwellian fluid and estimated the permeability in three-dimensional fractal network model. We consider an infinitely long cylindrical pipe with rigid solid wall. The pipe is filled with Maxwellian fluids. Based on the mass conservation equation, the equilibrium equation of force and Maxwell constitutive relationship, we formulated the flux by integration of axial velocity component over the pipe's cross section. Then we extend single pipe formulation to a 3D irregular network. Flux balance condition yields a set of linear equations whose unknowns are the fluid pressure at each node. By evaluating the total flow flux through the network, the dynamic permeability can be calculated.We investigated the dynamic permeability of brine and CPyCl/NaSal in a 3D porous sample with a cubic side length 1 cm. The pore network is created by a Voronoi cell filling method. The porosity, i.e., volume ratio between pore/pipe network and the overall cubic, is set as 0.1. The irregular pore network has a fractal structure. The dimension d of the pore network is defined by the relation between node number M within a sphere and the radius r of the sphere,M=rd.The results show that both brine and Maxwellian fluid's permeability maintain a stable value at low frequency, then decreases with fluctuating peaks. The dynamic permeability in pore networks saturated by Maxwellian fluid (CPyCl/NaSal (60 mM)) show larger peaks during the decline process at high frequency, which represents the typical resonance behavior. Dynamic permeability shows clear dependence on the dimension of the fractal network. Small-scale network has higher dimension than large-scale networks. The reason is that in larger networks pore and inter-pore connections are so dense that the probability P(r) to have a neighboring pore at distance r decays faster. The proposed model may be used to explain velocity dispersion in unconventional reservoir rocks observed in laboratory.

Slow synaptic dynamics in a network: From exponential to power-law forgetting

NASA Astrophysics Data System (ADS)

Luck, J. M.; Mehta, A.

2014-09-01

We investigate a mean-field model of interacting synapses on a directed neural network. Our interest lies in the slow adaptive dynamics of synapses, which are driven by the fast dynamics of the neurons they connect. Cooperation is modeled from the usual Hebbian perspective, while competition is modeled by an original polarity-driven rule. The emergence of a critical manifold culminating in a tricritical point is crucially dependent on the presence of synaptic competition. This leads to a universal 1/t power-law relaxation of the mean synaptic strength along the critical manifold and an equally universal 1/√t relaxation at the tricritical point, to be contrasted with the exponential relaxation that is otherwise generic. In turn, this leads to the natural emergence of long- and short-term memory from different parts of parameter space in a synaptic network, which is the most original and important result of our present investigations.