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.

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.

Dynamics analysis of SIR epidemic model with correlation coefficients and clustering coefficient in networks.

PubMed

Zhang, Juping; Yang, Chan; Jin, Zhen; Li, Jia

2018-07-14

In this paper, the correlation coefficients between nodes in states are used as dynamic variables, and we construct SIR epidemic dynamic models with correlation coefficients by using the pair approximation method in static networks and dynamic networks, respectively. Considering the clustering coefficient of the network, we analytically investigate the existence and the local asymptotic stability of each equilibrium of these models and derive threshold values for the prevalence of diseases. Additionally, we obtain two equivalent epidemic thresholds in dynamic networks, which are compared with the results of the mean field equations. Copyright © 2018 Elsevier Ltd. All rights reserved.

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…

Visibility graph analysis on heartbeat dynamics of meditation training

NASA Astrophysics Data System (ADS)

Jiang, Sen; Bian, Chunhua; Ning, Xinbao; Ma, Qianli D. Y.

2013-06-01

We apply the visibility graph analysis to human heartbeat dynamics by constructing the complex networks of heartbeat interval time series and investigating the statistical properties of the network before and during chi and yoga meditation. The experiment results show that visibility graph analysis can reveal the dynamical changes caused by meditation training manifested as regular heartbeat, which is closely related to the adjustment of autonomous neural system, and visibility graph analysis is effective to evaluate the effect of meditation.

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 recurrence network approach for the analysis of skin blood flow dynamics in response to loading pressure.

PubMed

Liao, Fuyuan; Jan, Yih-Kuen

2012-06-01

This paper presents a recurrence network approach for the analysis of skin blood flow dynamics in response to loading pressure. Recurrence is a fundamental property of many dynamical systems, which can be explored in phase spaces constructed from observational time series. A visualization tool of recurrence analysis called recurrence plot (RP) has been proved to be highly effective to detect transitions in the dynamics of the system. However, it was found that delay embedding can produce spurious structures in RPs. Network-based concepts have been applied for the analysis of nonlinear time series recently. We demonstrate that time series with different types of dynamics exhibit distinct global clustering coefficients and distributions of local clustering coefficients and that the global clustering coefficient is robust to the embedding parameters. We applied the approach to study skin blood flow oscillations (BFO) response to loading pressure. The results showed that global clustering coefficients of BFO significantly decreased in response to loading pressure (p<0.01). Moreover, surrogate tests indicated that such a decrease was associated with a loss of nonlinearity of BFO. Our results suggest that the recurrence network approach can practically quantify the nonlinear dynamics of BFO.

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

Dynamic Graph Analytic Framework (DYGRAF): greater situation awareness through layered multi-modal network analysis

NASA Astrophysics Data System (ADS)

Margitus, Michael R.; Tagliaferri, William A., Jr.; Sudit, Moises; LaMonica, Peter M.

2012-06-01

Understanding the structure and dynamics of networks are of vital importance to winning the global war on terror. To fully comprehend the network environment, analysts must be able to investigate interconnected relationships of many diverse network types simultaneously as they evolve both spatially and temporally. To remove the burden from the analyst of making mental correlations of observations and conclusions from multiple domains, we introduce the Dynamic Graph Analytic Framework (DYGRAF). DYGRAF provides the infrastructure which facilitates a layered multi-modal network analysis (LMMNA) approach that enables analysts to assemble previously disconnected, yet related, networks in a common battle space picture. In doing so, DYGRAF provides the analyst with timely situation awareness, understanding and anticipation of threats, and support for effective decision-making in diverse environments.

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.

Hamiltonian dynamics for complex food webs

NASA Astrophysics Data System (ADS)

Kozlov, Vladimir; Vakulenko, Sergey; Wennergren, Uno

2016-03-01

We investigate stability and dynamics of large ecological networks by introducing classical methods of dynamical system theory from physics, including Hamiltonian and averaging methods. Our analysis exploits the topological structure of the network, namely the existence of strongly connected nodes (hubs) in the networks. We reveal new relations between topology, interaction structure, and network dynamics. We describe mechanisms of catastrophic phenomena leading to sharp changes of dynamics and hence completely altering the ecosystem. We also show how these phenomena depend on the structure of interaction between species. We can conclude that a Hamiltonian structure of biological interactions leads to stability and large biodiversity.

Individual Differences in Dynamic Functional Brain Connectivity across the Human Lifespan.

PubMed

Davison, Elizabeth N; Turner, Benjamin O; Schlesinger, Kimberly J; Miller, Michael B; Grafton, Scott T; Bassett, Danielle S; Carlson, Jean M

2016-11-01

Individual differences in brain functional networks may be related to complex personal identifiers, including health, age, and ability. Dynamic network theory has been used to identify properties of dynamic brain function from fMRI data, but the majority of analyses and findings remain at the level of the group. Here, we apply hypergraph analysis, a method from dynamic network theory, to quantify individual differences in brain functional dynamics. Using a summary metric derived from the hypergraph formalism-hypergraph cardinality-we investigate individual variations in two separate, complementary data sets. The first data set ("multi-task") consists of 77 individuals engaging in four consecutive cognitive tasks. We observe that hypergraph cardinality exhibits variation across individuals while remaining consistent within individuals between tasks; moreover, the analysis of one of the memory tasks revealed a marginally significant correspondence between hypergraph cardinality and age. This finding motivated a similar analysis of the second data set ("age-memory"), in which 95 individuals, aged 18-75, performed a memory task with a similar structure to the multi-task memory task. With the increased age range in the age-memory data set, the correlation between hypergraph cardinality and age correspondence becomes significant. We discuss these results in the context of the well-known finding linking age with network structure, and suggest that hypergraph analysis should serve as a useful tool in furthering our understanding of the dynamic network structure of the brain.

Similar but Different: Dynamic Social Network Analysis Highlights Fundamental Differences between the Fission-Fusion Societies of Two Equid Species, the Onager and Grevy’s Zebra

PubMed Central

Rubenstein, Daniel I.; Sundaresan, Siva R.; Fischhoff, Ilya R.; Tantipathananandh, Chayant; Berger-Wolf, Tanya Y.

2015-01-01

Understanding why animal societies take on the form that they do has benefited from insights gained by applying social network analysis to patterns of individual associations. Such analyses typically aggregate data over long time periods even though most selective forces that shape sociality have strong temporal elements. By explicitly incorporating the temporal signal in social interaction data we re-examine the network dynamics of the social systems of the evolutionarily closely-related Grevy’s zebras and wild asses that show broadly similar social organizations. By identifying dynamic communities, previously hidden differences emerge: Grevy’s zebras show more modularity than wild asses and in wild asses most communities consist of solitary individuals; and in Grevy’s zebras, lactating females show a greater propensity to switch communities than non-lactating females and males. Both patterns were missed by static network analyses and in general, adding a temporal dimension provides insights into differences associated with the size and persistence of communities as well as the frequency and synchrony of their formation. Dynamic network analysis provides insights into the functional significance of these social differences and highlights the way dynamic community analysis can be applied to other species. PMID:26488598

A nanobiosensor for dynamic single cell analysis during microvascular self-organization.

PubMed

Wang, S; Sun, J; Zhang, D D; Wong, P K

2016-10-14

The formation of microvascular networks plays essential roles in regenerative medicine and tissue engineering. Nevertheless, the self-organization mechanisms underlying the dynamic morphogenic process are poorly understood due to a paucity of effective tools for mapping the spatiotemporal dynamics of single cell behaviors. By establishing a single cell nanobiosensor along with live cell imaging, we perform dynamic single cell analysis of the morphology, displacement, and gene expression during microvascular self-organization. Dynamic single cell analysis reveals that endothelial cells self-organize into subpopulations with specialized phenotypes to form microvascular networks and identifies the involvement of Notch1-Dll4 signaling in regulating the cell subpopulations. The cell phenotype correlates with the initial Dll4 mRNA expression level and each subpopulation displays a unique dynamic Dll4 mRNA expression profile. Pharmacological perturbations and RNA interference of Notch1-Dll4 signaling modulate the cell subpopulations and modify the morphology of the microvascular network. Taken together, a nanobiosensor enables a dynamic single cell analysis approach underscoring the importance of Notch1-Dll4 signaling in microvascular self-organization.

Dynamic Evolution Model Based on Social Network Services

NASA Astrophysics Data System (ADS)

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

2013-11-01

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

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

Psychology and social networks: a dynamic network theory perspective.

PubMed

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

2014-04-01

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

Detailed analysis of routing protocols with different network limitations

NASA Astrophysics Data System (ADS)

Masood, Mohsin; Abuhelala, Mohamed; Glesk, Ivan

2016-12-01

In network communication field, routing protocols have got a significant role which are not only used in networks to handle the user data but also to monitor the different network environments. Dynamic routing protocols such as OSPF, EIGRP and RIP are used for forwarding user data to its destination by instantly detecting the dynamic changes across the network. The dynamic changes in the network can be in the form of topological changes, congestions, links failure etc. Therefore, it becomes a challenge to develop and implement dynamic routing protocols that fulfills the network requirements. Hence, each routing protocol has its own characteristics such as convergence activity, routing metric, routing table etc. and will perform differently in various network environments. This paper presents a comprehensive study of static and dynamic routing, along with dynamic routing protocols. Experiments that are conducted under various network limitations are presented using the OPNET tool. The performance of each of dynamic routing protocols are monitored and explained in the form of simulated results using network parameters. The results are analyzed, in order to provide a clear understanding of each protocol performance for the selection of the proper protocol for a given network environment.

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

CollaborationViz: Interactive Visual Exploration of Biomedical Research Collaboration Networks

PubMed Central

Bian, Jiang; Xie, Mengjun; Hudson, Teresa J.; Eswaran, Hari; Brochhausen, Mathias; Hanna, Josh; Hogan, William R.

2014-01-01

Social network analysis (SNA) helps us understand patterns of interaction between social entities. A number of SNA studies have shed light on the characteristics of research collaboration networks (RCNs). Especially, in the Clinical Translational Science Award (CTSA) community, SNA provides us a set of effective tools to quantitatively assess research collaborations and the impact of CTSA. However, descriptive network statistics are difficult for non-experts to understand. In this article, we present our experiences of building meaningful network visualizations to facilitate a series of visual analysis tasks. The basis of our design is multidimensional, visual aggregation of network dynamics. The resulting visualizations can help uncover hidden structures in the networks, elicit new observations of the network dynamics, compare different investigators and investigator groups, determine critical factors to the network evolution, and help direct further analyses. We applied our visualization techniques to explore the biomedical RCNs at the University of Arkansas for Medical Sciences – a CTSA institution. And, we created CollaborationViz, an open-source visual analytical tool to help network researchers and administration apprehend the network dynamics of research collaborations through interactive visualization. PMID:25405477

Individual Differences in Dynamic Functional Brain Connectivity across the Human Lifespan

PubMed Central

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

2016-01-01

Individual differences in brain functional networks may be related to complex personal identifiers, including health, age, and ability. Dynamic network theory has been used to identify properties of dynamic brain function from fMRI data, but the majority of analyses and findings remain at the level of the group. Here, we apply hypergraph analysis, a method from dynamic network theory, to quantify individual differences in brain functional dynamics. Using a summary metric derived from the hypergraph formalism—hypergraph cardinality—we investigate individual variations in two separate, complementary data sets. The first data set (“multi-task”) consists of 77 individuals engaging in four consecutive cognitive tasks. We observe that hypergraph cardinality exhibits variation across individuals while remaining consistent within individuals between tasks; moreover, the analysis of one of the memory tasks revealed a marginally significant correspondence between hypergraph cardinality and age. This finding motivated a similar analysis of the second data set (“age-memory”), in which 95 individuals, aged 18–75, performed a memory task with a similar structure to the multi-task memory task. With the increased age range in the age-memory data set, the correlation between hypergraph cardinality and age correspondence becomes significant. We discuss these results in the context of the well-known finding linking age with network structure, and suggest that hypergraph analysis should serve as a useful tool in furthering our understanding of the dynamic network structure of the brain. PMID:27880785

Reconstruction of network topology using status-time-series data

NASA Astrophysics Data System (ADS)

Pandey, Pradumn Kumar; Badarla, Venkataramana

2018-01-01

Uncovering the heterogeneous connection pattern of a networked system from the available status-time-series (STS) data of a dynamical process on the network is of great interest in network science and known as a reverse engineering problem. Dynamical processes on a network are affected by the structure of the network. The dependency between the diffusion dynamics and structure of the network can be utilized to retrieve the connection pattern from the diffusion data. Information of the network structure can help to devise the control of dynamics on the network. In this paper, we consider the problem of network reconstruction from the available status-time-series (STS) data using matrix analysis. The proposed method of network reconstruction from the STS data is tested successfully under susceptible-infected-susceptible (SIS) diffusion dynamics on real-world and computer-generated benchmark networks. High accuracy and efficiency of the proposed reconstruction procedure from the status-time-series data define the novelty of the method. Our proposed method outperforms compressed sensing theory (CST) based method of network reconstruction using STS data. Further, the same procedure of network reconstruction is applied to the weighted networks. The ordering of the edges in the weighted networks is identified with high accuracy.

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…

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.

Network approach towards understanding the crazing in glassy amorphous polymers

NASA Astrophysics Data System (ADS)

Venkatesan, Sudarkodi; Vivek-Ananth, R. P.; Sreejith, R. P.; Mangalapandi, Pattulingam; Hassanali, Ali A.; Samal, Areejit

2018-04-01

We have used molecular dynamics to simulate an amorphous glassy polymer with long chains to study the deformation mechanism of crazing and associated void statistics. The Van der Waals interactions and the entanglements between chains constituting the polymer play a crucial role in crazing. Thus, we have reconstructed two underlying weighted networks, namely, the Van der Waals network and the entanglement network from polymer configurations extracted from the molecular dynamics simulation. Subsequently, we have performed graph-theoretic analysis of the two reconstructed networks to reveal the role played by them in the crazing of polymers. Our analysis captured various stages of crazing through specific trends in the network measures for Van der Waals networks and entanglement networks. To further corroborate the effectiveness of network analysis in unraveling the underlying physics of crazing in polymers, we have contrasted the trends in network measures for Van der Waals networks and entanglement networks in the light of stress-strain behaviour and voids statistics during deformation. We find that the Van der Waals network plays a crucial role in craze initiation and growth. Although, the entanglement network was found to maintain its structure during craze initiation stage, it was found to progressively weaken and undergo dynamic changes during the hardening and failure stages of crazing phenomena. Our work demonstrates the utility of network theory in quantifying the underlying physics of polymer crazing and widens the scope of applications of network science to characterization of deformation mechanisms in diverse polymers.

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

PubMed

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

2016-12-01

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

NetFlow Dynamics

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

Corbet Jr., Thomas F; Beyeler, Walter E; Vanwestrienen, Dirk

NetFlow Dynamics is a web-accessible analysis environment for simulating dynamic flows of materials on model networks. Performing a simulation requires both the NetFlow Dynamics application and a network model which is a description of the structure of the nodes and edges of a network including the flow capacity of each edge and the storage capacity of each node, and the sources and sinks of the material flowing on the network. NetFlow Dynamics consists of databases for storing network models, algorithms to calculate flows on networks, and a GIS-based graphical interface for performing simulations and viewing simulation results. Simulated flows aremore » dynamic in the sense that flows on each edge of the network and inventories at each node change with time and can be out of equilibrium with boundary conditions. Any number of network models could be simulated using Net Flow Dynamics. To date, the models simulated have been models of petroleum infrastructure. The main model has been the National Transportation Fuels Model (NTFM), a network of U.S. oil fields, transmission pipelines, rail lines, refineries, tank farms, and distribution terminals. NetFlow Dynamics supports two different flow algorithms, the Gradient Flow algorithm and the Inventory Control algorithm, that were developed specifically for the NetFlow Dynamics application. The intent is to add additional algorithms in the future as needed. The ability to select from multiple algorithms is desirable because a single algorithm never covers all analysis needs. The current algorithms use a demand-driven capacity-constrained formulation which means that the algorithms strive to use all available capacity and stored inventory to meet desired flows to sinks, subject to the capacity constraints of each network component. The current flow algorithms are best suited for problems in which a material flows on a capacity-constrained network representing a supply chain in which the material supplied can be stored at each node of the network. In the petroleum models, the flowing materials are crude oil and refined products that can be stored at tank farms, refineries, or terminals (i.e. the nodes of the network). Examples of other network models that could be simulated are currency flowing in a financial network, agricultural products moving to market, or natural gas flowing on a pipeline network.« less

Complex network description of the ionosphere

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

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.

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.

Principal network analysis: identification of subnetworks representing major dynamics using gene expression data

PubMed Central

Kim, Yongsoo; Kim, Taek-Kyun; Kim, Yungu; Yoo, Jiho; You, Sungyong; Lee, Inyoul; Carlson, George; Hood, Leroy; Choi, Seungjin; Hwang, Daehee

2011-01-01

Motivation: Systems biology attempts to describe complex systems behaviors in terms of dynamic operations of biological networks. However, there is lack of tools that can effectively decode complex network dynamics over multiple conditions. Results: We present principal network analysis (PNA) that can automatically capture major dynamic activation patterns over multiple conditions and then generate protein and metabolic subnetworks for the captured patterns. We first demonstrated the utility of this method by applying it to a synthetic dataset. The results showed that PNA correctly captured the subnetworks representing dynamics in the data. We further applied PNA to two time-course gene expression profiles collected from (i) MCF7 cells after treatments of HRG at multiple doses and (ii) brain samples of four strains of mice infected with two prion strains. The resulting subnetworks and their interactions revealed network dynamics associated with HRG dose-dependent regulation of cell proliferation and differentiation and early PrPSc accumulation during prion infection. Availability: The web-based software is available at: http://sbm.postech.ac.kr/pna. Contact: dhhwang@postech.ac.kr; seungjin@postech.ac.kr Supplementary information: Supplementary data are available at Bioinformatics online. PMID:21193522

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

The signaling petri net-based simulator: a non-parametric strategy for characterizing the dynamics of cell-specific signaling networks.

PubMed

Ruths, Derek; Muller, Melissa; Tseng, Jen-Te; Nakhleh, Luay; Ram, Prahlad T

2008-02-29

Reconstructing cellular signaling networks and understanding how they work are major endeavors in cell biology. The scale and complexity of these networks, however, render their analysis using experimental biology approaches alone very challenging. As a result, computational methods have been developed and combined with experimental biology approaches, producing powerful tools for the analysis of these networks. These computational methods mostly fall on either end of a spectrum of model parameterization. On one end is a class of structural network analysis methods; these typically use the network connectivity alone to generate hypotheses about global properties. On the other end is a class of dynamic network analysis methods; these use, in addition to the connectivity, kinetic parameters of the biochemical reactions to predict the network's dynamic behavior. These predictions provide detailed insights into the properties that determine aspects of the network's structure and behavior. However, the difficulty of obtaining numerical values of kinetic parameters is widely recognized to limit the applicability of this latter class of methods. Several researchers have observed that the connectivity of a network alone can provide significant insights into its dynamics. Motivated by this fundamental observation, we present the signaling Petri net, a non-parametric model of cellular signaling networks, and the signaling Petri net-based simulator, a Petri net execution strategy for characterizing the dynamics of signal flow through a signaling network using token distribution and sampling. The result is a very fast method, which can analyze large-scale networks, and provide insights into the trends of molecules' activity-levels in response to an external stimulus, based solely on the network's connectivity. We have implemented the signaling Petri net-based simulator in the PathwayOracle toolkit, which is publicly available at http://bioinfo.cs.rice.edu/pathwayoracle. Using this method, we studied a MAPK1,2 and AKT signaling network downstream from EGFR in two breast tumor cell lines. We analyzed, both experimentally and computationally, the activity level of several molecules in response to a targeted manipulation of TSC2 and mTOR-Raptor. The results from our method agreed with experimental results in greater than 90% of the cases considered, and in those where they did not agree, our approach provided valuable insights into discrepancies between known network connectivities and experimental observations.

The Signaling Petri Net-Based Simulator: A Non-Parametric Strategy for Characterizing the Dynamics of Cell-Specific Signaling Networks

PubMed Central

Ruths, Derek; Muller, Melissa; Tseng, Jen-Te; Nakhleh, Luay; Ram, Prahlad T.

2008-01-01

Reconstructing cellular signaling networks and understanding how they work are major endeavors in cell biology. The scale and complexity of these networks, however, render their analysis using experimental biology approaches alone very challenging. As a result, computational methods have been developed and combined with experimental biology approaches, producing powerful tools for the analysis of these networks. These computational methods mostly fall on either end of a spectrum of model parameterization. On one end is a class of structural network analysis methods; these typically use the network connectivity alone to generate hypotheses about global properties. On the other end is a class of dynamic network analysis methods; these use, in addition to the connectivity, kinetic parameters of the biochemical reactions to predict the network's dynamic behavior. These predictions provide detailed insights into the properties that determine aspects of the network's structure and behavior. However, the difficulty of obtaining numerical values of kinetic parameters is widely recognized to limit the applicability of this latter class of methods. Several researchers have observed that the connectivity of a network alone can provide significant insights into its dynamics. Motivated by this fundamental observation, we present the signaling Petri net, a non-parametric model of cellular signaling networks, and the signaling Petri net-based simulator, a Petri net execution strategy for characterizing the dynamics of signal flow through a signaling network using token distribution and sampling. The result is a very fast method, which can analyze large-scale networks, and provide insights into the trends of molecules' activity-levels in response to an external stimulus, based solely on the network's connectivity. We have implemented the signaling Petri net-based simulator in the PathwayOracle toolkit, which is publicly available at http://bioinfo.cs.rice.edu/pathwayoracle. Using this method, we studied a MAPK1,2 and AKT signaling network downstream from EGFR in two breast tumor cell lines. We analyzed, both experimentally and computationally, the activity level of several molecules in response to a targeted manipulation of TSC2 and mTOR-Raptor. The results from our method agreed with experimental results in greater than 90% of the cases considered, and in those where they did not agree, our approach provided valuable insights into discrepancies between known network connectivities and experimental observations. PMID:18463702

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

Mean-field equations for neuronal networks with arbitrary degree distributions.

PubMed

Nykamp, Duane Q; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Mean-field equations for neuronal networks with arbitrary degree distributions

NASA Astrophysics Data System (ADS)

Nykamp, Duane Q.; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Design and implementation of dynamic hybrid Honeypot network

NASA Astrophysics Data System (ADS)

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

2013-05-01

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

Petri net-based method for the analysis of the dynamics of signal propagation in signaling pathways.

PubMed

Hardy, Simon; Robillard, Pierre N

2008-01-15

Cellular signaling networks are dynamic systems that propagate and process information, and, ultimately, cause phenotypical responses. Understanding the circuitry of the information flow in cells is one of the keys to understanding complex cellular processes. The development of computational quantitative models is a promising avenue for attaining this goal. Not only does the analysis of the simulation data based on the concentration variations of biological compounds yields information about systemic state changes, but it is also very helpful for obtaining information about the dynamics of signal propagation. This article introduces a new method for analyzing the dynamics of signal propagation in signaling pathways using Petri net theory. The method is demonstrated with the Ca(2+)/calmodulin-dependent protein kinase II (CaMKII) regulation network. The results constitute temporal information about signal propagation in the network, a simplified graphical representation of the network and of the signal propagation dynamics and a characterization of some signaling routes as regulation motifs.

A mathematical analysis of the effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks.

PubMed

Siri, Benoît; Berry, Hugues; Cessac, Bruno; Delord, Bruno; Quoy, Mathias

2008-12-01

We present a mathematical analysis of the effects of Hebbian learning in random recurrent neural networks, with a generic Hebbian learning rule, including passive forgetting and different timescales, for neuronal activity and learning dynamics. Previous numerical work has reported that Hebbian learning drives the system from chaos to a steady state through a sequence of bifurcations. Here, we interpret these results mathematically and show that these effects, involving a complex coupling between neuronal dynamics and synaptic graph structure, can be analyzed using Jacobian matrices, which introduce both a structural and a dynamical point of view on neural network evolution. Furthermore, we show that sensitivity to a learned pattern is maximal when the largest Lyapunov exponent is close to 0. We discuss how neural networks may take advantage of this regime of high functional interest.

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.

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.

Static, Dynamic and Semantic Dimensions: Towards a Multidisciplinary Approach of Social Networks Analysis

NASA Astrophysics Data System (ADS)

Thovex, Christophe; Trichet, Francky

The objective of our work is to extend static and dynamic models of Social Networks Analysis (SNA), by taking conceptual aspects of enterprises and institutions social graph into account. The originality of our multidisciplinary work is to introduce abstract notions of electro-physic to define new measures in SNA, for new decision-making functions dedicated to Human Resource Management (HRM). This paper introduces a multidimensional system and new measures: (1) a tension measure for social network analysis, (2) an electrodynamic, predictive and semantic system for recommendations on social graphs evolutions and (3) a reactance measure used to evaluate the individual stress at work of the members of a social network.

Connectivity, excitability and activity patterns in neuronal networks

NASA Astrophysics Data System (ADS)

le Feber, Joost; Stoyanova, Irina I.; Chiappalone, Michela

2014-06-01

Extremely synchronized firing patterns such as those observed in brain diseases like epilepsy may result from excessive network excitability. Although network excitability is closely related to (excitatory) connectivity, a direct measure for network excitability remains unavailable. Several methods currently exist for estimating network connectivity, most of which are related to cross-correlation. An example is the conditional firing probability (CFP) analysis which calculates the pairwise probability (CFPi,j) that electrode j records an action potential at time t = τ, given that electrode i recorded a spike at t = 0. However, electrode i often records multiple spikes within the analysis interval, and CFP values are biased by the on-going dynamic state of the network. Here we show that in a linear approximation this bias may be removed by deconvoluting CFPi,j with the autocorrelation of i (i.e. CFPi,i), to obtain the single pulse response (SPRi,j)—the average response at electrode j to a single spike at electrode i. Thus, in a linear system SPRs would be independent of the dynamic network state. Nonlinear components of synaptic transmission, such as facilitation and short term depression, will however still affect SPRs. Therefore SPRs provide a clean measure of network excitability. We used carbachol and ghrelin to moderately activate cultured cortical networks to affect their dynamic state. Both neuromodulators transformed the bursting firing patterns of the isolated networks into more dispersed firing. We show that the influence of the dynamic state on SPRs is much smaller than the effect on CFPs, but not zero. The remaining difference reflects the alteration in network excitability. We conclude that SPRs are less contaminated by the dynamic network state and that mild excitation may decrease network excitability, possibly through short term synaptic depression.

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.

Coupled protein-ligand dynamics in truncated hemoglobin N from atomistic simulations and transition networks.

PubMed

Cazade, Pierre-André; Berezovska, Ganna; Meuwly, Markus

2015-05-01

The nature of ligand motion in proteins is difficult to characterize directly using experiment. Specifically, it is unclear to what degree these motions are coupled. All-atom simulations are used to sample ligand motion in truncated Hemoglobin N. A transition network analysis including ligand- and protein-degrees of freedom is used to analyze the microscopic dynamics. Clustering of two different subsets of MD trajectories highlights the importance of a diverse and exhaustive description to define the macrostates for a ligand-migration network. Monte Carlo simulations on the transition matrices from one particular clustering are able to faithfully capture the atomistic simulations. Contrary to clustering by ligand positions only, including a protein degree of freedom yields considerably improved coarse grained dynamics. Analysis with and without imposing detailed balance agree closely which suggests that the underlying atomistic simulations are converged with respect to sampling transitions between neighboring sites. Protein and ligand dynamics are not independent from each other and ligand migration through globular proteins is not passive diffusion. Transition network analysis is a powerful tool to analyze and characterize the microscopic dynamics in complex systems. This article is part of a Special Issue entitled Recent developments of molecular dynamics. Copyright © 2014 Elsevier B.V. All rights reserved.

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.

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.

A Method for Predicting Protein Complexes from Dynamic Weighted Protein-Protein Interaction Networks.

PubMed

Liu, Lizhen; Sun, Xiaowu; Song, Wei; Du, Chao

2018-06-01

Predicting protein complexes from protein-protein interaction (PPI) network is of great significance to recognize the structure and function of cells. A protein may interact with different proteins under different time or conditions. Existing approaches only utilize static PPI network data that may lose much temporal biological information. First, this article proposed a novel method that combines gene expression data at different time points with traditional static PPI network to construct different dynamic subnetworks. Second, to further filter out the data noise, the semantic similarity based on gene ontology is regarded as the network weight together with the principal component analysis, which is introduced to deal with the weight computing by three traditional methods. Third, after building a dynamic PPI network, a predicting protein complexes algorithm based on "core-attachment" structural feature is applied to detect complexes from each dynamic subnetworks. Finally, it is revealed from the experimental results that our method proposed in this article performs well on detecting protein complexes from dynamic weighted PPI networks.

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

PubMed Central

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

2017-01-01

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

Exploring Peer Relationships, Friendships and Group Work Dynamics in Higher Education: Applying Social Network Analysis

ERIC Educational Resources Information Center

Mamas, Christoforos

2018-01-01

This study primarily applied social network analysis (SNA) to explore the relationship between friendships, peer social interactions and group work dynamics within a higher education undergraduate programme in England. A critical case study design was adopted so as to allow for an in-depth exploration of the students' voice. In doing so, the views…

Thermostability of In Vitro Evolved Bacillus subtilis Lipase A: A Network and Dynamics Perspective

PubMed Central

Srivastava, Ashutosh; Sinha, Somdatta

2014-01-01

Proteins in thermophilic organisms remain stable and function optimally at high temperatures. Owing to their important applicability in many industrial processes, such thermostable proteins have been studied extensively, and several structural factors attributed to their enhanced stability. How these factors render the emergent property of thermostability to proteins, even in situations where no significant changes occur in their three-dimensional structures in comparison to their mesophilic counter-parts, has remained an intriguing question. In this study we treat Lipase A from Bacillus subtilis and its six thermostable mutants in a unified manner and address the problem with a combined complex network-based analysis and molecular dynamic studies to find commonality in their properties. The Protein Contact Networks (PCN) of the wild-type and six mutant Lipase A structures developed at a mesoscopic scale were analyzed at global network and local node (residue) level using network parameters and community structure analysis. The comparative PCN analysis of all proteins pointed towards important role of specific residues in the enhanced thermostability. Network analysis results were corroborated with finer-scale molecular dynamics simulations at both room and high temperatures. Our results show that this combined approach at two scales can uncover small but important changes in the local conformations that add up to stabilize the protein structure in thermostable mutants, even when overall conformation differences among them are negligible. Our analysis not only supports the experimentally determined stabilizing factors, but also unveils the important role of contacts, distributed throughout the protein, that lead to thermostability. We propose that this combined mesoscopic-network and fine-grained molecular dynamics approach is a convenient and useful scheme not only to study allosteric changes leading to protein stability in the face of negligible over-all conformational changes due to mutations, but also in other molecular networks where change in function does not accompany significant change in the network structure. PMID:25122499

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.

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

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

NASA Astrophysics Data System (ADS)

Wang, Ting; Plecháč, Petr

2017-12-01

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.

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.

Chaotic itinerancy within the coupled dynamics between a physical body and neural oscillator networks.

PubMed

Park, Jihoon; Mori, Hiroki; Okuyama, Yuji; Asada, Minoru

2017-01-01

Chaotic itinerancy is a phenomenon in which the state of a nonlinear dynamical system spontaneously explores and attracts certain states in a state space. From this perspective, the diverse behavior of animals and its spontaneous transitions lead to a complex coupled dynamical system, including a physical body and a brain. Herein, a series of simulations using different types of non-linear oscillator networks (i.e., regular, small-world, scale-free, random) with a musculoskeletal model (i.e., a snake-like robot) as a physical body are conducted to understand how the chaotic itinerancy of bodily behavior emerges from the coupled dynamics between the body and the brain. A behavior analysis (behavior clustering) and network analysis for the classified behavior are then applied. The former consists of feature vector extraction from the motions and classification of the movement patterns that emerged from the coupled dynamics. The network structures behind the classified movement patterns are revealed by estimating the "information networks" different from the given non-linear oscillator networks based on the transfer entropy which finds the information flow among neurons. The experimental results show that: (1) the number of movement patterns and their duration depend on the sensor ratio to control the balance of strength between the body and the brain dynamics and on the type of the given non-linear oscillator networks; and (2) two kinds of information networks are found behind two kinds movement patterns with different durations by utilizing the complex network measures, clustering coefficient and the shortest path length with a negative and a positive relationship with the duration periods of movement patterns. The current results seem promising for a future extension of the method to a more complicated body and environment. Several requirements are also discussed.

Charge transport network dynamics in molecular aggregates

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

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

2016-07-20

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

Principles of Biomimetic Vascular Network Design Applied to a Tissue-Engineered Liver Scaffold

PubMed Central

Hoganson, David M.; Pryor, Howard I.; Spool, Ira D.; Burns, Owen H.; Gilmore, J. Randall

2010-01-01

Branched vascular networks are a central component of scaffold architecture for solid organ tissue engineering. In this work, seven biomimetic principles were established as the major guiding technical design considerations of a branched vascular network for a tissue-engineered scaffold. These biomimetic design principles were applied to a branched radial architecture to develop a liver-specific vascular network. Iterative design changes and computational fluid dynamic analysis were used to optimize the network before mold manufacturing. The vascular network mold was created using a new mold technique that achieves a 1:1 aspect ratio for all channels. In vitro blood flow testing confirmed the physiologic hemodynamics of the network as predicted by computational fluid dynamic analysis. These results indicate that this biomimetic liver vascular network design will provide a foundation for developing complex vascular networks for solid organ tissue engineering that achieve physiologic blood flow. PMID:20001254

Principles of biomimetic vascular network design applied to a tissue-engineered liver scaffold.

PubMed

Hoganson, David M; Pryor, Howard I; Spool, Ira D; Burns, Owen H; Gilmore, J Randall; Vacanti, Joseph P

2010-05-01

Branched vascular networks are a central component of scaffold architecture for solid organ tissue engineering. In this work, seven biomimetic principles were established as the major guiding technical design considerations of a branched vascular network for a tissue-engineered scaffold. These biomimetic design principles were applied to a branched radial architecture to develop a liver-specific vascular network. Iterative design changes and computational fluid dynamic analysis were used to optimize the network before mold manufacturing. The vascular network mold was created using a new mold technique that achieves a 1:1 aspect ratio for all channels. In vitro blood flow testing confirmed the physiologic hemodynamics of the network as predicted by computational fluid dynamic analysis. These results indicate that this biomimetic liver vascular network design will provide a foundation for developing complex vascular networks for solid organ tissue engineering that achieve physiologic blood flow.

Analysis of continuous-time switching networks

NASA Astrophysics Data System (ADS)

Edwards, R.

2000-11-01

Models of a number of biological systems, including gene regulation and neural networks, can be formulated as switching networks, in which the interactions between the variables depend strongly on thresholds. An idealized class of such networks in which the switching takes the form of Heaviside step functions but variables still change continuously in time has been proposed as a useful simplification to gain analytic insight. These networks, called here Glass networks after their originator, are simple enough mathematically to allow significant analysis without restricting the range of dynamics found in analogous smooth systems. A number of results have been obtained before, particularly regarding existence and stability of periodic orbits in such networks, but important cases were not considered. Here we present a coherent method of analysis that summarizes previous work and fills in some of the gaps as well as including some new results. Furthermore, we apply this analysis to a number of examples, including surprising long and complex limit cycles involving sequences of hundreds of threshold transitions. Finally, we show how the above methods can be extended to investigate aperiodic behaviour in specific networks, though a complete analysis will have to await new results in matrix theory and symbolic dynamics.

Establishing a Dynamic Self-Adaptation Learning Algorithm of the BP Neural Network and Its Applications

NASA Astrophysics Data System (ADS)

Li, Xiaofeng; Xiang, Suying; Zhu, Pengfei; Wu, Min

2015-12-01

In order to avoid the inherent deficiencies of the traditional BP neural network, such as slow convergence speed, that easily leading to local minima, poor generalization ability and difficulty in determining the network structure, the dynamic self-adaptive learning algorithm of the BP neural network is put forward to improve the function of the BP neural network. The new algorithm combines the merit of principal component analysis, particle swarm optimization, correlation analysis and self-adaptive model, hence can effectively solve the problems of selecting structural parameters, initial connection weights and thresholds and learning rates of the BP neural network. This new algorithm not only reduces the human intervention, optimizes the topological structures of BP neural networks and improves the network generalization ability, but also accelerates the convergence speed of a network, avoids trapping into local minima, and enhances network adaptation ability and prediction ability. The dynamic self-adaptive learning algorithm of the BP neural network is used to forecast the total retail sale of consumer goods of Sichuan Province, China. Empirical results indicate that the new algorithm is superior to the traditional BP network algorithm in predicting accuracy and time consumption, which shows the feasibility and effectiveness of the new algorithm.

Impact analysis of two kinds of failure strategies in Beijing road transportation network

NASA Astrophysics Data System (ADS)

Zhang, Zundong; Xu, Xiaoyang; Zhang, Zhaoran; Zhou, Huijuan

The Beijing road transportation network (BRTN), as a large-scale technological network, exhibits very complex and complicate features during daily periods. And it has been widely highlighted that how statistical characteristics (i.e. average path length and global network efficiency) change while the network evolves. In this paper, by using different modeling concepts, three kinds of network models of BRTN namely the abstract network model, the static network model with road mileage as weights and the dynamic network model with travel time as weights — are constructed, respectively, according to the topological data and the real detected flow data. The degree distribution of the three kinds of network models are analyzed, which proves that the urban road infrastructure network and the dynamic network behavior like scale-free networks. By analyzing and comparing the important statistical characteristics of three models under random attacks and intentional attacks, it shows that the urban road infrastructure network and the dynamic network of BRTN are both robust and vulnerable.

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.

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

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.

Vertical Interaction in Open Software Engineering Communities

DTIC Science & Technology

2009-03-01

Program in CASOS (NSF,DGE-9972762), the Office of Naval Research under Dynamic Network Analysis program (N00014-02-1-0973, the Air Force Office of...W91WAW07C0063) for research in the area of dynamic network analysis. Additional support was provided by CASOS - the center for Computational Analysis of Social...methods across the domain. For a given project, de - velopers can choose from dozens of models, tools, platforms, and languages for specification, design

Understanding the Dynamics of MOOC Discussion Forums with Simulation Investigation for Empirical Network Analysis (SIENA)

ERIC Educational Resources Information Center

Zhang, Jingjing; Skryabin, Maxim; Song, Xiongwei

2016-01-01

This study attempts to make inferences about the mechanisms that drive network change over time. It adopts simulation investigation for empirical network analysis to examine the patterns and evolution of relationships formed in the context of a massive open online course (MOOC) discussion forum. Four network effects--"homophily,"…

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

Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx; Campos-Cantón, I.

We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enablemore » future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.« less

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

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

PubMed

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

2012-02-01

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

Machine Learning and Network Analysis of Molecular Dynamics Trajectories Reveal Two Chains of Red/Ox-specific Residue Interactions in Human Protein Disulfide Isomerase.

PubMed

Karamzadeh, Razieh; Karimi-Jafari, Mohammad Hossein; Sharifi-Zarchi, Ali; Chitsaz, Hamidreza; Salekdeh, Ghasem Hosseini; Moosavi-Movahedi, Ali Akbar

2017-06-16

The human protein disulfide isomerase (hPDI), is an essential four-domain multifunctional enzyme. As a result of disulfide shuffling in its terminal domains, hPDI exists in two oxidation states with different conformational preferences which are important for substrate binding and functional activities. Here, we address the redox-dependent conformational dynamics of hPDI through molecular dynamics (MD) simulations. Collective domain motions are identified by the principal component analysis of MD trajectories and redox-dependent opening-closing structure variations are highlighted on projected free energy landscapes. Then, important structural features that exhibit considerable differences in dynamics of redox states are extracted by statistical machine learning methods. Mapping the structural variations to time series of residue interaction networks also provides a holistic representation of the dynamical redox differences. With emphasizing on persistent long-lasting interactions, an approach is proposed that compiled these time series networks to a single dynamic residue interaction network (DRIN). Differential comparison of DRIN in oxidized and reduced states reveals chains of residue interactions that represent potential allosteric paths between catalytic and ligand binding sites of hPDI.

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.

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

NASA Astrophysics Data System (ADS)

Gan, Yu; Tang, Ming; Yang, Hanxin

2013-05-01

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

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

PubMed

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

2016-04-01

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

Discrete dynamic modeling of cellular signaling networks.

PubMed

Albert, Réka; Wang, Rui-Sheng

2009-01-01

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

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

Predicting and Detecting Emerging Cyberattack Patterns Using StreamWorks

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

Chin, George; Choudhury, Sutanay; Feo, John T.

2014-06-30

The number and sophistication of cyberattacks on industries and governments have dramatically grown in recent years. To counter this movement, new advanced tools and techniques are needed to detect cyberattacks in their early stages such that defensive actions may be taken to avert or mitigate potential damage. From a cybersecurity analysis perspective, detecting cyberattacks may be cast as a problem of identifying patterns in computer network traffic. Logically and intuitively, these patterns may take on the form of a directed graph that conveys how an attack or intrusion propagates through the computers of a network. Such cyberattack graphs could providemore » cybersecurity analysts with powerful conceptual representations that are natural to express and analyze. We have been researching and developing graph-centric approaches and algorithms for dynamic cyberattack detection. The advanced dynamic graph algorithms we are developing will be packaged into a streaming network analysis framework known as StreamWorks. With StreamWorks, a scientist or analyst may detect and identify precursor events and patterns as they emerge in complex networks. This analysis framework is intended to be used in a dynamic environment where network data is streamed in and is appended to a large-scale dynamic graph. Specific graphical query patterns are decomposed and collected into a graph query library. The individual decomposed subpatterns in the library are continuously and efficiently matched against the dynamic graph as it evolves to identify and detect early, partial subgraph patterns. The scalable emerging subgraph pattern algorithms will match on both structural and semantic network properties.« less

Chaotic itinerancy within the coupled dynamics between a physical body and neural oscillator networks

PubMed Central

Mori, Hiroki; Okuyama, Yuji; Asada, Minoru

2017-01-01

Chaotic itinerancy is a phenomenon in which the state of a nonlinear dynamical system spontaneously explores and attracts certain states in a state space. From this perspective, the diverse behavior of animals and its spontaneous transitions lead to a complex coupled dynamical system, including a physical body and a brain. Herein, a series of simulations using different types of non-linear oscillator networks (i.e., regular, small-world, scale-free, random) with a musculoskeletal model (i.e., a snake-like robot) as a physical body are conducted to understand how the chaotic itinerancy of bodily behavior emerges from the coupled dynamics between the body and the brain. A behavior analysis (behavior clustering) and network analysis for the classified behavior are then applied. The former consists of feature vector extraction from the motions and classification of the movement patterns that emerged from the coupled dynamics. The network structures behind the classified movement patterns are revealed by estimating the “information networks” different from the given non-linear oscillator networks based on the transfer entropy which finds the information flow among neurons. The experimental results show that: (1) the number of movement patterns and their duration depend on the sensor ratio to control the balance of strength between the body and the brain dynamics and on the type of the given non-linear oscillator networks; and (2) two kinds of information networks are found behind two kinds movement patterns with different durations by utilizing the complex network measures, clustering coefficient and the shortest path length with a negative and a positive relationship with the duration periods of movement patterns. The current results seem promising for a future extension of the method to a more complicated body and environment. Several requirements are also discussed. PMID:28796797

Introducing Co-Activation Pattern Metrics to Quantify Spontaneous Brain Network Dynamics

PubMed Central

Chen, Jingyuan E.; Chang, Catie; Greicius, Michael D.; Glover, Gary H.

2015-01-01

Recently, fMRI researchers have begun to realize that the brain's intrinsic network patterns may undergo substantial changes during a single resting state (RS) scan. However, despite the growing interest in brain dynamics, metrics that can quantify the variability of network patterns are still quite limited. Here, we first introduce various quantification metrics based on the extension of co-activation pattern (CAP) analysis, a recently proposed point-process analysis that tracks state alternations at each individual time frame and relies on very few assumptions; then apply these proposed metrics to quantify changes of brain dynamics during a sustained 2-back working memory (WM) task compared to rest. We focus on the functional connectivity of two prominent RS networks, the default-mode network (DMN) and executive control network (ECN). We first demonstrate less variability of global Pearson correlations with respect to the two chosen networks using a sliding-window approach during WM task compared to rest; then we show that the macroscopic decrease in variations in correlations during a WM task is also well characterized by the combined effect of a reduced number of dominant CAPs, increased spatial consistency across CAPs, and increased fractional contributions of a few dominant CAPs. These CAP metrics may provide alternative and more straightforward quantitative means of characterizing brain network dynamics than time-windowed correlation analyses. PMID:25662866

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

PubMed

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

2015-02-01

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

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.

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.

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.

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

PubMed Central

Almquist, Zack W.; Butts, Carter T.

2015-01-01

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

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

PubMed

Almquist, Zack W; Butts, Carter T

2014-08-01

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

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

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.

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

NASA Astrophysics Data System (ADS)

Katyal, Divya; Kant, Rama

2016-12-01

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

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.

Learning Networks: Iran and the Effects of Sanctions

DTIC Science & Technology

2013-03-27

synthesizes and summarizes our research efforts. 15. SUBJECT TERMS Network Science, Social Network Analysis, Dynamic Networks 16. SECURITY...www.ecssr.com/ECSSR/appmanager/portal/ecssr?_nfpb=true. Klebnikov, Paul. " Millionaire Mullahs." Forbes. Forbes Magazine, 21 July 2003. Web. http

Genomic analysis of regulatory network dynamics reveals large topological changes

NASA Astrophysics Data System (ADS)

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

2004-09-01

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

Maneuvering in the Complex Path from Genotype to Phenotype

NASA Astrophysics Data System (ADS)

Strohman, Richard

2002-04-01

Human disease phenotypes are controlled not only by genes but by lawful self-organizing networks that display system-wide dynamics. These networks range from metabolic pathways to signaling pathways that regulate hormone action. When perturbed, networks alter their output of matter and energy which, depending on the environmental context, can produce either a pathological or a normal phenotype. Study of the dynamics of these networks by approaches such as metabolic control analysis may provide new insights into the pathogenesis and treatment of complex diseases.

A portable structural analysis library for reaction networks.

PubMed

Bedaso, Yosef; Bergmann, Frank T; Choi, Kiri; Medley, Kyle; Sauro, Herbert M

2018-07-01

The topology of a reaction network can have a significant influence on the network's dynamical properties. Such influences can include constraints on network flows and concentration changes or more insidiously result in the emergence of feedback loops. These effects are due entirely to mass constraints imposed by the network configuration and are important considerations before any dynamical analysis is made. Most established simulation software tools usually carry out some kind of structural analysis of a network before any attempt is made at dynamic simulation. In this paper, we describe a portable software library, libStructural, that can carry out a variety of popular structural analyses that includes conservation analysis, flux dependency analysis and enumerating elementary modes. The library employs robust algorithms that allow it to be used on large networks with more than a two thousand nodes. The library accepts either a raw or fully labeled stoichiometry matrix or models written in SBML format. The software is written in standard C/C++ and comes with extensive on-line documentation and a test suite. The software is available for Windows, Mac OS X, and can be compiled easily on any Linux operating system. A language binding for Python is also available through the pip package manager making it simple to install on any standard Python distribution. The bulk of the source code is licensed under the open source BSD license with other parts using as either the MIT license or more simply public domain. All source is available on GitHub (https://github.com/sys-bio/Libstructural). Copyright © 2018 Elsevier B.V. All rights reserved.

Quantifying the spatio-temporal pattern of the ground impact of space weather events using dynamical networks formed from the SuperMAG database of ground based magnetometer stations.

NASA Astrophysics Data System (ADS)

Dods, Joe; Chapman, Sandra; Gjerloev, Jesper

2016-04-01

Quantitative understanding of the full spatial-temporal pattern of space weather is important in order to estimate the ground impact. Geomagnetic indices such as AE track the peak of a geomagnetic storm or substorm, but cannot capture the full spatial-temporal pattern. Observations by the ~100 ground based magnetometers in the northern hemisphere have the potential to capture the detailed evolution of a given space weather event. We present the first analysis of the full available set of ground based magnetometer observations of substorms using dynamical networks. SuperMAG offers a database containing ground station magnetometer data at a cadence of 1min from 100s stations situated across the globe. We use this data to form dynamic networks which capture spatial dynamics on timescales from the fast reconfiguration seen in the aurora, to that of the substorm cycle. Windowed linear cross-correlation between pairs of magnetometer time series along with a threshold is used to determine which stations are correlated and hence connected in the network. Variations in ground conductivity and differences in the response functions of magnetometers at individual stations are overcome by normalizing to long term averages of the cross-correlation. These results are tested against surrogate data in which phases have been randomised. The network is then a collection of connected points (ground stations); the structure of the network and its variation as a function of time quantify the detailed dynamical processes of the substorm. The network properties can be captured quantitatively in time dependent dimensionless network parameters and we will discuss their behaviour for examples of 'typical' substorms and storms. The network parameters provide a detailed benchmark to compare data with models of substorm dynamics, and can provide new insights on the similarities and differences between substorms and how they correlate with external driving and the internal state of the magnetosphere. We can also investigate the solar wind control of the magnetospheric-ionospheric convection system using dynamical networks. The dynamical networks are first interpolated onto a regular grid. Statistically averaged network responses are then formed for a variety of solar wind conditions, including investigating the network response to southward turnings. [1] Dods, J., S. C. Chapman, and J. W. Gjerloev (2015), Network analysis of geomagnetic substorms using the SuperMAG database of ground-based magnetometer stations, J. Geophys. Res. Space Physics, 120, 7774-7784, doi:10.1002/2015JA021456

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

PubMed Central

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

2010-01-01

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

Methods for the Analysis of Protein Phosphorylation-Mediated Cellular Signaling Networks

NASA Astrophysics Data System (ADS)

White, Forest M.; Wolf-Yadlin, Alejandro

2016-06-01

Protein phosphorylation-mediated cellular signaling networks regulate almost all aspects of cell biology, including the responses to cellular stimulation and environmental alterations. These networks are highly complex and comprise hundreds of proteins and potentially thousands of phosphorylation sites. Multiple analytical methods have been developed over the past several decades to identify proteins and protein phosphorylation sites regulating cellular signaling, and to quantify the dynamic response of these sites to different cellular stimulation. Here we provide an overview of these methods, including the fundamental principles governing each method, their relative strengths and weaknesses, and some examples of how each method has been applied to the analysis of complex signaling networks. When applied correctly, each of these techniques can provide insight into the topology, dynamics, and regulation of protein phosphorylation signaling 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.

Regenerating time series from ordinal networks.

PubMed

McCullough, Michael; Sakellariou, Konstantinos; Stemler, Thomas; Small, Michael

2017-03-01

Recently proposed ordinal networks not only afford novel methods of nonlinear time series analysis but also constitute stochastic approximations of the deterministic flow time series from which the network models are constructed. In this paper, we construct ordinal networks from discrete sampled continuous chaotic time series and then regenerate new time series by taking random walks on the ordinal network. We then investigate the extent to which the dynamics of the original time series are encoded in the ordinal networks and retained through the process of regenerating new time series by using several distinct quantitative approaches. First, we use recurrence quantification analysis on traditional recurrence plots and order recurrence plots to compare the temporal structure of the original time series with random walk surrogate time series. Second, we estimate the largest Lyapunov exponent from the original time series and investigate the extent to which this invariant measure can be estimated from the surrogate time series. Finally, estimates of correlation dimension are computed to compare the topological properties of the original and surrogate time series dynamics. Our findings show that ordinal networks constructed from univariate time series data constitute stochastic models which approximate important dynamical properties of the original systems.

Regenerating time series from ordinal networks

NASA Astrophysics Data System (ADS)

McCullough, Michael; Sakellariou, Konstantinos; Stemler, Thomas; Small, Michael

2017-03-01

Recently proposed ordinal networks not only afford novel methods of nonlinear time series analysis but also constitute stochastic approximations of the deterministic flow time series from which the network models are constructed. In this paper, we construct ordinal networks from discrete sampled continuous chaotic time series and then regenerate new time series by taking random walks on the ordinal network. We then investigate the extent to which the dynamics of the original time series are encoded in the ordinal networks and retained through the process of regenerating new time series by using several distinct quantitative approaches. First, we use recurrence quantification analysis on traditional recurrence plots and order recurrence plots to compare the temporal structure of the original time series with random walk surrogate time series. Second, we estimate the largest Lyapunov exponent from the original time series and investigate the extent to which this invariant measure can be estimated from the surrogate time series. Finally, estimates of correlation dimension are computed to compare the topological properties of the original and surrogate time series dynamics. Our findings show that ordinal networks constructed from univariate time series data constitute stochastic models which approximate important dynamical properties of the original systems.

A New View of Dynamic River Networks

NASA Astrophysics Data System (ADS)

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

2014-12-01

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

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

NASA Astrophysics Data System (ADS)

Zhuo, Zhao; Cai, Shi-Min; Tang, Ming; Lai, Ying-Cheng

2018-04-01

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community detection in complex networks.

Default and Executive Network Coupling Supports Creative Idea Production

PubMed Central

Beaty, Roger E.; Benedek, Mathias; Barry Kaufman, Scott; Silvia, Paul J.

2015-01-01

The role of attention in creative cognition remains controversial. Neuroimaging studies have reported activation of brain regions linked to both cognitive control and spontaneous imaginative processes, raising questions about how these regions interact to support creative thought. Using functional magnetic resonance imaging (fMRI), we explored this question by examining dynamic interactions between brain regions during a divergent thinking task. Multivariate pattern analysis revealed a distributed network associated with divergent thinking, including several core hubs of the default (posterior cingulate) and executive (dorsolateral prefrontal cortex) networks. The resting-state network affiliation of these regions was confirmed using data from an independent sample of participants. Graph theory analysis assessed global efficiency of the divergent thinking network, and network efficiency was found to increase as a function of individual differences in divergent thinking ability. Moreover, temporal connectivity analysis revealed increased coupling between default and salience network regions (bilateral insula) at the beginning of the task, followed by increased coupling between default and executive network regions at later stages. Such dynamic coupling suggests that divergent thinking involves cooperation between brain networks linked to cognitive control and spontaneous thought, which may reflect focused internal attention and the top-down control of spontaneous cognition during creative idea production. PMID:26084037

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.

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

Spatiotemporal Dynamics of a Network of Coupled Time-Delay Digital Tanlock Loops

NASA Astrophysics Data System (ADS)

Paul, Bishwajit; Banerjee, Tanmoy; Sarkar, B. C.

The time-delay digital tanlock loop (TDTLs) is an important class of phase-locked loop that is widely used in electronic communication systems. Although nonlinear dynamics of an isolated TDTL has been studied in the past but the collective behavior of TDTLs in a network is an important topic of research and deserves special attention as in practical communication systems separate entities are rarely isolated. In this paper, we carry out the detailed analysis and numerical simulations to explore the spatiotemporal dynamics of a network of a one-dimensional ring of coupled TDTLs with nearest neighbor coupling. The equation representing the network is derived and we carry out analytical calculations using the circulant matrix formalism to obtain the stability criteria. An extensive numerical simulation reveals that with the variation of gain parameter and coupling strength the network shows a variety of spatiotemporal dynamics such as frozen random pattern, pattern selection, spatiotemporal intermittency and fully developed spatiotemporal chaos. We map the distinct dynamical regions of the system in two-parameter space. Finally, we quantify the spatiotemporal dynamics by using quantitative measures like Lyapunov exponent and the average quadratic deviation of the full network.

Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion.

PubMed

Baggio, Jacopo A; BurnSilver, Shauna B; Arenas, Alex; Magdanz, James S; Kofinas, Gary P; De Domenico, Manlio

2016-11-29

Network analysis provides a powerful tool to analyze complex influences of social and ecological structures on community and household dynamics. Most network studies of social-ecological systems use simple, undirected, unweighted networks. We analyze multiplex, directed, and weighted networks of subsistence food flows collected in three small indigenous communities in Arctic Alaska potentially facing substantial economic and ecological changes. Our analysis of plausible future scenarios suggests that changes to social relations and key households have greater effects on community robustness than changes to specific wild food resources.

A complex systems analysis of stick-slip dynamics of a laboratory fault

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

Walker, David M.; Tordesillas, Antoinette, E-mail: atordesi@unimelb.edu.au; Small, Michael

2014-03-15

We study the stick-slip behavior of a granular bed of photoelastic disks sheared by a rough slider pulled along the surface. Time series of a proxy for granular friction are examined using complex systems methods to characterize the observed stick-slip dynamics of this laboratory fault. Nonlinear surrogate time series methods show that the stick-slip behavior appears more complex than a periodic dynamics description. Phase space embedding methods show that the dynamics can be locally captured within a four to six dimensional subspace. These slider time series also provide an experimental test for recent complex network methods. Phase space networks, constructedmore » by connecting nearby phase space points, proved useful in capturing the key features of the dynamics. In particular, network communities could be associated to slip events and the ranking of small network subgraphs exhibited a heretofore unreported ordering.« less

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.

A network dynamics approach to chemical reaction networks

NASA Astrophysics Data System (ADS)

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

2016-04-01

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

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

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.

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

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

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

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

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

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

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

2014-06-15

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

Genomic analysis reveals a tight link between transcription factor dynamics and regulatory network architecture.

PubMed

Jothi, Raja; Balaji, S; Wuster, Arthur; Grochow, Joshua A; Gsponer, Jörg; Przytycka, Teresa M; Aravind, L; Babu, M Madan

2009-01-01

Although several studies have provided important insights into the general principles of biological networks, the link between network organization and the genome-scale dynamics of the underlying entities (genes, mRNAs, and proteins) and its role in systems behavior remain unclear. Here we show that transcription factor (TF) dynamics and regulatory network organization are tightly linked. By classifying TFs in the yeast regulatory network into three hierarchical layers (top, core, and bottom) and integrating diverse genome-scale datasets, we find that the TFs have static and dynamic properties that are similar within a layer and different across layers. At the protein level, the top-layer TFs are relatively abundant, long-lived, and noisy compared with the core- and bottom-layer TFs. Although variability in expression of top-layer TFs might confer a selective advantage, as this permits at least some members in a clonal cell population to initiate a response to changing conditions, tight regulation of the core- and bottom-layer TFs may minimize noise propagation and ensure fidelity in regulation. We propose that the interplay between network organization and TF dynamics could permit differential utilization of the same underlying network by distinct members of a clonal cell population.

Research on the exponential growth effect on network topology: Theoretical and empirical analysis

NASA Astrophysics Data System (ADS)

Li, Shouwei; You, Zongjun

Integrated circuit (IC) industry network has been built in Yangtze River Delta with the constant expansion of IC industry. The IC industry network grows exponentially with the establishment of new companies and the establishment of contacts with old firms. Based on preferential attachment and exponential growth, the paper presents the analytical results in which the vertices degree of scale-free network follows power-law distribution p(k)˜k‑γ (γ=2β+1) and parameter β satisfies 0.5≤β≤1. At the same time, we find that the preferential attachment takes place in a dynamic local world and the size of the dynamic local world is in direct proportion to the size of whole networks. The paper also gives the analytical results of no-preferential attachment and exponential growth on random networks. The computer simulated results of the model illustrate these analytical results. Through some investigations on the enterprises, this paper at first presents the distribution of IC industry, composition of industrial chain and service chain firstly. Then, the correlative network and its analysis of industrial chain and service chain are presented. The correlative analysis of the whole IC industry is also presented at the same time. Based on the theory of complex network, the analysis and comparison of industrial chain network and service chain network in Yangtze River Delta are provided in the paper.

Molecular dynamics simulations and structure-based network analysis reveal structural and functional aspects of G-protein coupled receptor dimer interactions.

PubMed

Baltoumas, Fotis A; Theodoropoulou, Margarita C; Hamodrakas, Stavros J

2016-06-01

A significant amount of experimental evidence suggests that G-protein coupled receptors (GPCRs) do not act exclusively as monomers but also form biologically relevant dimers and oligomers. However, the structural determinants, stoichiometry and functional importance of GPCR oligomerization remain topics of intense speculation. In this study we attempted to evaluate the nature and dynamics of GPCR oligomeric interactions. A representative set of GPCR homodimers were studied through Coarse-Grained Molecular Dynamics simulations, combined with interface analysis and concepts from network theory for the construction and analysis of dynamic structural networks. Our results highlight important structural determinants that seem to govern receptor dimer interactions. A conserved dynamic behavior was observed among different GPCRs, including receptors belonging in different GPCR classes. Specific GPCR regions were highlighted as the core of the interfaces. Finally, correlations of motion were observed between parts of the dimer interface and GPCR segments participating in ligand binding and receptor activation, suggesting the existence of mechanisms through which dimer formation may affect GPCR function. The results of this study can be used to drive experiments aimed at exploring GPCR oligomerization, as well as in the study of transmembrane protein-protein interactions in general.

Molecular dynamics simulations and structure-based network analysis reveal structural and functional aspects of G-protein coupled receptor dimer interactions

NASA Astrophysics Data System (ADS)

Baltoumas, Fotis A.; Theodoropoulou, Margarita C.; Hamodrakas, Stavros J.

2016-06-01

A significant amount of experimental evidence suggests that G-protein coupled receptors (GPCRs) do not act exclusively as monomers but also form biologically relevant dimers and oligomers. However, the structural determinants, stoichiometry and functional importance of GPCR oligomerization remain topics of intense speculation. In this study we attempted to evaluate the nature and dynamics of GPCR oligomeric interactions. A representative set of GPCR homodimers were studied through Coarse-Grained Molecular Dynamics simulations, combined with interface analysis and concepts from network theory for the construction and analysis of dynamic structural networks. Our results highlight important structural determinants that seem to govern receptor dimer interactions. A conserved dynamic behavior was observed among different GPCRs, including receptors belonging in different GPCR classes. Specific GPCR regions were highlighted as the core of the interfaces. Finally, correlations of motion were observed between parts of the dimer interface and GPCR segments participating in ligand binding and receptor activation, suggesting the existence of mechanisms through which dimer formation may affect GPCR function. The results of this study can be used to drive experiments aimed at exploring GPCR oligomerization, as well as in the study of transmembrane protein-protein interactions in general.

Probing Allosteric Inhibition Mechanisms of the Hsp70 Chaperone Proteins Using Molecular Dynamics Simulations and Analysis of the Residue Interaction Networks.

PubMed

Stetz, Gabrielle; Verkhivker, Gennady M

2016-08-22

Although molecular mechanisms of allosteric regulation in the Hsp70 chaperones have been extensively studied at both structural and functional levels, the current understanding of allosteric inhibition of chaperone activities by small molecules is still lacking. In the current study, using a battery of computational approaches, we probed allosteric inhibition mechanisms of E. coli Hsp70 (DnaK) and human Hsp70 proteins by small molecule inhibitors PET-16 and novolactone. Molecular dynamics simulations and binding free energy analysis were combined with network-based modeling of residue interactions and allosteric communications to systematically characterize and compare molecular signatures of the apo form, substrate-bound, and inhibitor-bound chaperone complexes. The results suggested a mechanism by which the allosteric inhibitors may leverage binding energy hotspots in the interaction networks to stabilize a specific conformational state and impair the interdomain allosteric control. Using the network-based centrality analysis and community detection, we demonstrated that substrate binding may strengthen the connectivity of local interaction communities, leading to a dense interaction network that can promote an efficient allosteric communication. In contrast, binding of PET-16 to DnaK may induce significant dynamic changes and lead to a fractured interaction network and impaired allosteric communications in the DnaK complex. By using a mechanistic-based analysis of distance fluctuation maps and allosteric propensities of protein residues, we determined that the allosteric network in the PET-16 complex may be small and localized due to the reduced communication and low cooperativity of the substrate binding loops, which may promote the higher rates of substrate dissociation and the decreased substrate affinity. In comparison with the significant effect of PET-16, binding of novolactone to HSPA1A may cause only moderate network changes and preserve allosteric coupling between the allosteric pocket and the substrate binding region. The impact of novolactone on the conformational dynamics and allosteric communications in the HSPA1A complex was comparable to the substrate effect, which is consistent with the experimental evidence that PET-16, but not novolactone binding, can significantly decrease substrate affinity. We argue that the unique dynamic and network signatures of PET-16 and novolactone may be linked with the experimentally observed functional effects of these inhibitors on allosteric regulation and substrate binding.

Terminal Sliding Mode-Based Consensus Tracking Control for Networked Uncertain Mechanical Systems on Digraphs.

PubMed

Chen, Gang; Song, Yongduan; Guan, Yanfeng

2018-03-01

This brief investigates the finite-time consensus tracking control problem for networked uncertain mechanical systems on digraphs. A new terminal sliding-mode-based cooperative control scheme is developed to guarantee that the tracking errors converge to an arbitrarily small bound around zero in finite time. All the networked systems can have different dynamics and all the dynamics are unknown. A neural network is used at each node to approximate the local unknown dynamics. The control schemes are implemented in a fully distributed manner. The proposed control method eliminates some limitations in the existing terminal sliding-mode-based consensus control methods and extends the existing analysis methods to the case of directed graphs. Simulation results on networked robot manipulators are provided to show the effectiveness of the proposed control algorithms.

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.

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.

Molecular Dynamics Simulations and Dynamic Network Analysis Reveal the Allosteric Unbinding of Monobody to H-Ras Triggered by R135K Mutation.

PubMed

Ni, Duan; Song, Kun; Zhang, Jian; Lu, Shaoyong

2017-10-26

Ras proteins, as small GTPases, mediate cell proliferation, survival and differentiation. Ras mutations have been associated with a broad spectrum of human cancers and thus targeting Ras represents a potential way forward for cancer therapy. A recently reported monobody NS1 allosterically disrupts the Ras-mediated signaling pathway, but its efficacy is reduced by R135K mutation in H-Ras. However, the detailed mechanism is unresolved. Here, using molecular dynamics (MD) simulations and dynamic network analysis, we explored the molecular mechanism for the unbinding of NS1 to H-Ras and shed light on the underlying allosteric network in H-Ras. MD simulations revealed that the overall structures of the two complexes did not change significantly, but the H-Ras-NS1 interface underwent significant conformational alteration in the mutant Binding free energy analysis showed that NS1 binding was unfavored after R135K mutation, which resulted in the unfavorable binding of NS1. Furthermore, the critical residues on H-Ras responsible for the loss of binding of NS1 were identified. Importantly, the allosteric networks for these important residues were revealed, which yielded a novel insight into the allosteric regulatory mechanism of H-Ras.

Molecular Dynamics Simulations and Dynamic Network Analysis Reveal the Allosteric Unbinding of Monobody to H-Ras Triggered by R135K Mutation

PubMed Central

Song, Kun; Zhang, Jian; Lu, Shaoyong

2017-01-01

Ras proteins, as small GTPases, mediate cell proliferation, survival and differentiation. Ras mutations have been associated with a broad spectrum of human cancers and thus targeting Ras represents a potential way forward for cancer therapy. A recently reported monobody NS1 allosterically disrupts the Ras-mediated signaling pathway, but its efficacy is reduced by R135K mutation in H-Ras. However, the detailed mechanism is unresolved. Here, using molecular dynamics (MD) simulations and dynamic network analysis, we explored the molecular mechanism for the unbinding of NS1 to H-Ras and shed light on the underlying allosteric network in H-Ras. MD simulations revealed that the overall structures of the two complexes did not change significantly, but the H-Ras–NS1 interface underwent significant conformational alteration in the mutant Binding free energy analysis showed that NS1 binding was unfavored after R135K mutation, which resulted in the unfavorable binding of NS1. Furthermore, the critical residues on H-Ras responsible for the loss of binding of NS1 were identified. Importantly, the allosteric networks for these important residues were revealed, which yielded a novel insight into the allosteric regulatory mechanism of H-Ras. PMID:29072601

Nonlinear neural control with power systems applications

NASA Astrophysics Data System (ADS)

Chen, Dingguo

1998-12-01

Extensive studies have been undertaken on the transient stability of large interconnected power systems with flexible ac transmission systems (FACTS) devices installed. Varieties of control methodologies have been proposed to stabilize the postfault system which would otherwise eventually lose stability without a proper control. Generally speaking, regular transient stability is well understood, but the mechanism of load-driven voltage instability or voltage collapse has not been well understood. The interaction of generator dynamics and load dynamics makes synthesis of stabilizing controllers even more challenging. There is currently increasing interest in the research of neural networks as identifiers and controllers for dealing with dynamic time-varying nonlinear systems. This study focuses on the development of novel artificial neural network architectures for identification and control with application to dynamic electric power systems so that the stability of the interconnected power systems, following large disturbances, and/or with the inclusion of uncertain loads, can be largely enhanced, and stable operations are guaranteed. The latitudinal neural network architecture is proposed for the purpose of system identification. It may be used for identification of nonlinear static/dynamic loads, which can be further used for static/dynamic voltage stability analysis. The properties associated with this architecture are investigated. A neural network methodology is proposed for dealing with load modeling and voltage stability analysis. Based on the neural network models of loads, voltage stability analysis evolves, and modal analysis is performed. Simulation results are also provided. The transient stability problem is studied with consideration of load effects. The hierarchical neural control scheme is developed. Trajectory-following policy is used so that the hierarchical neural controller performs as almost well for non-nominal cases as they do for the nominal cases. The adaptive hierarchical neural control scheme is also proposed to deal with the time-varying nature of loads. Further, adaptive neural control, which is based on the on-line updating of the weights and biases of the neural networks, is studied. Simulations provided on the faulted power systems with unknown loads suggest that the proposed adaptive hierarchical neural control schemes should be useful for practical power applications.

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.

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

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

PubMed

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

2012-11-01

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

The Complexity of Dynamics in Small Neural Circuits

PubMed Central

Panzeri, Stefano

2016-01-01

Mean-field approximations are a powerful tool for studying large neural networks. However, they do not describe well the behavior of networks composed of a small number of neurons. In this case, major differences between the mean-field approximation and the real behavior of the network can arise. Yet, many interesting problems in neuroscience involve the study of mesoscopic networks composed of a few tens of neurons. Nonetheless, mathematical methods that correctly describe networks of small size are still rare, and this prevents us to make progress in understanding neural dynamics at these intermediate scales. Here we develop a novel systematic analysis of the dynamics of arbitrarily small networks composed of homogeneous populations of excitatory and inhibitory firing-rate neurons. We study the local bifurcations of their neural activity with an approach that is largely analytically tractable, and we numerically determine the global bifurcations. We find that for strong inhibition these networks give rise to very complex dynamics, caused by the formation of multiple branching solutions of the neural dynamics equations that emerge through spontaneous symmetry-breaking. This qualitative change of the neural dynamics is a finite-size effect of the network, that reveals qualitative and previously unexplored differences between mesoscopic cortical circuits and their mean-field approximation. The most important consequence of spontaneous symmetry-breaking is the ability of mesoscopic networks to regulate their degree of functional heterogeneity, which is thought to help reducing the detrimental effect of noise correlations on cortical information processing. PMID:27494737

Dynamic decomposition of spatiotemporal neural signals

PubMed Central

2017-01-01

Neural signals are characterized by rich temporal and spatiotemporal dynamics that reflect the organization of cortical networks. Theoretical research has shown how neural networks can operate at different dynamic ranges that correspond to specific types of information processing. Here we present a data analysis framework that uses a linearized model of these dynamic states in order to decompose the measured neural signal into a series of components that capture both rhythmic and non-rhythmic neural activity. The method is based on stochastic differential equations and Gaussian process regression. Through computer simulations and analysis of magnetoencephalographic data, we demonstrate the efficacy of the method in identifying meaningful modulations of oscillatory signals corrupted by structured temporal and spatiotemporal noise. These results suggest that the method is particularly suitable for the analysis and interpretation of complex temporal and spatiotemporal neural signals. PMID:28558039

Network analysis applications in hydrology

NASA Astrophysics Data System (ADS)

Price, Katie

2017-04-01

Applied network theory has seen pronounced expansion in recent years, in fields such as epidemiology, computer science, and sociology. Concurrent development of analytical methods and frameworks has increased possibilities and tools available to researchers seeking to apply network theory to a variety of problems. While water and nutrient fluxes through stream systems clearly demonstrate a directional network structure, the hydrological applications of network theory remain under­explored. This presentation covers a review of network applications in hydrology, followed by an overview of promising network analytical tools that potentially offer new insights into conceptual modeling of hydrologic systems, identifying behavioral transition zones in stream networks and thresholds of dynamical system response. Network applications were tested along an urbanization gradient in Atlanta, Georgia, USA. Peachtree Creek and Proctor Creek. Peachtree Creek contains a nest of five long­term USGS streamflow and water quality gages, allowing network application of long­term flow statistics. The watershed spans a range of suburban and heavily urbanized conditions. Summary flow statistics and water quality metrics were analyzed using a suite of network analysis techniques, to test the conceptual modeling and predictive potential of the methodologies. Storm events and low flow dynamics during Summer 2016 were analyzed using multiple network approaches, with an emphasis on tomogravity methods. Results indicate that network theory approaches offer novel perspectives for understanding long­ term and event­based hydrological data. Key future directions for network applications include 1) optimizing data collection, 2) identifying "hotspots" of contaminant and overland flow influx to stream systems, 3) defining process domains, and 4) analyzing dynamic connectivity of various system components, including groundwater­surface water interactions.

Automated quantification of neuronal networks and single-cell calcium dynamics using calcium imaging

PubMed Central

Patel, Tapan P.; Man, Karen; Firestein, Bonnie L.; Meaney, David F.

2017-01-01

Background Recent advances in genetically engineered calcium and membrane potential indicators provide the potential to estimate the activation dynamics of individual neurons within larger, mesoscale networks (100s–1000 +neurons). However, a fully integrated automated workflow for the analysis and visualization of neural microcircuits from high speed fluorescence imaging data is lacking. New method Here we introduce FluoroSNNAP, Fluorescence Single Neuron and Network Analysis Package. FluoroSNNAP is an open-source, interactive software developed in MATLAB for automated quantification of numerous biologically relevant features of both the calcium dynamics of single-cells and network activity patterns. FluoroSNNAP integrates and improves upon existing tools for spike detection, synchronization analysis, and inference of functional connectivity, making it most useful to experimentalists with little or no programming knowledge. Results We apply FluoroSNNAP to characterize the activity patterns of neuronal microcircuits undergoing developmental maturation in vitro. Separately, we highlight the utility of single-cell analysis for phenotyping a mixed population of neurons expressing a human mutant variant of the microtubule associated protein tau and wild-type tau. Comparison with existing method(s) We show the performance of semi-automated cell segmentation using spatiotemporal independent component analysis and significant improvement in detecting calcium transients using a template-based algorithm in comparison to peak-based or wavelet-based detection methods. Our software further enables automated analysis of microcircuits, which is an improvement over existing methods. Conclusions We expect the dissemination of this software will facilitate a comprehensive analysis of neuronal networks, promoting the rapid interrogation of circuits in health and disease. PMID:25629800

Multiscale modeling of brain dynamics: from single neurons and networks to mathematical tools.

PubMed

Siettos, Constantinos; Starke, Jens

2016-09-01

The extreme complexity of the brain naturally requires mathematical modeling approaches on a large variety of scales; the spectrum ranges from single neuron dynamics over the behavior of groups of neurons to neuronal network activity. Thus, the connection between the microscopic scale (single neuron activity) to macroscopic behavior (emergent behavior of the collective dynamics) and vice versa is a key to understand the brain in its complexity. In this work, we attempt a review of a wide range of approaches, ranging from the modeling of single neuron dynamics to machine learning. The models include biophysical as well as data-driven phenomenological models. The discussed models include Hodgkin-Huxley, FitzHugh-Nagumo, coupled oscillators (Kuramoto oscillators, Rössler oscillators, and the Hindmarsh-Rose neuron), Integrate and Fire, networks of neurons, and neural field equations. In addition to the mathematical models, important mathematical methods in multiscale modeling and reconstruction of the causal connectivity are sketched. The methods include linear and nonlinear tools from statistics, data analysis, and time series analysis up to differential equations, dynamical systems, and bifurcation theory, including Granger causal connectivity analysis, phase synchronization connectivity analysis, principal component analysis (PCA), independent component analysis (ICA), and manifold learning algorithms such as ISOMAP, and diffusion maps and equation-free techniques. WIREs Syst Biol Med 2016, 8:438-458. doi: 10.1002/wsbm.1348 For further resources related to this article, please visit the WIREs website. © 2016 Wiley Periodicals, Inc.

Dynamic functional connectivity analysis reveals transient states of dysconnectivity in schizophrenia.

PubMed

Damaraju, E; Allen, E A; Belger, A; Ford, J M; McEwen, S; Mathalon, D H; Mueller, B A; Pearlson, G D; Potkin, S G; Preda, A; Turner, J A; Vaidya, J G; van Erp, T G; Calhoun, V D

2014-01-01

Schizophrenia is a psychotic disorder characterized by functional dysconnectivity or abnormal integration between distant brain regions. Recent functional imaging studies have implicated large-scale thalamo-cortical connectivity as being disrupted in patients. However, observed connectivity differences in schizophrenia have been inconsistent between studies, with reports of hyperconnectivity and hypoconnectivity between the same brain regions. Using resting state eyes-closed functional imaging and independent component analysis on a multi-site data that included 151 schizophrenia patients and 163 age- and gender matched healthy controls, we decomposed the functional brain data into 100 components and identified 47 as functionally relevant intrinsic connectivity networks. We subsequently evaluated group differences in functional network connectivity, both in a static sense, computed as the pairwise Pearson correlations between the full network time courses (5.4 minutes in length), and a dynamic sense, computed using sliding windows (44 s in length) and k-means clustering to characterize five discrete functional connectivity states. Static connectivity analysis revealed that compared to healthy controls, patients show significantly stronger connectivity, i.e., hyperconnectivity, between the thalamus and sensory networks (auditory, motor and visual), as well as reduced connectivity (hypoconnectivity) between sensory networks from all modalities. Dynamic analysis suggests that (1), on average, schizophrenia patients spend much less time than healthy controls in states typified by strong, large-scale connectivity, and (2), that abnormal connectivity patterns are more pronounced during these connectivity states. In particular, states exhibiting cortical-subcortical antagonism (anti-correlations) and strong positive connectivity between sensory networks are those that show the group differences of thalamic hyperconnectivity and sensory hypoconnectivity. Group differences are weak or absent during other connectivity states. Dynamic analysis also revealed hypoconnectivity between the putamen and sensory networks during the same states of thalamic hyperconnectivity; notably, this finding cannot be observed in the static connectivity analysis. Finally, in post-hoc analyses we observed that the relationships between sub-cortical low frequency power and connectivity with sensory networks is altered in patients, suggesting different functional interactions between sub-cortical nuclei and sensorimotor cortex during specific connectivity states. While important differences between patients with schizophrenia and healthy controls have been identified, one should interpret the results with caution given the history of medication in patients. Taken together, our results support and expand current knowledge regarding dysconnectivity in schizophrenia, and strongly advocate the use of dynamic analyses to better account for and understand functional connectivity differences.

Dynamic functional connectivity analysis reveals transient states of dysconnectivity in schizophrenia

PubMed Central

Damaraju, E.; Allen, E.A.; Belger, A.; Ford, J.M.; McEwen, S.; Mathalon, D.H.; Mueller, B.A.; Pearlson, G.D.; Potkin, S.G.; Preda, A.; Turner, J.A.; Vaidya, J.G.; van Erp, T.G.; Calhoun, V.D.

2014-01-01

Schizophrenia is a psychotic disorder characterized by functional dysconnectivity or abnormal integration between distant brain regions. Recent functional imaging studies have implicated large-scale thalamo-cortical connectivity as being disrupted in patients. However, observed connectivity differences in schizophrenia have been inconsistent between studies, with reports of hyperconnectivity and hypoconnectivity between the same brain regions. Using resting state eyes-closed functional imaging and independent component analysis on a multi-site data that included 151 schizophrenia patients and 163 age- and gender matched healthy controls, we decomposed the functional brain data into 100 components and identified 47 as functionally relevant intrinsic connectivity networks. We subsequently evaluated group differences in functional network connectivity, both in a static sense, computed as the pairwise Pearson correlations between the full network time courses (5.4 minutes in length), and a dynamic sense, computed using sliding windows (44 s in length) and k-means clustering to characterize five discrete functional connectivity states. Static connectivity analysis revealed that compared to healthy controls, patients show significantly stronger connectivity, i.e., hyperconnectivity, between the thalamus and sensory networks (auditory, motor and visual), as well as reduced connectivity (hypoconnectivity) between sensory networks from all modalities. Dynamic analysis suggests that (1), on average, schizophrenia patients spend much less time than healthy controls in states typified by strong, large-scale connectivity, and (2), that abnormal connectivity patterns are more pronounced during these connectivity states. In particular, states exhibiting cortical–subcortical antagonism (anti-correlations) and strong positive connectivity between sensory networks are those that show the group differences of thalamic hyperconnectivity and sensory hypoconnectivity. Group differences are weak or absent during other connectivity states. Dynamic analysis also revealed hypoconnectivity between the putamen and sensory networks during the same states of thalamic hyperconnectivity; notably, this finding cannot be observed in the static connectivity analysis. Finally, in post-hoc analyses we observed that the relationships between sub-cortical low frequency power and connectivity with sensory networks is altered in patients, suggesting different functional interactions between sub-cortical nuclei and sensorimotor cortex during specific connectivity states. While important differences between patients with schizophrenia and healthy controls have been identified, one should interpret the results with caution given the history of medication in patients. Taken together, our results support and expand current knowledge regarding dysconnectivity in schizophrenia, and strongly advocate the use of dynamic analyses to better account for and understand functional connectivity differences. PMID:25161896

Visibility graph analysis on quarterly macroeconomic series of China based on complex network theory

NASA Astrophysics Data System (ADS)

Wang, Na; Li, Dong; Wang, Qiwen

2012-12-01

The visibility graph approach and complex network theory provide a new insight into time series analysis. The inheritance of the visibility graph from the original time series was further explored in the paper. We found that degree distributions of visibility graphs extracted from Pseudo Brownian Motion series obtained by the Frequency Domain algorithm exhibit exponential behaviors, in which the exponential exponent is a binomial function of the Hurst index inherited in the time series. Our simulations presented that the quantitative relations between the Hurst indexes and the exponents of degree distribution function are different for different series and the visibility graph inherits some important features of the original time series. Further, we convert some quarterly macroeconomic series including the growth rates of value-added of three industry series and the growth rates of Gross Domestic Product series of China to graphs by the visibility algorithm and explore the topological properties of graphs associated from the four macroeconomic series, namely, the degree distribution and correlations, the clustering coefficient, the average path length, and community structure. Based on complex network analysis we find degree distributions of associated networks from the growth rates of value-added of three industry series are almost exponential and the degree distributions of associated networks from the growth rates of GDP series are scale free. We also discussed the assortativity and disassortativity of the four associated networks as they are related to the evolutionary process of the original macroeconomic series. All the constructed networks have “small-world” features. The community structures of associated networks suggest dynamic changes of the original macroeconomic series. We also detected the relationship among government policy changes, community structures of associated networks and macroeconomic dynamics. We find great influences of government policies in China on the changes of dynamics of GDP and the three industries adjustment. The work in our paper provides a new way to understand the dynamics of economic development.

Exploring the evolution of node neighborhoods in Dynamic Networks

NASA Astrophysics Data System (ADS)

Orman, Günce Keziban; Labatut, Vincent; Naskali, Ahmet Teoman

2017-09-01

Dynamic Networks are a popular way of modeling and studying the behavior of evolving systems. However, their analysis constitutes a relatively recent subfield of Network Science, and the number of available tools is consequently much smaller than for static networks. In this work, we propose a method specifically designed to take advantage of the longitudinal nature of dynamic networks. It characterizes each individual node by studying the evolution of its direct neighborhood, based on the assumption that the way this neighborhood changes reflects the role and position of the node in the whole network. For this purpose, we define the concept of neighborhood event, which corresponds to the various transformations such groups of nodes can undergo, and describe an algorithm for detecting such events. We demonstrate the interest of our method on three real-world networks: DBLP, LastFM and Enron. We apply frequent pattern mining to extract meaningful information from temporal sequences of neighborhood events. This results in the identification of behavioral trends emerging in the whole network, as well as the individual characterization of specific nodes. We also perform a cluster analysis, which reveals that, in all three networks, one can distinguish two types of nodes exhibiting different behaviors: a very small group of active nodes, whose neighborhood undergo diverse and frequent events, and a very large group of stable nodes.

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.

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.

Using big data to map the network organization of the brain.

PubMed

Swain, James E; Sripada, Chandra; Swain, John D

2014-02-01

The past few years have shown a major rise in network analysis of "big data" sets in the social sciences, revealing non-obvious patterns of organization and dynamic principles. We speculate that the dependency dimension - individuality versus sociality - might offer important insights into the dynamics of neurons and neuronal ensembles. Connectomic neural analyses, informed by social network theory, may be helpful in understanding underlying fundamental principles of brain organization.

Using big data to map the network organization of the brain

PubMed Central

Swain, James E.; Sripada, Chandra; Swain, John D.

2015-01-01

The past few years have shown a major rise in network analysis of “big data” sets in the social sciences, revealing non-obvious patterns of organization and dynamic principles. We speculate that the dependency dimension – individuality versus sociality – might offer important insights into the dynamics of neurons and neuronal ensembles. Connectomic neural analyses, informed by social network theory, may be helpful in understanding underlying fundamental principles of brain organization. PMID:24572243

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…

Time-Varying Networks of Inter-Ictal Discharging Reveal Epileptogenic Zone.

PubMed

Zhang, Luyan; Liang, Yi; Li, Fali; Sun, Hongbin; Peng, Wenjing; Du, Peishan; Si, Yajing; Song, Limeng; Yu, Liang; Xu, Peng

2017-01-01

The neuronal synchronous discharging may cause an epileptic seizure. Currently, most of the studies conducted to investigate the mechanism of epilepsy are based on EEGs or functional magnetic resonance imaging (fMRI) recorded during the ictal discharging or the resting-state, and few studies have probed into the dynamic patterns during the inter-ictal discharging that are much easier to record in clinical applications. Here, we propose a time-varying network analysis based on adaptive directed transfer function to uncover the dynamic brain network patterns during the inter-ictal discharging. In addition, an algorithm based on the time-varying outflow of information derived from the network analysis is developed to detect the epileptogenic zone. The analysis performed revealed the time-varying network patterns during different stages of inter-ictal discharging; the epileptogenic zone was activated prior to the discharge onset then worked as the source to propagate the activity to other brain regions. Consistence between the epileptogenic zones detected by our proposed approach and the actual epileptogenic zones proved that time-varying network analysis could not only reveal the underlying neural mechanism of epilepsy, but also function as a useful tool in detecting the epileptogenic zone based on the EEGs in the inter-ictal discharging.

Modulation of the brain's functional network architecture in the transition from wake to sleep

PubMed Central

Larson-Prior, Linda J.; Power, Jonathan D.; Vincent, Justin L.; Nolan, Tracy S.; Coalson, Rebecca S.; Zempel, John; Snyder, Abraham Z.; Schlaggar, Bradley L.; Raichle, Marcus E.; Petersen, Steven E.

2013-01-01

The transition from quiet wakeful rest to sleep represents a period over which attention to the external environment fades. Neuroimaging methodologies have provided much information on the shift in neural activity patterns in sleep, but the dynamic restructuring of human brain networks in the transitional period from wake to sleep remains poorly understood. Analysis of electrophysiological measures and functional network connectivity of these early transitional states shows subtle shifts in network architecture that are consistent with reduced external attentiveness and increased internal and self-referential processing. Further, descent to sleep is accompanied by the loss of connectivity in anterior and posterior portions of the default-mode network and more locally organized global network architecture. These data clarify the complex and dynamic nature of the transitional period between wake and sleep and suggest the need for more studies investigating the dynamics of these processes. PMID:21854969

Complex social contagion makes networks more vulnerable to disease outbreaks.

PubMed

Campbell, Ellsworth; Salathé, Marcel

2013-01-01

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

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.

Dynamical Structure of a Traditional Amazonian Social Network

PubMed Central

Hooper, Paul L.; DeDeo, Simon; Caldwell Hooper, Ann E.; Gurven, Michael; Kaplan, Hillard S.

2014-01-01

Reciprocity is a vital feature of social networks, but relatively little is known about its temporal structure or the mechanisms underlying its persistence in real world behavior. In pursuit of these two questions, we study the stationary and dynamical signals of reciprocity in a network of manioc beer (Spanish: chicha; Tsimane’: shocdye’) drinking events in a Tsimane’ village in lowland Bolivia. At the stationary level, our analysis reveals that social exchange within the community is heterogeneously patterned according to kinship and spatial proximity. A positive relationship between the frequencies at which two families host each other, controlling for kinship and proximity, provides evidence for stationary reciprocity. Our analysis of the dynamical structure of this network presents a novel method for the study of conditional, or non-stationary, reciprocity effects. We find evidence that short-timescale reciprocity (within three days) is present among non- and distant-kin pairs; conversely, we find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone. PMID:25053880

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

PubMed Central

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

2017-01-01

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

Dynamical Structure of a Traditional Amazonian Social Network.

PubMed

Hooper, Paul L; DeDeo, Simon; Caldwell Hooper, Ann E; Gurven, Michael; Kaplan, Hillard S

2013-11-13

Reciprocity is a vital feature of social networks, but relatively little is known about its temporal structure or the mechanisms underlying its persistence in real world behavior. In pursuit of these two questions, we study the stationary and dynamical signals of reciprocity in a network of manioc beer (Spanish: chicha ; Tsimane': shocdye' ) drinking events in a Tsimane' village in lowland Bolivia. At the stationary level, our analysis reveals that social exchange within the community is heterogeneously patterned according to kinship and spatial proximity. A positive relationship between the frequencies at which two families host each other, controlling for kinship and proximity, provides evidence for stationary reciprocity. Our analysis of the dynamical structure of this network presents a novel method for the study of conditional, or non-stationary, reciprocity effects. We find evidence that short-timescale reciprocity (within three days) is present among non- and distant-kin pairs; conversely, we find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone.

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.

Dynamic mobility applications policy analysis : policy and institutional issues for intelligent network flow optimization (INFLO).

DOT National Transportation Integrated Search

2014-12-01

The report documents policy considerations for the Intelligent Network Flow Optimization (INFLO) connected vehicle applications bundle. INFLO aims to optimize network flow on freeways and arterials by informing motorists of existing and impendi...

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.

Toward next-generation optical networks: a network operator perspective based on experimental tests and economic analysis

NASA Astrophysics Data System (ADS)

Xiao, Xiaojun; Du, Chunsheng; Zhou, Rongsheng

2004-04-01

As a result of data traffic"s exponential growth, network is currently evolving from fixed circuit switched services to dynamic packet switched services, which has brought unprecedented changes to the existing transport infrastructure. It is generally agreed that automatic switched optical network (ASON) is one of the promising solutions for the next generation optical networks. In this paper, we present the results of our experimental tests and economic analysis on ASON. The intention of this paper is to present our perspective, in terms of evolution strategy toward ASON, on next generation optical networks. It is shown through experimental tests that the performance of current Pre-standard ASON enabled equipments satisfies the basic requirements of network operators and is ready for initial deployment. The results of the economic analysis show that network operators can be benefit from the deployment of ASON from three sides. Firstly, ASON can reduce the CAPEX for network expanding by integrating multiple ADM & DCS into one box. Secondly, ASON can reduce the OPEX for network operation by introducing automatic resource control scheme. Finally, ASON can increase margin revenue by providing new optical network services such as Bandwidth on Demand, optical VPN etc. Finally, the evolution strategy is proposed as our perspective toward next generation optical networks. We hope the evolution strategy introduced may be helpful for the network operators to gracefully migrate their fixed ring based legacy networks to next generation dynamic mesh based network.

Implementation of Dynamic Extensible Adaptive Locally Exchangeable Measures (IDEALEM) v 0.1

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

Sim, Alex; Lee, Dongeun; Wu, K. John

2016-03-04

Handling large streaming data is essential for various applications such as network traffic analysis, social networks, energy cost trends, and environment modeling. However, it is in general intractable to store, compute, search, and retrieve large streaming data. This software addresses a fundamental issue, which is to reduce the size of large streaming data and still obtain accurate statistical analysis. As an example, when a high-speed network such as 100 Gbps network is monitored, the collected measurement data rapidly grows so that polynomial time algorithms (e.g., Gaussian processes) become intractable. One possible solution to reduce the storage of vast amounts ofmore » measured data is to store a random sample, such as one out of 1000 network packets. However, such static sampling methods (linear sampling) have drawbacks: (1) it is not scalable for high-rate streaming data, and (2) there is no guarantee of reflecting the underlying distribution. In this software, we implemented a dynamic sampling algorithm, based on the recent technology from the relational dynamic bayesian online locally exchangeable measures, that reduces the storage of data records in a large scale, and still provides accurate analysis of large streaming data. The software can be used for both online and offline data records.« less

Network structure of multivariate time series.

PubMed

Lacasa, Lucas; Nicosia, Vincenzo; Latora, Vito

2015-10-21

Our understanding of a variety of phenomena in physics, biology and economics crucially depends on the analysis of multivariate time series. While a wide range tools and techniques for time series analysis already exist, the increasing availability of massive data structures calls for new approaches for multidimensional signal processing. We present here a non-parametric method to analyse multivariate time series, based on the mapping of a multidimensional time series into a multilayer network, which allows to extract information on a high dimensional dynamical system through the analysis of the structure of the associated multiplex network. The method is simple to implement, general, scalable, does not require ad hoc phase space partitioning, and is thus suitable for the analysis of large, heterogeneous and non-stationary time series. We show that simple structural descriptors of the associated multiplex networks allow to extract and quantify nontrivial properties of coupled chaotic maps, including the transition between different dynamical phases and the onset of various types of synchronization. As a concrete example we then study financial time series, showing that a multiplex network analysis can efficiently discriminate crises from periods of financial stability, where standard methods based on time-series symbolization often fail.

Network Analysis Reveals the Recognition Mechanism for Mannose-binding Lectins

NASA Astrophysics Data System (ADS)

Zhao, Yunjie; Jian, Yiren; Zeng, Chen; Computational Biophysics Lab Team

The specific carbohydrate binding of mannose-binding lectin (MBL) protein in plants makes it a very useful molecular tool for cancer cell detection and other applications. The biological states of most MBL proteins are dimeric. Using dynamics network analysis on molecular dynamics (MD) simulations on the model protein of MBL, we elucidate the short- and long-range driving forces behind the dimer formation. The results are further supported by sequence coevolution analysis. We propose a general framework for deciphering the recognition mechanism underlying protein-protein interactions that may have potential applications in signaling pathways.

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.

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

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

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

2015-05-15

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

Investigating the relationship between subjective drug craving and temporal dynamics of the default mode network, executive control network, and salience network in methamphetamine dependents using rsfMRI

NASA Astrophysics Data System (ADS)

Soltanian-Zadeh, Somayyeh; Hossein-Zadeh, Gholam-Ali; Shahbabaie, Alireza; Ekhtiari, Hamed

2016-03-01

Resting state functional connectivity (rsFC) studies using fMRI provides a great deal of knowledge on the spatiotemporal organization of the brain. The relationships between and within a number of resting state functional networks, namely the default mode network (DMN), salience network (SN) and executive control network (ECN) have been intensely studied in basic and clinical cognitive neuroscience [1]. However, the presumption of spatial and temporal stationarity has mostly restricted the assessment of rsFC [1]. In this study, sliding window correlation analysis and k-means clustering were exploited to examine the temporal dynamics of rsFC of these three networks in 24 abstinent methamphetamine dependents. Afterwards, using canonical correlation analysis (CCA) the possible relationship between the level of self-reported craving and the temporal dynamics was examined. Results indicate that the rsFC transits between 6 discrete "FC states" in the meth dependents. CCA results show that higher levels of craving are associated with higher probability of transiting from state 4 to 6 (positive FC of DMN-ECN getting weak and negative FC of DMN-SN appearing) and staying in state 4 (positive FC of DMN-ECN), lower probability of staying in state 2 (negative FC of DMN-ECN), transiting from state 4 to 2 (change of positive FC of DMN-ECN to negative FC), and transiting from state 3 to 5 (appearance of negative FC of DMN-SN and positive FC of DMN-ECN with the presence of negative FC of SN-ECN). Quantitative measures of temporal dynamics in large-scale brain networks could bring new added values to increase potentials for applications of rsfMRI in addiction medicine.

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.

Complex Dynamics in Information Sharing Networks

NASA Astrophysics Data System (ADS)

Cronin, Bruce

This study examines the roll-out of an electronic knowledge base in a medium-sized professional services firm over a six year period. The efficiency of such implementation is a key business problem in IT systems of this type. Data from usage logs provides the basis for analysis of the dynamic evolution of social networks around the depository during this time. The adoption pattern follows an "s-curve" and usage exhibits something of a power law distribution, both attributable to network effects, and network position is associated with organisational performance on a number of indicators. But periodicity in usage is evident and the usage distribution displays an exponential cut-off. Further analysis provides some evidence of mathematical complexity in the periodicity. Some implications of complex patterns in social network data for research and management are discussed. The study provides a case study demonstrating the utility of the broad methodological approach.

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

PubMed

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

2018-04-01

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

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.

Access Selection Algorithm of Heterogeneous Wireless Networks for Smart Distribution Grid Based on Entropy-Weight and Rough Set

NASA Astrophysics Data System (ADS)

Xiang, Min; Qu, Qinqin; Chen, Cheng; Tian, Li; Zeng, Lingkang

2017-11-01

To improve the reliability of communication service in smart distribution grid (SDG), an access selection algorithm based on dynamic network status and different service types for heterogeneous wireless networks was proposed. The network performance index values were obtained in real time by multimode terminal and the variation trend of index values was analyzed by the growth matrix. The index weights were calculated by entropy-weight and then modified by rough set to get the final weights. Combining the grey relational analysis to sort the candidate networks, and the optimum communication network is selected. Simulation results show that the proposed algorithm can implement dynamically access selection in heterogeneous wireless networks of SDG effectively and reduce the network blocking probability.

The dynamics of information-driven coordination phenomena: A transfer entropy analysis

PubMed Central

Borge-Holthoefer, Javier; Perra, Nicola; Gonçalves, Bruno; González-Bailón, Sandra; Arenas, Alex; Moreno, Yamir; Vespignani, Alessandro

2016-01-01

Data from social media provide unprecedented opportunities to investigate the processes that govern the dynamics of collective social phenomena. We consider an information theoretical approach to define and measure the temporal and structural signatures typical of collective social events as they arise and gain prominence. We use the symbolic transfer entropy analysis of microblogging time series to extract directed networks of influence among geolocalized subunits in social systems. This methodology captures the emergence of system-level dynamics close to the onset of socially relevant collective phenomena. The framework is validated against a detailed empirical analysis of five case studies. In particular, we identify a change in the characteristic time scale of the information transfer that flags the onset of information-driven collective phenomena. Furthermore, our approach identifies an order-disorder transition in the directed network of influence between social subunits. In the absence of clear exogenous driving, social collective phenomena can be represented as endogenously driven structural transitions of the information transfer network. This study provides results that can help define models and predictive algorithms for the analysis of societal events based on open source data. PMID:27051875

The dynamics of information-driven coordination phenomena: A transfer entropy analysis.

PubMed

Borge-Holthoefer, Javier; Perra, Nicola; Gonçalves, Bruno; González-Bailón, Sandra; Arenas, Alex; Moreno, Yamir; Vespignani, Alessandro

2016-04-01

Data from social media provide unprecedented opportunities to investigate the processes that govern the dynamics of collective social phenomena. We consider an information theoretical approach to define and measure the temporal and structural signatures typical of collective social events as they arise and gain prominence. We use the symbolic transfer entropy analysis of microblogging time series to extract directed networks of influence among geolocalized subunits in social systems. This methodology captures the emergence of system-level dynamics close to the onset of socially relevant collective phenomena. The framework is validated against a detailed empirical analysis of five case studies. In particular, we identify a change in the characteristic time scale of the information transfer that flags the onset of information-driven collective phenomena. Furthermore, our approach identifies an order-disorder transition in the directed network of influence between social subunits. In the absence of clear exogenous driving, social collective phenomena can be represented as endogenously driven structural transitions of the information transfer network. This study provides results that can help define models and predictive algorithms for the analysis of societal events based on open source data.

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

NASA Astrophysics Data System (ADS)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

Experiments in clustered neuronal networks: A paradigm for complex modular dynamics

NASA Astrophysics Data System (ADS)

Teller, Sara; Soriano, Jordi

2016-06-01

Uncovering the interplay activity-connectivity is one of the major challenges in neuroscience. To deepen in the understanding of how a neuronal circuit shapes network dynamics, neuronal cultures have emerged as remarkable systems given their accessibility and easy manipulation. An attractive configuration of these in vitro systems consists in an ensemble of interconnected clusters of neurons. Using calcium fluorescence imaging to monitor spontaneous activity in these clustered neuronal networks, we were able to draw functional maps and reveal their topological features. We also observed that these networks exhibit a hierarchical modular dynamics, in which clusters fire in small groups that shape characteristic communities in the network. The structure and stability of these communities is sensitive to chemical or physical action, and therefore their analysis may serve as a proxy for network health. Indeed, the combination of all these approaches is helping to develop models to quantify damage upon network degradation, with promising applications for the study of neurological disorders in vitro.

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

PubMed

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

2017-01-01

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

Information diffusion in structured online social networks

NASA Astrophysics Data System (ADS)

Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

2015-05-01

Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

Dynamics and causalities of atmospheric and oceanic data identified by complex networks and Granger causality analysis

NASA Astrophysics Data System (ADS)

Charakopoulos, A. K.; Katsouli, G. A.; Karakasidis, T. E.

2018-04-01

Understanding the underlying processes and extracting detailed characteristics of spatiotemporal dynamics of ocean and atmosphere as well as their interaction is of significant interest and has not been well thoroughly established. The purpose of this study was to examine the performance of two main additional methodologies for the identification of spatiotemporal underlying dynamic characteristics and patterns among atmospheric and oceanic variables from Seawatch buoys from Aegean and Ionian Sea, provided by the Hellenic Center for Marine Research (HCMR). The first approach involves the estimation of cross correlation analysis in an attempt to investigate time-lagged relationships, and further in order to identify the direction of interactions between the variables we performed the Granger causality method. According to the second approach the time series are converted into complex networks and then the main topological network properties such as degree distribution, average path length, diameter, modularity and clustering coefficient are evaluated. Our results show that the proposed analysis of complex network analysis of time series can lead to the extraction of hidden spatiotemporal characteristics. Also our findings indicate high level of positive and negative correlations and causalities among variables, both from the same buoy and also between buoys from different stations, which cannot be determined from the use of simple statistical measures.

Chaotic evolution of prisoner's dilemma game with volunteering on interdependent networks

NASA Astrophysics Data System (ADS)

Luo, Chao; Zhang, Xiaolin; Zheng, YuanJie

2017-06-01

In this article, the evolution of prisoner's dilemma game with volunteering on interdependent networks is investigated. Different from the traditional two-strategy game, voluntary participation as an additional strategy is involved in repeated game, that can introduce more complex evolutionary dynamics. And, interdependent networks provide a more generalized network architecture to study the intricate variability of dynamics. We have showed that voluntary participation could effectively promote the density of co-operation, that is also greatly affected by interdependent strength between two coupled networks. We further discussed the influence of interdependent strength on the densities of different strategies and found that an intermediate interdependence would play a bigger role on the evolution of dynamics. Subsequently, the critical values of the defection temptation for phase transitions under different conditions have been studied. Moreover, the global oscillations induced by the circle of dominance of three strategies on interdependent networks have been quantitatively investigated. Counter-intuitively, the oscillations of strategy densities are not periodic or stochastic, but have rich dynamical behaviors. By means of various analysis tools, we have demonstrated the global oscillations of strategy densities possessed chaotic characteristics.

A financial network perspective of financial institutions' systemic risk contributions

NASA Astrophysics Data System (ADS)

Huang, Wei-Qiang; Zhuang, Xin-Tian; Yao, Shuang; Uryasev, Stan

2016-08-01

This study considers the effects of the financial institutions' local topology structure in the financial network on their systemic risk contribution using data from the Chinese stock market. We first measure the systemic risk contribution with the Conditional Value-at-Risk (CoVaR) which is estimated by applying dynamic conditional correlation multivariate GARCH model (DCC-MVGARCH). Financial networks are constructed from dynamic conditional correlations (DCC) with graph filtering method of minimum spanning trees (MSTs). Then we investigate dynamics of systemic risk contributions of financial institution. Also we study dynamics of financial institution's local topology structure in the financial network. Finally, we analyze the quantitative relationships between the local topology structure and systemic risk contribution with panel data regression analysis. We find that financial institutions with greater node strength, larger node betweenness centrality, larger node closeness centrality and larger node clustering coefficient tend to be associated with larger systemic risk contributions.

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.

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.

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.

Task-Related Edge Density (TED)—A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain

PubMed Central

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach “Task-related Edge Density” (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function. PMID:27341204

Task-Related Edge Density (TED)-A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain.

PubMed

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach "Task-related Edge Density" (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function.

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

Allosteric Regulation of the Hsp90 Dynamics and Stability by Client Recruiter Cochaperones: Protein Structure Network Modeling

PubMed Central

Blacklock, Kristin; Verkhivker, Gennady M.

2014-01-01

The fundamental role of the Hsp90 chaperone in supporting functional activity of diverse protein clients is anchored by specific cochaperones. A family of immune sensing client proteins is delivered to the Hsp90 system with the aid of cochaperones Sgt1 and Rar1 that act cooperatively with Hsp90 to form allosterically regulated dynamic complexes. In this work, functional dynamics and protein structure network modeling are combined to dissect molecular mechanisms of Hsp90 regulation by the client recruiter cochaperones. Dynamic signatures of the Hsp90-cochaperone complexes are manifested in differential modulation of the conformational mobility in the Hsp90 lid motif. Consistent with the experiments, we have determined that targeted reorganization of the lid dynamics is a unifying characteristic of the client recruiter cochaperones. Protein network analysis of the essential conformational space of the Hsp90-cochaperone motions has identified structurally stable interaction communities, interfacial hubs and key mediating residues of allosteric communication pathways that act concertedly with the shifts in conformational equilibrium. The results have shown that client recruiter cochaperones can orchestrate global changes in the dynamics and stability of the interaction networks that could enhance the ATPase activity and assist in the client recruitment. The network analysis has recapitulated a broad range of structural and mutagenesis experiments, particularly clarifying the elusive role of Rar1 as a regulator of the Hsp90 interactions and a stability enhancer of the Hsp90-cochaperone complexes. Small-world organization of the interaction networks in the Hsp90 regulatory complexes gives rise to a strong correspondence between highly connected local interfacial hubs, global mediator residues of allosteric interactions and key functional hot spots of the Hsp90 activity. We have found that cochaperone-induced conformational changes in Hsp90 may be determined by specific interaction networks that can inhibit or promote progression of the ATPase cycle and thus control the recruitment of client proteins. PMID:24466147

Allosteric regulation of the Hsp90 dynamics and stability by client recruiter cochaperones: protein structure network modeling.

PubMed

Blacklock, Kristin; Verkhivker, Gennady M

2014-01-01

The fundamental role of the Hsp90 chaperone in supporting functional activity of diverse protein clients is anchored by specific cochaperones. A family of immune sensing client proteins is delivered to the Hsp90 system with the aid of cochaperones Sgt1 and Rar1 that act cooperatively with Hsp90 to form allosterically regulated dynamic complexes. In this work, functional dynamics and protein structure network modeling are combined to dissect molecular mechanisms of Hsp90 regulation by the client recruiter cochaperones. Dynamic signatures of the Hsp90-cochaperone complexes are manifested in differential modulation of the conformational mobility in the Hsp90 lid motif. Consistent with the experiments, we have determined that targeted reorganization of the lid dynamics is a unifying characteristic of the client recruiter cochaperones. Protein network analysis of the essential conformational space of the Hsp90-cochaperone motions has identified structurally stable interaction communities, interfacial hubs and key mediating residues of allosteric communication pathways that act concertedly with the shifts in conformational equilibrium. The results have shown that client recruiter cochaperones can orchestrate global changes in the dynamics and stability of the interaction networks that could enhance the ATPase activity and assist in the client recruitment. The network analysis has recapitulated a broad range of structural and mutagenesis experiments, particularly clarifying the elusive role of Rar1 as a regulator of the Hsp90 interactions and a stability enhancer of the Hsp90-cochaperone complexes. Small-world organization of the interaction networks in the Hsp90 regulatory complexes gives rise to a strong correspondence between highly connected local interfacial hubs, global mediator residues of allosteric interactions and key functional hot spots of the Hsp90 activity. We have found that cochaperone-induced conformational changes in Hsp90 may be determined by specific interaction networks that can inhibit or promote progression of the ATPase cycle and thus control the recruitment of client proteins.

Complexity and dynamics of topological and community structure in complex networks

NASA Astrophysics Data System (ADS)

Berec, Vesna

2017-07-01

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

Harvesting Ego-Network Data from Facebook: Using the CEMAP Facebook Profile in ORA

DTIC Science & Technology

2009-02-02

Keywords: Facebook , CEMAP, social network , ORA, dynamic network analysis Abstract...The Facebook social networking site (www.facebook.com) has become a popular phenomenon over the past five years. By its nature, Facebook has...tableset. The Facebook tableset is the CEMAP abstraction of the various levels of technology to harvest the social network data, via the Facebook developer

Dynamical Interplay between Awareness and Epidemic Spreading in Multiplex Networks

NASA Astrophysics Data System (ADS)

Granell, Clara; Gómez, Sergio; Arenas, Alex

2013-09-01

We present the analysis of the interrelation between two processes accounting for the spreading of an epidemic, and the information awareness to prevent its infection, on top of multiplex networks. This scenario is representative of an epidemic process spreading on a network of persistent real contacts, and a cyclic information awareness process diffusing in the network of virtual social contacts between the same individuals. The topology corresponds to a multiplex network where two diffusive processes are interacting affecting each other. The analysis using a microscopic Markov chain approach reveals the phase diagram of the incidence of the epidemics and allows us to capture the evolution of the epidemic threshold depending on the topological structure of the multiplex and the interrelation with the awareness process. Interestingly, the critical point for the onset of the epidemics has a critical value (metacritical point) defined by the awareness dynamics and the topology of the virtual network, from which the onset increases and the epidemics incidence decreases.

Dynamical interplay between awareness and epidemic spreading in multiplex networks.

PubMed

Granell, Clara; Gómez, Sergio; Arenas, Alex

2013-09-20

We present the analysis of the interrelation between two processes accounting for the spreading of an epidemic, and the information awareness to prevent its infection, on top of multiplex networks. This scenario is representative of an epidemic process spreading on a network of persistent real contacts, and a cyclic information awareness process diffusing in the network of virtual social contacts between the same individuals. The topology corresponds to a multiplex network where two diffusive processes are interacting affecting each other. The analysis using a microscopic Markov chain approach reveals the phase diagram of the incidence of the epidemics and allows us to capture the evolution of the epidemic threshold depending on the topological structure of the multiplex and the interrelation with the awareness process. Interestingly, the critical point for the onset of the epidemics has a critical value (metacritical point) defined by the awareness dynamics and the topology of the virtual network, from which the onset increases and the epidemics incidence decreases.

Evolving dynamics of trading behavior based on coordination game in complex networks

NASA Astrophysics Data System (ADS)

Bian, Yue-tang; Xu, Lu; Li, Jin-sheng

2016-05-01

This work concerns the modeling of evolvement of trading behavior in stock markets. Based on the assumption of the investors' limited rationality, the evolution mechanism of trading behavior is modeled according to the investment strategy of coordination game in network, that investors are prone to imitate their neighbors' activity through comprehensive analysis on the risk dominance degree of certain investment behavior, the network topology of their relationship and its heterogeneity. We investigate by mean-field analysis and extensive simulations the evolution of investors' trading behavior in various typical networks under different risk dominance degree of investment behavior. Our results indicate that the evolution of investors' behavior is affected by the network structure of stock market and the effect of risk dominance degree of investment behavior; the stability of equilibrium states of investors' behavior dynamics is directly related with the risk dominance degree of some behavior; connectivity and heterogeneity of the network plays an important role in the evolution of the investment behavior in stock market.

Synchronization from Second Order Network Connectivity Statistics

PubMed Central

Zhao, Liqiong; Beverlin, Bryce; Netoff, Theoden; Nykamp, Duane Q.

2011-01-01

We investigate how network structure can influence the tendency for a neuronal network to synchronize, or its synchronizability, independent of the dynamical model for each neuron. The synchrony analysis takes advantage of the framework of second order networks, which defines four second order connectivity statistics based on the relative frequency of two-connection network motifs. The analysis identifies two of these statistics, convergent connections, and chain connections, as highly influencing the synchrony. Simulations verify that synchrony decreases with the frequency of convergent connections and increases with the frequency of chain connections. These trends persist with simulations of multiple models for the neuron dynamics and for different types of networks. Surprisingly, divergent connections, which determine the fraction of shared inputs, do not strongly influence the synchrony. The critical role of chains, rather than divergent connections, in influencing synchrony can be explained by their increasing the effective coupling strength. The decrease of synchrony with convergent connections is primarily due to the resulting heterogeneity in firing rates. PMID:21779239

Integrating atomistic molecular dynamics simulations, experiments, and network analysis to study protein dynamics: strength in unity.

PubMed

Papaleo, Elena

2015-01-01

In the last years, we have been observing remarkable improvements in the field of protein dynamics. Indeed, we can now study protein dynamics in atomistic details over several timescales with a rich portfolio of experimental and computational techniques. On one side, this provides us with the possibility to validate simulation methods and physical models against a broad range of experimental observables. On the other side, it also allows a complementary and comprehensive view on protein structure and dynamics. What is needed now is a better understanding of the link between the dynamic properties that we observe and the functional properties of these important cellular machines. To make progresses in this direction, we need to improve the physical models used to describe proteins and solvent in molecular dynamics, as well as to strengthen the integration of experiments and simulations to overcome their own limitations. Moreover, now that we have the means to study protein dynamics in great details, we need new tools to understand the information embedded in the protein ensembles and in their dynamic signature. With this aim in mind, we should enrich the current tools for analysis of biomolecular simulations with attention to the effects that can be propagated over long distances and are often associated to important biological functions. In this context, approaches inspired by network analysis can make an important contribution to the analysis of molecular dynamics simulations.

Sparse SPM: Group Sparse-dictionary learning in SPM framework for resting-state functional connectivity MRI analysis.

PubMed

Lee, Young-Beom; Lee, Jeonghyeon; Tak, Sungho; Lee, Kangjoo; Na, Duk L; Seo, Sang Won; Jeong, Yong; Ye, Jong Chul

2016-01-15

Recent studies of functional connectivity MR imaging have revealed that the default-mode network activity is disrupted in diseases such as Alzheimer's disease (AD). However, there is not yet a consensus on the preferred method for resting-state analysis. Because the brain is reported to have complex interconnected networks according to graph theoretical analysis, the independency assumption, as in the popular independent component analysis (ICA) approach, often does not hold. Here, rather than using the independency assumption, we present a new statistical parameter mapping (SPM)-type analysis method based on a sparse graph model where temporal dynamics at each voxel position are described as a sparse combination of global brain dynamics. In particular, a new concept of a spatially adaptive design matrix has been proposed to represent local connectivity that shares the same temporal dynamics. If we further assume that local network structures within a group are similar, the estimation problem of global and local dynamics can be solved using sparse dictionary learning for the concatenated temporal data across subjects. Moreover, under the homoscedasticity variance assumption across subjects and groups that is often used in SPM analysis, the aforementioned individual and group analyses using sparse dictionary learning can be accurately modeled by a mixed-effect model, which also facilitates a standard SPM-type group-level inference using summary statistics. Using an extensive resting fMRI data set obtained from normal, mild cognitive impairment (MCI), and Alzheimer's disease patient groups, we demonstrated that the changes in the default mode network extracted by the proposed method are more closely correlated with the progression of Alzheimer's disease. Copyright © 2015 Elsevier Inc. All rights reserved.

Dynamic Photorefractive Memory and its Application for Opto-Electronic Neural Networks.

NASA Astrophysics Data System (ADS)

Sasaki, Hironori

This dissertation describes the analysis of the photorefractive crystal dynamics and its application for opto-electronic neural network systems. The realization of the dynamic photorefractive memory is investigated in terms of the following aspects: fast memory update, uniform grating multiplexing schedules and the prevention of the partial erasure of existing gratings. The fast memory update is realized by the selective erasure process that superimposes a new grating on the original one with an appropriate phase shift. The dynamics of the selective erasure process is analyzed using the first-order photorefractive material equations and experimentally confirmed. The effects of beam coupling and fringe bending on the selective erasure dynamics are also analyzed by numerically solving a combination of coupled wave equations and the photorefractive material equation. Incremental recording technique is proposed as a uniform grating multiplexing schedule and compared with the conventional scheduled recording technique in terms of phase distribution in the presence of an external dc electric field, as well as the image gray scale dependence. The theoretical analysis and experimental results proved the superiority of the incremental recording technique over the scheduled recording. Novel recirculating information memory architecture is proposed and experimentally demonstrated to prevent partial degradation of the existing gratings by accessing the memory. Gratings are circulated through a memory feed back loop based on the incremental recording dynamics and demonstrate robust read/write/erase capabilities. The dynamic photorefractive memory is applied to opto-electronic neural network systems. Module architecture based on the page-oriented dynamic photorefractive memory is proposed. This module architecture can implement two complementary interconnection organizations, fan-in and fan-out. The module system scalability and the learning capabilities are theoretically investigated using the photorefractive dynamics described in previous chapters of the dissertation. The implementation of the feed-forward image compression network with 900 input and 9 output neurons with 6-bit interconnection accuracy is experimentally demonstrated. Learning of the Perceptron network that determines sex based on input face images of 900 pixels is also successfully demonstrated.

Analysing Health Professionals' Learning Interactions in an Online Social Network: A Longitudinal Study.

PubMed

Li, Xin; Verspoor, Karin; Gray, Kathleen; Barnett, Stephen

2016-01-01

This paper summarises a longitudinal analysis of learning interactions occurring over three years among health professionals in an online social network. The study employs the techniques of Social Network Analysis (SNA) and statistical modeling to identify the changes in patterns of interaction over time and test associated structural network effects. SNA results indicate overall low participation in the network, although some participants became active over time and even led discussions. In particular, the analysis has shown that a change of lead contributor results in a change in learning interaction and network structure. The analysis of structural network effects demonstrates that the interaction dynamics slow down over time, indicating that interactions in the network are more stable. The health professionals may be reluctant to share knowledge and collaborate in groups but were interested in building personal learning networks or simply seeking information.

Molecular Dynamics Simulation Reveals Correlated Inter-Lobe Motion in Protein Lysine Methyltransferase SMYD2.

PubMed

Spellmon, Nicholas; Sun, Xiaonan; Sirinupong, Nualpun; Edwards, Brian; Li, Chunying; Yang, Zhe

2015-01-01

SMYD proteins are an exciting field of study as they are linked to many types of cancer-related pathways. Cardiac and skeletal muscle development and function also depend on SMYD proteins opening a possible avenue for cardiac-related treatment. Previous crystal structure studies have revealed that this special class of protein lysine methyltransferases have a bilobal structure, and an open-closed motion may regulate substrate specificity. Here we use the molecular dynamics simulation to investigate the still-poorly-understood SMYD2 dynamics. Cross-correlation analysis reveals that SMYD2 exhibits a negative correlated inter-lobe motion. Principle component analysis suggests that this correlated dynamic is contributed to by a twisting motion of the C-lobe with respect to the N-lobe and a clamshell-like motion between the lobes. Dynamical network analysis defines possible allosteric paths for the correlated dynamics. There are nine communities in the dynamical network with six in the N-lobe and three in the C-lobe, and the communication between the lobes is mediated by a lobe-bridging β hairpin. This study provides insight into the dynamical nature of SMYD2 and could facilitate better understanding of SMYD2 substrate specificity.

Laser dynamics: The system dynamics and network theory of optoelectronic integrated circuit design

NASA Astrophysics Data System (ADS)

Tarng, Tom Shinming-T. K.

Laser dynamics is the system dynamics, communication and network theory for the design of opto-electronic integrated circuit (OEIC). Combining the optical network theory and optical communication theory, the system analysis and design for the OEIC fundamental building blocks is considered. These building blocks include the direct current modulation, inject light modulation, wideband filter, super-gain optical amplifier, E/O and O/O optical bistability and current-controlled optical oscillator. Based on the rate equations, the phase diagram and phase portrait analysis is applied to the theoretical studies and numerical simulation. The OEIC system design methodologies are developed for the OEIC design. Stimulating-field-dependent rate equations are used to model the line-width narrowing/broadening mechanism for the CW mode and frequency chirp of semiconductor lasers. The momentary spectra are carrier-density-dependent. Furthermore, the phase portrait analysis and the nonlinear refractive index is used to simulate the single mode frequency chirp. The average spectra of chaos, period doubling, period pulsing, multi-loops and analog modulation are generated and analyzed. The bifurcation-chirp design chart with modulation depth and modulation frequency as parameters is provided for design purpose.

Principal States of Dynamic Functional Connectivity Reveal the Link Between Resting-State and Task-State Brain: An fMRI Study.

PubMed

Cheng, Lin; Zhu, Yang; Sun, Junfeng; Deng, Lifu; He, Naying; Yang, Yang; Ling, Huawei; Ayaz, Hasan; Fu, Yi; Tong, Shanbao

2018-01-25

Task-related reorganization of functional connectivity (FC) has been widely investigated. Under classic static FC analysis, brain networks under task and rest have been demonstrated a general similarity. However, brain activity and cognitive process are believed to be dynamic and adaptive. Since static FC inherently ignores the distinct temporal patterns between rest and task, dynamic FC may be more a suitable technique to characterize the brain's dynamic and adaptive activities. In this study, we adopted [Formula: see text]-means clustering to investigate task-related spatiotemporal reorganization of dynamic brain networks and hypothesized that dynamic FC would be able to reveal the link between resting-state and task-state brain organization, including broadly similar spatial patterns but distinct temporal patterns. In order to test this hypothesis, this study examined the dynamic FC in default-mode network (DMN) and motor-related network (MN) using Blood-Oxygenation-Level-Dependent (BOLD)-fMRI data from 26 healthy subjects during rest (REST) and a hand closing-and-opening (HCO) task. Two principal FC states in REST and one principal FC state in HCO were identified. The first principal FC state in REST was found similar to that in HCO, which appeared to represent intrinsic network architecture and validated the broadly similar spatial patterns between REST and HCO. However, the second FC principal state in REST with much shorter "dwell time" implied the transient functional relationship between DMN and MN during REST. In addition, a more frequent shifting between two principal FC states indicated that brain network dynamically maintained a "default mode" in the motor system during REST, whereas the presence of a single principal FC state and reduced FC variability implied a more temporally stable connectivity during HCO, validating the distinct temporal patterns between REST and HCO. Our results further demonstrated that dynamic FC analysis could offer unique insights in understanding how the brain reorganizes itself during rest and task states, and the ways in which the brain adaptively responds to the cognitive requirements of tasks.

Analysis on the dynamic error for optoelectronic scanning coordinate measurement network

NASA Astrophysics Data System (ADS)

Shi, Shendong; Yang, Linghui; Lin, Jiarui; Guo, Siyang; Ren, Yongjie

2018-01-01

Large-scale dynamic three-dimension coordinate measurement technique is eagerly demanded in equipment manufacturing. Noted for advantages of high accuracy, scale expandability and multitask parallel measurement, optoelectronic scanning measurement network has got close attention. It is widely used in large components jointing, spacecraft rendezvous and docking simulation, digital shipbuilding and automated guided vehicle navigation. At present, most research about optoelectronic scanning measurement network is focused on static measurement capacity and research about dynamic accuracy is insufficient. Limited by the measurement principle, the dynamic error is non-negligible and restricts the application. The workshop measurement and positioning system is a representative which can realize dynamic measurement function in theory. In this paper we conduct deep research on dynamic error resources and divide them two parts: phase error and synchronization error. Dynamic error model is constructed. Based on the theory above, simulation about dynamic error is carried out. Dynamic error is quantized and the rule of volatility and periodicity has been found. Dynamic error characteristics are shown in detail. The research result lays foundation for further accuracy improvement.

Discovery of Information Diffusion Process in Social Networks

NASA Astrophysics Data System (ADS)

Kim, Kwanho; Jung, Jae-Yoon; Park, Jonghun

Information diffusion analysis in social networks is of significance since it enables us to deeply understand dynamic social interactions among users. In this paper, we introduce approaches to discovering information diffusion process in social networks based on process mining. Process mining techniques are applied from three perspectives: social network analysis, process discovery and community recognition. We then present experimental results by using a real-life social network data. The proposed techniques are expected to employ as new analytical tools in online social networks such as blog and wikis for company marketers, politicians, news reporters and online writers.

Clustering determines the dynamics of complex contagions in multiplex networks

NASA Astrophysics Data System (ADS)

Zhuang, Yong; Arenas, Alex; Yaǧan, Osman

2017-01-01

We present the mathematical analysis of generalized complex contagions in a class of clustered multiplex networks. The model is intended to understand spread of influence, or any other spreading process implying a threshold dynamics, in setups of interconnected networks with significant clustering. The contagion is assumed to be general enough to account for a content-dependent linear threshold model, where each link type has a different weight (for spreading influence) that may depend on the content (e.g., product, rumor, political view) that is being spread. Using the generating functions formalism, we determine the conditions, probability, and expected size of the emergent global cascades. This analysis provides a generalization of previous approaches and is especially useful in problems related to spreading and percolation. The results present nontrivial dependencies between the clustering coefficient of the networks and its average degree. In particular, several phase transitions are shown to occur depending on these descriptors. Generally speaking, our findings reveal that increasing clustering decreases the probability of having global cascades and their size, however, this tendency changes with the average degree. There exists a certain average degree from which on clustering favors the probability and size of the contagion. By comparing the dynamics of complex contagions over multiplex networks and their monoplex projections, we demonstrate that ignoring link types and aggregating network layers may lead to inaccurate conclusions about contagion dynamics, particularly when the correlation of degrees between layers is high.

Reactive immunization on complex networks

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

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

PubMed

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

2014-11-01

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

Establishing the reliability of rhesus macaque social network assessment from video observations

PubMed Central

Feczko, Eric; Mitchell, Thomas A. J.; Walum, Hasse; Brooks, Jenna M.; Heitz, Thomas R.; Young, Larry J.; Parr, Lisa A.

2015-01-01

Understanding the properties of a social environment is important for understanding the dynamics of social relationships. Understanding such dynamics is relevant for multiple fields, ranging from animal behaviour to social and cognitive neuroscience. To quantify social environment properties, recent studies have incorporated social network analysis. Social network analysis quantifies both the global and local properties of a social environment, such as social network efficiency and the roles played by specific individuals, respectively. Despite the plethora of studies incorporating social network analysis, methods to determine the amount of data necessary to derive reliable social networks are still being developed. Determining the amount of data necessary for a reliable network is critical for measuring changes in the social environment, for example following an experimental manipulation, and therefore may be critical for using social network analysis to statistically assess social behaviour. In this paper, we extend methods for measuring error in acquired data and for determining the amount of data necessary to generate reliable social networks. We derived social networks from a group of 10 male rhesus macaques, Macaca mulatta, for three behaviours: spatial proximity, grooming and mounting. Behaviours were coded using a video observation technique, where video cameras recorded the compound where the 10 macaques resided. We collected, coded and used 10 h of video data to construct these networks. Using the methods described here, we found in our data that 1 h of spatial proximity observations produced reliable social networks. However, this may not be true for other studies due to differences in data acquisition. Our results have broad implications for measuring and predicting the amount of error in any social network, regardless of species. PMID:26392632

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.

Towards understanding the behavior of physical systems using information theory

NASA Astrophysics Data System (ADS)

Quax, Rick; Apolloni, Andrea; Sloot, Peter M. A.

2013-09-01

One of the goals of complex network analysis is to identify the most influential nodes, i.e., the nodes that dictate the dynamics of other nodes. In the case of autonomous systems or transportation networks, highly connected hubs play a preeminent role in diffusing the flow of information and viruses; in contrast, in language evolution most linguistic norms come from the peripheral nodes who have only few contacts. Clearly a topological analysis of the interactions alone is not sufficient to identify the nodes that drive the state of the network. Here we show how information theory can be used to quantify how the dynamics of individual nodes propagate through a system. We interpret the state of a node as a storage of information about the state of other nodes, which is quantified in terms of Shannon information. This information is transferred through interactions and lost due to noise, and we calculate how far it can travel through a network. We apply this concept to a model of opinion formation in a complex social network to calculate the impact of each node by measuring how long its opinion is remembered by the network. Counter-intuitively we find that the dynamics of opinions are not determined by the hubs or peripheral nodes, but rather by nodes with an intermediate connectivity.

Griffiths effects of the susceptible-infected-susceptible epidemic model on random power-law networks.

PubMed

Cota, Wesley; Ferreira, Silvio C; Ódor, Géza

2016-03-01

We provide numerical evidence for slow dynamics of the susceptible-infected-susceptible model evolving on finite-size random networks with power-law degree distributions. Extensive simulations were done by averaging the activity density over many realizations of networks. We investigated the effects of outliers in both highly fluctuating (natural cutoff) and nonfluctuating (hard cutoff) most connected vertices. Logarithmic and power-law decays in time were found for natural and hard cutoffs, respectively. This happens in extended regions of the control parameter space λ(1)<λ<λ(2), suggesting Griffiths effects, induced by the topological inhomogeneities. Optimal fluctuation theory considering sample-to-sample fluctuations of the pseudothresholds is presented to explain the observed slow dynamics. A quasistationary analysis shows that response functions remain bounded at λ(2). We argue these to be signals of a smeared transition. However, in the thermodynamic limit the Griffiths effects loose their relevancy and have a conventional critical point at λ(c)=0. Since many real networks are composed by heterogeneous and weakly connected modules, the slow dynamics found in our analysis of independent and finite networks can play an important role for the deeper understanding of such systems.

A brain-region-based meta-analysis method utilizing the Apriori algorithm.

PubMed

Niu, Zhendong; Nie, Yaoxin; Zhou, Qian; Zhu, Linlin; Wei, Jieyao

2016-05-18

Brain network connectivity modeling is a crucial method for studying the brain's cognitive functions. Meta-analyses can unearth reliable results from individual studies. Meta-analytic connectivity modeling is a connectivity analysis method based on regions of interest (ROIs) which showed that meta-analyses could be used to discover brain network connectivity. In this paper, we propose a new meta-analysis method that can be used to find network connectivity models based on the Apriori algorithm, which has the potential to derive brain network connectivity models from activation information in the literature, without requiring ROIs. This method first extracts activation information from experimental studies that use cognitive tasks of the same category, and then maps the activation information to corresponding brain areas by using the automatic anatomical label atlas, after which the activation rate of these brain areas is calculated. Finally, using these brain areas, a potential brain network connectivity model is calculated based on the Apriori algorithm. The present study used this method to conduct a mining analysis on the citations in a language review article by Price (Neuroimage 62(2):816-847, 2012). The results showed that the obtained network connectivity model was consistent with that reported by Price. The proposed method is helpful to find brain network connectivity by mining the co-activation relationships among brain regions. Furthermore, results of the co-activation relationship analysis can be used as a priori knowledge for the corresponding dynamic causal modeling analysis, possibly achieving a significant dimension-reducing effect, thus increasing the efficiency of the dynamic causal modeling analysis.

Predicting and controlling infectious disease epidemics using temporal networks

PubMed Central

Holme, Petter

2013-01-01

Infectious diseases can be considered to spread over social networks of people or animals. Mainly owing to the development of data recording and analysis techniques, an increasing amount of social contact data with time stamps has been collected in the last decade. Such temporal data capture the dynamics of social networks on a timescale relevant to epidemic spreading and can potentially lead to better ways to analyze, forecast, and prevent epidemics. However, they also call for extended analysis tools for network epidemiology, which has, to date, mostly viewed networks as static entities. We review recent results of network epidemiology for such temporal network data and discuss future developments. PMID:23513178

Predicting and controlling infectious disease epidemics using temporal networks.

PubMed

Masuda, Naoki; Holme, Petter

2013-01-01

Infectious diseases can be considered to spread over social networks of people or animals. Mainly owing to the development of data recording and analysis techniques, an increasing amount of social contact data with time stamps has been collected in the last decade. Such temporal data capture the dynamics of social networks on a timescale relevant to epidemic spreading and can potentially lead to better ways to analyze, forecast, and prevent epidemics. However, they also call for extended analysis tools for network epidemiology, which has, to date, mostly viewed networks as static entities. We review recent results of network epidemiology for such temporal network data and discuss future developments.

Dynamical Networks Characterization of Geomagnetic Substorms and Transient Response to the Solar Wind State.

NASA Astrophysics Data System (ADS)

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

2017-12-01

Observations of how the solar wind interacts with earth's magnetosphere, and its dynamical response, are increasingly becoming a data analytics challenge. Constellations of satellites observe the solar corona, the upstream solar wind and throughout earth's magnetosphere. These data are multipoint in space and extended in time, so in principle are ideal for study using dynamical networks to characterize the full time evolving spatial pattern. We focus here on analysis of data from the full set of 100+ auroral ground based magnetometer stations that have been collated by SuperMAG. Spatio-temporal patterns of correlation between the magnetometer time series can be used to form a dynamical network [1]. The properties of the network can then be captured by (time dependent) network parameters. This offers the possibility of characterizing detailed spatio-temporal pattern by a few parameters, so that many events can then be compared [2] with each other. Whilst networks are in widespread use in the data analytics of societal and commercial data, there are additional challenges in their application to physical timeseries. Determining whether two nodes (here, ground based magnetometer stations) are connected in a network (seeing the same dynamics) requires normalization w.r.t. the detailed sensitivities and dynamical responses of specific observing stations and seasonal conductivity variations and we have developed methods to achieve this dynamical normalization. The detailed properties of the network capture time dependent spatial correlation in the magnetometer responses and we will show how this can be used to infer a transient current system response to magnetospheric activity. [l] Dods et al, J. Geophys. Res 120, doi:10.1002/2015JA02 (2015). [2] Dods et al, J. Geophys. Res. 122, doi:10.1002/2016JA02 (2017).

Network Analysis: Applications for the Developing Brain

PubMed Central

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

2011-01-01

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

Spectral properties of the temporal evolution of brain network structure.

PubMed

Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

2015-12-01

The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

Spectral properties of the temporal evolution of brain network structure

NASA Astrophysics Data System (ADS)

Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

2015-12-01

The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

A proposed concept for a crustal dynamics information management network

NASA Technical Reports Server (NTRS)

Lohman, G. M.; Renfrow, J. T.

1980-01-01

The findings of a requirements and feasibility analysis of the present and potential producers, users, and repositories of space-derived geodetic information are summarized. A proposed concept is presented for a crustal dynamics information management network that would apply state of the art concepts of information management technology to meet the expanding needs of the producers, users, and archivists of this geodetic information.

Moving Target Techniques: Leveraging Uncertainty for CyberDefense

DTIC Science & Technology

2015-12-15

cyberattacks is a continual struggle for system managers. Attackers often need only find one vulnerability (a flaw or bug that an attacker can exploit...additional parsing code itself could have security-relevant software bugs . Dynamic  Network   Techniques in the dynamic network domain change the...evaluation of MT techniques can benefit from a variety of evaluation approaches, including abstract analysis, modeling and simulation, test bed

A Network Thermodynamic Framework for the Analysis and Control Design of Large-Scale Dynamical Systems

DTIC Science & Technology

2006-03-31

Nonnegative Dynamical Sys- tems................................................. 18 2.10. Adaptive Control for General Anesthesia and Intensive Care...Unit Sedation 20 2.11. Neural Network Adaptive Control for Intensive Care Unit Sedation and In- traoperative Anesthesia ...control for operating room hypnosis and intefisive care unit sedation. 1.3. Goals of this Report The main goal of this report is to summarize the

Complete synchronization of the global coupled dynamical network induced by Poisson noises.

PubMed

Guo, Qing; Wan, Fangyi

2017-01-01

The different Poisson noise-induced complete synchronization of the global coupled dynamical network is investigated. Based on the stability theory of stochastic differential equations driven by Poisson process, we can prove that Poisson noises can induce synchronization and sufficient conditions are established to achieve complete synchronization with probability 1. Furthermore, numerical examples are provided to show the agreement between theoretical and numerical analysis.

Allosteric pathway identification through network analysis: from molecular dynamics simulations to interactive 2D and 3D graphs.

PubMed

Allain, Ariane; Chauvot de Beauchêne, Isaure; Langenfeld, Florent; Guarracino, Yann; Laine, Elodie; Tchertanov, Luba

2014-01-01

Allostery is a universal phenomenon that couples the information induced by a local perturbation (effector) in a protein to spatially distant regulated sites. Such an event can be described in terms of a large scale transmission of information (communication) through a dynamic coupling between structurally rigid (minimally frustrated) and plastic (locally frustrated) clusters of residues. To elaborate a rational description of allosteric coupling, we propose an original approach - MOdular NETwork Analysis (MONETA) - based on the analysis of inter-residue dynamical correlations to localize the propagation of both structural and dynamical effects of a perturbation throughout a protein structure. MONETA uses inter-residue cross-correlations and commute times computed from molecular dynamics simulations and a topological description of a protein to build a modular network representation composed of clusters of residues (dynamic segments) linked together by chains of residues (communication pathways). MONETA provides a brand new direct and simple visualization of protein allosteric communication. A GEPHI module implemented in the MONETA package allows the generation of 2D graphs of the communication network. An interactive PyMOL plugin permits drawing of the communication pathways between chosen protein fragments or residues on a 3D representation. MONETA is a powerful tool for on-the-fly display of communication networks in proteins. We applied MONETA for the analysis of communication pathways (i) between the main regulatory fragments of receptors tyrosine kinases (RTKs), KIT and CSF-1R, in the native and mutated states and (ii) in proteins STAT5 (STAT5a and STAT5b) in the phosphorylated and the unphosphorylated forms. The description of the physical support for allosteric coupling by MONETA allowed a comparison of the mechanisms of (a) constitutive activation induced by equivalent mutations in two RTKs and (b) allosteric regulation in the activated and non-activated STAT5 proteins. Our theoretical prediction based on results obtained with MONETA was validated for KIT by in vitro experiments. MONETA is a versatile analytical and visualization tool entirely devoted to the understanding of the functioning/malfunctioning of allosteric regulation in proteins - a crucial basis to guide the discovery of next-generation allosteric drugs.

From kinetic-structure analysis to engineering crystalline fiber networks in soft materials.

PubMed

Wang, Rong-Yao; Wang, Peng; Li, Jing-Liang; Yuan, Bing; Liu, Yu; Li, Li; Liu, Xiang-Yang

2013-03-07

Understanding the role of kinetics in fiber network microstructure formation is of considerable importance in engineering gel materials to achieve their optimized performances/functionalities. In this work, we present a new approach for kinetic-structure analysis for fibrous gel materials. In this method, kinetic data is acquired using a rheology technique and is analyzed in terms of an extended Dickinson model in which the scaling behaviors of dynamic rheological properties in the gelation process are taken into account. It enables us to extract the structural parameter, i.e. the fractal dimension, of a fibrous gel from the dynamic rheological measurement of the gelation process, and to establish the kinetic-structure relationship suitable for both dilute and concentrated gelling systems. In comparison to the fractal analysis method reported in a previous study, our method is advantageous due to its general validity for a wide range of fractal structures of fibrous gels, from a highly compact network of the spherulitic domains to an open fibrous network structure. With such a kinetic-structure analysis, we can gain a quantitative understanding of the role of kinetic control in engineering the microstructure of the fiber network in gel materials.

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

PubMed

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

2017-01-01

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

Structural and Dynamical Patterns on Online Social Networks: The Spanish May 15th Movement as a Case Study

PubMed Central

Borge-Holthoefer, Javier; Rivero, Alejandro; García, Iñigo; Cauhé, Elisa; Ferrer, Alfredo; Ferrer, Darío; Francos, David; Iñiguez, David; Pérez, María Pilar; Ruiz, Gonzalo; Sanz, Francisco; Serrano, Fermín; Viñas, Cristina; Tarancón, Alfonso; Moreno, Yamir

2011-01-01

The number of people using online social networks in their everyday life is continuously growing at a pace never saw before. This new kind of communication has an enormous impact on opinions, cultural trends, information spreading and even in the commercial success of new products. More importantly, social online networks have revealed as a fundamental organizing mechanism in recent country-wide social movements. In this paper, we provide a quantitative analysis of the structural and dynamical patterns emerging from the activity of an online social network around the ongoing May 15th (15M) movement in Spain. Our network is made up by users that exchanged tweets in a time period of one month, which includes the birth and stabilization of the 15M movement. We characterize in depth the growth of such dynamical network and find that it is scale-free with communities at the mesoscale. We also find that its dynamics exhibits typical features of critical systems such as robustness and power-law distributions for several quantities. Remarkably, we report that the patterns characterizing the spreading dynamics are asymmetric, giving rise to a clear distinction between information sources and sinks. Our study represents a first step towards the use of data from online social media to comprehend modern societal dynamics. PMID:21886834

Role of Graph Architecture in Controlling Dynamical Networks with Applications to Neural Systems.

PubMed

Kim, Jason Z; Soffer, Jonathan M; Kahn, Ari E; Vettel, Jean M; Pasqualetti, Fabio; Bassett, Danielle S

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviors such as synchronization. While descriptions of these behaviors are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behavior. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behavior in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Role of graph architecture in controlling dynamical networks with applications to neural systems

NASA Astrophysics Data System (ADS)

Kim, Jason Z.; Soffer, Jonathan M.; Kahn, Ari E.; Vettel, Jean M.; Pasqualetti, Fabio; Bassett, Danielle S.

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviours such as synchronization. Although descriptions of these behaviours are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behaviour. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behaviour in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Global value chains: Building blocks and network dynamics

NASA Astrophysics Data System (ADS)

Tsekeris, Theodore

2017-12-01

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

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

PubMed

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

2016-01-01

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

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

PubMed Central

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

2016-01-01

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

Dynamics and nature of support in the personal networks of people with type 2 diabetes living in Europe: qualitative analysis of network properties.

PubMed

Kennedy, Anne; Rogers, Anne; Vassilev, Ivaylo; Todorova, Elka; Roukova, Poli; Foss, Christina; Knutsen, Ingrid; Portillo, Mari Carmen; Mujika, Agurtzane; Serrano-Gil, Manuel; Lionis, Christos; Angelaki, Agapi; Ratsika, Nikoleta; Koetsenruijter, Jan; Wensing, Michel

2015-12-01

Living with and self-managing a long-term condition implicates a diversity of networked relationships. This qualitative study examines the personal communities of support of people with type 2 diabetes. We conducted 170 biographical interviews in six European countries (Bulgaria, Greece, the Netherlands, Norway, Spain and UK) to explore social support and networks. Analysis was framed with reference to three predetermined social support mechanisms: the negotiation of support enabling engagement with healthy practices, navigation to sources of support and collective efficacy. Each interview was summarized to describe navigation and negotiation of participants' networks and the degree of collective efficacy. Analysis highlighted the similarities and differences between countries and provided insights into capacities of networks to support self-management. The network support mechanisms were identified in all interviews, and losses and gains in networks impacted on diabetes management. There were contextual differences between countries, most notably the impact of financial austerity on network dynamics. Four types of network are suggested: generative, diverse and beneficial to individuals; proxy, network members undertook diabetes management work; avoidant, support not engaged with; and struggling, diabetes management a struggle or not prioritized. It is possible to differentiate types of network input to living with and managing diabetes. Recognizing the nature of active, generative aspects of networks support is likely to have relevance for self-management support interventions either through encouraging continuing development and maintenance of these contacts or intervening to address struggling networks through introducing the means to connect people to additional sources of support. © 2014 John Wiley & Sons Ltd.

Metabolic reconstruction, constraint-based analysis and game theory to probe genome-scale metabolic networks.

PubMed

Ruppin, Eytan; Papin, Jason A; de Figueiredo, Luis F; Schuster, Stefan

2010-08-01

With the advent of modern omics technologies, it has become feasible to reconstruct (quasi-) whole-cell metabolic networks and characterize them in more and more detail. Computer simulations of the dynamic behavior of such networks are difficult due to a lack of kinetic data and to computational limitations. In contrast, network analysis based on appropriate constraints such as the steady-state condition (constraint-based analysis) is feasible and allows one to derive conclusions about the system's metabolic capabilities. Here, we review methods for the reconstruction of metabolic networks, modeling techniques such as flux balance analysis and elementary flux modes and current progress in their development and applications. Game-theoretical methods for studying metabolic networks are discussed as well. Copyright © 2010 Elsevier Ltd. All rights reserved.

Analyzing psychotherapy process as intersubjective sensemaking: an approach based on discourse analysis and neural networks.

PubMed

Nitti, Mariangela; Ciavolino, Enrico; Salvatore, Sergio; Gennaro, Alessandro

2010-09-01

The authors propose a method for analyzing the psychotherapy process: discourse flow analysis (DFA). DFA is a technique representing the verbal interaction between therapist and patient as a discourse network, aimed at measuring the therapist-patient discourse ability to generate new meanings through time. DFA assumes that the main function of psychotherapy is to produce semiotic novelty. DFA is applied to the verbatim transcript of the psychotherapy. It defines the main meanings active within the therapeutic discourse by means of the combined use of text analysis and statistical techniques. Subsequently, it represents the dynamic interconnections among these meanings in terms of a "discursive network." The dynamic and structural indexes of the discursive network have been shown to provide a valid representation of the patient-therapist communicative flow as well as an estimation of its clinical quality. Finally, a neural network is designed specifically to identify patterns of functioning of the discursive network and to verify the clinical validity of these patterns in terms of their association with specific phases of the psychotherapy process. An application of the DFA to a case of psychotherapy is provided to illustrate the method and the kinds of results it produces.

Using Social Network Analysis to Better Understand Compulsive Exercise Behavior Among a Sample of Sorority Members.

PubMed

Patterson, Megan S; Goodson, Patricia

2017-05-01

Compulsive exercise, a form of unhealthy exercise often associated with prioritizing exercise and feeling guilty when exercise is missed, is a common precursor to and symptom of eating disorders. College-aged women are at high risk of exercising compulsively compared with other groups. Social network analysis (SNA) is a theoretical perspective and methodology allowing researchers to observe the effects of relational dynamics on the behaviors of people. SNA was used to assess the relationship between compulsive exercise and body dissatisfaction, physical activity, and network variables. Descriptive statistics were conducted using SPSS, and quadratic assignment procedure (QAP) analyses were conducted using UCINET. QAP regression analysis revealed a statistically significant model (R 2 = .375, P < .0001) predicting compulsive exercise behavior. Physical activity, body dissatisfaction, and network variables were statistically significant predictor variables in the QAP regression model. In our sample, women who are connected to "important" or "powerful" people in their network are likely to have higher compulsive exercise scores. This result provides healthcare practitioners key target points for intervention within similar groups of women. For scholars researching eating disorders and associated behaviors, this study supports looking into group dynamics and network structure in conjunction with body dissatisfaction and exercise frequency.

Risperidone Effects on Brain Dynamic Connectivity-A Prospective Resting-State fMRI Study in Schizophrenia.

PubMed

Lottman, Kristin K; Kraguljac, Nina V; White, David M; Morgan, Charity J; Calhoun, Vince D; Butt, Allison; Lahti, Adrienne C

2017-01-01

Resting-state functional connectivity studies in schizophrenia evaluating average connectivity over the entire experiment have reported aberrant network integration, but findings are variable. Examining time-varying (dynamic) functional connectivity may help explain some inconsistencies. We assessed dynamic network connectivity using resting-state functional MRI in patients with schizophrenia, while unmedicated ( n  = 34), after 1 week ( n  = 29) and 6 weeks of treatment with risperidone ( n  = 24), as well as matched controls at baseline ( n  = 35) and after 6 weeks ( n  = 19). After identifying 41 independent components (ICs) comprising resting-state networks, sliding window analysis was performed on IC timecourses using an optimal window size validated with linear support vector machines. Windowed correlation matrices were then clustered into three discrete connectivity states (a relatively sparsely connected state, a relatively abundantly connected state, and an intermediately connected state). In unmedicated patients, static connectivity was increased between five pairs of ICs and decreased between two pairs of ICs when compared to controls, dynamic connectivity showed increased connectivity between the thalamus and somatomotor network in one of the three states. State statistics indicated that, in comparison to controls, unmedicated patients had shorter mean dwell times and fraction of time spent in the sparsely connected state, and longer dwell times and fraction of time spent in the intermediately connected state. Risperidone appeared to normalize mean dwell times after 6 weeks, but not fraction of time. Results suggest that static connectivity abnormalities in schizophrenia may partly be related to altered brain network temporal dynamics rather than consistent dysconnectivity within and between functional networks and demonstrate the importance of implementing complementary data analysis techniques.

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik V.; Marwan, Norbert; Dijkstra, Henk A.; Kurths, Jürgen

2015-11-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology.

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.

Can investor sentiment be used to predict the stock price? Dynamic analysis based on China stock market

NASA Astrophysics Data System (ADS)

Guo, Kun; Sun, Yi; Qian, Xin

2017-03-01

With the development of the social network, the interaction between investors in stock market became more fast and convenient. Thus, investor sentiment which can influence their investment decisions may be quickly spread and magnified through the network, and to a certain extent the stock market can be affected. This paper collected the user comments data from a popular professional social networking site of China stock market called Xueqiu, then the investor sentiment data can be obtained through semantic analysis. The dynamic analysis on relationship between investor sentiment and stock market is proposed based on Thermal Optimal Path (TOP) method. The results show that the sentiment data was not always leading over stock market price, and it can be used to predict the stock price only when the stock has high investor attention.

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

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

Jin, R; McCallen, S; Almaas, E

2007-05-28

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

A New Strategy for Analyzing Time-Series Data Using Dynamic Networks: Identifying Prospective Biomarkers of Hepatocellular Carcinoma.

PubMed

Huang, Xin; Zeng, Jun; Zhou, Lina; Hu, Chunxiu; Yin, Peiyuan; Lin, Xiaohui

2016-08-31

Time-series metabolomics studies can provide insight into the dynamics of disease development and facilitate the discovery of prospective biomarkers. To improve the performance of early risk identification, a new strategy for analyzing time-series data based on dynamic networks (ATSD-DN) in a systematic time dimension is proposed. In ATSD-DN, the non-overlapping ratio was applied to measure the changes in feature ratios during the process of disease development and to construct dynamic networks. Dynamic concentration analysis and network topological structure analysis were performed to extract early warning information. This strategy was applied to the study of time-series lipidomics data from a stepwise hepatocarcinogenesis rat model. A ratio of lyso-phosphatidylcholine (LPC) 18:1/free fatty acid (FFA) 20:5 was identified as the potential biomarker for hepatocellular carcinoma (HCC). It can be used to classify HCC and non-HCC rats, and the area under the curve values in the discovery and external validation sets were 0.980 and 0.972, respectively. This strategy was also compared with a weighted relative difference accumulation algorithm (wRDA), multivariate empirical Bayes statistics (MEBA) and support vector machine-recursive feature elimination (SVM-RFE). The better performance of ATSD-DN suggests its potential for a more complete presentation of time-series changes and effective extraction of early warning information.

A New Strategy for Analyzing Time-Series Data Using Dynamic Networks: Identifying Prospective Biomarkers of Hepatocellular Carcinoma

NASA Astrophysics Data System (ADS)

Huang, Xin; Zeng, Jun; Zhou, Lina; Hu, Chunxiu; Yin, Peiyuan; Lin, Xiaohui

2016-08-01

Time-series metabolomics studies can provide insight into the dynamics of disease development and facilitate the discovery of prospective biomarkers. To improve the performance of early risk identification, a new strategy for analyzing time-series data based on dynamic networks (ATSD-DN) in a systematic time dimension is proposed. In ATSD-DN, the non-overlapping ratio was applied to measure the changes in feature ratios during the process of disease development and to construct dynamic networks. Dynamic concentration analysis and network topological structure analysis were performed to extract early warning information. This strategy was applied to the study of time-series lipidomics data from a stepwise hepatocarcinogenesis rat model. A ratio of lyso-phosphatidylcholine (LPC) 18:1/free fatty acid (FFA) 20:5 was identified as the potential biomarker for hepatocellular carcinoma (HCC). It can be used to classify HCC and non-HCC rats, and the area under the curve values in the discovery and external validation sets were 0.980 and 0.972, respectively. This strategy was also compared with a weighted relative difference accumulation algorithm (wRDA), multivariate empirical Bayes statistics (MEBA) and support vector machine-recursive feature elimination (SVM-RFE). The better performance of ATSD-DN suggests its potential for a more complete presentation of time-series changes and effective extraction of early warning information.

Cooperation dynamics of generalized reciprocity in state-based social dilemmas

NASA Astrophysics Data System (ADS)

Stojkoski, Viktor; Utkovski, Zoran; Basnarkov, Lasko; Kocarev, Ljupco

2018-05-01

We introduce a framework for studying social dilemmas in networked societies where individuals follow a simple state-based behavioral mechanism based on generalized reciprocity, which is rooted in the principle "help anyone if helped by someone." Within this general framework, which applies to a wide range of social dilemmas including, among others, public goods, donation, and snowdrift games, we study the cooperation dynamics on a variety of complex network examples. By interpreting the studied model through the lenses of nonlinear dynamical systems, we show that cooperation through generalized reciprocity always emerges as the unique attractor in which the overall level of cooperation is maximized, while simultaneously exploitation of the participating individuals is prevented. The analysis elucidates the role of the network structure, here captured by a local centrality measure which uniquely quantifies the propensity of the network structure to cooperation by dictating the degree of cooperation displayed both at the microscopic and macroscopic level. We demonstrate the applicability of the analysis on a practical example by considering an interaction structure that couples a donation process with a public goods game.

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.

Dynamic Neural Networks Supporting Memory Retrieval

PubMed Central

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

2011-01-01

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

Role of centrality for the identification of influential spreaders in complex networks.

PubMed

de Arruda, Guilherme Ferraz; Barbieri, André Luiz; Rodríguez, Pablo Martín; Rodrigues, Francisco A; Moreno, Yamir; Costa, Luciano da Fontoura

2014-09-01

The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumorlike dynamics. Recent works have suggested that the identification of influential spreaders is not independent of the dynamics being studied. For instance, the key disease spreaders might not necessarily be so important when it comes to analyzing social contagion or rumor propagation. Additionally, it has been shown that different metrics (degree, coreness, etc.) might identify different influential nodes even for the same dynamical processes with diverse degrees of accuracy. In this paper, we investigate how nine centrality measures correlate with the disease and rumor spreading capabilities of the nodes in different synthetic and real-world (both spatial and nonspatial) networks. We also propose a generalization of the random walk accessibility as a new centrality measure and derive analytical expressions for the latter measure for simple network configurations. Our results show that for nonspatial networks, the k-core and degree centralities are the most correlated to epidemic spreading, whereas the average neighborhood degree, the closeness centrality, and accessibility are the most related to rumor dynamics. On the contrary, for spatial networks, the accessibility measure outperforms the rest of the centrality metrics in almost all cases regardless of the kind of dynamics considered. Therefore, an important consequence of our analysis is that previous studies performed in synthetic random networks cannot be generalized to the case of spatial networks.

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.

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.

Exploring Molecular Mechanisms of Paradoxical Activation in the BRAF Kinase Dimers: Atomistic Simulations of Conformational Dynamics and Modeling of Allosteric Communication Networks and Signaling Pathways

PubMed Central

Tse, Amanda; Verkhivker, Gennady M.

2016-01-01

The recent studies have revealed that most BRAF inhibitors can paradoxically induce kinase activation by promoting dimerization and enzyme transactivation. Despite rapidly growing number of structural and functional studies about the BRAF dimer complexes, the molecular basis of paradoxical activation phenomenon is poorly understood and remains largely hypothetical. In this work, we have explored the relationships between inhibitor binding, protein dynamics and allosteric signaling in the BRAF dimers using a network-centric approach. Using this theoretical framework, we have combined molecular dynamics simulations with coevolutionary analysis and modeling of the residue interaction networks to determine molecular determinants of paradoxical activation. We have investigated functional effects produced by paradox inducer inhibitors PLX4720, Dabrafenib, Vemurafenib and a paradox breaker inhibitor PLX7904. Functional dynamics and binding free energy analyses of the BRAF dimer complexes have suggested that negative cooperativity effect and dimer-promoting potential of the inhibitors could be important drivers of paradoxical activation. We have introduced a protein structure network model in which coevolutionary residue dependencies and dynamic maps of residue correlations are integrated in the construction and analysis of the residue interaction networks. The results have shown that coevolutionary residues in the BRAF structures could assemble into independent structural modules and form a global interaction network that may promote dimerization. We have also found that BRAF inhibitors could modulate centrality and communication propensities of global mediating centers in the residue interaction networks. By simulating allosteric communication pathways in the BRAF structures, we have determined that paradox inducer and breaker inhibitors may activate specific signaling routes that correlate with the extent of paradoxical activation. While paradox inducer inhibitors may facilitate a rapid and efficient communication via an optimal single pathway, the paradox breaker may induce a broader ensemble of suboptimal and less efficient communication routes. The central finding of our study is that paradox breaker PLX7904 could mimic structural, dynamic and network features of the inactive BRAF-WT monomer that may be required for evading paradoxical activation. The results of this study rationalize the existing structure-functional experiments by offering a network-centric rationale of the paradoxical activation phenomenon. We argue that BRAF inhibitors that amplify dynamic features of the inactive BRAF-WT monomer and intervene with the allosteric interaction networks may serve as effective paradox breakers in cellular environment. PMID:27861609

Unified Approach to Modeling and Simulation of Space Communication Networks and Systems

NASA Technical Reports Server (NTRS)

Barritt, Brian; Bhasin, Kul; Eddy, Wesley; Matthews, Seth

2010-01-01

Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks

Dynamic modeling and optimization for space logistics using time-expanded networks

NASA Astrophysics Data System (ADS)

Ho, Koki; de Weck, Olivier L.; Hoffman, Jeffrey A.; Shishko, Robert

2014-12-01

This research develops a dynamic logistics network formulation for lifecycle optimization of mission sequences as a system-level integrated method to find an optimal combination of technologies to be used at each stage of the campaign. This formulation can find the optimal transportation architecture considering its technology trades over time. The proposed methodologies are inspired by the ground logistics analysis techniques based on linear programming network optimization. Particularly, the time-expanded network and its extension are developed for dynamic space logistics network optimization trading the quality of the solution with the computational load. In this paper, the methodologies are applied to a human Mars exploration architecture design problem. The results reveal multiple dynamic system-level trades over time and give recommendation of the optimal strategy for the human Mars exploration architecture. The considered trades include those between In-Situ Resource Utilization (ISRU) and propulsion technologies as well as the orbit and depot location selections over time. This research serves as a precursor for eventual permanent settlement and colonization of other planets by humans and us becoming a multi-planet species.

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.

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

NASA Technical Reports Server (NTRS)

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

1997-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Design of neural networks for fast convergence and accuracy: dynamics and control.

PubMed

Maghami, P G; Sparks, D R

2000-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

A Novel Experimental and Analytical Approach to the Multimodal Neural Decoding of Intent During Social Interaction in Freely-behaving Human Infants.

PubMed

Cruz-Garza, Jesus G; Hernandez, Zachery R; Tse, Teresa; Caducoy, Eunice; Abibullaev, Berdakh; Contreras-Vidal, Jose L

2015-10-04

Understanding typical and atypical development remains one of the fundamental questions in developmental human neuroscience. Traditionally, experimental paradigms and analysis tools have been limited to constrained laboratory tasks and contexts due to technical limitations imposed by the available set of measuring and analysis techniques and the age of the subjects. These limitations severely limit the study of developmental neural dynamics and associated neural networks engaged in cognition, perception and action in infants performing "in action and in context". This protocol presents a novel approach to study infants and young children as they freely organize their own behavior, and its consequences in a complex, partly unpredictable and highly dynamic environment. The proposed methodology integrates synchronized high-density active scalp electroencephalography (EEG), inertial measurement units (IMUs), video recording and behavioral analysis to capture brain activity and movement non-invasively in freely-behaving infants. This setup allows for the study of neural network dynamics in the developing brain, in action and context, as these networks are recruited during goal-oriented, exploration and social interaction tasks.

Synchronization in networks with heterogeneous coupling delays

NASA Astrophysics Data System (ADS)

Otto, Andreas; Radons, Günter; Bachrathy, Dániel; Orosz, Gábor

2018-01-01

Synchronization in networks of identical oscillators with heterogeneous coupling delays is studied. A decomposition of the network dynamics is obtained by block diagonalizing a newly introduced adjacency lag operator which contains the topology of the network as well as the corresponding coupling delays. This generalizes the master stability function approach, which was developed for homogenous delays. As a result the network dynamics can be analyzed by delay differential equations with distributed delay, where different delay distributions emerge for different network modes. Frequency domain methods are used for the stability analysis of synchronized equilibria and synchronized periodic orbits. As an example, the synchronization behavior in a system of delay-coupled Hodgkin-Huxley neurons is investigated. It is shown that the parameter regions where synchronized periodic spiking is unstable expand when increasing the delay heterogeneity.

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.

Coherence analysis of a class of weighted networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; He, Jiaojiao; Zong, Yue; Ju, Tingting; Sun, Yu; Su, Weiyi

2018-04-01

This paper investigates consensus dynamics in a dynamical system with additive stochastic disturbances that is characterized as network coherence by using the Laplacian spectrum. We introduce a class of weighted networks based on a complete graph and investigate the first- and second-order network coherence quantifying as the sum and square sum of reciprocals of all nonzero Laplacian eigenvalues. First, the recursive relationship of its eigenvalues at two successive generations of Laplacian matrix is deduced. Then, we compute the sum and square sum of reciprocal of all nonzero Laplacian eigenvalues. The obtained results show that the scalings of first- and second-order coherence with network size obey four and five laws, respectively, along with the range of the weight factor. Finally, it indicates that the scalings of our studied networks are smaller than other studied networks when 1/√{d }

How mutation alters the evolutionary dynamics of cooperation on networks

NASA Astrophysics Data System (ADS)

Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

2018-05-01

Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Synchronization in Complex Networks with Multiple Connections

NASA Astrophysics Data System (ADS)

Wu, Qing-Chu; Fu, Xin-Chu; Sun, Wei-Gang

2010-01-01

In this paper a class of networks with multiple connections are discussed. The multiple connections include two different types of links between nodes in complex networks. For this new model, we give a simple generating procedure. Furthermore, we investigate dynamical synchronization behavior in a delayed two-layer network, giving corresponding theoretical analysis and numerical examples.

Spectral analysis and slow spreading dynamics on complex networks.

PubMed

Odor, Géza

2013-09-01

The susceptible-infected-susceptible (SIS) model is one of the simplest memoryless systems for describing information or epidemic spreading phenomena with competing creation and spontaneous annihilation reactions. The effect of quenched disorder on the dynamical behavior has recently been compared to quenched mean-field (QMF) approximations in scale-free networks. QMF can take into account topological heterogeneity and clustering effects of the activity in the steady state by spectral decomposition analysis of the adjacency matrix. Therefore, it can provide predictions on possible rare-region effects, thus on the occurrence of slow dynamics. I compare QMF results of SIS with simulations on various large dimensional graphs. In particular, I show that for Erdős-Rényi graphs this method predicts correctly the occurrence of rare-region effects. It also provides a good estimate for the epidemic threshold in case of percolating graphs. Griffiths Phases emerge if the graph is fragmented or if we apply a strong, exponentially suppressing weighting scheme on the edges. The latter model describes the connection time distributions in the face-to-face experiments. In case of a generalized Barabási-Albert type of network with aging connections, strong rare-region effects and numerical evidence for Griffiths Phase dynamics are shown. The dynamical simulation results agree well with the predictions of the spectral analysis applied for the weighted adjacency matrices.

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

PubMed

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

2008-01-01

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

Implications of Network Topology on Stability

PubMed Central

Kinkhabwala, Ali

2015-01-01

In analogy to chemical reaction networks, I demonstrate the utility of expressing the governing equations of an arbitrary dynamical system (interaction network) as sums of real functions (generalized reactions) multiplied by real scalars (generalized stoichiometries) for analysis of its stability. The reaction stoichiometries and first derivatives define the network’s “influence topology”, a signed directed bipartite graph. Parameter reduction of the influence topology permits simplified expression of the principal minors (sums of products of non-overlapping bipartite cycles) and Hurwitz determinants (sums of products of the principal minors or the bipartite cycles directly) for assessing the network’s steady state stability. Visualization of the Hurwitz determinants over the reduced parameters defines the network’s stability phase space, delimiting the range of its dynamics (specifically, the possible numbers of unstable roots at each steady state solution). Any further explicit algebraic specification of the network will project onto this stability phase space. Stability analysis via this hierarchical approach is demonstrated on classical networks from multiple fields. PMID:25826219

Transition Characteristic Analysis of Traffic Evolution Process for Urban Traffic Network

PubMed Central

Chen, Hong; Li, Yang

2014-01-01

The characterization of the dynamics of traffic states remains fundamental to seeking for the solutions of diverse traffic problems. To gain more insights into traffic dynamics in the temporal domain, this paper explored temporal characteristics and distinct regularity in the traffic evolution process of urban traffic network. We defined traffic state pattern through clustering multidimensional traffic time series using self-organizing maps and construct a pattern transition network model that is appropriate for representing and analyzing the evolution progress. The methodology is illustrated by an application to data flow rate of multiple road sections from Network of Shenzhen's Nanshan District, China. Analysis and numerical results demonstrated that the methodology permits extracting many useful traffic transition characteristics including stability, preference, activity, and attractiveness. In addition, more information about the relationships between these characteristics was extracted, which should be helpful in understanding the complex behavior of the temporal evolution features of traffic patterns. PMID:24982969

Social networks dynamics revealed by temporal analysis: An example in a non-human primate (Macaca sylvanus) in "La Forêt des Singes".

PubMed

Sosa, Sebastian; Zhang, Peng; Cabanes, Guénaël

2017-06-01

This study applied a temporal social network analysis model to describe three affiliative social networks (allogrooming, sleep in contact, and triadic interaction) in a non-human primate species, Macaca sylvanus. Three main social mechanisms were examined to determine interactional patterns among group members, namely preferential attachment (i.e., highly connected individuals are more likely to form new connections), triadic closure (new connections occur via previous close connections), and homophily (individuals interact preferably with others with similar attributes). Preferential attachment was only observed for triadic interaction network. Triadic closure was significant in allogrooming and triadic interaction networks. Finally, gender homophily was seasonal for allogrooming and sleep in contact networks, and observed in each period for triadic interaction network. These individual-based behaviors are based on individual reactions, and their analysis can shed light on the formation of the affiliative networks determining ultimate coalition networks, and how these networks may evolve over time. A focus on individual behaviors is necessary for a global interactional approach to understanding social behavior rules and strategies. When combined, these social processes could make animal social networks more resilient, thus enabling them to face drastic environmental changes. This is the first study to pinpoint some of the processes underlying the formation of a social structure in a non-human primate species, and identify common mechanisms with humans. The approach used in this study provides an ideal tool for further research seeking to answer long-standing questions about social network dynamics. © 2017 Wiley Periodicals, Inc.

A DNA network as an information processing system.

PubMed

Santini, Cristina Costa; Bath, Jonathan; Turberfield, Andrew J; Tyrrell, Andy M

2012-01-01

Biomolecular systems that can process information are sought for computational applications, because of their potential for parallelism and miniaturization and because their biocompatibility also makes them suitable for future biomedical applications. DNA has been used to design machines, motors, finite automata, logic gates, reaction networks and logic programs, amongst many other structures and dynamic behaviours. Here we design and program a synthetic DNA network to implement computational paradigms abstracted from cellular regulatory networks. These show information processing properties that are desirable in artificial, engineered molecular systems, including robustness of the output in relation to different sources of variation. We show the results of numerical simulations of the dynamic behaviour of the network and preliminary experimental analysis of its main components.

Containment control of networked autonomous underwater vehicles: A predictor-based neural DSC design.

PubMed

Peng, Zhouhua; Wang, Dan; Wang, Wei; Liu, Lu

2015-11-01

This paper investigates the containment control problem of networked autonomous underwater vehicles in the presence of model uncertainty and unknown ocean disturbances. A predictor-based neural dynamic surface control design method is presented to develop the distributed adaptive containment controllers, under which the trajectories of follower vehicles nearly converge to the dynamic convex hull spanned by multiple reference trajectories over a directed network. Prediction errors, rather than tracking errors, are used to update the neural adaptation laws, which are independent of the tracking error dynamics, resulting in two time-scales to govern the entire system. The stability property of the closed-loop network is established via Lyapunov analysis, and transient property is quantified in terms of L2 norms of the derivatives of neural weights, which are shown to be smaller than the classical neural dynamic surface control approach. Comparative studies are given to show the substantial improvements of the proposed new method. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Neural networks with excitatory and inhibitory components: Direct and inverse problems by a mean-field approach

NASA Astrophysics Data System (ADS)

di Volo, Matteo; Burioni, Raffaella; Casartelli, Mario; Livi, Roberto; Vezzani, Alessandro

2016-01-01

We study the dynamics of networks with inhibitory and excitatory leak-integrate-and-fire neurons with short-term synaptic plasticity in the presence of depressive and facilitating mechanisms. The dynamics is analyzed by a heterogeneous mean-field approximation, which allows us to keep track of the effects of structural disorder in the network. We describe the complex behavior of different classes of excitatory and inhibitory components, which give rise to a rich dynamical phase diagram as a function of the fraction of inhibitory neurons. Using the same mean-field approach, we study and solve a global inverse problem: reconstructing the degree probability distributions of the inhibitory and excitatory components and the fraction of inhibitory neurons from the knowledge of the average synaptic activity field. This approach unveils new perspectives on the numerical study of neural network dynamics and the possibility of using these models as a test bed for the analysis of experimental data.

Modular analysis of biological networks.

PubMed

Kaltenbach, Hans-Michael; Stelling, Jörg

2012-01-01

The analysis of complex biological networks has traditionally relied on decomposition into smaller, semi-autonomous units such as individual signaling pathways. With the increased scope of systems biology (models), rational approaches to modularization have become an important topic. With increasing acceptance of de facto modularity in biology, widely different definitions of what constitutes a module have sparked controversies. Here, we therefore review prominent classes of modular approaches based on formal network representations. Despite some promising research directions, several important theoretical challenges remain open on the way to formal, function-centered modular decompositions for dynamic biological networks.

Dynamics of global supply chain and electric power networks: Models, pricing analysis, and computations

NASA Astrophysics Data System (ADS)

Matsypura, Dmytro

In this dissertation, I develop a new theoretical framework for the modeling, pricing analysis, and computation of solutions to electric power supply chains with power generators, suppliers, transmission service providers, and the inclusion of consumer demands. In particular, I advocate the application of finite-dimensional variational inequality theory, projected dynamical systems theory, game theory, network theory, and other tools that have been recently proposed for the modeling and analysis of supply chain networks (cf. Nagurney (2006)) to electric power markets. This dissertation contributes to the extant literature on the modeling, analysis, and solution of supply chain networks, including global supply chains, in general, and electric power supply chains, in particular, in the following ways. It develops a theoretical framework for modeling, pricing analysis, and computation of electric power flows/transactions in electric power systems using the rationale for supply chain analysis. The models developed include both static and dynamic ones. The dissertation also adds a new dimension to the methodology of the theory of projected dynamical systems by proving that, irrespective of the speeds of adjustment, the equilibrium of the system remains the same. Finally, I include alternative fuel suppliers, along with their behavior into the supply chain modeling and analysis framework. This dissertation has strong practical implications. In an era in which technology and globalization, coupled with increasing risk and uncertainty, complicate electricity demand and supply within and between nations, the successful management of electric power systems and pricing become increasingly pressing topics with relevance not only for economic prosperity but also national security. This dissertation addresses such related topics by providing models, pricing tools, and algorithms for decentralized electric power supply chains. This dissertation is based heavily on the following coauthored papers: Nagurney, Cruz, and Matsypura (2003), Nagurney and Matsypura (2004, 2005, 2006), Matsypura and Nagurney (2005), Matsypura, Nagurney, and Liu (2006).

Dancing through Life: Molecular Dynamics Simulations and Network-Centric Modeling of Allosteric Mechanisms in Hsp70 and Hsp110 Chaperone Proteins.

PubMed

Stetz, Gabrielle; Verkhivker, Gennady M

2015-01-01

Hsp70 and Hsp110 chaperones play an important role in regulating cellular processes that involve protein folding and stabilization, which are essential for the integrity of signaling networks. Although many aspects of allosteric regulatory mechanisms in Hsp70 and Hsp110 chaperones have been extensively studied and significantly advanced in recent experimental studies, the atomistic picture of signal propagation and energetics of dynamics-based communication still remain unresolved. In this work, we have combined molecular dynamics simulations and protein stability analysis of the chaperone structures with the network modeling of residue interaction networks to characterize molecular determinants of allosteric mechanisms. We have shown that allosteric mechanisms of Hsp70 and Hsp110 chaperones may be primarily determined by nucleotide-induced redistribution of local conformational ensembles in the inter-domain regions and the substrate binding domain. Conformational dynamics and energetics of the peptide substrate binding with the Hsp70 structures has been analyzed using free energy calculations, revealing allosteric hotspots that control negative cooperativity between regulatory sites. The results have indicated that cooperative interactions may promote a population-shift mechanism in Hsp70, in which functional residues are organized in a broad and robust allosteric network that can link the nucleotide-binding site and the substrate-binding regions. A smaller allosteric network in Hsp110 structures may elicit an entropy-driven allostery that occurs in the absence of global structural changes. We have found that global mediating residues with high network centrality may be organized in stable local communities that are indispensable for structural stability and efficient allosteric communications. The network-centric analysis of allosteric interactions has also established that centrality of functional residues could correlate with their sensitivity to mutations across diverse chaperone functions. This study reconciles a wide spectrum of structural and functional experiments by demonstrating how integration of molecular simulations and network-centric modeling may explain thermodynamic and mechanistic aspects of allosteric regulation in chaperones.

Dancing through Life: Molecular Dynamics Simulations and Network-Centric Modeling of Allosteric Mechanisms in Hsp70 and Hsp110 Chaperone Proteins

PubMed Central

Stetz, Gabrielle; Verkhivker, Gennady M.

2015-01-01

Hsp70 and Hsp110 chaperones play an important role in regulating cellular processes that involve protein folding and stabilization, which are essential for the integrity of signaling networks. Although many aspects of allosteric regulatory mechanisms in Hsp70 and Hsp110 chaperones have been extensively studied and significantly advanced in recent experimental studies, the atomistic picture of signal propagation and energetics of dynamics-based communication still remain unresolved. In this work, we have combined molecular dynamics simulations and protein stability analysis of the chaperone structures with the network modeling of residue interaction networks to characterize molecular determinants of allosteric mechanisms. We have shown that allosteric mechanisms of Hsp70 and Hsp110 chaperones may be primarily determined by nucleotide-induced redistribution of local conformational ensembles in the inter-domain regions and the substrate binding domain. Conformational dynamics and energetics of the peptide substrate binding with the Hsp70 structures has been analyzed using free energy calculations, revealing allosteric hotspots that control negative cooperativity between regulatory sites. The results have indicated that cooperative interactions may promote a population-shift mechanism in Hsp70, in which functional residues are organized in a broad and robust allosteric network that can link the nucleotide-binding site and the substrate-binding regions. A smaller allosteric network in Hsp110 structures may elicit an entropy-driven allostery that occurs in the absence of global structural changes. We have found that global mediating residues with high network centrality may be organized in stable local communities that are indispensable for structural stability and efficient allosteric communications. The network-centric analysis of allosteric interactions has also established that centrality of functional residues could correlate with their sensitivity to mutations across diverse chaperone functions. This study reconciles a wide spectrum of structural and functional experiments by demonstrating how integration of molecular simulations and network-centric modeling may explain thermodynamic and mechanistic aspects of allosteric regulation in chaperones. PMID:26619280

Dynamic self-guiding analysis of Alzheimer's disease

PubMed Central

Kurakin, Alexei; Bredesen, Dale E.

2015-01-01

We applied a self-guiding evolutionary algorithm to initiate the synthesis of the Alzheimer's disease-related data and literature. A protein interaction network associated with amyloid-beta precursor protein (APP) and a seed model that treats Alzheimer's disease as progressive dysregulation of APP-associated signaling were used as dynamic “guides” and structural “filters” in the recursive search, analysis, and assimilation of data to drive the evolution of the seed model in size, detail, and complexity. Analysis of data and literature across sub-disciplines and system-scale discovery platforms suggests a key role of dynamic cytoskeletal connectivity in the stability, plasticity, and performance of multicellular networks and architectures. Chronic impairment and/or dysregulation of cell adhesions/synapses, cytoskeletal networks, and/or reversible epithelial-to-mesenchymal-like transitions, which enable and mediate the stable and coherent yet dynamic and reconfigurable multicellular architectures, may lead to the emergence and persistence of the disordered, wound-like pockets/microenvironments of chronically disconnected cells. Such wound-like microenvironments support and are supported by pro-inflammatory, pro-secretion, de-differentiated cellular phenotypes with altered metabolism and signaling. The co-evolution of wound-like microenvironments and their inhabitants may lead to the selection and stabilization of degenerated cellular phenotypes, via acquisition of epigenetic modifications and mutations, which eventually result in degenerative disorders such as cancer and Alzheimer's disease. PMID:26041885

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.

The College Football Student-Athlete's Academic Experience: Network Analysis and Model Development

ERIC Educational Resources Information Center

Young, Kyle McLendon

2010-01-01

A grounded theory research study employing network analysis as a means of facilitating the latter stages of the coding process was conducted at a selective university that competes at the highest level of college football. The purpose of the study was to develop a better understanding of how interactive dynamics and controlling mechanisms, such as…

Dynamic Connectivity between Brain Networks Supports Working Memory: Relationships to Dopamine Release and Schizophrenia.

PubMed

Cassidy, Clifford M; Van Snellenberg, Jared X; Benavides, Caridad; Slifstein, Mark; Wang, Zhishun; Moore, Holly; Abi-Dargham, Anissa; Horga, Guillermo

2016-04-13

Connectivity between brain networks may adapt flexibly to cognitive demand, a process that could underlie adaptive behaviors and cognitive deficits, such as those observed in neuropsychiatric conditions like schizophrenia. Dopamine signaling is critical for working memory but its influence on internetwork connectivity is relatively unknown. We addressed these questions in healthy humans using functional magnetic resonance imaging (during ann-back working-memory task) and positron emission tomography using the radiotracer [(11)C]FLB457 before and after amphetamine to measure the capacity for dopamine release in extrastriatal brain regions. Brain networks were defined by spatial independent component analysis (ICA) and working-memory-load-dependent connectivity between task-relevant pairs of networks was determined via a modified psychophysiological interaction analysis. For most pairs of task-relevant networks, connectivity significantly changed as a function of working-memory load. Moreover, load-dependent changes in connectivity between left and right frontoparietal networks (Δ connectivity lFPN-rFPN) predicted interindividual differences in task performance more accurately than other fMRI and PET imaging measures. Δ Connectivity lFPN-rFPN was not related to cortical dopamine release capacity. A second study in unmedicated patients with schizophrenia showed no abnormalities in load-dependent connectivity but showed a weaker relationship between Δ connectivity lFPN-rFPN and working memory performance in patients compared with matched healthy individuals. Poor working memory performance in patients was, in contrast, related to deficient cortical dopamine release. Our findings indicate that interactions between brain networks dynamically adapt to fluctuating environmental demands. These dynamic adaptations underlie successful working memory performance in healthy individuals and are not well predicted by amphetamine-induced dopamine release capacity. It is unclear how communication between brain networks responds to changing environmental demands during complex cognitive processes. Also, unknown in regard to these network dynamics is the role of neuromodulators, such as dopamine, and whether their dysregulation could underlie cognitive deficits in neuropsychiatric illness. We found that connectivity between brain networks changes with working-memory load and greater increases predict better working memory performance; however, it was not related to capacity for dopamine release in the cortex. Patients with schizophrenia did show dynamic internetwork connectivity; however, this was more weakly associated with successful performance in patients compared with healthy individuals. Our findings indicate that dynamic interactions between brain networks may support the type of flexible adaptations essential to goal-directed behavior. Copyright © 2016 the authors 0270-6474/16/364378-12$15.00/0.

Dynamic Connectivity between Brain Networks Supports Working Memory: Relationships to Dopamine Release and Schizophrenia

PubMed Central

Van Snellenberg, Jared X.; Benavides, Caridad; Slifstein, Mark; Wang, Zhishun; Moore, Holly; Abi-Dargham, Anissa

2016-01-01

Connectivity between brain networks may adapt flexibly to cognitive demand, a process that could underlie adaptive behaviors and cognitive deficits, such as those observed in neuropsychiatric conditions like schizophrenia. Dopamine signaling is critical for working memory but its influence on internetwork connectivity is relatively unknown. We addressed these questions in healthy humans using functional magnetic resonance imaging (during an n-back working-memory task) and positron emission tomography using the radiotracer [11C]FLB457 before and after amphetamine to measure the capacity for dopamine release in extrastriatal brain regions. Brain networks were defined by spatial independent component analysis (ICA) and working-memory-load-dependent connectivity between task-relevant pairs of networks was determined via a modified psychophysiological interaction analysis. For most pairs of task-relevant networks, connectivity significantly changed as a function of working-memory load. Moreover, load-dependent changes in connectivity between left and right frontoparietal networks (Δ connectivity lFPN-rFPN) predicted interindividual differences in task performance more accurately than other fMRI and PET imaging measures. Δ Connectivity lFPN-rFPN was not related to cortical dopamine release capacity. A second study in unmedicated patients with schizophrenia showed no abnormalities in load-dependent connectivity but showed a weaker relationship between Δ connectivity lFPN-rFPN and working memory performance in patients compared with matched healthy individuals. Poor working memory performance in patients was, in contrast, related to deficient cortical dopamine release. Our findings indicate that interactions between brain networks dynamically adapt to fluctuating environmental demands. These dynamic adaptations underlie successful working memory performance in healthy individuals and are not well predicted by amphetamine-induced dopamine release capacity. SIGNIFICANCE STATEMENT It is unclear how communication between brain networks responds to changing environmental demands during complex cognitive processes. Also, unknown in regard to these network dynamics is the role of neuromodulators, such as dopamine, and whether their dysregulation could underlie cognitive deficits in neuropsychiatric illness. We found that connectivity between brain networks changes with working-memory load and greater increases predict better working memory performance; however, it was not related to capacity for dopamine release in the cortex. Patients with schizophrenia did show dynamic internetwork connectivity; however, this was more weakly associated with successful performance in patients compared with healthy individuals. Our findings indicate that dynamic interactions between brain networks may support the type of flexible adaptations essential to goal-directed behavior. PMID:27076432

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.

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.

Network Approach to Understanding Emotion Dynamics in Relation to Childhood Trauma and Genetic Liability to Psychopathology: Replication of a Prospective Experience Sampling Analysis

PubMed Central

Hasmi, Laila; Drukker, Marjan; Guloksuz, Sinan; Menne-Lothmann, Claudia; Decoster, Jeroen; van Winkel, Ruud; Collip, Dina; Delespaul, Philippe; De Hert, Marc; Derom, Catherine; Thiery, Evert; Jacobs, Nele; Rutten, Bart P. F.; Wichers, Marieke; van Os, Jim

2017-01-01

Background: The network analysis of intensive time series data collected using the Experience Sampling Method (ESM) may provide vital information in gaining insight into the link between emotion regulation and vulnerability to psychopathology. The aim of this study was to apply the network approach to investigate whether genetic liability (GL) to psychopathology and childhood trauma (CT) are associated with the network structure of the emotions “cheerful,” “insecure,” “relaxed,” “anxious,” “irritated,” and “down”—collected using the ESM method. Methods: Using data from a population-based sample of twin pairs and siblings (704 individuals), we examined whether momentary emotion network structures differed across strata of CT and GL. GL was determined empirically using the level of psychopathology in monozygotic and dizygotic co-twins. Network models were generated using multilevel time-lagged regression analysis and were compared across three strata (low, medium, and high) of CT and GL, respectively. Permutations were utilized to calculate p values and compare regressions coefficients, density, and centrality indices. Regression coefficients were presented as connections, while variables represented the nodes in the network. Results: In comparison to the low GL stratum, the high GL stratum had significantly denser overall (p = 0.018) and negative affect network density (p < 0.001). The medium GL stratum also showed a directionally similar (in-between high and low GL strata) but statistically inconclusive association with network density. In contrast to GL, the results of the CT analysis were less conclusive, with increased positive affect density (p = 0.021) and overall density (p = 0.042) in the high CT stratum compared to the medium CT stratum but not to the low CT stratum. The individual node comparisons across strata of GL and CT yielded only very few significant results, after adjusting for multiple testing. Conclusions: The present findings demonstrate that the network approach may have some value in understanding the relation between established risk factors for mental disorders (particularly GL) and the dynamic interplay between emotions. The present finding partially replicates an earlier analysis, suggesting it may be instructive to model negative emotional dynamics as a function of genetic influence. PMID:29163289

Higher Dimensional Meta-State Analysis Reveals Reduced Resting fMRI Connectivity Dynamism in Schizophrenia Patients.

PubMed

Miller, Robyn L; Yaesoubi, Maziar; Turner, Jessica A; Mathalon, Daniel; Preda, Adrian; Pearlson, Godfrey; Adali, Tulay; Calhoun, Vince D

2016-01-01

Resting-state functional brain imaging studies of network connectivity have long assumed that functional connections are stationary on the timescale of a typical scan. Interest in moving beyond this simplifying assumption has emerged only recently. The great hope is that training the right lens on time-varying properties of whole-brain network connectivity will shed additional light on previously concealed brain activation patterns characteristic of serious neurological or psychiatric disorders. We present evidence that multiple explicitly dynamical properties of time-varying whole-brain network connectivity are strongly associated with schizophrenia, a complex mental illness whose symptomatic presentation can vary enormously across subjects. As with so much brain-imaging research, a central challenge for dynamic network connectivity lies in determining transformations of the data that both reduce its dimensionality and expose features that are strongly predictive of important population characteristics. Our paper introduces an elegant, simple method of reducing and organizing data around which a large constellation of mutually informative and intuitive dynamical analyses can be performed. This framework combines a discrete multidimensional data-driven representation of connectivity space with four core dynamism measures computed from large-scale properties of each subject's trajectory, ie., properties not identifiable with any specific moment in time and therefore reasonable to employ in settings lacking inter-subject time-alignment, such as resting-state functional imaging studies. Our analysis exposes pronounced differences between schizophrenia patients (Nsz = 151) and healthy controls (Nhc = 163). Time-varying whole-brain network connectivity patterns are found to be markedly less dynamically active in schizophrenia patients, an effect that is even more pronounced in patients with high levels of hallucinatory behavior. To the best of our knowledge this is the first demonstration that high-level dynamic properties of whole-brain connectivity, generic enough to be commensurable under many decompositions of time-varying connectivity data, exhibit robust and systematic differences between schizophrenia patients and healthy controls.

Higher Dimensional Meta-State Analysis Reveals Reduced Resting fMRI Connectivity Dynamism in Schizophrenia Patients

PubMed Central

Miller, Robyn L.; Yaesoubi, Maziar; Turner, Jessica A.; Mathalon, Daniel; Preda, Adrian; Pearlson, Godfrey; Adali, Tulay; Calhoun, Vince D.

2016-01-01

Resting-state functional brain imaging studies of network connectivity have long assumed that functional connections are stationary on the timescale of a typical scan. Interest in moving beyond this simplifying assumption has emerged only recently. The great hope is that training the right lens on time-varying properties of whole-brain network connectivity will shed additional light on previously concealed brain activation patterns characteristic of serious neurological or psychiatric disorders. We present evidence that multiple explicitly dynamical properties of time-varying whole-brain network connectivity are strongly associated with schizophrenia, a complex mental illness whose symptomatic presentation can vary enormously across subjects. As with so much brain-imaging research, a central challenge for dynamic network connectivity lies in determining transformations of the data that both reduce its dimensionality and expose features that are strongly predictive of important population characteristics. Our paper introduces an elegant, simple method of reducing and organizing data around which a large constellation of mutually informative and intuitive dynamical analyses can be performed. This framework combines a discrete multidimensional data-driven representation of connectivity space with four core dynamism measures computed from large-scale properties of each subject’s trajectory, ie., properties not identifiable with any specific moment in time and therefore reasonable to employ in settings lacking inter-subject time-alignment, such as resting-state functional imaging studies. Our analysis exposes pronounced differences between schizophrenia patients (Nsz = 151) and healthy controls (Nhc = 163). Time-varying whole-brain network connectivity patterns are found to be markedly less dynamically active in schizophrenia patients, an effect that is even more pronounced in patients with high levels of hallucinatory behavior. To the best of our knowledge this is the first demonstration that high-level dynamic properties of whole-brain connectivity, generic enough to be commensurable under many decompositions of time-varying connectivity data, exhibit robust and systematic differences between schizophrenia patients and healthy controls. PMID:26981625

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

NASA Astrophysics Data System (ADS)

Srivastava, Abhinav; Debnath, Ananya

2018-03-01

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

Design and Analysis of a Dynamic Mobility Management Scheme for Wireless Mesh Network

PubMed Central

Roy, Sudipta

2013-01-01

Seamless mobility management of the mesh clients (MCs) in wireless mesh network (WMN) has drawn a lot of attention from the research community. A number of mobility management schemes such as mesh network with mobility management (MEMO), mesh mobility management (M3), and wireless mesh mobility management (WMM) have been proposed. The common problem with these schemes is that they impose uniform criteria on all the MCs for sending route update message irrespective of their distinct characteristics. This paper proposes a session-to-mobility ratio (SMR) based dynamic mobility management scheme for handling both internet and intranet traffic. To reduce the total communication cost, this scheme considers each MC's session and mobility characteristics by dynamically determining optimal threshold SMR value for each MC. A numerical analysis of the proposed scheme has been carried out. Comparison with other schemes shows that the proposed scheme outperforms MEMO, M3, and WMM with respect to total cost. PMID:24311982

Adaptive Synchronization of Fractional Order Complex-Variable Dynamical Networks via Pinning Control

NASA Astrophysics Data System (ADS)

Ding, Da-Wei; Yan, Jie; Wang, Nian; Liang, Dong

2017-09-01

In this paper, the synchronization of fractional order complex-variable dynamical networks is studied using an adaptive pinning control strategy based on close center degree. Some effective criteria for global synchronization of fractional order complex-variable dynamical networks are derived based on the Lyapunov stability theory. From the theoretical analysis, one concludes that under appropriate conditions, the complex-variable dynamical networks can realize the global synchronization by using the proper adaptive pinning control method. Meanwhile, we succeed in solving the problem about how much coupling strength should be applied to ensure the synchronization of the fractional order complex networks. Therefore, compared with the existing results, the synchronization method in this paper is more general and convenient. This result extends the synchronization condition of the real-variable dynamical networks to the complex-valued field, which makes our research more practical. Finally, two simulation examples show that the derived theoretical results are valid and the proposed adaptive pinning method is effective. Supported by National Natural Science Foundation of China under Grant No. 61201227, National Natural Science Foundation of China Guangdong Joint Fund under Grant No. U1201255, the Natural Science Foundation of Anhui Province under Grant No. 1208085MF93, 211 Innovation Team of Anhui University under Grant Nos. KJTD007A and KJTD001B, and also supported by Chinese Scholarship Council

EEGNET: An Open Source Tool for Analyzing and Visualizing M/EEG Connectome.

PubMed

Hassan, Mahmoud; Shamas, Mohamad; Khalil, Mohamad; El Falou, Wassim; Wendling, Fabrice

2015-01-01

The brain is a large-scale complex network often referred to as the "connectome". Exploring the dynamic behavior of the connectome is a challenging issue as both excellent time and space resolution is required. In this context Magneto/Electroencephalography (M/EEG) are effective neuroimaging techniques allowing for analysis of the dynamics of functional brain networks at scalp level and/or at reconstructed sources. However, a tool that can cover all the processing steps of identifying brain networks from M/EEG data is still missing. In this paper, we report a novel software package, called EEGNET, running under MATLAB (Math works, inc), and allowing for analysis and visualization of functional brain networks from M/EEG recordings. EEGNET is developed to analyze networks either at the level of scalp electrodes or at the level of reconstructed cortical sources. It includes i) Basic steps in preprocessing M/EEG signals, ii) the solution of the inverse problem to localize / reconstruct the cortical sources, iii) the computation of functional connectivity among signals collected at surface electrodes or/and time courses of reconstructed sources and iv) the computation of the network measures based on graph theory analysis. EEGNET is the unique tool that combines the M/EEG functional connectivity analysis and the computation of network measures derived from the graph theory. The first version of EEGNET is easy to use, flexible and user friendly. EEGNET is an open source tool and can be freely downloaded from this webpage: https://sites.google.com/site/eegnetworks/.

EEGNET: An Open Source Tool for Analyzing and Visualizing M/EEG Connectome

PubMed Central

Hassan, Mahmoud; Shamas, Mohamad; Khalil, Mohamad; El Falou, Wassim; Wendling, Fabrice

2015-01-01

The brain is a large-scale complex network often referred to as the “connectome”. Exploring the dynamic behavior of the connectome is a challenging issue as both excellent time and space resolution is required. In this context Magneto/Electroencephalography (M/EEG) are effective neuroimaging techniques allowing for analysis of the dynamics of functional brain networks at scalp level and/or at reconstructed sources. However, a tool that can cover all the processing steps of identifying brain networks from M/EEG data is still missing. In this paper, we report a novel software package, called EEGNET, running under MATLAB (Math works, inc), and allowing for analysis and visualization of functional brain networks from M/EEG recordings. EEGNET is developed to analyze networks either at the level of scalp electrodes or at the level of reconstructed cortical sources. It includes i) Basic steps in preprocessing M/EEG signals, ii) the solution of the inverse problem to localize / reconstruct the cortical sources, iii) the computation of functional connectivity among signals collected at surface electrodes or/and time courses of reconstructed sources and iv) the computation of the network measures based on graph theory analysis. EEGNET is the unique tool that combines the M/EEG functional connectivity analysis and the computation of network measures derived from the graph theory. The first version of EEGNET is easy to use, flexible and user friendly. EEGNET is an open source tool and can be freely downloaded from this webpage: https://sites.google.com/site/eegnetworks/. PMID:26379232

Smoking Behavior and Friendship Formation: The Importance of Time Heterogeneity in Studying Social Network Dynamics

DTIC Science & Technology

2010-01-01

Smoking Behavior and Friendship Formation: The Importance of Time Heterogeneity in Studying Social Network Dynamics Joshua A. Lospinoso Department of...djsatchell@gmail.com Abstract—This study illustrates the importance of assessing and accounting for time heterogeneity in longitudinal social net- work...analysis. We apply the time heterogeneity model selection procedure of [1] to a dataset collected on social tie formation for university freshman in the

Vehicle dynamic analysis using neuronal network algorithms

NASA Astrophysics Data System (ADS)

Oloeriu, Florin; Mocian, Oana

2014-06-01

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

Dynamic Synchronization of Teacher-Students Affection in Affective Instruction

ERIC Educational Resources Information Center

Zhang, Wenhai; Lu, Jiamei

2011-01-01

Based on Bower's affective network theory, the article links the dynamic analysis of affective factors in affective instruction, and presents affective instruction strategic of dynamic synchronization between teacher and students to implement the best ideal mood that promotes students' cognition and affection together. In the process of teaching,…

Social Sensor Analytics: Making Sense of Network Models in Social Media

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

Dowling, Chase P.; Harrison, Joshua J.; Sathanur, Arun V.

Social networks can be thought of as noisy sensor networks mapping real world information to the web. Owing to the extensive body of literature in sensor network analysis, this work sought to apply several novel and traditional methods in sensor network analysis for the purposes of efficiently interrogating social media data streams from raw data. We carefully revisit our definition of a social media signal from previous work both in terms of time-varying features within the data and the networked nature of the medium. Further, we detail our analysis of global patterns in Twitter over the months of November 2013more » and June 2014, detect and categorize events, and illustrate how these analyses can be used to inform graph-based models of Twitter, namely using a recent network influence model called PhySense: similar to PageRank but tuned to behavioral analysis by leveraging a sociologically inspired probabilistic model. We ultimately identify forms of information dissemination via analysis of time series and dynamic graph spectra and corroborate these findings through manual investigation of the data as a requisite step in modeling the diffusion process with PhySense. We hope to sufficiently characterize global behavior in a medium such as Twitter as a means of learning global model parameters one may use to predict or simulate behavior on a large scale. We have made our time series and dynamic graph analytical code available via a GitHub repository https://github.com/cpatdowling/salsa and our data are available upon request.« less

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

A natural experiment of social network formation and dynamics.

PubMed

Phan, Tuan Q; Airoldi, Edoardo M

2015-05-26

Social networks affect many aspects of life, including the spread of diseases, the diffusion of information, the workers' productivity, and consumers' behavior. Little is known, however, about how these networks form and change. Estimating causal effects and mechanisms that drive social network formation and dynamics is challenging because of the complexity of engineering social relations in a controlled environment, endogeneity between network structure and individual characteristics, and the lack of time-resolved data about individuals' behavior. We leverage data from a sample of 1.5 million college students on Facebook, who wrote more than 630 million messages and 590 million posts over 4 years, to design a long-term natural experiment of friendship formation and social dynamics in the aftermath of a natural disaster. The analysis shows that affected individuals are more likely to strengthen interactions, while maintaining the same number of friends as unaffected individuals. Our findings suggest that the formation of social relationships may serve as a coping mechanism to deal with high-stress situations and build resilience in communities.

A natural experiment of social network formation and dynamics

PubMed Central

Phan, Tuan Q.; Airoldi, Edoardo M.

2015-01-01

Social networks affect many aspects of life, including the spread of diseases, the diffusion of information, the workers' productivity, and consumers' behavior. Little is known, however, about how these networks form and change. Estimating causal effects and mechanisms that drive social network formation and dynamics is challenging because of the complexity of engineering social relations in a controlled environment, endogeneity between network structure and individual characteristics, and the lack of time-resolved data about individuals' behavior. We leverage data from a sample of 1.5 million college students on Facebook, who wrote more than 630 million messages and 590 million posts over 4 years, to design a long-term natural experiment of friendship formation and social dynamics in the aftermath of a natural disaster. The analysis shows that affected individuals are more likely to strengthen interactions, while maintaining the same number of friends as unaffected individuals. Our findings suggest that the formation of social relationships may serve as a coping mechanism to deal with high-stress situations and build resilience in communities. PMID:25964337

Network structure of SiO2 and MgSiO3 in amorphous and liquid States

NASA Astrophysics Data System (ADS)

Lan, Mai Thi; Thuy Duong, Tran; Viet Huy, Nguyen; Van Hong, Nguyen

2017-03-01

Network structure of SiO2 and MgSiO3 at 300 K and 3200 K is investigated by molecular dynamics simulation and visualization of simulation data. Structural organization of SiO2 and MgSiO3 is clarified via analysis the short range order (SRO) and intermediate range order (IRO). Network topology is determined via analyzing the bond between structural units, the cluster of structural units as well as spatial distribution of structural units. The polyamorphism as well as structural and dynamic heterogeneities are also discussed in this work.

Mutation-induced protein interaction kinetics changes affect apoptotic network dynamic properties and facilitate oncogenesis

PubMed Central

Zhao, Linjie; Sun, Tanlin; Pei, Jianfeng; Ouyang, Qi

2015-01-01

It has been a consensus in cancer research that cancer is a disease caused primarily by genomic alterations, especially somatic mutations. However, the mechanism of mutation-induced oncogenesis is not fully understood. Here, we used the mitochondrial apoptotic pathway as a case study and performed a systematic analysis of integrating pathway dynamics with protein interaction kinetics to quantitatively investigate the causal molecular mechanism of mutation-induced oncogenesis. A mathematical model of the regulatory network was constructed to establish the functional role of dynamic bifurcation in the apoptotic process. The oncogenic mutation enrichment of each of the protein functional domains involved was found strongly correlated with the parameter sensitivity of the bifurcation point. We further dissected the causal mechanism underlying this correlation by evaluating the mutational influence on protein interaction kinetics using molecular dynamics simulation. We analyzed 29 matched mutant–wild-type and 16 matched SNP—wild-type protein systems. We found that the binding kinetics changes reflected by the changes of free energy changes induced by protein interaction mutations, which induce variations in the sensitive parameters of the bifurcation point, were a major cause of apoptosis pathway dysfunction, and mutations involved in sensitive interaction domains show high oncogenic potential. Our analysis provided a molecular basis for connecting protein mutations, protein interaction kinetics, network dynamics properties, and physiological function of a regulatory network. These insights provide a framework for coupling mutation genotype to tumorigenesis phenotype and help elucidate the logic of cancer initiation. PMID:26170328

Coupled disease-behavior dynamics on complex networks: A review

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Cluster analysis of word frequency dynamics

NASA Astrophysics Data System (ADS)

Maslennikova, Yu S.; Bochkarev, V. V.; Belashova, I. A.

2015-01-01

This paper describes the analysis and modelling of word usage frequency time series. During one of previous studies, an assumption was put forward that all word usage frequencies have uniform dynamics approaching the shape of a Gaussian function. This assumption can be checked using the frequency dictionaries of the Google Books Ngram database. This database includes 5.2 million books published between 1500 and 2008. The corpus contains over 500 billion words in American English, British English, French, German, Spanish, Russian, Hebrew, and Chinese. We clustered time series of word usage frequencies using a Kohonen neural network. The similarity between input vectors was estimated using several algorithms. As a result of the neural network training procedure, more than ten different forms of time series were found. They describe the dynamics of word usage frequencies from birth to death of individual words. Different groups of word forms were found to have different dynamics of word usage frequency variations.

Detecting malicious chaotic signals in wireless sensor network

NASA Astrophysics Data System (ADS)

Upadhyay, Ranjit Kumar; Kumari, Sangeeta

2018-02-01

In this paper, an e-epidemic Susceptible-Infected-Vaccinated (SIV) model has been proposed to analyze the effect of node immunization and worms attacking dynamics in wireless sensor network. A modified nonlinear incidence rate with cyrtoid type functional response has been considered using sleep and active mode approach. Detailed stability analysis and the sufficient criteria for the persistence of the model system have been established. We also established different types of bifurcation analysis for different equilibria at different critical points of the control parameters. We performed a detailed Hopf bifurcation analysis and determine the direction and stability of the bifurcating periodic solutions using center manifold theorem. Numerical simulations are carried out to confirm the theoretical results. The impact of the control parameters on the dynamics of the model system has been investigated and malicious chaotic signals are detected. Finally, we have analyzed the effect of time delay on the dynamics of the model system.

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.

An emergency-adaptive routing scheme for wireless sensor networks for building fire hazard monitoring.

PubMed

Zeng, Yuanyuan; Sreenan, Cormac J; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

2011-01-01

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

PubMed Central

Zeng, Yuanyuan; Sreenan, Cormac J.; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

2011-01-01

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work. PMID:22163774

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.

Molecular inspired models for prediction and control of directional FSO/RF wireless networks

NASA Astrophysics Data System (ADS)

Llorca, Jaime; Milner, Stuart D.; Davis, Christopher C.

2010-08-01

Directional wireless networks using FSO and RF transmissions provide wireless backbone support for mobile communications in dynamic environments. The heterogeneous and dynamic nature of such networks challenges their robustness and requires self-organization mechanisms to assure end-to-end broadband connectivity. We developed a framework based on the definition of a potential energy function to characterize robustness in communication networks and the study of first and second order variations of the potential energy to provide prediction and control strategies for network performance optimization. In this paper, we present non-convex molecular potentials such as the Morse Potential, used to describe the potential energy of bonds within molecules, for the characterization of communication links in the presence of physical constraints such as the power available at the network nodes. The inclusion of the Morse Potential translates into adaptive control strategies where forces on network nodes drive the release, retention or reconfiguration of communication links for network performance optimization. Simulation results show the effectiveness of our self-organized control mechanism, where the physical topology reorganizes to maximize the number of source to destination communicating pairs. Molecular Normal Mode Analysis (NMA) techniques for assessing network performance degradation in dynamic networks are also presented. Preliminary results show correlation between peaks in the eigenvalues of the Hessian of the network potential and network degradation.

A transcriptional dynamic network during Arabidopsis thaliana pollen development.

PubMed

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

2011-01-01

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

Coupled dynamics analysis of wind energy systems

NASA Technical Reports Server (NTRS)

Hoffman, J. A.

1977-01-01

A qualitative description of all key elements of a complete wind energy system computer analysis code is presented. The analysis system addresses the coupled dynamics characteristics of wind energy systems, including the interactions of the rotor, tower, nacelle, power train, control system, and electrical network. The coupled dynamics are analyzed in both the frequency and time domain to provide the basic motions and loads data required for design, performance verification and operations analysis activities. Elements of the coupled analysis code were used to design and analyze candidate rotor articulation concepts. Fundamental results and conclusions derived from these studies are presented.

Stochastic Simulation of Biomolecular Networks in Dynamic Environments

PubMed Central

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

2016-01-01

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

Classification of epilepsy types through global network analysis of scalp electroencephalograms

NASA Astrophysics Data System (ADS)

Lee, Uncheol; Kim, Seunghwan; Jung, Ki-Young

2006-04-01

Epilepsy is a dynamic disease in which self-organization and emergent structures occur dynamically at multiple levels of neuronal integration. Therefore, the transient relationship within multichannel electroencephalograms (EEGs) is crucial for understanding epileptic processes. In this paper, we show that the global relationship within multichannel EEGs provides us with more useful information in classifying two different epilepsy types than pairwise relationships such as cross correlation. To demonstrate this, we determine the global network structure within channels of the scalp EEG based on the minimum spanning tree method. The topological dissimilarity of the network structures from different types of temporal lobe epilepsy is described in the form of the divergence rate and is computed for 11 patients with left (LTLE) and right temporal lobe epilepsy (RTLE). We find that patients with LTLE and RTLE exhibit different large scale network structures, which emerge at the epoch immediately before the seizure onset, not in the preceding epochs. Our results suggest that patients with the two different epilepsy types display distinct large scale dynamical networks with characteristic epileptic network structures.

Timescale analysis of rule-based biochemical reaction networks

PubMed Central

Klinke, David J.; Finley, Stacey D.

2012-01-01

The flow of information within a cell is governed by a series of protein-protein interactions that can be described as a reaction network. Mathematical models of biochemical reaction networks can be constructed by repetitively applying specific rules that define how reactants interact and what new species are formed upon reaction. To aid in understanding the underlying biochemistry, timescale analysis is one method developed to prune the size of the reaction network. In this work, we extend the methods associated with timescale analysis to reaction rules instead of the species contained within the network. To illustrate this approach, we applied timescale analysis to a simple receptor-ligand binding model and a rule-based model of Interleukin-12 (IL-12) signaling in näive CD4+ T cells. The IL-12 signaling pathway includes multiple protein-protein interactions that collectively transmit information; however, the level of mechanistic detail sufficient to capture the observed dynamics has not been justified based upon the available data. The analysis correctly predicted that reactions associated with JAK2 and TYK2 binding to their corresponding receptor exist at a pseudo-equilibrium. In contrast, reactions associated with ligand binding and receptor turnover regulate cellular response to IL-12. An empirical Bayesian approach was used to estimate the uncertainty in the timescales. This approach complements existing rank- and flux-based methods that can be used to interrogate complex reaction networks. Ultimately, timescale analysis of rule-based models is a computational tool that can be used to reveal the biochemical steps that regulate signaling dynamics. PMID:21954150

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.

Innovation diffusion on time-varying activity driven networks

NASA Astrophysics Data System (ADS)

Rizzo, Alessandro; Porfiri, Maurizio

2016-01-01

Since its introduction in the 1960s, the theory of innovation diffusion has contributed to the advancement of several research fields, such as marketing management and consumer behavior. The 1969 seminal paper by Bass [F.M. Bass, Manag. Sci. 15, 215 (1969)] introduced a model of product growth for consumer durables, which has been extensively used to predict innovation diffusion across a range of applications. Here, we propose a novel approach to study innovation diffusion, where interactions among individuals are mediated by the dynamics of a time-varying network. Our approach is based on the Bass' model, and overcomes key limitations of previous studies, which assumed timescale separation between the individual dynamics and the evolution of the connectivity patterns. Thus, we do not hypothesize homogeneous mixing among individuals or the existence of a fixed interaction network. We formulate our approach in the framework of activity driven networks to enable the analysis of the concurrent evolution of the interaction and individual dynamics. Numerical simulations offer a systematic analysis of the model behavior and highlight the role of individual activity on market penetration when targeted advertisement campaigns are designed, or a competition between two different products takes place.

Dynamical analysis of yeast protein interaction network during the sake brewing process.

PubMed

Mirzarezaee, Mitra; Sadeghi, Mehdi; Araabi, Babak N

2011-12-01

Proteins interact with each other for performing essential functions of an organism. They change partners to get involved in various processes at different times or locations. Studying variations of protein interactions within a specific process would help better understand the dynamic features of the protein interactions and their functions. We studied the protein interaction network of Saccharomyces cerevisiae (yeast) during the brewing of Japanese sake. In this process, yeast cells are exposed to several stresses. Analysis of protein interaction networks of yeast during this process helps to understand how protein interactions of yeast change during the sake brewing process. We used gene expression profiles of yeast cells for this purpose. Results of our experiments revealed some characteristics and behaviors of yeast hubs and non-hubs and their dynamical changes during the brewing process. We found that just a small portion of the proteins (12.8 to 21.6%) is responsible for the functional changes of the proteins in the sake brewing process. The changes in the number of edges and hubs of the yeast protein interaction networks increase in the first stages of the process and it then decreases at the final stages.

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

Quantitative Analysis of Cellular Metabolic Dissipative, Self-Organized Structures

PubMed Central

de la Fuente, Ildefonso Martínez

2010-01-01

One of the most important goals of the postgenomic era is understanding the metabolic dynamic processes and the functional structures generated by them. Extensive studies during the last three decades have shown that the dissipative self-organization of the functional enzymatic associations, the catalytic reactions produced during the metabolite channeling, the microcompartmentalization of these metabolic processes and the emergence of dissipative networks are the fundamental elements of the dynamical organization of cell metabolism. Here we present an overview of how mathematical models can be used to address the properties of dissipative metabolic structures at different organizational levels, both for individual enzymatic associations and for enzymatic networks. Recent analyses performed with dissipative metabolic networks have shown that unicellular organisms display a singular global enzymatic structure common to all living cellular organisms, which seems to be an intrinsic property of the functional metabolism as a whole. Mathematical models firmly based on experiments and their corresponding computational approaches are needed to fully grasp the molecular mechanisms of metabolic dynamical processes. They are necessary to enable the quantitative and qualitative analysis of the cellular catalytic reactions and also to help comprehend the conditions under which the structural dynamical phenomena and biological rhythms arise. Understanding the molecular mechanisms responsible for the metabolic dissipative structures is crucial for unraveling the dynamics of cellular life. PMID:20957111

Chaotic dynamics and diffusion in a piecewise linear equation

NASA Astrophysics Data System (ADS)

Shahrear, Pabel; Glass, Leon; Edwards, Rod

2015-03-01

Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.

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.

Brain connectivity dynamics during social interaction reflect social network structure

PubMed Central

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

2017-01-01

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

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

PubMed

Gibbs, David L; Shmulevich, Ilya

2017-06-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

Social Network Analysis as an Analytic Tool for Task Group Research: A Case Study of an Interdisciplinary Community of Practice

ERIC Educational Resources Information Center

Lockhart, Naorah C.

2017-01-01

Group counselors commonly collaborate in interdisciplinary settings in health care, substance abuse, and juvenile justice. Social network analysis is a methodology rarely used in counseling research yet has potential to examine task group dynamics in new ways. This case study explores the scholarly relationships among 36 members of an…

Infraslow Electroencephalographic and Dynamic Resting State Network Activity.

PubMed

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

2017-06-01

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

Infraslow Electroencephalographic and Dynamic Resting State Network Activity

PubMed Central

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

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2015-03-01

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

Transcriptional dynamics of a conserved gene expression network associated with craniofacial divergence in Arctic charr.

PubMed

Ahi, Ehsan Pashay; Kapralova, Kalina Hristova; Pálsson, Arnar; Maier, Valerie Helene; Gudbrandsson, Jóhannes; Snorrason, Sigurdur S; Jónsson, Zophonías O; Franzdóttir, Sigrídur Rut

2014-01-01

Understanding the molecular basis of craniofacial variation can provide insights into key developmental mechanisms of adaptive changes and their role in trophic divergence and speciation. Arctic charr (Salvelinus alpinus) is a polymorphic fish species, and, in Lake Thingvallavatn in Iceland, four sympatric morphs have evolved distinct craniofacial structures. We conducted a gene expression study on candidates from a conserved gene coexpression network, focusing on the development of craniofacial elements in embryos of two contrasting Arctic charr morphotypes (benthic and limnetic). Four Arctic charr morphs were studied: one limnetic and two benthic morphs from Lake Thingvallavatn and a limnetic reference aquaculture morph. The presence of morphological differences at developmental stages before the onset of feeding was verified by morphometric analysis. Following up on our previous findings that Mmp2 and Sparc were differentially expressed between morphotypes, we identified a network of genes with conserved coexpression across diverse vertebrate species. A comparative expression study of candidates from this network in developing heads of the four Arctic charr morphs verified the coexpression relationship of these genes and revealed distinct transcriptional dynamics strongly correlated with contrasting craniofacial morphologies (benthic versus limnetic). A literature review and Gene Ontology analysis indicated that a significant proportion of the network genes play a role in extracellular matrix organization and skeletogenesis, and motif enrichment analysis of conserved noncoding regions of network candidates predicted a handful of transcription factors, including Ap1 and Ets2, as potential regulators of the gene network. The expression of Ets2 itself was also found to associate with network gene expression. Genes linked to glucocorticoid signalling were also studied, as both Mmp2 and Sparc are responsive to this pathway. Among those, several transcriptional targets and upstream regulators showed differential expression between the contrasting morphotypes. Interestingly, although selected network genes showed overlapping expression patterns in situ and no morph differences, Timp2 expression patterns differed between morphs. Our comparative study of transcriptional dynamics in divergent craniofacial morphologies of Arctic charr revealed a conserved network of coexpressed genes sharing functional roles in structural morphogenesis. We also implicate transcriptional regulators of the network as targets for future functional studies.

Opinion diversity and community formation in adaptive networks

NASA Astrophysics Data System (ADS)

Yu, Y.; Xiao, G.; Li, G.; Tay, W. P.; Teoh, H. F.

2017-10-01

It is interesting and of significant importance to investigate how network structures co-evolve with opinions. In this article, we show that, a simple model integrating consensus formation, link rewiring, and opinion change allows complex system dynamics to emerge, driving the system into a dynamic equilibrium with the co-existence of diversified opinions. Specifically, similar opinion holders may form into communities yet with no strict community consensus; and rather than being separated into disconnected communities, different communities are connected by a non-trivial proportion of inter-community links. More importantly, we show that the complex dynamics may lead to different numbers of communities at the steady state with a given tolerance between different opinion holders. We construct a framework for theoretically analyzing the co-evolution process. Theoretical analysis and extensive simulation results reveal some useful insights into the complex co-evolution process, including the formation of dynamic equilibrium, the transition between different steady states with different numbers of communities, and the dynamics between opinion distribution and network modularity.

Advanced functional network analysis in the geosciences: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Runge, Jakob; Schultz, Hanna C. H.; Wiedermann, Marc; Zech, Alraune; Feldhoff, Jan; Rheinwalt, Aljoscha; Kutza, Hannes; Radebach, Alexander; Marwan, Norbert; Kurths, Jürgen

2013-04-01

Functional networks are a powerful tool for analyzing large geoscientific datasets such as global fields of climate time series originating from observations or model simulations. pyunicorn (pythonic unified complex network and recurrence analysis toolbox) is an open-source, fully object-oriented and easily parallelizable package written in the language Python. It allows for constructing functional networks (aka climate networks) representing the structure of statistical interrelationships in large datasets and, subsequently, investigating this structure using advanced methods of complex network theory such as measures for networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn allows to study the complex dynamics of geoscientific systems as recorded by time series by means of recurrence networks and visibility graphs. The range of possible applications of the package is outlined drawing on several examples from climatology.

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.

An Adaptive Channel Access Method for Dynamic Super Dense Wireless Sensor Networks.

PubMed

Lei, Chunyang; Bie, Hongxia; Fang, Gengfa; Zhang, Xuekun

2015-12-03

Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT), Machine-to-Machine (M2M) communications, Vehicular-to-Vehicular (V2V) communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensing and spectral efficiency, a new channel access scheme needs to be designed to solve the channel congestion problem introduced by the high dynamics of competing nodes accessing the channel simultaneously. In this paper, we firstly analyzed the channel contention problem using a novel normalized channel contention analysis model which provides information on how to tune the contention window according to the state of channel contention. We then proposed an adaptive channel contention window tuning algorithm in which the contention window tuning rate is set dynamically based on the estimated channel contention level. Simulation results show that our proposed adaptive channel access algorithm based on fast contention window tuning can achieve more than 95 % of the theoretical optimal throughput and 0 . 97 of fairness index especially in dynamic and dense networks.

Applying differential dynamic logic to reconfigurable biological networks.

PubMed

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

2017-09-01

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

Collective stochastic coherence in recurrent neuronal networks

NASA Astrophysics Data System (ADS)

Sancristóbal, Belén; Rebollo, Beatriz; Boada, Pol; Sanchez-Vives, Maria V.; Garcia-Ojalvo, Jordi

2016-09-01

Recurrent networks of dynamic elements frequently exhibit emergent collective oscillations, which can show substantial regularity even when the individual elements are considerably noisy. How noise-induced dynamics at the local level coexists with regular oscillations at the global level is still unclear. Here we show that a combination of stochastic recurrence-based initiation with deterministic refractoriness in an excitable network can reconcile these two features, leading to maximum collective coherence for an intermediate noise level. We report this behaviour in the slow oscillation regime exhibited by a cerebral cortex network under dynamical conditions resembling slow-wave sleep and anaesthesia. Computational analysis of a biologically realistic network model reveals that an intermediate level of background noise leads to quasi-regular dynamics. We verify this prediction experimentally in cortical slices subject to varying amounts of extracellular potassium, which modulates neuronal excitability and thus synaptic noise. The model also predicts that this effectively regular state should exhibit noise-induced memory of the spatial propagation profile of the collective oscillations, which is also verified experimentally. Taken together, these results allow us to construe the high regularity observed experimentally in the brain as an instance of collective stochastic coherence.

IBiSA_Tools: A Computational Toolkit for Ion-Binding State Analysis in Molecular Dynamics Trajectories of Ion Channels.

PubMed

Kasahara, Kota; Kinoshita, Kengo

2016-01-01

Ion conduction mechanisms of ion channels are a long-standing conundrum. Although the molecular dynamics (MD) method has been extensively used to simulate ion conduction dynamics at the atomic level, analysis and interpretation of MD results are not straightforward due to complexity of the dynamics. In our previous reports, we proposed an analytical method called ion-binding state analysis to scrutinize and summarize ion conduction mechanisms by taking advantage of a variety of analytical protocols, e.g., the complex network analysis, sequence alignment, and hierarchical clustering. This approach effectively revealed the ion conduction mechanisms and their dependence on the conditions, i.e., ion concentration and membrane voltage. Here, we present an easy-to-use computational toolkit for ion-binding state analysis, called IBiSA_tools. This toolkit consists of a C++ program and a series of Python and R scripts. From the trajectory file of MD simulations and a structure file, users can generate several images and statistics of ion conduction processes. A complex network named ion-binding state graph is generated in a standard graph format (graph modeling language; GML), which can be visualized by standard network analyzers such as Cytoscape. As a tutorial, a trajectory of a 50 ns MD simulation of the Kv1.2 channel is also distributed with the toolkit. Users can trace the entire process of ion-binding state analysis step by step. The novel method for analysis of ion conduction mechanisms of ion channels can be easily used by means of IBiSA_tools. This software is distributed under an open source license at the following URL: http://www.ritsumei.ac.jp/~ktkshr/ibisa_tools/.

Impact of Partial Time Delay on Temporal Dynamics of Watts-Strogatz Small-World Neuronal Networks

NASA Astrophysics Data System (ADS)

Yan, Hao; Sun, Xiaojuan

2017-06-01

In this paper, we mainly discuss effects of partial time delay on temporal dynamics of Watts-Strogatz (WS) small-world neuronal networks by controlling two parameters. One is the time delay τ and the other is the probability of partial time delay pdelay. Temporal dynamics of WS small-world neuronal networks are discussed with the aid of temporal coherence and mean firing rate. With the obtained simulation results, it is revealed that for small time delay τ, the probability pdelay could weaken temporal coherence and increase mean firing rate of neuronal networks, which indicates that it could improve neuronal firings of the neuronal networks while destroying firing regularity. For large time delay τ, temporal coherence and mean firing rate do not have great changes with respect to pdelay. Time delay τ always has great influence on both temporal coherence and mean firing rate no matter what is the value of pdelay. Moreover, with the analysis of spike trains and histograms of interspike intervals of neurons inside neuronal networks, it is found that the effects of partial time delays on temporal coherence and mean firing rate could be the result of locking between the period of neuronal firing activities and the value of time delay τ. In brief, partial time delay could have great influence on temporal dynamics of the neuronal networks.

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.

Smoking-based selection and influence in gender-segregated friendship networks: a social network analysis of adolescent smoking.

PubMed

Mercken, Liesbeth; Snijders, Tom A B; Steglich, Christian; Vertiainen, Erkki; de Vries, Hein

2010-07-01

The main goal of this study was to examine differences between adolescent male and female friendship networks regarding smoking-based selection and influence processes using newly developed social network analysis methods that allow the current state of continuously changing friendship networks to act as a dynamic constraint for changes in smoking behaviour, while allowing current smoking behaviour to be simultaneously a dynamic constraint for changes in friendship networks. Longitudinal design with four measurements. Nine junior high schools in Finland. A total of 1163 adolescents (mean age = 13.6 years) who participated in the control group of the ESFA (European Smoking prevention Framework Approach) study, including 605 males and 558 females. Smoking behaviour of adolescents, parents, siblings and friendship ties. Smoking-based selection of friends was found in male as well as female networks. However, support for influence among friends was found only in female networks. Furthermore, females and males were both influenced by parental smoking behaviour. In Finnish adolescents, both male and female smokers tend to select other smokers as friends but it appears that only females are influenced to smoke by their peer group. This suggests that prevention campaigns targeting resisting peer pressure may be more effective in adolescent girls than boys.

Single-cell resolution of intracellular T cell Ca2+ dynamics in response to frequency-based H2O2 stimulation.

PubMed

Kniss-James, Ariel S; Rivet, Catherine A; Chingozha, Loice; Lu, Hang; Kemp, Melissa L

2017-03-01

Adaptive immune cells, such as T cells, integrate information from their extracellular environment through complex signaling networks with exquisite sensitivity in order to direct decisions on proliferation, apoptosis, and cytokine production. These signaling networks are reliant on the interplay between finely tuned secondary messengers, such as Ca 2+ and H 2 O 2 . Frequency response analysis, originally developed in control engineering, is a tool used for discerning complex networks. This analytical technique has been shown to be useful for understanding biological systems and facilitates identification of the dominant behaviour of the system. We probed intracellular Ca 2+ dynamics in the frequency domain to investigate the complex relationship between two second messenger signaling molecules, H 2 O 2 and Ca 2+ , during T cell activation with single cell resolution. Single-cell analysis provides a unique platform for interrogating and monitoring cellular processes of interest. We utilized a previously developed microfluidic device to monitor individual T cells through time while applying a dynamic input to reveal a natural frequency of the system at approximately 2.78 mHz stimulation. Although our network was much larger with more unknown connections than previous applications, we are able to derive features from our data, observe forced oscillations associated with specific amplitudes and frequencies of stimuli, and arrive at conclusions about potential transfer function fits as well as the underlying population dynamics.

Pattern Formation on Networks: from Localised Activity to Turing Patterns

PubMed Central

McCullen, Nick; Wagenknecht, Thomas

2016-01-01

Networks of interactions between competing species are used to model many complex systems, such as in genetics, evolutionary biology or sociology and knowledge of the patterns of activity they can exhibit is important for understanding their behaviour. The emergence of patterns on complex networks with reaction-diffusion dynamics is studied here, where node dynamics interact via diffusion via the network edges. Through the application of a generalisation of dynamical systems analysis this work reveals a fundamental connection between small-scale modes of activity on networks and localised pattern formation seen throughout science, such as solitons, breathers and localised buckling. The connection between solutions with a single and small numbers of activated nodes and the fully developed system-scale patterns are investigated computationally using numerical continuation methods. These techniques are also used to help reveal a much larger portion of of the full number of solutions that exist in the system at different parameter values. The importance of network structure is also highlighted, with a key role being played by nodes with a certain so-called optimal degree, on which the interaction between the reaction kinetics and the network structure organise the behaviour of the system. PMID:27273339

Adaptive dynamical networks

NASA Astrophysics Data System (ADS)

Maslennikov, O. V.; Nekorkin, V. I.

2017-10-01

Dynamical networks are systems of active elements (nodes) interacting with each other through links. Examples are power grids, neural structures, coupled chemical oscillators, and communications networks, all of which are characterized by a networked structure and intrinsic dynamics of their interacting components. If the coupling structure of a dynamical network can change over time due to nodal dynamics, then such a system is called an adaptive dynamical network. The term ‘adaptive’ implies that the coupling topology can be rewired; the term ‘dynamical’ implies the presence of internal node and link dynamics. The main results of research on adaptive dynamical networks are reviewed. Key notions and definitions of the theory of complex networks are given, and major collective effects that emerge in adaptive dynamical networks are described.

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.

Socioscape: Real-Time Analysis of Dynamic Heterogeneous Networks In Complex Socio-Cultural Systems

DTIC Science & Technology

2015-10-22

Cluster Mixed-Membership Blockmodel for Time-Evolving Networks, Proceedings of the 14th International Conference on Artifical Intelligence and...Learning With Simultaneous Orthogonal Matching Pursuit, Proceedings of the 13th International Conference on Artifical Intelligence and Statistics

gRINN: a tool for calculation of residue interaction energies and protein energy network analysis of molecular dynamics simulations.

PubMed

Serçinoglu, Onur; Ozbek, Pemra

2018-05-25

Atomistic molecular dynamics (MD) simulations generate a wealth of information related to the dynamics of proteins. If properly analyzed, this information can lead to new insights regarding protein function and assist wet-lab experiments. Aiming to identify interactions between individual amino acid residues and the role played by each in the context of MD simulations, we present a stand-alone software called gRINN (get Residue Interaction eNergies and Networks). gRINN features graphical user interfaces (GUIs) and a command-line interface for generating and analyzing pairwise residue interaction energies and energy correlations from protein MD simulation trajectories. gRINN utilizes the features of NAMD or GROMACS MD simulation packages and automatizes the steps necessary to extract residue-residue interaction energies from user-supplied simulation trajectories, greatly simplifying the analysis for the end-user. A GUI, including an embedded molecular viewer, is provided for visualization of interaction energy time-series, distributions, an interaction energy matrix, interaction energy correlations and a residue correlation matrix. gRINN additionally offers construction and analysis of Protein Energy Networks, providing residue-based metrics such as degrees, betweenness-centralities, closeness centralities as well as shortest path analysis. gRINN is free and open to all users without login requirement at http://grinn.readthedocs.io.

Neuronal and network computation in the brain

NASA Astrophysics Data System (ADS)

Babloyantz, A.

1999-03-01

The concepts and methods of non-linear dynamics have been a powerful tool for studying some gamow aspects of brain dynamics. In this paper we show how, from time series analysis of electroencepholograms in sick and healthy subjects, chaotic nature of brain activity could be unveiled. This finding gave rise to the concept of spatiotemporal cortical chaotic networks which in turn was the foundation for a simple brain-like device which is able to become attentive, perform pattern recognition and motion detection. A new method of time series analysis is also proposed which demonstrates for the first time the existence of neuronal code in interspike intervals of coclear cells.

Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks

NASA Astrophysics Data System (ADS)

St-Onge, Guillaume; Young, Jean-Gabriel; Laurence, Edward; Murphy, Charles; Dubé, Louis J.

2018-02-01

We present a degree-based theoretical framework to study the susceptible-infected-susceptible (SIS) dynamics on time-varying (rewired) configuration model networks. Using this framework on a given degree distribution, we provide a detailed analysis of the stationary state using the rewiring rate to explore the whole range of the time variation of the structure relative to that of the SIS process. This analysis is suitable for the characterization of the phase transition and leads to three main contributions: (1) We obtain a self-consistent expression for the absorbing-state threshold, able to capture both collective and hub activation. (2) We recover the predictions of a number of existing approaches as limiting cases of our analysis, providing thereby a unifying point of view for the SIS dynamics on random networks. (3) We obtain bounds for the critical exponents of a number of quantities in the stationary state. This allows us to reinterpret the concept of hub-dominated phase transition. Within our framework, it appears as a heterogeneous critical phenomenon: observables for different degree classes have a different scaling with the infection rate. This phenomenon is followed by the successive activation of the degree classes beyond the epidemic threshold.

Combination of Markov state models and kinetic networks for the analysis of molecular dynamics simulations of peptide folding.

PubMed

Radford, Isolde H; Fersht, Alan R; Settanni, Giovanni

2011-06-09

Atomistic molecular dynamics simulations of the TZ1 beta-hairpin peptide have been carried out using an implicit model for the solvent. The trajectories have been analyzed using a Markov state model defined on the projections along two significant observables and a kinetic network approach. The Markov state model allowed for an unbiased identification of the metastable states of the system, and provided the basis for commitment probability calculations performed on the kinetic network. The kinetic network analysis served to extract the main transition state for folding of the peptide and to validate the results from the Markov state analysis. The combination of the two techniques allowed for a consistent and concise characterization of the dynamics of the peptide. The slowest relaxation process identified is the exchange between variably folded and denatured species, and the second slowest process is the exchange between two different subsets of the denatured state which could not be otherwise identified by simple inspection of the projected trajectory. The third slowest process is the exchange between a fully native and a partially folded intermediate state characterized by a native turn with a proximal backbone H-bond, and frayed side-chain packing and termini. The transition state for the main folding reaction is similar to the intermediate state, although a more native like side-chain packing is observed.

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

PubMed

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

2018-07-01

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

Integration of Structural Dynamics and Molecular Evolution via Protein Interaction Networks: A New Era in Genomic Medicine

PubMed Central

Kumar, Avishek; Butler, Brandon M.; Kumar, Sudhir; Ozkan, S. Banu

2016-01-01

Summary Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. PMID:26684487

Robust dynamics in minimal hybrid models of genetic networks

PubMed Central

Perkins, Theodore J.; Wilds, Roy; Glass, Leon

2010-01-01

Many gene-regulatory networks necessarily display robust dynamics that are insensitive to noise and stable under evolution. We propose that a class of hybrid systems can be used to relate the structure of these networks to their dynamics and provide insight into the origin of robustness. In these systems, the genes are represented by logical functions, and the controlling transcription factor protein molecules are real variables, which are produced and destroyed. As the transcription factor concentrations cross thresholds, they control the production of other transcription factors. We discuss mathematical analysis of these systems and show how the concepts of robustness and minimality can be used to generate putative logical organizations based on observed symbolic sequences. We apply the methods to control of the cell cycle in yeast. PMID:20921006

Robust dynamics in minimal hybrid models of genetic networks.

PubMed

Perkins, Theodore J; Wilds, Roy; Glass, Leon

2010-11-13

Many gene-regulatory networks necessarily display robust dynamics that are insensitive to noise and stable under evolution. We propose that a class of hybrid systems can be used to relate the structure of these networks to their dynamics and provide insight into the origin of robustness. In these systems, the genes are represented by logical functions, and the controlling transcription factor protein molecules are real variables, which are produced and destroyed. As the transcription factor concentrations cross thresholds, they control the production of other transcription factors. We discuss mathematical analysis of these systems and show how the concepts of robustness and minimality can be used to generate putative logical organizations based on observed symbolic sequences. We apply the methods to control of the cell cycle in yeast.

Dynamic Repertoire of Intrinsic Brain States Is Reduced in Propofol-Induced Unconsciousness

PubMed Central

Liu, Xiping; Pillay, Siveshigan

2015-01-01

Abstract The richness of conscious experience is thought to scale with the size of the repertoire of causal brain states, and it may be diminished in anesthesia. We estimated the state repertoire from dynamic analysis of intrinsic functional brain networks in conscious sedated and unconscious anesthetized rats. Functional resonance images were obtained from 30-min whole-brain resting-state blood oxygen level-dependent (BOLD) signals at propofol infusion rates of 20 and 40 mg/kg/h, intravenously. Dynamic brain networks were defined at the voxel level by sliding window analysis of regional homogeneity (ReHo) or coincident threshold crossings (CTC) of the BOLD signal acquired in nine sagittal slices. The state repertoire was characterized by the temporal variance of the number of voxels with significant ReHo or positive CTC. From low to high propofol dose, the temporal variances of ReHo and CTC were reduced by 78%±20% and 76%±20%, respectively. Both baseline and propofol-induced reduction of CTC temporal variance increased from lateral to medial position. Group analysis showed a 20% reduction in the number of unique states at the higher propofol dose. Analysis of temporal variance in 12 anatomically defined regions of interest predicted that the largest changes occurred in visual cortex, parietal cortex, and caudate-putamen. The results suggest that the repertoire of large-scale brain states derived from the spatiotemporal dynamics of intrinsic networks is substantially reduced at an anesthetic dose associated with loss of consciousness. PMID:24702200

Order parameter analysis of synchronization transitions on star networks

NASA Astrophysics Data System (ADS)

Chen, Hong-Bin; Sun, Yu-Ting; Gao, Jian; Xu, Can; Zheng, Zhi-Gang

2017-12-01

The collective behaviors of populations of coupled oscillators have attracted significant attention in recent years. In this paper, an order parameter approach is proposed to study the low-dimensional dynamical mechanism of collective synchronizations, by adopting the star-topology of coupled oscillators as a prototype system. The order parameter equation of star-linked phase oscillators can be obtained in terms of the Watanabe-Strogatz transformation, Ott-Antonsen ansatz, and the ensemble order parameter approach. Different solutions of the order parameter equation correspond to the diverse collective states, and different bifurcations reveal various transitions among these collective states. The properties of various transitions in the star-network model are revealed by using tools of nonlinear dynamics such as time reversibility analysis and linear stability analysis.

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

NASA Astrophysics Data System (ADS)

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

2003-12-01

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

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

Epidemics in Adaptive Social Networks with Temporary Link Deactivation

NASA Astrophysics Data System (ADS)

Tunc, Ilker; Shkarayev, Maxim S.; Shaw, Leah B.

2013-04-01

Disease spread in a society depends on the topology of the network of social contacts. Moreover, individuals may respond to the epidemic by adapting their contacts to reduce the risk of infection, thus changing the network structure and affecting future disease spread. We propose an adaptation mechanism where healthy individuals may choose to temporarily deactivate their contacts with sick individuals, allowing reactivation once both individuals are healthy. We develop a mean-field description of this system and find two distinct regimes: slow network dynamics, where the adaptation mechanism simply reduces the effective number of contacts per individual, and fast network dynamics, where more efficient adaptation reduces the spread of disease by targeting dangerous connections. Analysis of the bifurcation structure is supported by numerical simulations of disease spread on an adaptive network. The system displays a single parameter-dependent stable steady state and non-monotonic dependence of connectivity on link deactivation rate.

Correspondence of the brain's functional architecture during activation and rest.

PubMed

Smith, Stephen M; Fox, Peter T; Miller, Karla L; Glahn, David C; Fox, P Mickle; Mackay, Clare E; Filippini, Nicola; Watkins, Kate E; Toro, Roberto; Laird, Angela R; Beckmann, Christian F

2009-08-04

Neural connections, providing the substrate for functional networks, exist whether or not they are functionally active at any given moment. However, it is not known to what extent brain regions are continuously interacting when the brain is "at rest." In this work, we identify the major explicit activation networks by carrying out an image-based activation network analysis of thousands of separate activation maps derived from the BrainMap database of functional imaging studies, involving nearly 30,000 human subjects. Independently, we extract the major covarying networks in the resting brain, as imaged with functional magnetic resonance imaging in 36 subjects at rest. The sets of major brain networks, and their decompositions into subnetworks, show close correspondence between the independent analyses of resting and activation brain dynamics. We conclude that the full repertoire of functional networks utilized by the brain in action is continuously and dynamically "active" even when at "rest."

Linear and nonlinear ARMA model parameter estimation using an artificial neural network

NASA Technical Reports Server (NTRS)

Chon, K. H.; Cohen, R. J.

1997-01-01

This paper addresses parametric system identification of linear and nonlinear dynamic systems by analysis of the input and output signals. Specifically, we investigate the relationship between estimation of the system using a feedforward neural network model and estimation of the system by use of linear and nonlinear autoregressive moving-average (ARMA) models. By utilizing a neural network model incorporating a polynomial activation function, we show the equivalence of the artificial neural network to the linear and nonlinear ARMA models. We compare the parameterization of the estimated system using the neural network and ARMA approaches by utilizing data generated by means of computer simulations. Specifically, we show that the parameters of a simulated ARMA system can be obtained from the neural network analysis of the simulated data or by conventional least squares ARMA analysis. The feasibility of applying neural networks with polynomial activation functions to the analysis of experimental data is explored by application to measurements of heart rate (HR) and instantaneous lung volume (ILV) fluctuations.

SS-mPMG and SS-GA: tools for finding pathways and dynamic simulation of metabolic networks.

PubMed

Katsuragi, Tetsuo; Ono, Naoaki; Yasumoto, Keiichi; Altaf-Ul-Amin, Md; Hirai, Masami Y; Sriyudthsak, Kansuporn; Sawada, Yuji; Yamashita, Yui; Chiba, Yukako; Onouchi, Hitoshi; Fujiwara, Toru; Naito, Satoshi; Shiraishi, Fumihide; Kanaya, Shigehiko

2013-05-01

Metabolomics analysis tools can provide quantitative information on the concentration of metabolites in an organism. In this paper, we propose the minimum pathway model generator tool for simulating the dynamics of metabolite concentrations (SS-mPMG) and a tool for parameter estimation by genetic algorithm (SS-GA). SS-mPMG can extract a subsystem of the metabolic network from the genome-scale pathway maps to reduce the complexity of the simulation model and automatically construct a dynamic simulator to evaluate the experimentally observed behavior of metabolites. Using this tool, we show that stochastic simulation can reproduce experimentally observed dynamics of amino acid biosynthesis in Arabidopsis thaliana. In this simulation, SS-mPMG extracts the metabolic network subsystem from published databases. The parameters needed for the simulation are determined using a genetic algorithm to fit the simulation results to the experimental data. We expect that SS-mPMG and SS-GA will help researchers to create relevant metabolic networks and carry out simulations of metabolic reactions derived from metabolomics data.

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

NASA Astrophysics Data System (ADS)

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

2017-02-01

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

Risk seeking for losses modulates the functional connectivity of the default mode and left frontoparietal networks in young males.

PubMed

Deza Araujo, Yacila I; Nebe, Stephan; Neukam, Philipp T; Pooseh, Shakoor; Sebold, Miriam; Garbusow, Maria; Heinz, Andreas; Smolka, Michael N

2018-06-01

Value-based decision making (VBDM) is a principle that states that humans and other species adapt their behavior according to the dynamic subjective values of the chosen or unchosen options. The neural bases of this process have been extensively investigated using task-based fMRI and lesion studies. However, the growing field of resting-state functional connectivity (RSFC) may shed light on the organization and function of brain connections across different decision-making domains. With this aim, we used independent component analysis to study the brain network dynamics in a large cohort of young males (N = 145) and the relationship of these dynamics with VBDM. Participants completed a battery of behavioral tests that evaluated delay aversion, risk seeking for losses, risk aversion for gains, and loss aversion, followed by an RSFC scan session. We identified a set of large-scale brain networks and conducted our analysis only on the default mode network (DMN) and networks comprising cognitive control, appetitive-driven, and reward-processing regions. Higher risk seeking for losses was associated with increased connectivity between medial temporal regions, frontal regions, and the DMN. Higher risk seeking for losses was also associated with increased coupling between the left frontoparietal network and occipital cortices. These associations illustrate the participation of brain regions involved in prospective thinking, affective decision making, and visual processing in participants who are greater risk-seekers, and they demonstrate the sensitivity of RSFC to detect brain connectivity differences associated with distinct VBDM parameters.

Computer-aided-engineering system for modeling and analysis of ECLSS integration testing

NASA Technical Reports Server (NTRS)

Sepahban, Sonbol

1987-01-01

The accurate modeling and analysis of two-phase fluid networks found in environmental control and life support systems is presently undertaken by computer-aided engineering (CAE) techniques whose generalized fluid dynamics package can solve arbitrary flow networks. The CAE system for integrated test bed modeling and analysis will also furnish interfaces and subsystem/test-article mathematical models. Three-dimensional diagrams of the test bed are generated by the system after performing the requisite simulation and analysis.

Ant-Plant Interaction in a Tropical Savanna: May the Network Structure Vary over Time and Influence on the Outcomes of Associations?

PubMed Central

Lange, Denise; Del-Claro, Kleber

2014-01-01

Plant-animal interactions occur in a community context of dynamic and complex ecological interactive networks. The understanding of who interacts with whom is a basic information, but the outcomes of interactions among associates are fundamental to draw valid conclusions about the functional structure of the network. Ecological networks studies in general gave little importance to know the true outcomes of interactions and how they may change over time. We evaluate the dynamic of an interaction network between ants and plants with extrafloral nectaries, by verifying the temporal variation in structure and outcomes of mutualism for the plant community (leaf herbivory). To reach this goal, we used two tools: bipartite network analysis and experimental manipulation. The networks exhibited the same general pattern as other mutualistic networks: nestedness, asymmetry and low specialization and this pattern was maintained over time, but with internal changes (species degree, connectance and ant abundance). These changes influenced the protection effectiveness of plants by ants, which varied over time. Our study shows that interaction networks between ants and plants are dynamic over time, and that these alterations affect the outcomes of mutualisms. In addition, our study proposes that the set of single systems that shape ecological networks can be manipulated for a greater understanding of the entire system. PMID:25141007

Loads Bias Genetic and Signaling Switches in Synthetic and Natural Systems

PubMed Central

Medford, June; Prasad, Ashok

2014-01-01

Biological protein interactions networks such as signal transduction or gene transcription networks are often treated as modular, allowing motifs to be analyzed in isolation from the rest of the network. Modularity is also a key assumption in synthetic biology, where it is similarly expected that when network motifs are combined together, they do not lose their essential characteristics. However, the interactions that a network module has with downstream elements change the dynamical equations describing the upstream module and thus may change the dynamic and static properties of the upstream circuit even without explicit feedback. In this work we analyze the behavior of a ubiquitous motif in gene transcription and signal transduction circuits: the switch. We show that adding an additional downstream component to the simple genetic toggle switch changes its dynamical properties by changing the underlying potential energy landscape, and skewing it in favor of the unloaded side, and in some situations adding loads to the genetic switch can also abrogate bistable behavior. We find that an additional positive feedback motif found in naturally occurring toggle switches could tune the potential energy landscape in a desirable manner. We also analyze autocatalytic signal transduction switches and show that a ubiquitous positive feedback switch can lose its switch-like properties when connected to a downstream load. Our analysis underscores the necessity of incorporating the effects of downstream components when understanding the physics of biochemical network motifs, and raises the question as to how these effects are managed in real biological systems. This analysis is particularly important when scaling synthetic networks to more complex organisms. PMID:24676102

Detection of allosteric signal transmission by information-theoretic analysis of protein dynamics

PubMed Central

Pandini, Alessandro; Fornili, Arianna; Fraternali, Franca; Kleinjung, Jens

2012-01-01

Allostery offers a highly specific way to modulate protein function. Therefore, understanding this mechanism is of increasing interest for protein science and drug discovery. However, allosteric signal transmission is difficult to detect experimentally and to model because it is often mediated by local structural changes propagating along multiple pathways. To address this, we developed a method to identify communication pathways by an information-theoretical analysis of molecular dynamics simulations. Signal propagation was described as information exchange through a network of correlated local motions, modeled as transitions between canonical states of protein fragments. The method was used to describe allostery in two-component regulatory systems. In particular, the transmission from the allosteric site to the signaling surface of the receiver domain NtrC was shown to be mediated by a layer of hub residues. The location of hubs preferentially connected to the allosteric site was found in close agreement with key residues experimentally identified as involved in the signal transmission. The comparison with the networks of the homologues CheY and FixJ highlighted similarities in their dynamics. In particular, we showed that a preorganized network of fragment connections between the allosteric and functional sites exists already in the inactive state of all three proteins.—Pandini, A., Fornili, A., Fraternali, F., Kleinjung, J. Detection of allosteric signal transmission by information-theoretic analysis of protein dynamics. PMID:22071506

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.

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.

Can Multilayer Networks Advance Animal Behavior Research?

PubMed

Silk, Matthew J; Finn, Kelly R; Porter, Mason A; Pinter-Wollman, Noa

2018-06-01

Interactions among individual animals - and between these individuals and their environment - yield complex, multifaceted systems. The development of multilayer network analysis offers a promising new approach for studying animal social behavior and its relation to eco-evolutionary dynamics. Copyright © 2018 Elsevier Ltd. All rights reserved.

Do Narcissism and Emotional Intelligence Win Us Friends? Modeling Dynamics of Peer Popularity Using Inferential Network Analysis.

PubMed

Czarna, Anna Z; Leifeld, Philip; Śmieja, Magdalena; Dufner, Michael; Salovey, Peter

2016-09-27

This research investigated effects of narcissism and emotional intelligence (EI) on popularity in social networks. In a longitudinal field study, we examined the dynamics of popularity in 15 peer groups in two waves (N = 273). We measured narcissism, ability EI, and explicit and implicit self-esteem. In addition, we measured popularity at zero acquaintance and 3 months later. We analyzed the data using inferential network analysis (temporal exponential random graph modeling, TERGM) accounting for self-organizing network forces. People high in narcissism were popular, but increased less in popularity over time than people lower in narcissism. In contrast, emotionally intelligent people increased more in popularity over time than less emotionally intelligent people. The effects held when we controlled for explicit and implicit self-esteem. These results suggest that narcissism is rather disadvantageous and that EI is rather advantageous for long-term popularity. © 2016 by the Society for Personality and Social Psychology, Inc.

Analysis of the dynamic co-expression network of heart regeneration in the zebrafish

PubMed Central

Rodius, Sophie; Androsova, Ganna; Götz, Lou; Liechti, Robin; Crespo, Isaac; Merz, Susanne; Nazarov, Petr V.; de Klein, Niek; Jeanty, Céline; González-Rosa, Juan M.; Muller, Arnaud; Bernardin, Francois; Niclou, Simone P.; Vallar, Laurent; Mercader, Nadia; Ibberson, Mark; Xenarios, Ioannis; Azuaje, Francisco

2016-01-01

The zebrafish has the capacity to regenerate its heart after severe injury. While the function of a few genes during this process has been studied, we are far from fully understanding how genes interact to coordinate heart regeneration. To enable systematic insights into this phenomenon, we generated and integrated a dynamic co-expression network of heart regeneration in the zebrafish and linked systems-level properties to the underlying molecular events. Across multiple post-injury time points, the network displays topological attributes of biological relevance. We show that regeneration steps are mediated by modules of transcriptionally coordinated genes, and by genes acting as network hubs. We also established direct associations between hubs and validated drivers of heart regeneration with murine and human orthologs. The resulting models and interactive analysis tools are available at http://infused.vital-it.ch. Using a worked example, we demonstrate the usefulness of this unique open resource for hypothesis generation and in silico screening for genes involved in heart regeneration. PMID:27241320

Computing by robust transience: How the fronto-parietal network performs sequential category-based decisions

PubMed Central

Chaisangmongkon, Warasinee; Swaminathan, Sruthi K.; Freedman, David J.; Wang, Xiao-Jing

2017-01-01

Summary Decision making involves dynamic interplay between internal judgements and external perception, which has been investigated in delayed match-to-category (DMC) experiments. Our analysis of neural recordings shows that, during DMC tasks, LIP and PFC neurons demonstrate mixed, time-varying, and heterogeneous selectivity, but previous theoretical work has not established the link between these neural characteristics and population-level computations. We trained a recurrent network model to perform DMC tasks and found that the model can remarkably reproduce key features of neuronal selectivity at the single-neuron and population levels. Analysis of the trained networks elucidates that robust transient trajectories of the neural population are the key driver of sequential categorical decisions. The directions of trajectories are governed by network self-organized connectivity, defining a ‘neural landscape’, consisting of a task-tailored arrangement of slow states and dynamical tunnels. With this model, we can identify functionally-relevant circuit motifs and generalize the framework to solve other categorization tasks. PMID:28334612

Analysis of the dynamic co-expression network of heart regeneration in the zebrafish

NASA Astrophysics Data System (ADS)

Rodius, Sophie; Androsova, Ganna; Götz, Lou; Liechti, Robin; Crespo, Isaac; Merz, Susanne; Nazarov, Petr V.; de Klein, Niek; Jeanty, Céline; González-Rosa, Juan M.; Muller, Arnaud; Bernardin, Francois; Niclou, Simone P.; Vallar, Laurent; Mercader, Nadia; Ibberson, Mark; Xenarios, Ioannis; Azuaje, Francisco

2016-05-01

The zebrafish has the capacity to regenerate its heart after severe injury. While the function of a few genes during this process has been studied, we are far from fully understanding how genes interact to coordinate heart regeneration. To enable systematic insights into this phenomenon, we generated and integrated a dynamic co-expression network of heart regeneration in the zebrafish and linked systems-level properties to the underlying molecular events. Across multiple post-injury time points, the network displays topological attributes of biological relevance. We show that regeneration steps are mediated by modules of transcriptionally coordinated genes, and by genes acting as network hubs. We also established direct associations between hubs and validated drivers of heart regeneration with murine and human orthologs. The resulting models and interactive analysis tools are available at http://infused.vital-it.ch. Using a worked example, we demonstrate the usefulness of this unique open resource for hypothesis generation and in silico screening for genes involved in heart regeneration.

SYNCHRONIZATION OF HETEROGENEOUS OSCILLATORS UNDER NETWORK MODIFICATIONS: PERTURBATION AND OPTIMIZATION OF THE SYNCHRONY ALIGNMENT FUNCTION

PubMed Central

Taylor, Dane; Skardal, Per Sebastian; Sun, Jie

2016-01-01

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications—for which proper functionality depends sensitively on the extent of synchronization—there remains a lack of understanding for how systems can best evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system’s ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments. PMID:27872501

Graph Theory-Based Pinning Synchronization of Stochastic Complex Dynamical Networks.

PubMed

Li, Xiao-Jian; Yang, Guang-Hong

2017-02-01

This paper is concerned with the adaptive pinning synchronization problem of stochastic complex dynamical networks (CDNs). Based on algebraic graph theory and Lyapunov theory, pinning controller design conditions are derived, and the rigorous convergence analysis of synchronization errors in the probability sense is also conducted. Compared with the existing results, the topology structures of stochastic CDN are allowed to be unknown due to the use of graph theory. In particular, it is shown that the selection of nodes for pinning depends on the unknown lower bounds of coupling strengths. Finally, an example on a Chua's circuit network is given to validate the effectiveness of the theoretical results.

Performance analysis of Integrated Communication and Control System networks

NASA Technical Reports Server (NTRS)

Halevi, Y.; Ray, A.

1990-01-01

This paper presents statistical analysis of delays in Integrated Communication and Control System (ICCS) networks that are based on asynchronous time-division multiplexing. The models are obtained in closed form for analyzing control systems with randomly varying delays. The results of this research are applicable to ICCS design for complex dynamical processes like advanced aircraft and spacecraft, autonomous manufacturing plants, and chemical and processing plants.

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

PubMed

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

2015-12-01

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

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

Empirical and Theoretical Aspects of Generation and Transfer of Information in a Neuromagnetic Source Network

PubMed Central

Vakorin, Vasily A.; Mišić, Bratislav; Krakovska, Olga; McIntosh, Anthony Randal

2011-01-01

Variability in source dynamics across the sources in an activated network may be indicative of how the information is processed within a network. Information-theoretic tools allow one not only to characterize local brain dynamics but also to describe interactions between distributed brain activity. This study follows such a framework and explores the relations between signal variability and asymmetry in mutual interdependencies in a data-driven pipeline of non-linear analysis of neuromagnetic sources reconstructed from human magnetoencephalographic (MEG) data collected as a reaction to a face recognition task. Asymmetry in non-linear interdependencies in the network was analyzed using transfer entropy, which quantifies predictive information transfer between the sources. Variability of the source activity was estimated using multi-scale entropy, quantifying the rate of which information is generated. The empirical results are supported by an analysis of synthetic data based on the dynamics of coupled systems with time delay in coupling. We found that the amount of information transferred from one source to another was correlated with the difference in variability between the dynamics of these two sources, with the directionality of net information transfer depending on the time scale at which the sample entropy was computed. The results based on synthetic data suggest that both time delay and strength of coupling can contribute to the relations between variability of brain signals and information transfer between them. Our findings support the previous attempts to characterize functional organization of the activated brain, based on a combination of non-linear dynamics and temporal features of brain connectivity, such as time delay. PMID:22131968

Dynamic Granger causality based on Kalman filter for evaluation of functional network connectivity in fMRI data

PubMed Central

Havlicek, Martin; Jan, Jiri; Brazdil, Milan; Calhoun, Vince D.

2015-01-01

Increasing interest in understanding dynamic interactions of brain neural networks leads to formulation of sophisticated connectivity analysis methods. Recent studies have applied Granger causality based on standard multivariate autoregressive (MAR) modeling to assess the brain connectivity. Nevertheless, one important flaw of this commonly proposed method is that it requires the analyzed time series to be stationary, whereas such assumption is mostly violated due to the weakly nonstationary nature of functional magnetic resonance imaging (fMRI) time series. Therefore, we propose an approach to dynamic Granger causality in the frequency domain for evaluating functional network connectivity in fMRI data. The effectiveness and robustness of the dynamic approach was significantly improved by combining a forward and backward Kalman filter that improved estimates compared to the standard time-invariant MAR modeling. In our method, the functional networks were first detected by independent component analysis (ICA), a computational method for separating a multivariate signal into maximally independent components. Then the measure of Granger causality was evaluated using generalized partial directed coherence that is suitable for bivariate as well as multivariate data. Moreover, this metric provides identification of causal relation in frequency domain, which allows one to distinguish the frequency components related to the experimental paradigm. The procedure of evaluating Granger causality via dynamic MAR was demonstrated on simulated time series as well as on two sets of group fMRI data collected during an auditory sensorimotor (SM) or auditory oddball discrimination (AOD) tasks. Finally, a comparison with the results obtained from a standard time-invariant MAR model was provided. PMID:20561919

Predictive Control of Networked Multiagent Systems via Cloud Computing.

PubMed

Liu, Guo-Ping

2017-01-18

This paper studies the design and analysis of networked multiagent predictive control systems via cloud computing. A cloud predictive control scheme for networked multiagent systems (NMASs) is proposed to achieve consensus and stability simultaneously and to compensate for network delays actively. The design of the cloud predictive controller for NMASs is detailed. The analysis of the cloud predictive control scheme gives the necessary and sufficient conditions of stability and consensus of closed-loop networked multiagent control systems. The proposed scheme is verified to characterize the dynamical behavior and control performance of NMASs through simulations. The outcome provides a foundation for the development of cooperative and coordinative control of NMASs and its applications.

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

USGS Publications Warehouse

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

1996-01-01

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

From fuzzy recurrence plots to scalable recurrence networks of time series

NASA Astrophysics Data System (ADS)

Pham, Tuan D.

2017-04-01

Recurrence networks, which are derived from recurrence plots of nonlinear time series, enable the extraction of hidden features of complex dynamical systems. Because fuzzy recurrence plots are represented as grayscale images, this paper presents a variety of texture features that can be extracted from fuzzy recurrence plots. Based on the notion of fuzzy recurrence plots, defuzzified, undirected, and unweighted recurrence networks are introduced. Network measures can be computed for defuzzified recurrence networks that are scalable to meet the demand for the network-based analysis of big data.

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.

What's Next in Complex Networks? Capturing the Concept of Attacking Play in Invasive Team Sports.

PubMed

Ramos, João; Lopes, Rui J; Araújo, Duarte

2018-01-01

The evolution of performance analysis within sports sciences is tied to technology development and practitioner demands. However, how individual and collective patterns self-organize and interact in invasive team sports remains elusive. Social network analysis has been recently proposed to resolve some aspects of this problem, and has proven successful in capturing collective features resulting from the interactions between team members as well as a powerful communication tool. Despite these advances, some fundamental team sports concepts such as an attacking play have not been properly captured by the more common applications of social network analysis to team sports performance. In this article, we propose a novel approach to team sports performance centered on sport concepts, namely that of an attacking play. Network theory and tools including temporal and bipartite or multilayered networks were used to capture this concept. We put forward eight questions directly related to team performance to discuss how common pitfalls in the use of network tools for capturing sports concepts can be avoided. Some answers are advanced in an attempt to be more precise in the description of team dynamics and to uncover other metrics directly applied to sport concepts, such as the structure and dynamics of attacking plays. Finally, we propose that, at this stage of knowledge, it may be advantageous to build up from fundamental sport concepts toward complex network theory and tools, and not the other way around.

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.

A network of discrete events for the representation and analysis of diffusion dynamics.

PubMed

Pintus, Alberto M; Pazzona, Federico G; Demontis, Pierfranco; Suffritti, Giuseppe B

2015-11-14

We developed a coarse-grained description of the phenomenology of diffusive processes, in terms of a space of discrete events and its representation as a network. Once a proper classification of the discrete events underlying the diffusive process is carried out, their transition matrix is calculated on the basis of molecular dynamics data. This matrix can be represented as a directed, weighted network where nodes represent discrete events, and the weight of edges is given by the probability that one follows the other. The structure of this network reflects dynamical properties of the process of interest in such features as its modularity and the entropy rate of nodes. As an example of the applicability of this conceptual framework, we discuss here the physics of diffusion of small non-polar molecules in a microporous material, in terms of the structure of the corresponding network of events, and explain on this basis the diffusivity trends observed. A quantitative account of these trends is obtained by considering the contribution of the various events to the displacement autocorrelation function.

Random domain name and address mutation (RDAM) for thwarting reconnaissance attacks

PubMed Central

Chen, Xi; Zhu, Yuefei

2017-01-01

Network address shuffling is a novel moving target defense (MTD) that invalidates the address information collected by the attacker by dynamically changing or remapping the host’s network addresses. However, most network address shuffling methods are limited by the limited address space and rely on the host’s static domain name to map to its dynamic address; therefore these methods cannot effectively defend against random scanning attacks, and cannot defend against an attacker who knows the target’s domain name. In this paper, we propose a network defense method based on random domain name and address mutation (RDAM), which increases the scanning space of the attacker through a dynamic domain name method and reduces the probability that a host will be hit by an attacker scanning IP addresses using the domain name system (DNS) query list and the time window methods. Theoretical analysis and experimental results show that RDAM can defend against scanning attacks and worm propagation more effectively than general network address shuffling methods, while introducing an acceptable operational overhead. PMID:28489910

Dynamics of VEGF matrix-retention in vascular network patterning

NASA Astrophysics Data System (ADS)

Köhn-Luque, A.; de Back, W.; Yamaguchi, Y.; Yoshimura, K.; Herrero, M. A.; Miura, T.

2013-12-01

Vascular endothelial growth factor (VEGF) is a central regulator of blood vessel morphogenesis, although its role in patterning of endothelial cells into vascular networks is not fully understood. It has been suggested that binding of soluble VEGF to extracellular matrix components causes spatially restricted cues that guide endothelial cells into network patterns. Yet, current evidence for such a mechanism remains indirect. In this study, we quantitatively analyse the dynamics of VEGF retention in a controlled in vitro situation of human umbilical vascular endothelial cells (HUVECs) in Matrigel. We show that fluorescent VEGF accumulates in pericellular areas and colocalizes with VEGF binding molecules. Analysis of fluorescence recovery after photobleaching reveals that binding/unbinding to matrix molecules dominates VEGF dynamics in the pericellular region. Computational simulations using our experimental measurements of kinetic parameters show that matrix retention of chemotactic signals can lead to the formation of reticular cellular networks on a realistic timescale. Taken together, these results show that VEGF binds to matrix molecules in proximity of HUVECs in Matrigel, and suggest that bound VEGF drives vascular network patterning.

Exploring the networking behaviors of hospital organizations.

PubMed

Di Vincenzo, Fausto

2018-05-08

Despite an extensive body of knowledge exists on network outcomes and on how hospital network structures may contribute to the creation of outcomes at different levels of analysis, less attention has been paid to understanding how and why hospital organizational networks evolve and change. The aim of this paper is to study the dynamics of networking behaviors of hospital organizations. Stochastic actor-based model for network dynamics was used to quantitatively examine data covering six-years of patient transfer relations among 35 hospital organizations. Specifically, the study investigated about determinants of patient transfer evolution modeling partner selection choice as a combination of multiple organizational attributes and endogenous network-based processes. The results indicate that having overlapping specialties and treating patients with the same case-mix decrease the likelihood of observing network ties between hospitals. Also, results revealed as geographical proximity and membership of the same LHA have a positive impact on the networking behavior of hospitals organizations, there is a propensity in the network to choose larger hospitals as partners, and to transfer patients between hospitals facing similar levels of operational uncertainty. Organizational attributes (overlapping specialties and case-mix), institutional factors (LHA), and geographical proximity matter in the formation and shaping of hospital networks over time. Managers can benefit from the use of these findings by clearly identifying the role and strategic positioning of their hospital with respect to the entire network. Social network analysis can yield novel information and also aid policy makers in the formation of interventions, encouraging alliances among providers as well as planning health system restructuring.

Chaos of radiative heat-loss-induced flame front instability.

PubMed

Kinugawa, Hikaru; Ueda, Kazuhiro; Gotoda, Hiroshi

2016-03-01

We are intensively studying the chaos via the period-doubling bifurcation cascade in radiative heat-loss-induced flame front instability by analytical methods based on dynamical systems theory and complex networks. Significant changes in flame front dynamics in the chaotic region, which cannot be seen in the bifurcation diagrams, were successfully extracted from recurrence quantification analysis and nonlinear forecasting and from the network entropy. The temporal dynamics of the fuel concentration in the well-developed chaotic region is much more complicated than that of the flame front temperature. It exhibits self-affinity as a result of the scale-free structure in the constructed visibility graph.

Synchronization properties of heterogeneous neuronal networks with mixed excitability type

NASA Astrophysics Data System (ADS)

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

2015-03-01

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

Adaptive mechanism-based congestion control for networked systems

NASA Astrophysics Data System (ADS)

Liu, Zhi; Zhang, Yun; Chen, C. L. Philip

2013-03-01

In order to assure the communication quality in network systems with heavy traffic and limited bandwidth, a new ATRED (adaptive thresholds random early detection) congestion control algorithm is proposed for the congestion avoidance and resource management of network systems. Different to the traditional AQM (active queue management) algorithms, the control parameters of ATRED are not configured statically, but dynamically adjusted by the adaptive mechanism. By integrating with the adaptive strategy, ATRED alleviates the tuning difficulty of RED (random early detection) and shows a better control on the queue management, and achieve a more robust performance than RED under varying network conditions. Furthermore, a dynamic transmission control protocol-AQM control system using ATRED controller is introduced for the systematic analysis. It is proved that the stability of the network system can be guaranteed when the adaptive mechanism is finely designed. Simulation studies show the proposed ATRED algorithm achieves a good performance in varying network environments, which is superior to the RED and Gentle-RED algorithm, and providing more reliable service under varying network conditions.

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.

Adaptive control of dynamical synchronization on evolving networks with noise disturbances

NASA Astrophysics Data System (ADS)

Yuan, Wu-Jie; Zhou, Jian-Fang; Sendiña-Nadal, Irene; Boccaletti, Stefano; Wang, Zhen

2018-02-01

In real-world networked systems, the underlying structure is often affected by external and internal unforeseen factors, making its evolution typically inaccessible. An adaptive strategy was introduced for maintaining synchronization on unpredictably evolving networks [Sorrentino and Ott, Phys. Rev. Lett. 100, 114101 (2008), 10.1103/PhysRevLett.100.114101], which yet does not consider the noise disturbances widely existing in networks' environments. We provide here strategies to control dynamical synchronization on slowly and unpredictably evolving networks subjected to noise disturbances which are observed at the node and at the communication channel level. With our strategy, the nodes' coupling strength is adaptively adjusted with the aim of controlling synchronization, and according only to their received signal and noise disturbances. We first provide a theoretical analysis of the control scheme by introducing an error potential function to seek for the minimization of the synchronization error. Then, we show numerical experiments which verify our theoretical results. In particular, it is found that our adaptive strategy is effective even for the case in which the dynamics of the uncontrolled network would be explosive (i.e., the states of all the nodes would diverge to infinity).

Pseudo-random dynamic address configuration (PRDAC) algorithm for mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Wu, Shaochuan; Tan, Xuezhi

2007-11-01

By analyzing all kinds of address configuration algorithms, this paper provides a new pseudo-random dynamic address configuration (PRDAC) algorithm for mobile ad hoc networks. Based on PRDAC, the first node that initials this network randomly chooses a nonlinear shift register that can generates an m-sequence. When another node joins this network, the initial node will act as an IP address configuration sever to compute an IP address according to this nonlinear shift register, and then allocates this address and tell the generator polynomial of this shift register to this new node. By this means, when other node joins this network, any node that has obtained an IP address can act as a server to allocate address to this new node. PRDAC can also efficiently avoid IP conflicts and deal with network partition and merge as same as prophet address (PA) allocation and dynamic configuration and distribution protocol (DCDP). Furthermore, PRDAC has less algorithm complexity, less computational complexity and more sufficient assumption than PA. In addition, PRDAC radically avoids address conflicts and maximizes the utilization rate of IP addresses. Analysis and simulation results show that PRDAC has rapid convergence, low overhead and immune from topological structures.

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory

PubMed Central

Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors’ long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests. PMID:27218468

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory.

PubMed

Xing, Lizhi; Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors' long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests.

Progression In The Concepts Of Cognitive Sense Wireless Networks - An Analysis Report

NASA Astrophysics Data System (ADS)

Ajay, V. P.; Nesasudha, M.

2017-10-01

This paper illustrates the conception of networks, their primary goals (from day one to the present), the changes it had to endure to get to its present form and the developments which are in progress and in store for further standardization. The analysis gives more importance to the specifics of the Cognitive Radio Networks, which makes use of the dynamic spectrum access procedures, framed for better utilization of our available spectrum resources. The main conceptual difficulties and current research trends are also discussed in terms of real time implementation.

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.

Integration of structural dynamics and molecular evolution via protein interaction networks: a new era in genomic medicine.

PubMed

Kumar, Avishek; Butler, Brandon M; Kumar, Sudhir; Ozkan, S Banu

2015-12-01

Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. Copyright © 2015 Elsevier Ltd. All rights reserved.

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.

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.

Robustness of Oscillatory Behavior in Correlated Networks

PubMed Central

Sasai, Takeyuki; Morino, Kai; Tanaka, Gouhei; Almendral, Juan A.; Aihara, Kazuyuki

2015-01-01

Understanding network robustness against failures of network units is useful for preventing large-scale breakdowns and damages in real-world networked systems. The tolerance of networked systems whose functions are maintained by collective dynamical behavior of the network units has recently been analyzed in the framework called dynamical robustness of complex networks. The effect of network structure on the dynamical robustness has been examined with various types of network topology, but the role of network assortativity, or degree–degree correlations, is still unclear. Here we study the dynamical robustness of correlated (assortative and disassortative) networks consisting of diffusively coupled oscillators. Numerical analyses for the correlated networks with Poisson and power-law degree distributions show that network assortativity enhances the dynamical robustness of the oscillator networks but the impact of network disassortativity depends on the detailed network connectivity. Furthermore, we theoretically analyze the dynamical robustness of correlated bimodal networks with two-peak degree distributions and show the positive impact of the network assortativity. PMID:25894574

Network analysis shining light on parasite ecology and diversity.

PubMed

Poulin, Robert

2010-10-01

The vast number of species making up natural communities, and the myriad interactions among them, pose great difficulties for the study of community structure, dynamics and stability. Borrowed from other fields, network analysis is making great inroads in community ecology and is only now being applied to host-parasite interactions. It allows a complex system to be examined in its entirety, as opposed to one or a few components at a time. This review explores what network analysis is and how it can be used to investigate parasite ecology. It also summarizes the first findings to emerge from network analyses of host-parasite interactions and identifies promising future directions made possible by this approach. Copyright © 2010 Elsevier Ltd. All rights reserved.

Investigating the Temporal Patterns within and between Intrinsic Connectivity Networks under Eyes-Open and Eyes-Closed Resting States: A Dynamical Functional Connectivity Study Based on Phase Synchronization

PubMed Central

Wang, Xun-Heng; Li, Lihua; Xu, Tao; Ding, Zhongxiang

2015-01-01

The brain active patterns were organized differently under resting states of eyes open (EO) and eyes closed (EC). The altered voxel-wise and regional-wise resting state active patterns under EO/EC were found by static analysis. More importantly, dynamical spontaneous functional connectivity has been observed in the resting brain. To the best of our knowledge, the dynamical mechanisms of intrinsic connectivity networks (ICNs) under EO/EC remain largely unexplored. The goals of this paper were twofold: 1) investigating the dynamical intra-ICN and inter-ICN temporal patterns during resting state; 2) analyzing the altered dynamical temporal patterns of ICNs under EO/EC. To this end, a cohort of healthy subjects with scan conditions of EO/EC were recruited from 1000 Functional Connectomes Project. Through Hilbert transform, time-varying phase synchronization (PS) was applied to evaluate the inter-ICN synchrony. Meanwhile, time-varying amplitude was analyzed as dynamical intra-ICN temporal patterns. The results found six micro-states of inter-ICN synchrony. The medial visual network (MVN) showed decreased intra-ICN amplitude during EC relative to EO. The sensory-motor network (SMN) and auditory network (AN) exhibited enhanced intra-ICN amplitude during EC relative to EO. Altered inter-ICN PS was found between certain ICNs. Particularly, the SMN and AN exhibited enhanced PS to other ICNs during EC relative to EO. In addition, the intra-ICN amplitude might influence the inter-ICN synchrony. Moreover, default mode network (DMN) might play an important role in information processing during EO/EC. Together, the dynamical temporal patterns within and between ICNs were altered during different scan conditions of EO/EC. Overall, the dynamical intra-ICN and inter-ICN temporal patterns could benefit resting state fMRI-related research, and could be potential biomarkers for human functional connectome. PMID:26469182

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.

Cooperative spreading processes in multiplex networks.

PubMed

Wei, Xiang; Chen, Shihua; Wu, Xiaoqun; Ning, Di; Lu, Jun-An

2016-06-01

This study is concerned with the dynamic behaviors of epidemic spreading in multiplex networks. A model composed of two interacting complex networks is proposed to describe cooperative spreading processes, wherein the virus spreading in one layer can penetrate into the other to promote the spreading process. The global epidemic threshold of the model is smaller than the epidemic thresholds of the corresponding isolated networks. Thus, global epidemic onset arises in the interacting networks even though an epidemic onset does not arise in each isolated network. Simulations verify the analysis results and indicate that cooperative spreading processes in multiplex networks enhance the final infection fraction.

Use of transcriptome sequencing to understand the pistillate flowering in hickory (Carya cathayensis Sarg.).

PubMed

Huang, You-Jun; Liu, Li-Li; Huang, Jian-Qin; Wang, Zheng-Jia; Chen, Fang-Fang; Zhang, Qi-Xiang; Zheng, Bing-Song; Chen, Ming

2013-10-10

Different from herbaceous plants, the woody plants undergo a long-period vegetative stage to achieve floral transition. They then turn into seasonal plants, flowering annually. In this study, a preliminary model of gene regulations for seasonal pistillate flowering in hickory (Carya cathayensis) was proposed. The genome-wide dynamic transcriptome was characterized via the joint-approach of RNA sequencing and microarray analysis. Differential transcript abundance analysis uncovered the dynamic transcript abundance patterns of flowering correlated genes and their major functions based on Gene Ontology (GO) analysis. To explore pistillate flowering mechanism in hickory, a comprehensive flowering gene regulatory network based on Arabidopsis thaliana was constructed by additional literature mining. A total of 114 putative flowering or floral genes including 31 with differential transcript abundance were identified in hickory. The locations, functions and dynamic transcript abundances were analyzed in the gene regulatory networks. A genome-wide co-expression network for the putative flowering or floral genes shows three flowering regulatory modules corresponding to response to light abiotic stimulus, cold stress, and reproductive development process, respectively. Totally 27 potential flowering or floral genes were recruited which are meaningful to understand the hickory specific seasonal flowering mechanism better. Flowering event of pistillate flower bud in hickory is triggered by several pathways synchronously including the photoperiod, autonomous, vernalization, gibberellin, and sucrose pathway. Totally 27 potential flowering or floral genes were recruited from the genome-wide co-expression network function module analysis. Moreover, the analysis provides a potential FLC-like gene based vernalization pathway and an 'AC' model for pistillate flower development in hickory. This work provides an available framework for pistillate flower development in hickory, which is significant for insight into regulation of flowering and floral development of woody plants.

Use of transcriptome sequencing to understand the pistillate flowering in hickory (Carya cathayensis Sarg.)

PubMed Central

2013-01-01

Background Different from herbaceous plants, the woody plants undergo a long-period vegetative stage to achieve floral transition. They then turn into seasonal plants, flowering annually. In this study, a preliminary model of gene regulations for seasonal pistillate flowering in hickory (Carya cathayensis) was proposed. The genome-wide dynamic transcriptome was characterized via the joint-approach of RNA sequencing and microarray analysis. Results Differential transcript abundance analysis uncovered the dynamic transcript abundance patterns of flowering correlated genes and their major functions based on Gene Ontology (GO) analysis. To explore pistillate flowering mechanism in hickory, a comprehensive flowering gene regulatory network based on Arabidopsis thaliana was constructed by additional literature mining. A total of 114 putative flowering or floral genes including 31 with differential transcript abundance were identified in hickory. The locations, functions and dynamic transcript abundances were analyzed in the gene regulatory networks. A genome-wide co-expression network for the putative flowering or floral genes shows three flowering regulatory modules corresponding to response to light abiotic stimulus, cold stress, and reproductive development process, respectively. Totally 27 potential flowering or floral genes were recruited which are meaningful to understand the hickory specific seasonal flowering mechanism better. Conclusions Flowering event of pistillate flower bud in hickory is triggered by several pathways synchronously including the photoperiod, autonomous, vernalization, gibberellin, and sucrose pathway. Totally 27 potential flowering or floral genes were recruited from the genome-wide co-expression network function module analysis. Moreover, the analysis provides a potential FLC-like gene based vernalization pathway and an 'AC’ model for pistillate flower development in hickory. This work provides an available framework for pistillate flower development in hickory, which is significant for insight into regulation of flowering and floral development of woody plants. PMID:24106755

Experimental Modal Analysis and Dynaic Strain Fiber Bragg Gratings for Structural Health Monitoring of Composite Aerospace Structures

NASA Astrophysics Data System (ADS)

Panopoulou, A.; Fransen, S.; Gomez Molinero, V.; Kostopoulos, V.

2012-07-01

The objective of this work is to develop a new structural health monitoring system for composite aerospace structures based on dynamic response strain measurements and experimental modal analysis techniques. Fibre Bragg Grating (FBG) optical sensors were used for monitoring the dynamic response of the composite structure. The structural dynamic behaviour has been numerically simulated and experimentally verified by means of vibration testing. The hypothesis of all vibration tests was that actual damage in composites reduces their stiffness and produces the same result as mass increase produces. Thus, damage was simulated by slightly varying locally the mass of the structure at different zones. Experimental modal analysis based on the strain responses was conducted and the extracted strain mode shapes were the input for the damage detection expert system. A feed-forward back propagation neural network was the core of the damage detection system. The features-input to the neural network consisted of the strain mode shapes, extracted from the experimental modal analysis. Dedicated training and validation activities were carried out based on the experimental results. The system showed high reliability, confirmed by the ability of the neural network to recognize the size and the position of damage on the structure. The experiments were performed on a real structure i.e. a lightweight antenna sub- reflector, manufactured and tested at EADS CASA ESPACIO. An integrated FBG sensor network, based on the advantage of multiplexing, was mounted on the structure with optimum topology. Numerical simulation of both structures was used as a support tool at all the steps of the work. Potential applications for the proposed system are during ground qualification extensive tests of space structures and during the mission as modal analysis tool on board, being able via the FBG responses to identify a potential failure.

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

NASA Astrophysics Data System (ADS)

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

2012-11-01

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

A Study on Standard Competition with Network Effect Based on Evolutionary Game Model

NASA Astrophysics Data System (ADS)

Wang, Ye; Wang, Bingdong; Li, Kangning

Owing to networks widespread in modern society, standard competition with network effect is now endowed with new connotation. This paper aims to study the impact of network effect on standard competition; it is organized in the mode of "introduction-model setup-equilibrium analysis-conclusion". Starting from a well-structured model of evolutionary game, it is then extended to a dynamic analysis. This article proves both theoretically and empirically that whether or not a standard can lead the market trends depends on the utility it would bring, and the author also discusses some advisable strategies revolving around the two factors of initial position and border break.

Two-photon imaging and analysis of neural network dynamics

NASA Astrophysics Data System (ADS)

Lütcke, Henry; Helmchen, Fritjof

2011-08-01

The glow of a starry night sky, the smell of a freshly brewed cup of coffee or the sound of ocean waves breaking on the beach are representations of the physical world that have been created by the dynamic interactions of thousands of neurons in our brains. How the brain mediates perceptions, creates thoughts, stores memories and initiates actions remains one of the most profound puzzles in biology, if not all of science. A key to a mechanistic understanding of how the nervous system works is the ability to measure and analyze the dynamics of neuronal networks in the living organism in the context of sensory stimulation and behavior. Dynamic brain properties have been fairly well characterized on the microscopic level of individual neurons and on the macroscopic level of whole brain areas largely with the help of various electrophysiological techniques. However, our understanding of the mesoscopic level comprising local populations of hundreds to thousands of neurons (so-called 'microcircuits') remains comparably poor. Predominantly, this has been due to the technical difficulties involved in recording from large networks of neurons with single-cell spatial resolution and near-millisecond temporal resolution in the brain of living animals. In recent years, two-photon microscopy has emerged as a technique which meets many of these requirements and thus has become the method of choice for the interrogation of local neural circuits. Here, we review the state-of-research in the field of two-photon imaging of neuronal populations, covering the topics of microscope technology, suitable fluorescent indicator dyes, staining techniques, and in particular analysis techniques for extracting relevant information from the fluorescence data. We expect that functional analysis of neural networks using two-photon imaging will help to decipher fundamental operational principles of neural microcircuits.

Network Configurations in the Human Brain Reflect Choice Bias during Rapid Face Processing.

PubMed

Tu, Tao; Schneck, Noam; Muraskin, Jordan; Sajda, Paul

2017-12-13

Network interactions are likely to be instrumental in processes underlying rapid perception and cognition. Specifically, high-level and perceptual regions must interact to balance pre-existing models of the environment with new incoming stimuli. Simultaneous electroencephalography (EEG) and fMRI (EEG/fMRI) enables temporal characterization of brain-network interactions combined with improved anatomical localization of regional activity. In this paper, we use simultaneous EEG/fMRI and multivariate dynamical systems (MDS) analysis to characterize network relationships between constitute brain areas that reflect a subject's choice for a face versus nonface categorization task. Our simultaneous EEG and fMRI analysis on 21 human subjects (12 males, 9 females) identifies early perceptual and late frontal subsystems that are selective to the categorical choice of faces versus nonfaces. We analyze the interactions between these subsystems using an MDS in the space of the BOLD signal. Our main findings show that differences between face-choice and house-choice networks are seen in the network interactions between the early and late subsystems, and that the magnitude of the difference in network interaction positively correlates with the behavioral false-positive rate of face choices. We interpret this to reflect the role of saliency and expectations likely encoded in frontal "late" regions on perceptual processes occurring in "early" perceptual regions. SIGNIFICANCE STATEMENT Our choices are affected by our biases. In visual perception and cognition such biases can be commonplace and quite curious-e.g., we see a human face when staring up at a cloud formation or down at a piece of toast at the breakfast table. Here we use multimodal neuroimaging and dynamical systems analysis to measure whole-brain spatiotemporal dynamics while subjects make decisions regarding the type of object they see in rapidly flashed images. We find that the degree of interaction in these networks accounts for a substantial fraction of our bias to see faces. In general, our findings illustrate how the properties of spatiotemporal networks yield insight into the mechanisms of how we form decisions. Copyright © 2017 the authors 0270-6474/17/3712226-12$15.00/0.

Network Configurations in the Human Brain Reflect Choice Bias during Rapid Face Processing

PubMed Central

Schneck, Noam

2017-01-01

Network interactions are likely to be instrumental in processes underlying rapid perception and cognition. Specifically, high-level and perceptual regions must interact to balance pre-existing models of the environment with new incoming stimuli. Simultaneous electroencephalography (EEG) and fMRI (EEG/fMRI) enables temporal characterization of brain–network interactions combined with improved anatomical localization of regional activity. In this paper, we use simultaneous EEG/fMRI and multivariate dynamical systems (MDS) analysis to characterize network relationships between constitute brain areas that reflect a subject's choice for a face versus nonface categorization task. Our simultaneous EEG and fMRI analysis on 21 human subjects (12 males, 9 females) identifies early perceptual and late frontal subsystems that are selective to the categorical choice of faces versus nonfaces. We analyze the interactions between these subsystems using an MDS in the space of the BOLD signal. Our main findings show that differences between face-choice and house-choice networks are seen in the network interactions between the early and late subsystems, and that the magnitude of the difference in network interaction positively correlates with the behavioral false-positive rate of face choices. We interpret this to reflect the role of saliency and expectations likely encoded in frontal “late” regions on perceptual processes occurring in “early” perceptual regions. SIGNIFICANCE STATEMENT Our choices are affected by our biases. In visual perception and cognition such biases can be commonplace and quite curious—e.g., we see a human face when staring up at a cloud formation or down at a piece of toast at the breakfast table. Here we use multimodal neuroimaging and dynamical systems analysis to measure whole-brain spatiotemporal dynamics while subjects make decisions regarding the type of object they see in rapidly flashed images. We find that the degree of interaction in these networks accounts for a substantial fraction of our bias to see faces. In general, our findings illustrate how the properties of spatiotemporal networks yield insight into the mechanisms of how we form decisions. PMID:29118108

Structure-Based Network Analysis of Activation Mechanisms in the ErbB Family of Receptor Tyrosine Kinases: The Regulatory Spine Residues Are Global Mediators of Structural Stability and Allosteric Interactions

PubMed Central

James, Kevin A.; Verkhivker, Gennady M.

2014-01-01

The ErbB protein tyrosine kinases are among the most important cell signaling families and mutation-induced modulation of their activity is associated with diverse functions in biological networks and human disease. We have combined molecular dynamics simulations of the ErbB kinases with the protein structure network modeling to characterize the reorganization of the residue interaction networks during conformational equilibrium changes in the normal and oncogenic forms. Structural stability and network analyses have identified local communities integrated around high centrality sites that correspond to the regulatory spine residues. This analysis has provided a quantitative insight to the mechanism of mutation-induced “superacceptor” activity in oncogenic EGFR dimers. We have found that kinase activation may be determined by allosteric interactions between modules of structurally stable residues that synchronize the dynamics in the nucleotide binding site and the αC-helix with the collective motions of the integrating αF-helix and the substrate binding site. The results of this study have pointed to a central role of the conserved His-Arg-Asp (HRD) motif in the catalytic loop and the Asp-Phe-Gly (DFG) motif as key mediators of structural stability and allosteric communications in the ErbB kinases. We have determined that residues that are indispensable for kinase regulation and catalysis often corresponded to the high centrality nodes within the protein structure network and could be distinguished by their unique network signatures. The optimal communication pathways are also controlled by these nodes and may ensure efficient allosteric signaling in the functional kinase state. Structure-based network analysis has quantified subtle effects of ATP binding on conformational dynamics and stability of the EGFR structures. Consistent with the NMR studies, we have found that nucleotide-induced modulation of the residue interaction networks is not limited to the ATP site, and may enhance allosteric cooperativity with the substrate binding region by increasing communication capabilities of mediating residues. PMID:25427151

Network analysis reveals the recognition mechanism for complex formation of mannose-binding lectins

NASA Astrophysics Data System (ADS)

Jian, Yiren; Zhao, Yunjie; Zeng, Chen

The specific carbohydrate binding of lectin makes the protein a powerful molecular tool for various applications including cancer cell detection due to its glycoprotein profile on the cell surface. Most biologically active lectins are dimeric. To understand the structure-function relation of lectin complex, it is essential to elucidate the short- and long-range driving forces behind the dimer formation. Here we report our molecular dynamics simulations and associated dynamical network analysis on a particular lectin, i.e., the mannose-binding lectin from garlic. Our results, further supported by sequence coevolution analysis, shed light on how different parts of the complex communicate with each other. We propose a general framework for deciphering the recognition mechanism underlying protein-protein interactions that may have potential applications in signaling pathways.

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

PubMed Central

Stringer, Clive; Beeknoo, Neeraj

2017-01-01

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

Using barometric time series of the IMS infrasound network for a global analysis of thermally induced atmospheric tides

NASA Astrophysics Data System (ADS)

Hupe, Patrick; Ceranna, Lars; Pilger, Christoph

2018-04-01

The International Monitoring System (IMS) has been established to monitor compliance with the Comprehensive Nuclear-Test-Ban Treaty and comprises four technologies, one of which is infrasound. When fully established, the IMS infrasound network consists of 60 sites uniformly distributed around the globe. Besides its primary purpose of determining explosions in the atmosphere, the recorded data reveal information on other anthropogenic and natural infrasound sources. Furthermore, the almost continuous multi-year recordings of differential and absolute air pressure allow for analysing the atmospheric conditions. In this paper, spectral analysis tools are applied to derive atmospheric dynamics from barometric time series. Based on the solar atmospheric tides, a methodology for performing geographic and temporal variability analyses is presented, which is supposed to serve for upcoming studies related to atmospheric dynamics. The surplus value of using the IMS infrasound network data for such purposes is demonstrated by comparing the findings on the thermal tides with previous studies and the Modern-Era Retrospective analysis for Research and Applications Version 2 (MERRA-2), which represents the solar tides well in its surface pressure fields. Absolute air pressure recordings reveal geographical characteristics of atmospheric tides related to the solar day and even to the lunar day. We therefore claim the chosen methodology of using the IMS infrasound network to be applicable for global and temporal studies on specific atmospheric dynamics. Given the accuracy and high temporal resolution of the barometric data from the IMS infrasound network, interactions with gravity waves and planetary waves can be examined in future for refining the knowledge of atmospheric dynamics, e.g. the origin of tidal harmonics up to 9 cycles per day as found in the barometric data sets. Data assimilation in empirical models of solar tides would be a valuable application of the IMS infrasound data.

Measuring the regulation of keratin filament network dynamics

PubMed Central

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

2013-01-01

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

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.

[Reliability theory based on quality risk network analysis for Chinese medicine injection].

PubMed

Li, Zheng; Kang, Li-Yuan; Fan, Xiao-Hui

2014-08-01

A new risk analysis method based upon reliability theory was introduced in this paper for the quality risk management of Chinese medicine injection manufacturing plants. The risk events including both cause and effect ones were derived in the framework as nodes with a Bayesian network analysis approach. It thus transforms the risk analysis results from failure mode and effect analysis (FMEA) into a Bayesian network platform. With its structure and parameters determined, the network can be used to evaluate the system reliability quantitatively with probabilistic analytical appraoches. Using network analysis tools such as GeNie and AgenaRisk, we are able to find the nodes that are most critical to influence the system reliability. The importance of each node to the system can be quantitatively evaluated by calculating the effect of the node on the overall risk, and minimization plan can be determined accordingly to reduce their influences and improve the system reliability. Using the Shengmai injection manufacturing plant of SZYY Ltd as a user case, we analyzed the quality risk with both static FMEA analysis and dynamic Bayesian Network analysis. The potential risk factors for the quality of Shengmai injection manufacturing were identified with the network analysis platform. Quality assurance actions were further defined to reduce the risk and improve the product quality.

Inferring Network Controls from Topology Using the Chomp Database

DTIC Science & Technology

2015-12-03

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

Reaction dynamics analysis of a reconstituted Escherichia coli protein translation system by computational modeling

PubMed Central

Matsuura, Tomoaki; Tanimura, Naoki; Hosoda, Kazufumi; Yomo, Tetsuya; Shimizu, Yoshihiro

2017-01-01

To elucidate the dynamic features of a biologically relevant large-scale reaction network, we constructed a computational model of minimal protein synthesis consisting of 241 components and 968 reactions that synthesize the Met-Gly-Gly (MGG) peptide based on an Escherichia coli-based reconstituted in vitro protein synthesis system. We performed a simulation using parameters collected primarily from the literature and found that the rate of MGG peptide synthesis becomes nearly constant in minutes, thus achieving a steady state similar to experimental observations. In addition, concentration changes to 70% of the components, including intermediates, reached a plateau in a few minutes. However, the concentration change of each component exhibits several temporal plateaus, or a quasi-stationary state (QSS), before reaching the final plateau. To understand these complex dynamics, we focused on whether the components reached a QSS, mapped the arrangement of components in a QSS in the entire reaction network structure, and investigated time-dependent changes. We found that components in a QSS form clusters that grow over time but not in a linear fashion, and that this process involves the collapse and regrowth of clusters before the formation of a final large single cluster. These observations might commonly occur in other large-scale biological reaction networks. This developed analysis might be useful for understanding large-scale biological reactions by visualizing complex dynamics, thereby extracting the characteristics of the reaction network, including phase transitions. PMID:28167777

Microwave analog fiber-optic link for use in the deep space network

NASA Technical Reports Server (NTRS)

Logan, R. T., Jr.; Lutes, G. F.; Maleki, L.

1990-01-01

A novel fiber-optic system with dynamic range of up to 150 dB-Hz for transmission of microwave analog signals is described. The design, analysis, and laboratory evaluations of this system are reported, and potential applications in the NASA/JPL Deep Space Network are discussed.

Network Analysis of a Virtual Community of Learning of Economics Educators

ERIC Educational Resources Information Center

Fontainha, Elsa; Martins, Jorge Tiago; Vasconcelos, Ana Cristina

2015-01-01

Introduction: This paper aims at understanding virtual communities of learning in terms of dynamics, types of knowledge shared by participants, and network characteristics such as size, relationships, density, and centrality of participants. It looks at the relationships between these aspects and the evolution of communities of learning. It…

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

Effects of active links on epidemic transmission over social networks

NASA Astrophysics Data System (ADS)

Zhu, Guanghu; Chen, Guanrong; Fu, Xinchu

2017-02-01

A new epidemic model with two infection periods is developed to account for the human behavior in social network, where newly infected individuals gradually restrict most of future contacts or are quarantined, causing infectivity change from a degree-dependent form to a constant. The corresponding dynamics are formulated by a set of ordinary differential equations (ODEs) via mean-field approximation. The effects of diverse infectivity on the epidemic dynamics ​are examined, with a behavioral interpretation of the basic reproduction number. Results show that such simple adaptive reactions largely determine the impact of network structure on epidemics. Particularly, a theorem proposed by Lajmanovich and Yorke in 1976 is generalized, so that it can be applied for the analysis of the epidemic models with multi-compartments especially network-coupled ODE systems.

Variable Neural Adaptive Robust Control: A Switched System Approach

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

Lian, Jianming; Hu, Jianghai; Zak, Stanislaw H.

2015-05-01

Variable neural adaptive robust control strategies are proposed for the output tracking control of a class of multi-input multi-output uncertain systems. The controllers incorporate a variable-structure radial basis function (RBF) network as the self-organizing approximator for unknown system dynamics. The variable-structure RBF network solves the problem of structure determination associated with fixed-structure RBF networks. It can determine the network structure on-line dynamically by adding or removing radial basis functions according to the tracking performance. The structure variation is taken into account in the stability analysis of the closed-loop system using a switched system approach with the aid of the piecewisemore » quadratic Lyapunov function. The performance of the proposed variable neural adaptive robust controllers is illustrated with simulations.« less

Correlations induced by depressing synapses in critically self-organized networks with quenched dynamics

NASA Astrophysics Data System (ADS)

Campos, João Guilherme Ferreira; Costa, Ariadne de Andrade; Copelli, Mauro; Kinouchi, Osame

2017-04-01

In a recent work, mean-field analysis and computer simulations were employed to analyze critical self-organization in networks of excitable cellular automata where randomly chosen synapses in the network were depressed after each spike (the so-called annealed dynamics). Calculations agree with simulations of the annealed version, showing that the nominal branching ratio σ converges to unity in the thermodynamic limit, as expected of a self-organized critical system. However, the question remains whether the same results apply to the biological case where only the synapses of firing neurons are depressed (the so-called quenched dynamics). We show that simulations of the quenched model yield significant deviations from σ =1 due to spatial correlations. However, the model is shown to be critical, as the largest eigenvalue of the synaptic matrix approaches unity in the thermodynamic limit, that is, λc=1 . We also study the finite size effects near the critical state as a function of the parameters of the synaptic dynamics.

Granger causality network reconstruction of conductance-based integrate-and-fire neuronal systems.

PubMed

Zhou, Douglas; Xiao, Yanyang; Zhang, Yaoyu; Xu, Zhiqin; Cai, David

2014-01-01

Reconstruction of anatomical connectivity from measured dynamical activities of coupled neurons is one of the fundamental issues in the understanding of structure-function relationship of neuronal circuitry. Many approaches have been developed to address this issue based on either electrical or metabolic data observed in experiment. The Granger causality (GC) analysis remains one of the major approaches to explore the dynamical causal connectivity among individual neurons or neuronal populations. However, it is yet to be clarified how such causal connectivity, i.e., the GC connectivity, can be mapped to the underlying anatomical connectivity in neuronal networks. We perform the GC analysis on the conductance-based integrate-and-fire (I&F) neuronal networks to obtain their causal connectivity. Through numerical experiments, we find that the underlying synaptic connectivity amongst individual neurons or subnetworks, can be successfully reconstructed by the GC connectivity constructed from voltage time series. Furthermore, this reconstruction is insensitive to dynamical regimes and can be achieved without perturbing systems and prior knowledge of neuronal model parameters. Surprisingly, the synaptic connectivity can even be reconstructed by merely knowing the raster of systems, i.e., spike timing of neurons. Using spike-triggered correlation techniques, we establish a direct mapping between the causal connectivity and the synaptic connectivity for the conductance-based I&F neuronal networks, and show the GC is quadratically related to the coupling strength. The theoretical approach we develop here may provide a framework for examining the validity of the GC analysis in other settings.

Granger Causality Network Reconstruction of Conductance-Based Integrate-and-Fire Neuronal Systems

PubMed Central

Zhou, Douglas; Xiao, Yanyang; Zhang, Yaoyu; Xu, Zhiqin; Cai, David

2014-01-01

Reconstruction of anatomical connectivity from measured dynamical activities of coupled neurons is one of the fundamental issues in the understanding of structure-function relationship of neuronal circuitry. Many approaches have been developed to address this issue based on either electrical or metabolic data observed in experiment. The Granger causality (GC) analysis remains one of the major approaches to explore the dynamical causal connectivity among individual neurons or neuronal populations. However, it is yet to be clarified how such causal connectivity, i.e., the GC connectivity, can be mapped to the underlying anatomical connectivity in neuronal networks. We perform the GC analysis on the conductance-based integrate-and-fire (IF) neuronal networks to obtain their causal connectivity. Through numerical experiments, we find that the underlying synaptic connectivity amongst individual neurons or subnetworks, can be successfully reconstructed by the GC connectivity constructed from voltage time series. Furthermore, this reconstruction is insensitive to dynamical regimes and can be achieved without perturbing systems and prior knowledge of neuronal model parameters. Surprisingly, the synaptic connectivity can even be reconstructed by merely knowing the raster of systems, i.e., spike timing of neurons. Using spike-triggered correlation techniques, we establish a direct mapping between the causal connectivity and the synaptic connectivity for the conductance-based IF neuronal networks, and show the GC is quadratically related to the coupling strength. The theoretical approach we develop here may provide a framework for examining the validity of the GC analysis in other settings. PMID:24586285

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik; Marwan, Norbert; Dijkstra, Henk; Kurths, Jürgen

2016-04-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology. pyunicorn is available online at https://github.com/pik-copan/pyunicorn. Reference: J.F. Donges, J. Heitzig, B. Beronov, M. Wiedermann, J. Runge, Q.-Y. Feng, L. Tupikina, V. Stolbova, R.V. Donner, N. Marwan, H.A. Dijkstra, and J. Kurths, Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package, Chaos 25, 113101 (2015), DOI: 10.1063/1.4934554, Preprint: arxiv.org:1507.01571 [physics.data-an].

Social network approaches to recruitment, HIV prevention, medical care, and medication adherence.

PubMed

Latkin, Carl A; Davey-Rothwell, Melissa A; Knowlton, Amy R; Alexander, Kamila A; Williams, Chyvette T; Boodram, Basmattee

2013-06-01

This article reviews the current issues and advancements in social network approaches to HIV prevention and care. Social network analysis can provide a method to understand health disparities in HIV rates, treatment access, and outcomes. Social network analysis is a valuable tool to link social structural factors to individual behaviors. Social networks provide an avenue for low-cost and sustainable HIV prevention interventions that can be adapted and translated into diverse populations. Social networks can be utilized as a viable approach to recruitment for HIV testing and counseling, HIV prevention interventions, optimizing HIV medical care, and medication adherence. Social network interventions may be face-to-face or through social media. Key issues in designing social network interventions are contamination due to social diffusion, network stability, density, and the choice and training of network members. There are also ethical issues involved in the development and implementation of social network interventions. Social network analyses can also be used to understand HIV transmission dynamics.

Exploring the Epileptic Brain Network Using Time-Variant Effective Connectivity and Graph Theory.

PubMed

Storti, Silvia Francesca; Galazzo, Ilaria Boscolo; Khan, Sehresh; Manganotti, Paolo; Menegaz, Gloria

2017-09-01

The application of time-varying measures of causality between source time series can be very informative to elucidate the direction of communication among the regions of an epileptic brain. The aim of the study was to identify the dynamic patterns of epileptic networks in focal epilepsy by applying multivariate adaptive directed transfer function (ADTF) analysis and graph theory to high-density electroencephalographic recordings. The cortical network was modeled after source reconstruction and topology modulations were detected during interictal spikes. First a distributed linear inverse solution, constrained to the individual grey matter, was applied to the averaged spikes and the mean source activity over 112 regions, as identified by the Harvard-Oxford Atlas, was calculated. Then, the ADTF, a dynamic measure of causality, was used to quantify the connectivity strength between pairs of regions acting as nodes in the graph, and the measure of node centrality was derived. The proposed analysis was effective in detecting the focal regions as well as in characterizing the dynamics of the spike propagation, providing evidence of the fact that the node centrality is a reliable feature for the identification of the epileptogenic zones. Validation was performed by multimodal analysis as well as from surgical outcomes. In conclusion, the time-variant connectivity analysis applied to the epileptic patients can distinguish the generator of the abnormal activity from the propagation spread and identify the connectivity pattern over time.

Identification of neuronal network properties from the spectral analysis of calcium imaging signals in neuronal cultures.

PubMed

Tibau, Elisenda; Valencia, Miguel; Soriano, Jordi

2013-01-01

Neuronal networks in vitro are prominent systems to study the development of connections in living neuronal networks and the interplay between connectivity, activity and function. These cultured networks show a rich spontaneous activity that evolves concurrently with the connectivity of the underlying network. In this work we monitor the development of neuronal cultures, and record their activity using calcium fluorescence imaging. We use spectral analysis to characterize global dynamical and structural traits of the neuronal cultures. We first observe that the power spectrum can be used as a signature of the state of the network, for instance when inhibition is active or silent, as well as a measure of the network's connectivity strength. Second, the power spectrum identifies prominent developmental changes in the network such as GABAA switch. And third, the analysis of the spatial distribution of the spectral density, in experiments with a controlled disintegration of the network through CNQX, an AMPA-glutamate receptor antagonist in excitatory neurons, reveals the existence of communities of strongly connected, highly active neurons that display synchronous oscillations. Our work illustrates the interest of spectral analysis for the study of in vitro networks, and its potential use as a network-state indicator, for instance to compare healthy and diseased neuronal networks.

Automated analysis of information processing, kinetic independence and modular architecture in biochemical networks using MIDIA.

PubMed

Bowsher, Clive G

2011-02-15

Understanding the encoding and propagation of information by biochemical reaction networks and the relationship of such information processing properties to modular network structure is of fundamental importance in the study of cell signalling and regulation. However, a rigorous, automated approach for general biochemical networks has not been available, and high-throughput analysis has therefore been out of reach. Modularization Identification by Dynamic Independence Algorithms (MIDIA) is a user-friendly, extensible R package that performs automated analysis of how information is processed by biochemical networks. An important component is the algorithm's ability to identify exact network decompositions based on both the mass action kinetics and informational properties of the network. These modularizations are visualized using a tree structure from which important dynamic conditional independence properties can be directly read. Only partial stoichiometric information needs to be used as input to MIDIA, and neither simulations nor knowledge of rate parameters are required. When applied to a signalling network, for example, the method identifies the routes and species involved in the sequential propagation of information between its multiple inputs and outputs. These routes correspond to the relevant paths in the tree structure and may be further visualized using the Input-Output Path Matrix tool. MIDIA remains computationally feasible for the largest network reconstructions currently available and is straightforward to use with models written in Systems Biology Markup Language (SBML). The package is distributed under the GNU General Public License and is available, together with a link to browsable Supplementary Material, at http://code.google.com/p/midia. Further information is at www.maths.bris.ac.uk/~macgb/Software.html.

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.

Passive and Active Analysis in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Dempsey, Tae; Sahin, Gokhan; Morton, Y. T. (Jade)

Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments. Furthermore, we investigate active analysis, which is the combination of a classifier and intelligent jammer to invoke specific responses from a victim network.

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.

Electrical Mapping of Silver Nanowire Networks: A Versatile Tool for Imaging Network Homogeneity and Degradation Dynamics during Failure.

PubMed

Sannicolo, Thomas; Charvin, Nicolas; Flandin, Lionel; Kraus, Silas; Papanastasiou, Dorina T; Celle, Caroline; Simonato, Jean-Pierre; Muñoz-Rojas, David; Jiménez, Carmen; Bellet, Daniel

2018-05-22

Electrical stability and homogeneity of silver nanowire (AgNW) networks are critical assets for increasing their robustness and reliability when integrated as transparent electrodes in devices. Our ability to distinguish defects, inhomogeneities, or inactive areas at the scale of the entire network is therefore a critical issue. We propose one-probe electrical mapping (1P-mapping) as a specific simple tool to study the electrical distribution in these discrete structures. 1P-mapping has allowed us to show that the tortuosity of the voltage equipotential lines of AgNW networks under bias decreases with increasing network density, leading to a better electrical homogeneity. The impact of the network fabrication technique on the electrical homogeneity of the resulting electrode has also been investigated. Then, by combining 1P-mapping with electrical resistance measurements and IR thermography, we propose a comprehensive analysis of the evolution of the electrical distribution in AgNW networks when subjected to increasing voltage stresses. We show that AgNW networks experience three distinctive stages: optimization, degradation, and breakdown. We also demonstrate that the failure dynamics of AgNW networks at high voltages occurs through a highly correlated and spatially localized mechanism. In particular the in situ formation of cracks could be clearly visualized. It consists of two steps: creation of a crack followed by propagation nearly parallel to the equipotential lines. Finally, we show that current can dynamically redistribute during failure, by following partially damaged secondary pathways through the crack.

Dynamics of Bottlebrush Networks

NASA Astrophysics Data System (ADS)

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

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

Network robustness assessed within a dual connectivity framework: joint dynamics of the Active and Idle Networks.

PubMed

Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Ambroj, Samuel; Foufoula-Georgiou, Efi

2017-08-17

Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. But current definition of robustness is only accounting for half of the story: the connectivity of the nodes unaffected by the attack. Here we propose a new framework to assess network robustness, wherein the connectivity of the affected nodes is also taken into consideration, acknowledging that it plays a crucial role in properly evaluating the overall network robustness in terms of its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and that of building-up the IN. We show, via analysis of well-known prototype networks and real world data, that trade-offs between the efficiency of Active and Idle Network dynamics give rise to surprising robustness crossovers and re-rankings, which can have significant implications for decision making.

Dynamic robustness of knowledge collaboration network of open source product development community

NASA Astrophysics Data System (ADS)

Zhou, Hong-Li; Zhang, Xiao-Dong

2018-01-01

As an emergent innovative design style, open source product development communities are characterized by a self-organizing, mass collaborative, networked structure. The robustness of the community is critical to its performance. Using the complex network modeling method, the knowledge collaboration network of the community is formulated, and the robustness of the network is systematically and dynamically studied. The characteristics of the network along the development period determine that its robustness should be studied from three time stages: the start-up, development and mature stages of the network. Five kinds of user-loss pattern are designed, to assess the network's robustness under different situations in each of these three time stages. Two indexes - the largest connected component and the network efficiency - are used to evaluate the robustness of the community. The proposed approach is applied in an existing open source car design community. The results indicate that the knowledge collaboration networks show different levels of robustness in different stages and different user loss patterns. Such analysis can be applied to provide protection strategies for the key users involved in knowledge dissemination and knowledge contribution at different stages of the network, thereby promoting the sustainable and stable development of the open source community.

Elementary signaling modes predict the essentiality of signal transduction network components

PubMed Central

2011-01-01

Background Understanding how signals propagate through signaling pathways and networks is a central goal in systems biology. Quantitative dynamic models help to achieve this understanding, but are difficult to construct and validate because of the scarcity of known mechanistic details and kinetic parameters. Structural and qualitative analysis is emerging as a feasible and useful alternative for interpreting signal transduction. Results In this work, we present an integrative computational method for evaluating the essentiality of components in signaling networks. This approach expands an existing signaling network to a richer representation that incorporates the positive or negative nature of interactions and the synergistic behaviors among multiple components. Our method simulates both knockout and constitutive activation of components as node disruptions, and takes into account the possible cascading effects of a node's disruption. We introduce the concept of elementary signaling mode (ESM), as the minimal set of nodes that can perform signal transduction independently. Our method ranks the importance of signaling components by the effects of their perturbation on the ESMs of the network. Validation on several signaling networks describing the immune response of mammals to bacteria, guard cell abscisic acid signaling in plants, and T cell receptor signaling shows that this method can effectively uncover the essentiality of components mediating a signal transduction process and results in strong agreement with the results of Boolean (logical) dynamic models and experimental observations. Conclusions This integrative method is an efficient procedure for exploratory analysis of large signaling and regulatory networks where dynamic modeling or experimental tests are impractical. Its results serve as testable predictions, provide insights into signal transduction and regulatory mechanisms and can guide targeted computational or experimental follow-up studies. The source codes for the algorithms developed in this study can be found at http://www.phys.psu.edu/~ralbert/ESM. PMID:21426566

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

NASA Astrophysics Data System (ADS)

Franke, Jasper G.; Donner, Reik V.

2017-04-01

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

Emergence of bursts and communities in evolving weighted networks.

PubMed

Jo, Hang-Hyun; Pan, Raj Kumar; Kaski, Kimmo

2011-01-01

Understanding the patterns of human dynamics and social interaction and the way they lead to the formation of an organized and functional society are important issues especially for techno-social development. Addressing these issues of social networks has recently become possible through large scale data analysis of mobile phone call records, which has revealed the existence of modular or community structure with many links between nodes of the same community and relatively few links between nodes of different communities. The weights of links, e.g., the number of calls between two users, and the network topology are found correlated such that intra-community links are stronger compared to the weak inter-community links. This feature is known as Granovetter's "The strength of weak ties" hypothesis. In addition to this inhomogeneous community structure, the temporal patterns of human dynamics turn out to be inhomogeneous or bursty, characterized by the heavy tailed distribution of time interval between two consecutive events, i.e., inter-event time. In this paper, we study how the community structure and the bursty dynamics emerge together in a simple evolving weighted network model. The principal mechanisms behind these patterns are social interaction by cyclic closure, i.e., links to friends of friends and the focal closure, links to individuals sharing similar attributes or interests, and human dynamics by task handling process. These three mechanisms have been implemented as a network model with local attachment, global attachment, and priority-based queuing processes. By comprehensive numerical simulations we show that the interplay of these mechanisms leads to the emergence of heavy tailed inter-event time distribution and the evolution of Granovetter-type community structure. Moreover, the numerical results are found to be in qualitative agreement with empirical analysis results from mobile phone call dataset.

Self-organized topology of recurrence-based complex networks

NASA Astrophysics Data System (ADS)

Yang, Hui; Liu, Gang

2013-12-01

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

Self-organized topology of recurrence-based complex networks.

PubMed

Yang, Hui; Liu, Gang

2013-12-01

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

Self-organized topology of recurrence-based complex networks

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

Yang, Hui, E-mail: huiyang@usf.edu; Liu, Gang

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article ismore » to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.« less

Neural networks for tracking of unknown SISO discrete-time nonlinear dynamic systems.

PubMed

Aftab, Muhammad Saleheen; Shafiq, Muhammad

2015-11-01

This article presents a Lyapunov function based neural network tracking (LNT) strategy for single-input, single-output (SISO) discrete-time nonlinear dynamic systems. The proposed LNT architecture is composed of two feedforward neural networks operating as controller and estimator. A Lyapunov function based back propagation learning algorithm is used for online adjustment of the controller and estimator parameters. The controller and estimator error convergence and closed-loop system stability analysis is performed by Lyapunov stability theory. Moreover, two simulation examples and one real-time experiment are investigated as case studies. The achieved results successfully validate the controller performance. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Evolution of continental-scale drainage in response to mantle dynamics and surface processes: An example from the Ethiopian Highlands

NASA Astrophysics Data System (ADS)

Sembroni, Andrea; Molin, Paola; Pazzaglia, Frank J.; Faccenna, Claudio; Abebe, Bekele

2016-05-01

Ethiopia offers an excellent opportunity to study the effects and linkage between mantle dynamics and surface processes on landscape evolution. The Ethiopian Highlands (NW Ethiopia), characterized by a huge basaltic plateau, is part of the African Superswell, a wide region of dynamically-supported anomalously high topography related to the rising of the Afar plume. The initiation and steadiness of dynamic support beneath Ethiopia has been explored in several studies. However the presence, role, and timing of dynamic support beneath Ethiopia and its relationship with continental flood basalts volcanism and surface processes are poorly defined. Here, we present a geomorphological analysis of the Ethiopian Highlands supplying new constraints on the evolution of river network. We investigated the general topographic features (filtered topography, swath profiles, local relief) and the river network (river longitudinal profiles) of the study area. We also apply a knickpoint celerity model in order to provide a chronological framework to the evolution of the river network. The results trace the long-term progressive capture of the Ethiopian Highlands drainage system and confirm the long-term dynamic support of the area, documenting its impact on the contrasting development of the Blue Nile and Tekeze basins.

Evolution of continental-scale drainage in response to mantle dynamics and surface processes: an example from the Ethiopian Highlands.

NASA Astrophysics Data System (ADS)

Sembroni, Andrea; Molin, Paola; Pazzaglia, Frank J.; Faccenna, Claudio; Abebe, Bekele

2016-04-01

Ethiopia offers an excellent opportunity to study the effects and linkage between mantle dynamics and surface processes on landscape evolution. The Ethiopian Highlands (NW Ethiopia), characterized by a huge basaltic plateau, is part of the African Superswell, a wide region of dynamically-supported anomalously high topography related to the rising of the Afar plume. The initiation and steadiness of dynamic support beneath Ethiopia has been explored in several studies. However the presence, role, and timing of dynamic support beneath Ethiopia and its relationship with continental flood basalts volcanism and surface processes are poorly defined. Here, we present a geomorphological analysis of the Ethiopian Highlands supplying new constrains on the evolution of river network. We investigated the general topographic features (filtered topography, swath profiles, local relief) and the river network (river longitudinal profiles) of the study area. We also apply a knickpoint celerity model in order to provide a chronological framework to the evolution of the river network. The results trace the long-term progressive capture of the Ethiopian Highlands drainage system and confirm the long-term dynamic support of the area, documenting its impact on the contrasting development of the Blue Nile and Tekeze basins.

Coarse graining for synchronization in directed networks

NASA Astrophysics Data System (ADS)

Zeng, An; Lü, Linyuan

2011-05-01

Coarse-graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve statistical properties as well as the dynamic behaviors of the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse-graining directed networks lacks of consideration. In this paper we proposed a path-based coarse-graining (PCG) method to coarse grain the directed networks. Performing the linear stability analysis of synchronization and numerical simulation of the Kuramoto model on four kinds of directed networks, including tree networks and variants of Barabási-Albert networks, Watts-Strogatz networks, and Erdös-Rényi networks, we find our method can effectively preserve the network synchronizability.

Scale-Free and Multifractal Time Dynamics of fMRI Signals during Rest and Task

PubMed Central

Ciuciu, P.; Varoquaux, G.; Abry, P.; Sadaghiani, S.; Kleinschmidt, A.

2012-01-01

Scaling temporal dynamics in functional MRI (fMRI) signals have been evidenced for a decade as intrinsic characteristics of ongoing brain activity (Zarahn et al., 1997). Recently, scaling properties were shown to fluctuate across brain networks and to be modulated between rest and task (He, 2011): notably, Hurst exponent, quantifying long memory, decreases under task in activating and deactivating brain regions. In most cases, such results were obtained: First, from univariate (voxelwise or regionwise) analysis, hence focusing on specific cognitive systems such as Resting-State Networks (RSNs) and raising the issue of the specificity of this scale-free dynamics modulation in RSNs. Second, using analysis tools designed to measure a single scaling exponent related to the second order statistics of the data, thus relying on models that either implicitly or explicitly assume Gaussianity and (asymptotic) self-similarity, while fMRI signals may significantly depart from those either of those two assumptions (Ciuciu et al., 2008; Wink et al., 2008). To address these issues, the present contribution elaborates on the analysis of the scaling properties of fMRI temporal dynamics by proposing two significant variations. First, scaling properties are technically investigated using the recently introduced Wavelet Leader-based Multifractal formalism (WLMF; Wendt et al., 2007). This measures a collection of scaling exponents, thus enables a richer and more versatile description of scale invariance (beyond correlation and Gaussianity), referred to as multifractality. Also, it benefits from improved estimation performance compared to tools previously used in the literature. Second, scaling properties are investigated in both RSN and non-RSN structures (e.g., artifacts), at a broader spatial scale than the voxel one, using a multivariate approach, namely the Multi-Subject Dictionary Learning (MSDL) algorithm (Varoquaux et al., 2011) that produces a set of spatial components that appear more sparse than their Independent Component Analysis (ICA) counterpart. These tools are combined and applied to a fMRI dataset comprising 12 subjects with resting-state and activation runs (Sadaghiani et al., 2009). Results stemming from those analysis confirm the already reported task-related decrease of long memory in functional networks, but also show that it occurs in artifacts, thus making this feature not specific to functional networks. Further, results indicate that most fMRI signals appear multifractal at rest except in non-cortical regions. Task-related modulation of multifractality appears only significant in functional networks and thus can be considered as the key property disentangling functional networks from artifacts. These finding are discussed in the light of the recent literature reporting scaling dynamics of EEG microstate sequences at rest and addressing non-stationarity issues in temporally independent fMRI modes. PMID:22715328

Inferring Instantaneous, Multivariate and Nonlinear Sensitivities for the Analysis of Feedback Processes in a Dynamical System: Lorenz Model Case Study

NASA Technical Reports Server (NTRS)

Aires, Filipe; Rossow, William B.; Hansen, James E. (Technical Monitor)

2001-01-01

A new approach is presented for the analysis of feedback processes in a nonlinear dynamical system by observing its variations. The new methodology consists of statistical estimates of the sensitivities between all pairs of variables in the system based on a neural network modeling of the dynamical system. The model can then be used to estimate the instantaneous, multivariate and nonlinear sensitivities, which are shown to be essential for the analysis of the feedbacks processes involved in the dynamical system. The method is described and tested on synthetic data from the low-order Lorenz circulation model where the correct sensitivities can be evaluated analytically.

Community evolution mining and analysis in social network

NASA Astrophysics Data System (ADS)

Liu, Hongtao; Tian, Yuan; Liu, Xueyan; Jian, Jie

2017-03-01

With the development of digital and network technology, various social platforms emerge. These social platforms have greatly facilitated access to information, attracting more and more users. They use these social platforms every day to work, study and communicate, so every moment social platforms are generating massive amounts of data. These data can often be modeled as complex networks, making large-scale social network analysis possible. In this paper, the existing evolution classification model of community has been improved based on community evolution relationship over time in dynamic social network, and the Evolution-Tree structure is proposed which can show the whole life cycle of the community more clearly. The comparative test result shows that the improved model can excavate the evolution relationship of the community well.

Based on records of Three Gorge Telemetric Seismic Network to analyze Vibration process of micro fracture of rock landslide

NASA Astrophysics Data System (ADS)

WANG, Q.

2017-12-01

Used the finite element analysis software GeoStudio to establish vibration analysis model of Qianjiangping landslide, which locates at the Three Gorges Reservoir area. In QUAKE/W module, we chosen proper Dynamic elasticity modulus and Poisson's ratio of soil layer and rock stratum. When loading, we selected the waveform data record of Three Gorge Telemetric Seismic Network as input ground motion, which includes five rupture events recorded of Lujiashan seismic station. In dynamic simulating, we mainly focused on sliding process when the earthquake date record was applied. The simulation result shows that Qianjiangping landslide wasn't not only affected by its own static force, but also experienced the dynamic process of micro fracture-creep-slip rupture-creep-slip.it provides a new approach for the early warning feasibility of rock landslide in future research.

Final Report. Analysis and Reduction of Complex Networks Under Uncertainty

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

Marzouk, Youssef M.; Coles, T.; Spantini, A.

2013-09-30

The project was a collaborative effort among MIT, Sandia National Laboratories (local PI Dr. Habib Najm), the University of Southern California (local PI Prof. Roger Ghanem), and The Johns Hopkins University (local PI Prof. Omar Knio, now at Duke University). Our focus was the analysis and reduction of large-scale dynamical systems emerging from networks of interacting components. Such networks underlie myriad natural and engineered systems. Examples important to DOE include chemical models of energy conversion processes, and elements of national infrastructure—e.g., electric power grids. Time scales in chemical systems span orders of magnitude, while infrastructure networks feature both local andmore » long-distance connectivity, with associated clusters of time scales. These systems also blend continuous and discrete behavior; examples include saturation phenomena in surface chemistry and catalysis, and switching in electrical networks. Reducing size and stiffness is essential to tractable and predictive simulation of these systems. Computational singular perturbation (CSP) has been effectively used to identify and decouple dynamics at disparate time scales in chemical systems, allowing reduction of model complexity and stiffness. In realistic settings, however, model reduction must contend with uncertainties, which are often greatest in large-scale systems most in need of reduction. Uncertainty is not limited to parameters; one must also address structural uncertainties—e.g., whether a link is present in a network—and the impact of random perturbations, e.g., fluctuating loads or sources. Research under this project developed new methods for the analysis and reduction of complex multiscale networks under uncertainty, by combining computational singular perturbation (CSP) with probabilistic uncertainty quantification. CSP yields asymptotic approximations of reduceddimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing uncertainty in this context raised fundamentally new issues, e.g., how is the topology of slow manifolds transformed by parametric uncertainty? How to construct dynamical models on these uncertain manifolds? To address these questions, we used stochastic spectral polynomial chaos (PC) methods to reformulate uncertain network models and analyzed them using CSP in probabilistic terms. Finding uncertain manifolds involved the solution of stochastic eigenvalue problems, facilitated by projection onto PC bases. These problems motivated us to explore the spectral properties stochastic Galerkin systems. We also introduced novel methods for rank-reduction in stochastic eigensystems—transformations of a uncertain dynamical system that lead to lower storage and solution complexity. These technical accomplishments are detailed below. This report focuses on the MIT portion of the joint project.« less

Resting State Network Topology of the Ferret Brain

PubMed Central

Zhou, Zhe Charles; Salzwedel, Andrew P.; Radtke-Schuller, Susanne; Li, Yuhui; Sellers, Kristin K.; Gilmore, John H.; Shih, Yen-Yu Ian; Fröhlich, Flavio; Gao, Wei

2016-01-01

Resting state functional magnetic resonance imaging (rsfMRI) has emerged as a versatile tool for non-invasive measurement of functional connectivity patterns in the brain. RsfMRI brain dynamics in rodents, non-human primates, and humans share similar properties; however, little is known about the resting state functional connectivity patterns in the ferret, an animal model with high potential for developmental and cognitive translational study. To address this knowledge-gap, we performed rsfMRI on anesthetized ferrets using a 9.4 tesla MRI scanner, and subsequently performed group-level independent component analysis (gICA) to identify functionally connected brain networks. Group-level ICA analysis revealed distributed sensory, motor, and higher-order networks in the ferret brain. Subsequent connectivity analysis showed interconnected higher-order networks that constituted a putative default mode network (DMN), a network that exhibits altered connectivity in neuropsychiatric disorders. Finally, we assessed ferret brain topological efficiency using graph theory analysis and found that the ferret brain exhibits small-world properties. Overall, these results provide additional evidence for pan-species resting-state networks, further supporting ferret-based studies of sensory and cognitive function. PMID:27596024

Impact of leakage delay on bifurcation in high-order fractional BAM neural networks.

PubMed

Huang, Chengdai; Cao, Jinde

2018-02-01

The effects of leakage delay on the dynamics of neural networks with integer-order have lately been received considerable attention. It has been confirmed that fractional neural networks more appropriately uncover the dynamical properties of neural networks, but the results of fractional neural networks with leakage delay are relatively few. This paper primarily concentrates on the issue of bifurcation for high-order fractional bidirectional associative memory(BAM) neural networks involving leakage delay. The first attempt is made to tackle the stability and bifurcation of high-order fractional BAM neural networks with time delay in leakage terms in this paper. The conditions for the appearance of bifurcation for the proposed systems with leakage delay are firstly established by adopting time delay as a bifurcation parameter. Then, the bifurcation criteria of such system without leakage delay are successfully acquired. Comparative analysis wondrously detects that the stability performance of the proposed high-order fractional neural networks is critically weakened by leakage delay, they cannot be overlooked. Numerical examples are ultimately exhibited to attest the efficiency of the theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

PubMed Central

2011-01-01

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

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.

A Dynamic Intrusion Detection System Based on Multivariate Hotelling's T2 Statistics Approach for Network Environments

PubMed Central

Avalappampatty Sivasamy, Aneetha; Sundan, Bose

2015-01-01

The ever expanding communication requirements in today's world demand extensive and efficient network systems with equally efficient and reliable security features integrated for safe, confident, and secured communication and data transfer. Providing effective security protocols for any network environment, therefore, assumes paramount importance. Attempts are made continuously for designing more efficient and dynamic network intrusion detection models. In this work, an approach based on Hotelling's T2 method, a multivariate statistical analysis technique, has been employed for intrusion detection, especially in network environments. Components such as preprocessing, multivariate statistical analysis, and attack detection have been incorporated in developing the multivariate Hotelling's T2 statistical model and necessary profiles have been generated based on the T-square distance metrics. With a threshold range obtained using the central limit theorem, observed traffic profiles have been classified either as normal or attack types. Performance of the model, as evaluated through validation and testing using KDD Cup'99 dataset, has shown very high detection rates for all classes with low false alarm rates. Accuracy of the model presented in this work, in comparison with the existing models, has been found to be much better. PMID:26357668

A Dynamic Intrusion Detection System Based on Multivariate Hotelling's T2 Statistics Approach for Network Environments.

PubMed

Sivasamy, Aneetha Avalappampatty; Sundan, Bose

2015-01-01

The ever expanding communication requirements in today's world demand extensive and efficient network systems with equally efficient and reliable security features integrated for safe, confident, and secured communication and data transfer. Providing effective security protocols for any network environment, therefore, assumes paramount importance. Attempts are made continuously for designing more efficient and dynamic network intrusion detection models. In this work, an approach based on Hotelling's T(2) method, a multivariate statistical analysis technique, has been employed for intrusion detection, especially in network environments. Components such as preprocessing, multivariate statistical analysis, and attack detection have been incorporated in developing the multivariate Hotelling's T(2) statistical model and necessary profiles have been generated based on the T-square distance metrics. With a threshold range obtained using the central limit theorem, observed traffic profiles have been classified either as normal or attack types. Performance of the model, as evaluated through validation and testing using KDD Cup'99 dataset, has shown very high detection rates for all classes with low false alarm rates. Accuracy of the model presented in this work, in comparison with the existing models, has been found to be much better.

The relationship between node degree and dissipation rate in networks of diffusively coupled oscillators and its significance for pancreatic beta cells.

PubMed

Gosak, Marko; Stožer, Andraž; Markovič, Rene; Dolenšek, Jurij; Marhl, Marko; Rupnik, Marjan Slak; Perc, Matjaž

2015-07-01

Self-sustained oscillatory dynamics is a motion along a stable limit cycle in the phase space, and it arises in a wide variety of mechanical, electrical, and biological systems. Typically, oscillations are due to a balance between energy dissipation and generation. Their stability depends on the properties of the attractor, in particular, its dissipative characteristics, which in turn determine the flexibility of a given dynamical system. In a network of oscillators, the coupling additionally contributes to the dissipation, and hence affects the robustness of the oscillatory solution. Here, we therefore investigate how a heterogeneous network structure affects the dissipation rate of individual oscillators. First, we show that in a network of diffusively coupled oscillators, the dissipation is a linearly decreasing function of the node degree, and we demonstrate this numerically by calculating the average divergence of coupled Hopf oscillators. Subsequently, we use recordings of intracellular calcium dynamics in pancreatic beta cells in mouse acute tissue slices and the corresponding functional connectivity networks for an experimental verification of the presented theory. We use methods of nonlinear time series analysis to reconstruct the phase space and calculate the sum of Lyapunov exponents. Our analysis reveals a clear tendency of cells with a higher degree, that is, more interconnected cells, having more negative values of divergence, thus confirming our theoretical predictions. We discuss these findings in the context of energetic aspects of signaling in beta cells and potential risks for pathological changes in the tissue.

From brain to earth and climate systems: small-world interaction networks or not?

PubMed

Bialonski, Stephan; Horstmann, Marie-Therese; Lehnertz, Klaus

2010-03-01

We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With numerical simulations that mimic typical experimental situations, we have identified an important constraint when characterizing such networks: indications of a small-world topology can be expected solely due to the spatial sampling of the system along with the commonly used time series analysis based approaches to network characterization.

Axelrod's Metanorm Games on Networks

PubMed Central

Galán, José M.; Łatek, Maciej M.; Rizi, Seyed M. Mussavi

2011-01-01

Metanorms is a mechanism proposed to promote cooperation in social dilemmas. Recent experimental results show that network structures that underlie social interactions influence the emergence of norms that promote cooperation. We generalize Axelrod's analysis of metanorms dynamics to interactions unfolding on networks through simulation and mathematical modeling. Network topology strongly influences the effectiveness of the metanorms mechanism in establishing cooperation. In particular, we find that average degree, clustering coefficient and the average number of triplets per node play key roles in sustaining or collapsing cooperation. PMID:21655211

Suppression of anomalous synchronization and nonstationary behavior of neural network under small-world topology

NASA Astrophysics Data System (ADS)

Boaretto, B. R. R.; Budzinski, R. C.; Prado, T. L.; Kurths, J.; Lopes, S. R.

2018-05-01

It is known that neural networks under small-world topology can present anomalous synchronization and nonstationary behavior for weak coupling regimes. Here, we propose methods to suppress the anomalous synchronization and also to diminish the nonstationary behavior occurring in weakly coupled neural network under small-world topology. We consider a network of 2000 thermally sensitive identical neurons, based on the model of Hodgkin-Huxley in a small-world topology, with the probability of adding non local connection equal to p = 0 . 001. Based on experimental protocols to suppress anomalous synchronization, as well as nonstationary behavior of the neural network dynamics, we make use of (i) external stimulus (pulsed current); (ii) biologic parameters changing (neuron membrane conductance changes); and (iii) body temperature changes. Quantification analysis to evaluate phase synchronization makes use of the Kuramoto's order parameter, while recurrence quantification analysis, particularly the determinism, computed over the easily accessible mean field of network, the local field potential (LFP), is used to evaluate nonstationary states. We show that the methods proposed can control the anomalous synchronization and nonstationarity occurring for weak coupling parameter without any effect on the individual neuron dynamics, neither in the expected asymptotic synchronized states occurring for large values of the coupling parameter.

Dynamics of delay-coupled FitzHugh-Nagumo neural rings.

PubMed

Mao, Xiaochen; Sun, Jianqiao; Li, Shaofan

2018-01-01

This paper studies the dynamical behaviors of a pair of FitzHugh-Nagumo neural networks with bidirectional delayed couplings. It presents a detailed analysis of delay-independent and delay-dependent stabilities and the existence of bifurcated oscillations. Illustrative examples are performed to validate the analytical results and to discover interesting phenomena. It is shown that the network exhibits a variety of complicated activities, such as multiple stability switches, the coexistence of periodic and quasi-periodic oscillations, the coexistence of periodic and chaotic orbits, and the coexisting chaotic attractors.

Dynamics of delay-coupled FitzHugh-Nagumo neural rings

NASA Astrophysics Data System (ADS)

Mao, Xiaochen; Sun, Jianqiao; Li, Shaofan

2018-01-01

This paper studies the dynamical behaviors of a pair of FitzHugh-Nagumo neural networks with bidirectional delayed couplings. It presents a detailed analysis of delay-independent and delay-dependent stabilities and the existence of bifurcated oscillations. Illustrative examples are performed to validate the analytical results and to discover interesting phenomena. It is shown that the network exhibits a variety of complicated activities, such as multiple stability switches, the coexistence of periodic and quasi-periodic oscillations, the coexistence of periodic and chaotic orbits, and the coexisting chaotic attractors.

Structure Analysis of Jungle-Gym-Type Gels by Brownian Dynamics Simulation

NASA Astrophysics Data System (ADS)

Ohta, Noriyoshi; Ono, Kohki; Takasu, Masako; Furukawa, Hidemitsu

2008-02-01

We investigated the structure and the formation process of two kinds of gels by Brownian dynamics simulation. The effect of flexibility of main chain oligomer was studied. From our results, hard gel with rigid main chain forms more homogeneous network structure than soft gel with flexible main chain. In soft gel, many small loops are formed, and clusters tend to shrink. This heterogeneous network structure may be caused by microgels. In the low density case, soft gel shows more heterogeneity than the high density case.

Network evolution induced by the dynamical rules of two populations

NASA Astrophysics Data System (ADS)

Platini, Thierry; Zia, R. K. P.

2010-10-01

We study the dynamical properties of a finite dynamical network composed of two interacting populations, namely extrovert (a) and introvert (b). In our model, each group is characterized by its size (Na and Nb) and preferred degree (κa and \\kappa_b\\ll \\kappa_a ). The network dynamics is governed by the competing microscopic rules of each population that consist of the creation and destruction of links. Starting from an unconnected network, we give a detailed analysis of the mean field approach which is compared to Monte Carlo simulation data. The time evolution of the restricted degrees langkbbrang and langkabrang presents three time regimes and a non-monotonic behavior well captured by our theory. Surprisingly, when the population sizes are equal Na = Nb, the ratio of the restricted degree θ0 = langkabrang/langkbbrang appears to be an integer in the asymptotic limits of the three time regimes. For early times (defined by t < t1 = κb) the total number of links presents a linear evolution, where the two populations are indistinguishable and where θ0 = 1. Interestingly, in the intermediate time regime (defined for t_1\\lt t\\lt t_2\\propto \\kappa_a and for which θ0 = 5), the system reaches a transient stationary state, where the number of contacts among introverts remains constant while the number of connections increases linearly in the extrovert population. Finally, due to the competing dynamics, the network presents a frustrated stationary state characterized by a ratio θ0 = 3.

Novel approaches to pin cluster synchronization on complex dynamical networks in Lur'e forms

NASA Astrophysics Data System (ADS)

Tang, Ze; Park, Ju H.; Feng, Jianwen

2018-04-01

This paper investigates the cluster synchronization of complex dynamical networks consisted of identical or nonidentical Lur'e systems. Due to the special topology structure of the complex networks and the existence of stochastic perturbations, a kind of randomly occurring pinning controller is designed which not only synchronizes all Lur'e systems in the same cluster but also decreases the negative influence among different clusters. Firstly, based on an extended integral inequality, the convex combination theorem and S-procedure, the conditions for cluster synchronization of identical Lur'e networks are derived in a convex domain. Secondly, randomly occurring adaptive pinning controllers with two independent Bernoulli stochastic variables are designed and then sufficient conditions are obtained for the cluster synchronization on complex networks consisted of nonidentical Lur'e systems. In addition, suitable control gains for successful cluster synchronization of nonidentical Lur'e networks are acquired by designing some adaptive updating laws. Finally, we present two numerical examples to demonstrate the validity of the control scheme and the theoretical analysis.

Correspondence of the brain's functional architecture during activation and rest

PubMed Central

Smith, Stephen M.; Fox, Peter T.; Miller, Karla L.; Glahn, David C.; Fox, P. Mickle; Mackay, Clare E.; Filippini, Nicola; Watkins, Kate E.; Toro, Roberto; Laird, Angela R.; Beckmann, Christian F.

2009-01-01

Neural connections, providing the substrate for functional networks, exist whether or not they are functionally active at any given moment. However, it is not known to what extent brain regions are continuously interacting when the brain is “at rest.” In this work, we identify the major explicit activation networks by carrying out an image-based activation network analysis of thousands of separate activation maps derived from the BrainMap database of functional imaging studies, involving nearly 30,000 human subjects. Independently, we extract the major covarying networks in the resting brain, as imaged with functional magnetic resonance imaging in 36 subjects at rest. The sets of major brain networks, and their decompositions into subnetworks, show close correspondence between the independent analyses of resting and activation brain dynamics. We conclude that the full repertoire of functional networks utilized by the brain in action is continuously and dynamically “active” even when at “rest.” PMID:19620724

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.

Integrate and fire neural networks, piecewise contractive maps and limit cycles.

PubMed

Catsigeras, Eleonora; Guiraud, Pierre

2013-09-01

We study the global dynamics of integrate and fire neural networks composed of an arbitrary number of identical neurons interacting by inhibition and excitation. We prove that if the interactions are strong enough, then the support of the stable asymptotic dynamics consists of limit cycles. We also find sufficient conditions for the synchronization of networks containing excitatory neurons. The proofs are based on the analysis of the equivalent dynamics of a piecewise continuous Poincaré map associated to the system. We show that for efficient interactions the Poincaré map is piecewise contractive. Using this contraction property, we prove that there exist a countable number of limit cycles attracting all the orbits dropping into the stable subset of the phase space. This result applies not only to the Poincaré map under study, but also to a wide class of general n-dimensional piecewise contractive maps.

Executive Functions and Prefrontal Cortex: A Matter of Persistence?

PubMed Central

Ball, Gareth; Stokes, Paul R.; Rhodes, Rebecca A.; Bose, Subrata K.; Rezek, Iead; Wink, Alle-Meije; Lord, Louis-David; Mehta, Mitul A.; Grasby, Paul M.; Turkheimer, Federico E.

2011-01-01

Executive function is thought to originates from the dynamics of frontal cortical networks. We examined the dynamic properties of the blood oxygen level dependent time-series measured with functional MRI (fMRI) within the prefrontal cortex (PFC) to test the hypothesis that temporally persistent neural activity underlies performance in three tasks of executive function. A numerical estimate of signal persistence, the Hurst exponent, postulated to represent the coherent firing of cortical networks, was determined and correlated with task performance. Increasing persistence in the lateral PFC was shown to correlate with improved performance during an n-back task. Conversely, we observed a correlation between persistence and increasing commission error – indicating a failure to inhibit a prepotent response – during a Go/No-Go task. We propose that persistence within the PFC reflects dynamic network formation and these findings underline the importance of frequency analysis of fMRI time-series in the study of executive functions. PMID:21286223

Self-organization in suspensions of end-functionalized semiflexible polymers under shear flow

NASA Astrophysics Data System (ADS)

Myung, Jin Suk; Winkler, Roland G.; Gompper, Gerhard

2015-12-01

The nonequilibrium dynamical behavior and structure formation of end-functionalized semiflexible polymer suspensions under flow are investigated by mesoscale hydrodynamic simulations. The hybrid simulation approach combines the multiparticle collision dynamics method for the fluid, which accounts for hydrodynamic interactions, with molecular dynamics simulations for the semiflexible polymers. In equilibrium, various kinds of scaffold-like network structures are observed, depending on polymer flexibility and end-attraction strength. We investigate the flow behavior of the polymer networks under shear and analyze their nonequilibrium structural and rheological properties. The scaffold structure breaks up and densified aggregates are formed at low shear rates, while the structural integrity is completely lost at high shear rates. We provide a detailed analysis of the shear- rate-dependent flow-induced structures. The studies provide a deeper understanding of the formation and deformation of network structures in complex materials.

Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads

NASA Technical Reports Server (NTRS)

Brunstrom, Anna; Leutenegger, Scott T.; Simha, Rahul

1995-01-01

Traditionally, allocation of data in distributed database management systems has been determined by off-line analysis and optimization. This technique works well for static database access patterns, but is often inadequate for frequently changing workloads. In this paper we address how to dynamically reallocate data for partionable distributed databases with changing access patterns. Rather than complicated and expensive optimization algorithms, a simple heuristic is presented and shown, via an implementation study, to improve system throughput by 30 percent in a local area network based system. Based on artificial wide area network delays, we show that dynamic reallocation can improve system throughput by a factor of two and a half for wide area networks. We also show that individual site load must be taken into consideration when reallocating data, and provide a simple policy that incorporates load in the reallocation decision.

Network cosmology.

PubMed

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

Network Cosmology

PubMed Central

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688

First Selection, Then Influence: Developmental Differences in Friendship Dynamics Regarding Academic Achievement

ERIC Educational Resources Information Center

Gremmen, Mariola Claudia; Dijkstra, Jan Kornelis; Steglich, Christian; Veenstra, René

2017-01-01

This study concerns peer selection and influence dynamics in early adolescents' friendships regarding academic achievement. Using longitudinal social network analysis (RSiena), both selection and influence processes were investigated for students' average grades and their cluster-specific grades (i.e., language, exact, and social cluster). Data…

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

PubMed

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

2018-02-01

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

Temperature-Dependent Conformational Properties of Human Neuronal Calcium Sensor-1 Protein Revealed by All-Atom Simulations.

PubMed

Zhu, Yuzhen; Ma, Buyong; Qi, Ruxi; Nussinov, Ruth; Zhang, Qingwen

2016-04-14

Neuronal calcium sensor-1 (NCS-1) protein has orthologues from Saccharomyces cerevisiae to human with highly conserved amino acid sequences. NCS-1 is an important factor controlling the animal's response to temperature change. This leads us to investigate the temperature effects on the conformational dynamics of human NCS-1 at 310 and 316 K by all-atom molecular dynamics (MD) simulations and dynamic community network analysis. Four independent 500 ns MD simulations show that secondary structure content at 316 K is similar to that at 310 K, whereas the global protein structure is expanded. Loop 3 (L3) adopts an extended state occuping the hydrophobic crevice, and the number of suboptimal communication paths between residue D176 and V190 is reduced at 316 K. The dynamic community network analysis suggests that the interdomain correlation is weakened, and the intradomain coupling is strengthened at 316 K. The elevated temperature reduces the number of the salt bridges, especially in C-domain. This study suggests that the elevated temperature affects the conformational dynamics of human NCS-1 protein. Comparison of the structural dynamics of R102Q mutant and Δ176-190 truncated NCS-1 suggests that the structural and dynamical response of NCS-1 protein to elevated temperature may be one of its intrinsic functional properties.

How Terrorist Groups Survive: A Dynamic Network Analysis Approach to the Resilience of Terrorist Organizations

DTIC Science & Technology

2009-05-21

Monterrey , CA: Naval Post Graduate School, 2002), 1. 12 Kathleen M. Carley, Jeffrey Reminga, and Natasha Kamneva, “Destabilizing Terrorist Networks...An example of this experience is when two colleagues in a professional school learn that one colleague was recently divorced from a woman the other

Culture, Role and Group Work: A Social Network Analysis Perspective on an Online Collaborative Course

ERIC Educational Resources Information Center

Stepanyan, Karen; Mather, Richard; Dalrymple, Roger

2014-01-01

This paper discusses the patterns of network dynamics within a multicultural online collaborative learning environment. It analyses the interaction of participants (both students and facilitators) within a discussion board that was established as part of a 3-month online collaborative course. The study employs longitudinal probabilistic social…

Gap Gene Regulatory Dynamics Evolve along a Genotype Network

PubMed Central

Crombach, Anton; Wotton, Karl R.; Jiménez-Guri, Eva; Jaeger, Johannes

2016-01-01

Developmental gene networks implement the dynamic regulatory mechanisms that pattern and shape the organism. Over evolutionary time, the wiring of these networks changes, yet the patterning outcome is often preserved, a phenomenon known as “system drift.” System drift is illustrated by the gap gene network—involved in segmental patterning—in dipteran insects. In the classic model organism Drosophila melanogaster and the nonmodel scuttle fly Megaselia abdita, early activation and placement of gap gene expression domains show significant quantitative differences, yet the final patterning output of the system is essentially identical in both species. In this detailed modeling analysis of system drift, we use gene circuits which are fit to quantitative gap gene expression data in M. abdita and compare them with an equivalent set of models from D. melanogaster. The results of this comparative analysis show precisely how compensatory regulatory mechanisms achieve equivalent final patterns in both species. We discuss the larger implications of the work in terms of “genotype networks” and the ways in which the structure of regulatory networks can influence patterns of evolutionary change (evolvability). PMID:26796549

The NEST Dry-Run Mode: Efficient Dynamic Analysis of Neuronal Network Simulation Code.

PubMed

Kunkel, Susanne; Schenck, Wolfram

2017-01-01

NEST is a simulator for spiking neuronal networks that commits to a general purpose approach: It allows for high flexibility in the design of network models, and its applications range from small-scale simulations on laptops to brain-scale simulations on supercomputers. Hence, developers need to test their code for various use cases and ensure that changes to code do not impair scalability. However, running a full set of benchmarks on a supercomputer takes up precious compute-time resources and can entail long queuing times. Here, we present the NEST dry-run mode, which enables comprehensive dynamic code analysis without requiring access to high-performance computing facilities. A dry-run simulation is carried out by a single process, which performs all simulation steps except communication as if it was part of a parallel environment with many processes. We show that measurements of memory usage and runtime of neuronal network simulations closely match the corresponding dry-run data. Furthermore, we demonstrate the successful application of the dry-run mode in the areas of profiling and performance modeling.

Fault detection and diagnosis for non-Gaussian stochastic distribution systems with time delays via RBF neural networks.

PubMed

Yi, Qu; Zhan-ming, Li; Er-chao, Li

2012-11-01

A new fault detection and diagnosis (FDD) problem via the output probability density functions (PDFs) for non-gausian stochastic distribution systems (SDSs) is investigated. The PDFs can be approximated by radial basis functions (RBFs) neural networks. Different from conventional FDD problems, the measured information for FDD is the output stochastic distributions and the stochastic variables involved are not confined to Gaussian ones. A (RBFs) neural network technique is proposed so that the output PDFs can be formulated in terms of the dynamic weighings of the RBFs neural network. In this work, a nonlinear adaptive observer-based fault detection and diagnosis algorithm is presented by introducing the tuning parameter so that the residual is as sensitive as possible to the fault. Stability and Convergency analysis is performed in fault detection and fault diagnosis analysis for the error dynamic system. At last, an illustrated example is given to demonstrate the efficiency of the proposed algorithm, and satisfactory results have been obtained. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.

The NEST Dry-Run Mode: Efficient Dynamic Analysis of Neuronal Network Simulation Code

PubMed Central

Kunkel, Susanne; Schenck, Wolfram

2017-01-01

NEST is a simulator for spiking neuronal networks that commits to a general purpose approach: It allows for high flexibility in the design of network models, and its applications range from small-scale simulations on laptops to brain-scale simulations on supercomputers. Hence, developers need to test their code for various use cases and ensure that changes to code do not impair scalability. However, running a full set of benchmarks on a supercomputer takes up precious compute-time resources and can entail long queuing times. Here, we present the NEST dry-run mode, which enables comprehensive dynamic code analysis without requiring access to high-performance computing facilities. A dry-run simulation is carried out by a single process, which performs all simulation steps except communication as if it was part of a parallel environment with many processes. We show that measurements of memory usage and runtime of neuronal network simulations closely match the corresponding dry-run data. Furthermore, we demonstrate the successful application of the dry-run mode in the areas of profiling and performance modeling. PMID:28701946