Complex networks: Dynamics and security
Indian Academy of Sciences (India)
This paper presents a perspective in the study of complex networks by focusing on how dynamics may affect network security under attacks. ... Department of Mathematics and Statistics, Arizona State University, Tempe, Arizona 85287, USA; Institute of Mathematics and Computer Science, University of Sao Paulo, Brazil ...
Dynamic and interacting complex networks
Dickison, Mark E.
This thesis employs methods of statistical mechanics and numerical simulations to study some aspects of dynamic and interacting complex networks. The mapping of various social and physical phenomena to complex networks has been a rich field in the past few decades. Subjects as broad as petroleum engineering, scientific collaborations, and the structure of the internet have all been analyzed in a network physics context, with useful and universal results. In the first chapter we introduce basic concepts in networks, including the two types of network configurations that are studied and the statistical physics and epidemiological models that form the framework of the network research, as well as covering various previously-derived results in network theory that are used in the work in the following chapters. In the second chapter we introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the time evolution of the network. We show that the dynamic network undergoes a percolation phase transition at a critical concentration pc, that decreases with the rate r at which the network links are changed. The behavior near criticality is universal and independent of r. We find that for dynamic random networks fundamental laws are changed: i) The size of the giant component at criticality scales with the network size N for all values of r, rather than as N2/3 in static network, ii) In the presence of a broad distribution of disorder, the optimal path length between two nodes in a dynamic network scales as N1/2, compared to N1/3 in a static network. The third chapter consists of a study of the effect of quarantine on the propagation of epidemics on an adaptive network of social contacts. For this purpose, we analyze the susceptible-infected-recovered model in the presence of quarantine, where susceptible
Traffic Dynamics on Complex Networks: A Survey
Directory of Open Access Journals (Sweden)
Shengyong Chen
2012-01-01
Full Text Available Traffic dynamics on complex networks are intriguing in recent years due to their practical implications in real communication networks. In this survey, we give a brief review of studies on traffic routing dynamics on complex networks. Strategies for improving transport efficiency, including designing efficient routing strategies and making appropriate adjustments to the underlying network structure, are introduced in this survey. Finally, a few open problems are discussed in this survey.
Competitive Dynamics on Complex Networks
Zhao, Jiuhua; Liu, Qipeng; Wang, Xiaofan
2014-07-01
We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is most likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.
Pinning Synchronization of Switched Complex Dynamical Networks
Directory of Open Access Journals (Sweden)
Liming Du
2015-01-01
Full Text Available Network topology and node dynamics play a key role in forming synchronization of complex networks. Unfortunately there is no effective synchronization criterion for pinning synchronization of complex dynamical networks with switching topology. In this paper, pinning synchronization of complex dynamical networks with switching topology is studied. Two basic problems are considered: one is pinning synchronization of switched complex networks under arbitrary switching; the other is pinning synchronization of switched complex networks by design of switching when synchronization cannot achieved by using any individual connection topology alone. For the two problems, common Lyapunov function method and single Lyapunov function method are used respectively, some global synchronization criteria are proposed and the designed switching law is given. Finally, simulation results verify the validity of the results.
Spreading dynamics in complex networks
Pei, Sen; Makse, Hernán A.
2013-12-01
Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from epidemic control, innovation diffusion, viral marketing, and social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community—LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in the LiveJournal social network, only a small fraction of them are involved in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with a large influence. Our results should provide useful information for designing efficient spreading strategies in reality.
Spreading dynamics in complex networks
International Nuclear Information System (INIS)
Pei, Sen; Makse, Hernán A
2013-01-01
Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from epidemic control, innovation diffusion, viral marketing, and social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community—LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in the LiveJournal social network, only a small fraction of them are involved in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with a large influence. Our results should provide useful information for designing efficient spreading strategies in reality. (paper)
Inferring network topology from complex dynamics
International Nuclear Information System (INIS)
Shandilya, Srinivas Gorur; Timme, Marc
2011-01-01
Inferring the network topology from dynamical observations is a fundamental problem pervading research on complex systems. Here, we present a simple, direct method for inferring the structural connection topology of a network, given an observation of one collective dynamical trajectory. The general theoretical framework is applicable to arbitrary network dynamical systems described by ordinary differential equations. No interference (external driving) is required and the type of dynamics is hardly restricted in any way. In particular, the observed dynamics may be arbitrarily complex; stationary, invariant or transient; synchronous or asynchronous and chaotic or periodic. Presupposing a knowledge of the functional form of the dynamical units and of the coupling functions between them, we present an analytical solution to the inverse problem of finding the network topology from observing a time series of state variables only. Robust reconstruction is achieved in any sufficiently long generic observation of the system. We extend our method to simultaneously reconstructing both the entire network topology and all parameters appearing linear in the system's equations of motion. Reconstruction of network topology and system parameters is viable even in the presence of external noise that distorts the original dynamics substantially. The method provides a conceptually new step towards reconstructing a variety of real-world networks, including gene and protein interaction networks and neuronal circuits.
Evolutionary dynamics of complex communications networks
Karyotis, Vasileios; Papavassiliou, Symeon
2013-01-01
Until recently, most network design techniques employed a bottom-up approach with lower protocol layer mechanisms affecting the development of higher ones. This approach, however, has not yielded fascinating results in the case of wireless distributed networks. Addressing the emerging aspects of modern network analysis and design, Evolutionary Dynamics of Complex Communications Networks introduces and develops a top-bottom approach where elements of the higher layer can be exploited in modifying the lowest physical topology-closing the network design loop in an evolutionary fashion similar to
How complex a dynamical network can be?
International Nuclear Information System (INIS)
Baptista, M.S.; Kakmeni, F. Moukam; Del Magno, Gianluigi; Hussein, M.S.
2011-01-01
Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen; (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes.
Markovian dynamics on complex reaction networks
Energy Technology Data Exchange (ETDEWEB)
Goutsias, J., E-mail: goutsias@jhu.edu; Jenkinson, G., E-mail: jenkinson@jhu.edu
2013-08-10
Complex networks, comprised of individual elements that interact with each other through reaction channels, are ubiquitous across many scientific and engineering disciplines. Examples include biochemical, pharmacokinetic, epidemiological, ecological, social, neural, and multi-agent networks. A common approach to modeling such networks is by a master equation that governs the dynamic evolution of the joint probability mass function of the underlying population process and naturally leads to Markovian dynamics for such process. Due however to the nonlinear nature of most reactions and the large size of the underlying state-spaces, computation and analysis of the resulting stochastic population dynamics is a difficult task. This review article provides a coherent and comprehensive coverage of recently developed approaches and methods to tackle this problem. After reviewing a general framework for modeling Markovian reaction networks and giving specific examples, the authors present numerical and computational techniques capable of evaluating or approximating the solution of the master equation, discuss a recently developed approach for studying the stationary behavior of Markovian reaction networks using a potential energy landscape perspective, and provide an introduction to the emerging theory of thermodynamic analysis of such networks. Three representative problems of opinion formation, transcription regulation, and neural network dynamics are used as illustrative examples.
Markovian dynamics on complex reaction networks
International Nuclear Information System (INIS)
Goutsias, J.; Jenkinson, G.
2013-01-01
Complex networks, comprised of individual elements that interact with each other through reaction channels, are ubiquitous across many scientific and engineering disciplines. Examples include biochemical, pharmacokinetic, epidemiological, ecological, social, neural, and multi-agent networks. A common approach to modeling such networks is by a master equation that governs the dynamic evolution of the joint probability mass function of the underlying population process and naturally leads to Markovian dynamics for such process. Due however to the nonlinear nature of most reactions and the large size of the underlying state-spaces, computation and analysis of the resulting stochastic population dynamics is a difficult task. This review article provides a coherent and comprehensive coverage of recently developed approaches and methods to tackle this problem. After reviewing a general framework for modeling Markovian reaction networks and giving specific examples, the authors present numerical and computational techniques capable of evaluating or approximating the solution of the master equation, discuss a recently developed approach for studying the stationary behavior of Markovian reaction networks using a potential energy landscape perspective, and provide an introduction to the emerging theory of thermodynamic analysis of such networks. Three representative problems of opinion formation, transcription regulation, and neural network dynamics are used as illustrative examples
Complex networks under dynamic repair model
Chaoqi, Fu; Ying, Wang; Kun, Zhao; Yangjun, Gao
2018-01-01
Invulnerability is not the only factor of importance when considering complex networks' security. It is also critical to have an effective and reasonable repair strategy. Existing research on network repair is confined to the static model. The dynamic model makes better use of the redundant capacity of repaired nodes and repairs the damaged network more efficiently than the static model; however, the dynamic repair model is complex and polytropic. In this paper, we construct a dynamic repair model and systematically describe the energy-transfer relationships between nodes in the repair process of the failure network. Nodes are divided into three types, corresponding to three structures. We find that the strong coupling structure is responsible for secondary failure of the repaired nodes and propose an algorithm that can select the most suitable targets (nodes or links) to repair the failure network with minimal cost. Two types of repair strategies are identified, with different effects under the two energy-transfer rules. The research results enable a more flexible approach to network repair.
System crash as dynamics of complex networks.
Yu, Yi; Xiao, Gaoxi; Zhou, Jie; Wang, Yubo; Wang, Zhen; Kurths, Jürgen; Schellnhuber, Hans Joachim
2016-10-18
Complex systems, from animal herds to human nations, sometimes crash drastically. Although the growth and evolution of systems have been extensively studied, our understanding of how systems crash is still limited. It remains rather puzzling why some systems, appearing to be doomed to fail, manage to survive for a long time whereas some other systems, which seem to be too big or too strong to fail, crash rapidly. In this contribution, we propose a network-based system dynamics model, where individual actions based on the local information accessible in their respective system structures may lead to the "peculiar" dynamics of system crash mentioned above. Extensive simulations are carried out on synthetic and real-life networks, which further reveal the interesting system evolution leading to the final crash. Applications and possible extensions of the proposed model are discussed.
Advances in dynamic network modeling in complex transportation systems
Ukkusuri, Satish V
2013-01-01
This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.
Imaging complex nutrient dynamics in mycelial networks.
Fricker, M D; Lee, J A; Bebber, D P; Tlalka, M; Hynes, J; Darrah, P R; Watkinson, S C; Boddy, L
2008-08-01
Transport networks are vital components of multi-cellular organisms, distributing nutrients and removing waste products. Animal cardiovascular and respiratory systems, and plant vasculature, are branching trees whose architecture is thought to determine universal scaling laws in these organisms. In contrast, the transport systems of many multi-cellular fungi do not fit into this conceptual framework, as they have evolved to explore a patchy environment in search of new resources, rather than ramify through a three-dimensional organism. These fungi grow as a foraging mycelium, formed by the branching and fusion of threadlike hyphae, that gives rise to a complex network. To function efficiently, the mycelial network must both transport nutrients between spatially separated source and sink regions and also maintain its integrity in the face of continuous attack by mycophagous insects or random damage. Here we review the development of novel imaging approaches and software tools that we have used to characterise nutrient transport and network formation in foraging mycelia over a range of spatial scales. On a millimetre scale, we have used a combination of time-lapse confocal imaging and fluorescence recovery after photobleaching to quantify the rate of diffusive transport through the unique vacuole system in individual hyphae. These data then form the basis of a simulation model to predict the impact of such diffusion-based movement on a scale of several millimetres. On a centimetre scale, we have used novel photon-counting scintillation imaging techniques to visualize radiolabel movement in small microcosms. This approach has revealed novel N-transport phenomena, including rapid, preferential N-resource allocation to C-rich sinks, induction of simultaneous bi-directional transport, abrupt switching between different pre-existing transport routes, and a strong pulsatile component to transport in some species. Analysis of the pulsatile transport component using Fourier
Sync in Complex Dynamical Networks: Stability, Evolution, Control, and Application
Li, Xiang
2005-01-01
In the past few years, the discoveries of small-world and scale-free properties of many natural and artificial complex networks have stimulated significant advances in better understanding the relationship between the topology and the collective dynamics of complex networks. This paper reports recent progresses in the literature of synchronization of complex dynamical networks including stability criteria, network synchronizability and uniform synchronous criticality in different topologies, ...
Spatial price dynamics: From complex network perspective
Li, Y. L.; Bi, J. T.; Sun, H. J.
2008-10-01
The spatial price problem means that if the supply price plus the transportation cost is less than the demand price, there exists a trade. Thus, after an amount of exchange, the demand price will decrease. This process is continuous until an equilibrium state is obtained. However, how the trade network structure affects this process has received little attention. In this paper, we give a evolving model to describe the levels of spatial price on different complex network structures. The simulation results show that the network with shorter path length is sensitive to the variation of prices.
Complex systems and networks dynamics, controls and applications
Yu, Xinghuo; Chen, Guanrong; Yu, Wenwu
2016-01-01
This elementary book provides some state-of-the-art research results on broad disciplinary sciences on complex networks. It presents an in-depth study with detailed description of dynamics, controls and applications of complex networks. The contents of this book can be summarized as follows. First, the dynamics of complex networks, for example, the cluster dynamic analysis by using kernel spectral methods, community detection algorithms in bipartite networks, epidemiological modeling with demographics and epidemic spreading on multi-layer networks, are studied. Second, the controls of complex networks are investigated including topics like distributed finite-time cooperative control of multi-agent systems by applying homogenous-degree and Lyapunov methods, composite finite-time containment control for disturbed second-order multi-agent systems, fractional-order observer design of multi-agent systems, chaos control and anticontrol of complex systems via Parrondos game and many more. Third, the applications of ...
Exponential Synchronization of Uncertain Complex Dynamical Networks with Delay Coupling
International Nuclear Information System (INIS)
Wang Lifu; Kong Zhi; Jing Yuanwei
2010-01-01
This paper studies the global exponential synchronization of uncertain complex delayed dynamical networks. The network model considered is general dynamical delay networks with unknown network structure and unknown coupling functions but bounded. Novel delay-dependent linear controllers are designed via the Lyapunov stability theory. Especially, it is shown that the controlled networks are globally exponentially synchronized with a given convergence rate. An example of typical dynamical network of this class, having the Lorenz system at each node, has been used to demonstrate and verify the novel design proposed. And, the numerical simulation results show the effectiveness of proposed synchronization approaches. (general)
The topology and dynamics of complex networks
Dezso, Zoltan
We start with a brief introduction about the topological properties of real networks. Most real networks are scale-free, being characterized by a power-law degree distribution. The scale-free nature of real networks leads to unexpected properties such as the vanishing epidemic threshold. Traditional methods aiming to reduce the spreading rate of viruses cannot succeed on eradicating the epidemic on a scale-free network. We demonstrate that policies that discriminate between the nodes, curing mostly the highly connected nodes, can restore a finite epidemic threshold and potentially eradicate the virus. We find that the more biased a policy is towards the hubs, the more chance it has to bring the epidemic threshold above the virus' spreading rate. We continue by studying a large Web portal as a model system for a rapidly evolving network. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power law distribution, in contrast with the exponential expected for Poisson processes. We show that the exponent characterizing the individual user's browsing patterns determines the power-law decay in a document's visitation. Finally, we turn our attention to biological networks and demonstrate quantitatively that protein complexes in the yeast, Saccharomyces cerevisiae, are comprised of a core in which subunits are highly coexpressed, display the same deletion phenotype (essential or non-essential) and share identical functional classification and cellular localization. The results allow us to define the deletion phenotype and cellular task of most known complexes, and to identify with high confidence the biochemical role of hundreds of proteins with yet unassigned functionality.
Epidemic dynamics and endemic states in complex networks
Pastor-Satorras, Romualdo; Vespignani, Alessandro
2001-01-01
We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below which the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are pron...
Imura, Jun-ichi; Ueta, Tetsushi
2015-01-01
This book is the first to report on theoretical breakthroughs on control of complex dynamical systems developed by collaborative researchers in the two fields of dynamical systems theory and control theory. As well, its basic point of view is of three kinds of complexity: bifurcation phenomena subject to model uncertainty, complex behavior including periodic/quasi-periodic orbits as well as chaotic orbits, and network complexity emerging from dynamical interactions between subsystems. Analysis and Control of Complex Dynamical Systems offers a valuable resource for mathematicians, physicists, and biophysicists, as well as for researchers in nonlinear science and control engineering, allowing them to develop a better fundamental understanding of the analysis and control synthesis of such complex systems.
Practical synchronization on complex dynamical networks via optimal pinning control
Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu
2015-07-01
We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.
Synchronization in Complex Networks of Nonlinear Dynamical Systems
Wu, Chai Wah
2007-01-01
This book brings together two emerging research areas: synchronization in coupled nonlinear systems and complex networks, and study conditions under which a complex network of dynamical systems synchronizes. While there are many texts that study synchronization in chaotic systems or properties of complex networks, there are few texts that consider the intersection of these two very active and interdisciplinary research areas. The main theme of this book is that synchronization conditions can be related to graph theoretical properties of the underlying coupling topology. The book introduces ide
Epidemic dynamics and endemic states in complex networks
Pastor-Satorras, Romualdo; Vespignani, Alessandro
2001-06-01
We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.
Epidemic dynamics and endemic states in complex networks
International Nuclear Information System (INIS)
Pastor-Satorras, Romualdo; Vespignani, Alessandro
2001-01-01
We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks
Synchronization of complex delayed dynamical networks with nonlinearly coupled nodes
International Nuclear Information System (INIS)
Liu Tao; Zhao Jun; Hill, David J.
2009-01-01
In this paper, we study the global synchronization of nonlinearly coupled complex delayed dynamical networks with both directed and undirected graphs. Via Lyapunov-Krasovskii stability theory and the network topology, we investigate the global synchronization of such networks. Under the assumption that coupling coefficients are known, a family of delay-independent decentralized nonlinear feedback controllers are designed to globally synchronize the networks. When coupling coefficients are unavailable, an adaptive mechanism is introduced to synthesize a family of delay-independent decentralized adaptive controllers which guarantee the global synchronization of the uncertain networks. Two numerical examples of directed and undirected delayed dynamical network are given, respectively, using the Lorenz system as the nodes of the networks, which demonstrate the effectiveness of proposed results.
Dynamic properties of epidemic spreading on finite size complex networks
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.
Robustness of pinning a general complex dynamical network
International Nuclear Information System (INIS)
Wang Lei; Sun Youxian
2010-01-01
This Letter studies the robustness problem of pinning a general complex dynamical network toward an assigned synchronous evolution. Several synchronization criteria are presented to guarantee the convergence of the pinning process locally and globally by construction of Lyapunov functions. In particular, if a pinning strategy has been designed for synchronization of a given complex dynamical network, then no matter what uncertainties occur among the pinned nodes, synchronization can still be guaranteed through the pinning. The analytical results show that pinning control has a certain robustness against perturbations on network architecture: adding, deleting and changing the weights of edges. Numerical simulations illustrated by scale-free complex networks verify the theoretical results above-acquired.
Complex and unexpected dynamics in simple genetic regulatory networks
Borg, Yanika; Ullner, Ekkehard; Alagha, Afnan; Alsaedi, Ahmed; Nesbeth, Darren; Zaikin, Alexey
2014-03-01
One aim of synthetic biology is to construct increasingly complex genetic networks from interconnected simpler ones to address challenges in medicine and biotechnology. However, as systems increase in size and complexity, emergent properties lead to unexpected and complex dynamics due to nonlinear and nonequilibrium properties from component interactions. We focus on four different studies of biological systems which exhibit complex and unexpected dynamics. Using simple synthetic genetic networks, small and large populations of phase-coupled quorum sensing repressilators, Goodwin oscillators, and bistable switches, we review how coupled and stochastic components can result in clustering, chaos, noise-induced coherence and speed-dependent decision making. A system of repressilators exhibits oscillations, limit cycles, steady states or chaos depending on the nature and strength of the coupling mechanism. In large repressilator networks, rich dynamics can also be exhibited, such as clustering and chaos. In populations of Goodwin oscillators, noise can induce coherent oscillations. In bistable systems, the speed with which incoming external signals reach steady state can bias the network towards particular attractors. These studies showcase the range of dynamical behavior that simple synthetic genetic networks can exhibit. In addition, they demonstrate the ability of mathematical modeling to analyze nonlinearity and inhomogeneity within these systems.
Coupled disease-behavior dynamics on complex networks: A review
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.
Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics
Chen, Yu-Zhong; Lai, Ying-Cheng
2018-03-01
Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.
Complex human mobility dynamics on a network
International Nuclear Information System (INIS)
Szell, M.
2010-01-01
Massive multiplayer online games provide a fascinating new way of observing hundreds of thousands of simultaneously interacting individuals engaged in virtual socio-economic activities. We have compiled a data set consisting of practically all actions of all players over a period of four years from an online game played by over 350,000 people. The universe of this online world is a lattice-like network on which players move in order to interact with other players. We focus on the mobility of human players on this network over a time-period of 500 days. We take a number of mobility measurements and compare them with measures of simulated random walkers on the same topology. Mobility of players is sub-diffusive - the mean squared displacement follows a power law with exponent 0.4 - and significantly deviates from mobility patterns of random walkers. Mean first passage times and transition counts relate via a power-law with slope -1/3. We compare our results with studies where human mobility was measured via mobile phone data and find striking similarities. (author)
Recovery time after localized perturbations in complex dynamical networks
Mitra, Chiranjit; Kittel, Tim; Choudhary, Anshul; Kurths, Jürgen; Donner, Reik V.
2017-10-01
Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed
Recovery time after localized perturbations in complex dynamical networks
International Nuclear Information System (INIS)
Mitra, Chiranjit; Kittel, Tim; Kurths, Jürgen; Donner, Reik V; Choudhary, Anshul
2017-01-01
Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed
Opinion Dynamics on Complex Networks with Communities
International Nuclear Information System (INIS)
Ru, Wang; Li-Ping, Chi
2008-01-01
The Ising or Potts models of ferromagnetism have been widely used to describe locally interacting social or economic systems. We consider a related model, introduced by Sznajd to describe the evolution of consensus in the scale-free networks with the tunable strength (noted by Q) of community structure. In the Sznajd model, the opinion or state of any spins can only be changed by the influence of neighbouring pairs of similar connection spins. Such pairs can polarize their neighbours. Using asynchronous updating, it is found that the smaller the community strength Q, the larger the slope of the exponential relaxation time distribution. Then the effect of the initial up- spin concentration p as a function of the final all up probability E is investigated by taking different initialization strategies, the random node-chosen initialization strategy has no difference under different community strengths, while the strategies of community node-chosen initialization and hub node-chosen initialization are different in final probability under different Q, and the latter one is more effective in reaching final state
A paradox for traffic dynamics in complex networks with ATIS
International Nuclear Information System (INIS)
Zheng Jianfeng; Gao Ziyou
2008-01-01
In this work, we study the statistical properties of traffic (e.g., vehicles) dynamics in complex networks, by introducing advanced transportation information systems (ATIS). The ATIS can provide the information of traffic flow pattern throughout the network and have an obvious effect on path routing strategy for such vehicles equipped with ATIS. The ATIS can be described by the understanding of link cost functions. Different indices such as efficiency and system total cost are discussed in depth. It is found that, for random networks (scale-free networks), the efficiency is effectively improved (decreased) if ATIS is properly equipped; however the system total cost is largely increased (decreased). It indicates that there exists a paradox between the efficiency and system total cost in complex networks. Furthermore, we report the simulation results by considering different kinds of link cost functions, and the paradox is recovered. Finally, we extend our traffic model, and also find the existence of the paradox
Complex Dynamical Network Control for Trajectory Tracking Using Delayed Recurrent Neural Networks
Directory of Open Access Journals (Sweden)
Jose P. Perez
2014-01-01
Full Text Available In this paper, the problem of trajectory tracking is studied. Based on the V-stability and Lyapunov theory, a control law that achieves the global asymptotic stability of the tracking error between a delayed recurrent neural network and a complex dynamical network is obtained. To illustrate the analytic results, we present a tracking simulation of a dynamical network with each node being just one Lorenz’s dynamical system and three identical Chen’s dynamical systems.
Spreading dynamics on complex networks: a general stochastic approach.
Noël, Pierre-André; Allard, Antoine; Hébert-Dufresne, Laurent; Marceau, Vincent; Dubé, Louis J
2014-12-01
Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our framework and the fact that its assumptions are explicitly stated suggests that it could be used as a common ground for comparing existing epidemics models too complex for direct comparison, such as agent-based computer simulations. We provide many examples for the special cases of susceptible-infectious-susceptible and susceptible-infectious-removed dynamics (e.g., epidemics propagation) and we observe multiple situations where accurate results may be obtained at low computational cost. Our perspective reveals a subtle balance between the complex requirements of a realistic model and its basic assumptions.
Dynamics of functional failures and recovery in complex road networks
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.
Complexity and network dynamics in physiological adaptation: An integrated view
Baffy, Gyorgy; Loscalzo, Joseph
2014-01-01
Living organisms constantly interact with their surroundings and sustain internal stability against perturbations. This dynamic process follows three fundamental strategies (restore, explore, and abandon) articulated in historical concepts of physiological adaptation such as homeostasis, allostasis, and the general adaptation syndrome. These strategies correspond to elementary forms of behavior (ordered, chaotic, and static) in complex adaptive systems and invite a network-based analysis of t...
International Nuclear Information System (INIS)
Zhang Li-Sheng; Mi Yuan-Yuan; Gu Wei-Feng; Hu Gang
2014-01-01
All dynamic complex networks have two important aspects, pattern dynamics and network topology. Discovering different types of pattern dynamics and exploring how these dynamics depend on network topologies are tasks of both great theoretical importance and broad practical significance. In this paper we study the oscillatory behaviors of excitable complex networks (ECNs) and find some interesting dynamic behaviors of ECNs in oscillatory probability, the multiplicity of oscillatory attractors, period distribution, and different types of oscillatory patterns (e.g., periodic, quasiperiodic, and chaotic). In these aspects, we further explore strikingly sharp differences among network dynamics induced by different topologies (random or scale-free topologies) and different interaction structures (symmetric or asymmetric couplings). The mechanisms behind these differences are explained physically. (interdisciplinary physics and related areas of science and technology)
Complexity and network dynamics in physiological adaptation: an integrated view.
Baffy, György; Loscalzo, Joseph
2014-05-28
Living organisms constantly interact with their surroundings and sustain internal stability against perturbations. This dynamic process follows three fundamental strategies (restore, explore, and abandon) articulated in historical concepts of physiological adaptation such as homeostasis, allostasis, and the general adaptation syndrome. These strategies correspond to elementary forms of behavior (ordered, chaotic, and static) in complex adaptive systems and invite a network-based analysis of the operational characteristics, allowing us to propose an integrated framework of physiological adaptation from a complex network perspective. Applicability of this concept is illustrated by analyzing molecular and cellular mechanisms of adaptation in response to the pervasive challenge of obesity, a chronic condition resulting from sustained nutrient excess that prompts chaotic exploration for system stability associated with tradeoffs and a risk of adverse outcomes such as diabetes, cardiovascular disease, and cancer. Deconstruction of this complexity holds the promise of gaining novel insights into physiological adaptation in health and disease. Published by Elsevier Inc.
The geometry of chaotic dynamics — a complex network perspective
Donner, R. V.; Heitzig, J.; Donges, J. F.; Zou, Y.; Marwan, N.; Kurths, J.
2011-12-01
Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques, recurrence-based concepts and prominently ɛ-recurrence networks, most faithfully represent the geometrical fine structure of the attractors underlying chaotic (and less interestingly non-chaotic) time series. In this paper we demonstrate that the well known graph theoretical properties local clustering coefficient and global (network) transitivity can meaningfully be exploited to define two new local and two new global measures of dimension in phase space: local upper and lower clustering dimension as well as global upper and lower transitivity dimension. Rigorous analytical as well as numerical results for self-similar sets and simple chaotic model systems suggest that these measures are well-behaved in most non-pathological situations and that they can be estimated reasonably well using ɛ-recurrence networks constructed from relatively short time series. Moreover, we study the relationship between clustering and transitivity dimensions on the one hand, and traditional measures like pointwise dimension or local Lyapunov dimension on the other hand. We also provide further evidence that the local clustering coefficients, or equivalently the local clustering dimensions, are useful for identifying unstable periodic orbits and other dynamically invariant objects from time series. Our results demonstrate that ɛ-recurrence networks exhibit an important link between dynamical systems and graph theory.
Hash function construction using weighted complex dynamical networks
International Nuclear Information System (INIS)
Song Yu-Rong; Jiang Guo-Ping
2013-01-01
A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency. (general)
Self-organization of complex networks as a dynamical system.
Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio
2015-01-01
To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.
Impulsive generalized function synchronization of complex dynamical networks
International Nuclear Information System (INIS)
Zhang, Qunjiao; Chen, Juan; Wan, Li
2013-01-01
This Letter investigates generalized function synchronization of continuous and discrete complex networks by impulsive control. By constructing the reasonable corresponding impulsively controlled response networks, some criteria and corollaries are derived for the generalized function synchronization between the impulsively controlled complex networks, continuous and discrete networks are both included. Furthermore, the generalized linear synchronization and nonlinear synchronization are respectively illustrated by several examples. All the numerical simulations demonstrate the correctness of the theoretical results
Fundamentals of complex networks models, structures and dynamics
Chen, Guanrong; Li, Xiang
2014-01-01
Complex networks such as the Internet, WWW, transportationnetworks, power grids, biological neural networks, and scientificcooperation networks of all kinds provide challenges for futuretechnological development. In particular, advanced societies havebecome dependent on large infrastructural networks to an extentbeyond our capability to plan (modeling) and to operate (control).The recent spate of collapses in power grids and ongoing virusattacks on the Internet illustrate the need for knowledge aboutmodeling, analysis of behaviors, optimized planning and performancecontrol in such networks. F
Dynamics of Symmetric Conserved Mass Aggregation Model on Complex Networks
Institute of Scientific and Technical Information of China (English)
HUA Da-Yin
2009-01-01
We investigate the dynamical behaviour of the aggregation process in the symmetric conserved mass aggregation model under three different topological structures. The dispersion σ(t, L) = (∑i(mi - ρ0)2/L)1/2 is defined to describe the dynamical behaviour where ρ0 is the density of particle and mi is the particle number on a site. It is found numerically that for a regular lattice and a scale-free network, σ(t, L) follows a power-law scaling σ(t, L) ～ tδ1 and σ(t, L) ～ tδ4 from a random initial condition to the stationary states, respectively. However, for a small-world network, there are two power-law scaling regimes, σ(t, L) ～ tδ2 when t＜T and a(t, L) ～ tδ3 when tT. Moreover, it is found numerically that δ2 is near to δ1 for small rewiring probability q, and δ3 hardly changes with varying q and it is almost the same as δ4. We speculate that the aggregation of the connection degree accelerates the mass aggregation in the initial relaxation stage and the existence of the long-distance interactions in the complex networks results in the acceleration of the mass aggregation when tT for the small-world networks. We also show that the relaxation time T follows a power-law scaling τ Lz and σ(t, L) in the stationary state follows a power-law σs(L) ～ Lσ for three different structures.
Structure-based control of complex networks with nonlinear dynamics.
Zañudo, Jorge Gomez Tejeda; Yang, Gang; Albert, Réka
2017-07-11
What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.
The Graph Laplacian and the Dynamics of Complex Networks
Energy Technology Data Exchange (ETDEWEB)
Thulasidasan, Sunil [Los Alamos National Laboratory
2012-06-11
In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.
Complex networks: when random walk dynamics equals synchronization
International Nuclear Information System (INIS)
Kriener, Birgit; Anand, Lishma; Timme, Marc
2012-01-01
Synchrony prevalently emerges from the interactions of coupled dynamical units. For simple systems such as networks of phase oscillators, the asymptotic synchronization process is assumed to be equivalent to a Markov process that models standard diffusion or random walks on the same network topology. In this paper, we analytically derive the conditions for such equivalence for networks of pulse-coupled oscillators, which serve as models for neurons and pacemaker cells interacting by exchanging electric pulses or fireflies interacting via light flashes. We find that the pulse synchronization process is less simple, but there are classes of, e.g., network topologies that ensure equivalence. In particular, local dynamical operators are required to be doubly stochastic. These results provide a natural link between stochastic processes and deterministic synchronization on networks. Tools for analyzing diffusion (or, more generally, Markov processes) may now be transferred to pin down features of synchronization in networks of pulse-coupled units such as neural circuits. (paper)
On synchronized regions of discrete-time complex dynamical networks
International Nuclear Information System (INIS)
Duan Zhisheng; Chen Guanrong
2011-01-01
In this paper, the local synchronization of discrete-time complex networks is studied. First, it is shown that for any natural number n, there exists a discrete-time network which has at least left floor n/2 right floor +1 disconnected synchronized regions for local synchronization, which implies the possibility of intermittent synchronization behaviors. Different from the continuous-time networks, the existence of an unbounded synchronized region is impossible for discrete-time networks. The convexity of the synchronized regions is also characterized based on the stability of a class of matrix pencils, which is useful for enlarging the stability region so as to improve the network synchronizability.
Evsukoff, Alexandre; González, Marta
2013-01-01
In the last decade we have seen the emergence of a new inter-disciplinary field focusing on the understanding of networks which are dynamic, large, open, and have a structure sometimes called random-biased. The field of Complex Networks is helping us better understand many complex phenomena such as the spread of deseases, protein interactions, social relationships, to name but a few. Studies in Complex Networks are gaining attention due to some major scientific breakthroughs proposed by network scientists helping us understand and model interactions contained in large datasets. In fact, if we could point to one event leading to the widespread use of complex network analysis is the availability of online databases. Theories of Random Graphs from Erdös and Rényi from the late 1950s led us to believe that most networks had random characteristics. The work on large online datasets told us otherwise. Starting with the work of Barabási and Albert as well as Watts and Strogatz in the late 1990s, we now know th...
2003-01-01
Network Physics, provider of business-level, traffic flow-based network management solutions, today announced the introduction of the Network Physics NP/BizFlow-1000. With the NP/BizFlow-1000, Fortune 1000 companies with complex and dynamic networks can analyze the flows that link business groups, critical applications, and network software and hardware (1 page).
Complex Dynamics of Delay-Coupled Neural Networks
Mao, Xiaochen
2016-09-01
This paper reveals the complicated dynamics of a delay-coupled system that consists of a pair of sub-networks and multiple bidirectional couplings. Time delays are introduced into the internal connections and network-couplings, respectively. The stability and instability of the coupled network are discussed. The sufficient conditions for the existence of oscillations are given. Case studies of numerical simulations are given to validate the analytical results. Interesting and complicated neuronal activities are observed numerically, such as rest states, periodic oscillations, multiple switches of rest states and oscillations, and the coexistence of different types of oscillations.
Energy Technology Data Exchange (ETDEWEB)
Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teacher' s College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Lu Hongqian [Shandong Institute of Light Industry, Shandong Jinan 250353 (China)
2009-12-28
This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.
International Nuclear Information System (INIS)
Xu Yuhua; Zhou Wuneng; Fang Jian'an; Lu Hongqian
2009-01-01
This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.
Asymmetrically interacting spreading dynamics on complex layered networks.
Wang, Wei; Tang, Ming; Yang, Hui; Younghae Do; Lai, Ying-Cheng; Lee, GyuWon
2014-05-29
The spread of disease through a physical-contact network and the spread of information about the disease on a communication network are two intimately related dynamical processes. We investigate the asymmetrical interplay between the two types of spreading dynamics, each occurring on its own layer, by focusing on the two fundamental quantities underlying any spreading process: epidemic threshold and the final infection ratio. We find that an epidemic outbreak on the contact layer can induce an outbreak on the communication layer, and information spreading can effectively raise the epidemic threshold. When structural correlation exists between the two layers, the information threshold remains unchanged but the epidemic threshold can be enhanced, making the contact layer more resilient to epidemic outbreak. We develop a physical theory to understand the intricate interplay between the two types of spreading dynamics.
Gao, Zilin; Wang, Yinhe; Zhang, Lili
2018-02-01
In the existing research results of the complex dynamical networks controlled, the controllers are mainly used to guarantee the synchronization or stabilization of the nodes’ state, and the terms coupled with connection relationships may affect the behaviors of nodes, this obviously ignores the dynamic common behavior of the connection relationships between the nodes. In fact, from the point of view of large-scale system, a complex dynamical network can be regarded to be composed of two time-varying dynamic subsystems, which can be called the nodes subsystem and the connection relationships subsystem, respectively. Similar to the synchronization or stabilization of the nodes subsystem, some characteristic phenomena can be also emerged in the connection relationships subsystem. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. This paper focuses on the structural balance in dynamic complex networks. Generally speaking, the state of the connection relationships subsystem is difficult to be measured accurately in practical applications, and thus it is not easy to implant the controller directly into the connection relationships subsystem. It is noted that the nodes subsystem and the relationships subsystem are mutually coupled, which implies that the state of the connection relationships subsystem can be affected by the controllable state of nodes subsystem. Inspired by this observation, by using the structural balance theory of triad, the controller with the parameter adaptive law is proposed for the nodes subsystem in this paper, which may ensure the connection relationship matrix to approximate a given structural balance matrix in the sense of the uniformly ultimately bounded (UUB). That is, the structural balance may be obtained by employing the controlling state of the nodes subsystem. Finally, the simulations are used to show the validity of the method in this paper.
International Nuclear Information System (INIS)
Li, Lixiang; Li, Weiwei; Kurths, Jürgen; Luo, Qun; Yang, Yixian; Li, Shudong
2015-01-01
For the reason that the uncertain complex dynamic network with multi-link is quite close to various practical networks, there is superiority in the fields of research and application. In this paper, we focus upon pinning adaptive synchronization for uncertain complex dynamic networks with multi-link against network deterioration. The pinning approach can be applied to adapt uncertain coupling factors of deteriorated networks which can compensate effects of uncertainty. Several new synchronization criterions for networks with multi-link are derived, which ensure the synchronized states to be local or global stable with uncertainty and deterioration. Results of simulation are shown to demonstrate the feasibility and usefulness of our method
Lectures in Supercomputational Neurosciences Dynamics in Complex Brain Networks
Graben, Peter beim; Thiel, Marco; Kurths, Jürgen
2008-01-01
Computational Neuroscience is a burgeoning field of research where only the combined effort of neuroscientists, biologists, psychologists, physicists, mathematicians, computer scientists, engineers and other specialists, e.g. from linguistics and medicine, seem to be able to expand the limits of our knowledge. The present volume is an introduction, largely from the physicists' perspective, to the subject matter with in-depth contributions by system neuroscientists. A conceptual model for complex networks of neurons is introduced that incorporates many important features of the real brain, such as various types of neurons, various brain areas, inhibitory and excitatory coupling and the plasticity of the network. The computational implementation on supercomputers, which is introduced and discussed in detail in this book, will enable the readers to modify and adapt the algortihm for their own research. Worked-out examples of applications are presented for networks of Morris-Lecar neurons to model the cortical co...
Nonlinear dynamics of the complex multi-scale network
Makarov, Vladimir V.; Kirsanov, Daniil; Goremyko, Mikhail; Andreev, Andrey; Hramov, Alexander E.
2018-04-01
In this paper, we study the complex multi-scale network of nonlocally coupled oscillators for the appearance of chimera states. Chimera is a special state in which, in addition to the asynchronous cluster, there are also completely synchronous parts in the system. We show that the increase of nodes in subgroups leads to the destruction of the synchronous interaction within the common ring and to the narrowing of the chimera region.
Dynamics of Research Team Formation in Complex Networks
Sun, Caihong; Wan, Yuzi; Chen, Yu
Most organizations encourage the formation of teams to accomplish complicated tasks, and vice verse, effective teams could bring lots benefits and profits for organizations. Network structure plays an important role in forming teams. In this paper, we specifically study the dynamics of team formation in large research communities in which knowledge of individuals plays an important role on team performance and individual utility. An agent-based model is proposed, in which heterogeneous agents from research communities are described and empirically tested. Each agent has a knowledge endowment and a preference for both income and leisure. Agents provide a variable input (‘effort’) and their knowledge endowments to production. They could learn from others in their team and those who are not in their team but have private connections in community to adjust their own knowledge endowment. They are allowed to join other teams or work alone when it is welfare maximizing to do so. Various simulation experiments are conducted to examine the impacts of network topology, knowledge diffusion among community network, and team output sharing mechanisms on the dynamics of team formation.
Directory of Open Access Journals (Sweden)
Xinwei Wang
2017-01-01
Full Text Available Topology detection for output-coupling weighted complex dynamical networks with two types of time delays is investigated in this paper. Different from existing literatures, coupling delay and transmission delay are simultaneously taken into account in the output-coupling network. Based on the idea of the state observer, we build the drive-response system and apply LaSalle’s invariance principle to the error dynamical system of the drive-response system. Several convergent criteria are deduced in the form of algebraic inequalities. Some numerical simulations for the complex dynamical network, with node dynamics being chaotic, are given to verify the effectiveness of the proposed scheme.
Pinning synchronization of delayed complex dynamical networks with nonlinear coupling
Cheng, Ranran; Peng, Mingshu; Yu, Weibin
2014-11-01
In this paper, we find that complex networks with the Watts-Strogatz or scale-free BA random topological architecture can be synchronized more easily by pin-controlling fewer nodes than regular systems. Theoretical analysis is included by means of Lyapunov functions and linear matrix inequalities (LMI) to make all nodes reach complete synchronization. Numerical examples are also provided to illustrate the importance of our theoretical analysis, which implies that there exists a gap between the theoretical prediction and numerical results about the minimum number of pinning controlled nodes.
Directory of Open Access Journals (Sweden)
Joshua Rodewald
2016-10-01
Full Text Available Supply networks existing today in many industries can behave as complex adaptive systems making them more difficult to analyze and assess. Being able to fully understand both the complex static and dynamic structures of a complex adaptive supply network (CASN are key to being able to make more informed management decisions and prioritize resources and production throughout the network. Previous efforts to model and analyze CASN have been impeded by the complex, dynamic nature of the systems. However, drawing from other complex adaptive systems sciences, information theory provides a model-free methodology removing many of those barriers, especially concerning complex network structure and dynamics. With minimal information about the network nodes, transfer entropy can be used to reverse engineer the network structure while local transfer entropy can be used to analyze the network structure’s dynamics. Both simulated and real-world networks were analyzed using this methodology. Applying the methodology to CASNs allows the practitioner to capitalize on observations from the highly multidisciplinary field of information theory which provides insights into CASN’s self-organization, emergence, stability/instability, and distributed computation. This not only provides managers with a more thorough understanding of a system’s structure and dynamics for management purposes, but also opens up research opportunities into eventual strategies to monitor and manage emergence and adaption within the environment.
Modeling Networks and Dynamics in Complex Systems: from Nano-Composites to Opinion Formation
Shi, Feng
Complex networks are ubiquitous in systems of physical, biological, social or technological origin. Components in those systems range from as large as cities in power grids, to as small as molecules in metabolic networks. Since the dawn of network science, significant attention has focused on the implications of dynamics in establishing network structure and the impact of structural properties on dynamics on those networks. The first part of the thesis follows this direction, studying the network formed by conductive nanorods in nano-materials, and focuses on the electrical response of the composite to the structure change of the network. New scaling laws for the shear-induced anisotropic percolation are introduced and a robust exponential tail of the current distribution across the network is identified. These results are relevant especially to "active" composite materials where materials are exposed to mechanical loading and strain deformations. However, in many real-world networks the evolution of the network topology is tied to the states of the vertices and vice versa. Networks that exhibit such a feedback are called adaptive or coevolutionary networks. The second part of the thesis examines two closely related variants of a simple, abstract model for coevolution of a network and the opinions of its members. As a representative model for adaptive networks, it displays the feature of self-organization of the system into a stable configuration due to the interplay between the network topology and the dynamics on the network. This simple model yields interesting dynamics and the slight change in the rewiring strategy results in qualitatively different behaviors of the system. In conclusion, the dissertation aims to develop new network models and tools which enable insights into the structure and dynamics of various systems, and seeks to advance network algorithms which provide approaches to coherently articulated questions in real-world complex systems such as
Ganguly, Niloy; Mukherjee, Animesh
2009-01-01
This self-contained book systematically explores the statistical dynamics on and of complex networks having relevance across a large number of scientific disciplines. The theories related to complex networks are increasingly being used by researchers for their usefulness in harnessing the most difficult problems of a particular discipline. The book is a collection of surveys and cutting-edge research contributions exploring the interdisciplinary relationship of dynamics on and of complex networks. Towards this goal, the work is thematically organized into three main sections: Part I studies th
Framework based on communicability and flow to analyze complex network dynamics
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.
2015-11-01
Gholamreza, and Ester, Martin. “Modeling the Temporal Dynamics of Social Rating Networks Using Bidirectional Effects of Social Relations and Rating...1.1.2 β-disruptor Problems Besides the homogeneous network model consisting of uniform nodes and bidirectional links, the heterogeneous network model... neural and metabolic networks .” Biological Cybernetics 90 (2004): 311–317. 10.1007/s00422-004-0479-1. URL http://dx.doi.org/10.1007/s00422-004-0479-1 [51
Directory of Open Access Journals (Sweden)
Xianjun Shen
Full Text Available How to identify protein complex is an important and challenging task in proteomics. It would make great contribution to our knowledge of molecular mechanism in cell life activities. However, the inherent organization and dynamic characteristic of cell system have rarely been incorporated into the existing algorithms for detecting protein complexes because of the limitation of protein-protein interaction (PPI data produced by high throughput techniques. The availability of time course gene expression profile enables us to uncover the dynamics of molecular networks and improve the detection of protein complexes. In order to achieve this goal, this paper proposes a novel algorithm DCA (Dynamic Core-Attachment. It detects protein-complex core comprising of continually expressed and highly connected proteins in dynamic PPI network, and then the protein complex is formed by including the attachments with high adhesion into the core. The integration of core-attachment feature into the dynamic PPI network is responsible for the superiority of our algorithm. DCA has been applied on two different yeast dynamic PPI networks and the experimental results show that it performs significantly better than the state-of-the-art techniques in terms of prediction accuracy, hF-measure and statistical significance in biology. In addition, the identified complexes with strong biological significance provide potential candidate complexes for biologists to validate.
Yasami, Yasser; Safaei, Farshad
2018-02-01
The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of
Information Propagation in Complex Networks : Structures and Dynamics
Märtens, M.
2018-01-01
This thesis is a contribution to a deeper understanding of how information propagates and what this process entails. At its very core is the concept of the network: a collection of nodes and links, which describes the structure of the systems under investigation. The network is a mathematical model
Generation of clusters in complex dynamical networks via pinning control
International Nuclear Information System (INIS)
Li Kezan; Fu Xinchu; Small, Michael
2008-01-01
Many real-world networks show community structure, i.e., groups (or clusters) of nodes that have a high density of links within them but with a lower density of links between them. In this paper, by applying feedback injections to a fraction of network nodes, various clusters are synchronized independently according to the community structure generated by the group partition of the network (cluster synchronization). This control is achieved by pinning (i.e. applying linear feedback control) to a subset of the network nodes. Those pinned nodes are selected not randomly but according to the topological structure of communities of a given network. Specifically, for a given group partition of a network, those nodes with direct connections between groups must be pinned in order to achieve cluster synchronization. Both the local stability and global stability of cluster synchronization are investigated. Taking the tree-shaped network and the most modular network as two particular examples, we illustrate in detail how the pinning strategy influences the generation of clusters. The simulations verify the efficiency of the pinning schemes used in this paper
Dynamics of slow and fast systems on complex networks
Indian Academy of Sciences (India)
synchrony in oscillator networks [10]. In power grids and the Internet it has been shown that heterogeneity due to different loads on nodes can cause a cascade ..... from that of the bipartite one even when they start from the same initial conditions. In the network of 3 sys- tems the configurations 3 and 4 exhibited frequency.
International Nuclear Information System (INIS)
Zhao-Bing, Liu; Hua-Guang, Zhang; Qiu-Ye, Sun
2010-01-01
This paper considers the global stability of controlling an uncertain complex network to a homogeneous trajectory of the uncoupled system by a local pinning control strategy. Several sufficient conditions are derived to guarantee the network synchronisation by investigating the relationship among pinning synchronisation, network topology, and coupling strength. Also, some fundamental and yet challenging problems in the pinning control of complex networks are discussed: (1) what nodes should be selected as pinned candidates? (2) How many nodes are needed to be pinned for a fixed coupling strength? Furthermore, an adaptive pinning control scheme is developed. In order to achieve synchronisation of an uncertain complex network, the adaptive tuning strategy of either the coupling strength or the control gain is utilised. As an illustrative example, a network with the Lorenz system as node self-dynamics is simulated to verify the efficacy of theoretical results. (general)
Game theory and extremal optimization for community detection in complex dynamic networks.
Lung, Rodica Ioana; Chira, Camelia; Andreica, Anca
2014-01-01
The detection of evolving communities in dynamic complex networks is a challenging problem that recently received attention from the research community. Dynamics clearly add another complexity dimension to the difficult task of community detection. Methods should be able to detect changes in the network structure and produce a set of community structures corresponding to different timestamps and reflecting the evolution in time of network data. We propose a novel approach based on game theory elements and extremal optimization to address dynamic communities detection. Thus, the problem is formulated as a mathematical game in which nodes take the role of players that seek to choose a community that maximizes their profit viewed as a fitness function. Numerical results obtained for both synthetic and real-world networks illustrate the competitive performance of this game theoretical approach.
Exponentially asymptotical synchronization in uncertain complex dynamical networks with time delay
Energy Technology Data Exchange (ETDEWEB)
Luo Qun; Yang Han; Li Lixiang; Yang Yixian [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Han Jiangxue, E-mail: luoqun@bupt.edu.c [National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China)
2010-12-10
Over the past decade, complex dynamical network synchronization has attracted more and more attention and important developments have been made. In this paper, we explore the scheme of globally exponentially asymptotical synchronization in complex dynamical networks with time delay. Based on Lyapunov stability theory and through defining the error function between adjacent nodes, four novel adaptive controllers are designed under four situations where the Lipschitz constants of the state function in nodes are known or unknown and the network structure is certain or uncertain, respectively. These controllers could not only globally asymptotically synchronize all nodes in networks, but also ensure that the error functions do not exceed the pre-scheduled exponential function. Finally, simulations of the synchronization among the chaotic system in the small-world and scale-free network structures are presented, which prove the effectiveness and feasibility of our controllers.
Adaptive Synchronization of Fractional Order Complex-Variable Dynamical Networks via Pinning Control
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
Exponential synchronization of complex networks with nonidentical time-delayed dynamical nodes
International Nuclear Information System (INIS)
Cai Shuiming; He Qinbin; Hao Junjun; Liu Zengrong
2010-01-01
In this Letter, exponential synchronization of a complex network with nonidentical time-delayed dynamical nodes is considered. Two effective control schemes are proposed to drive the network to synchronize globally exponentially onto any smooth goal dynamics. By applying open-loop control to all nodes and adding some intermittent controllers to partial nodes, some simple criteria for exponential synchronization of such network are established. Meanwhile, a pinning scheme deciding which nodes need to be pinned and a simply approximate formula for estimating the least number of pinned nodes are also provided. By introducing impulsive effects to the open-loop controlled network, another synchronization scheme is developed for the network with nonidentical time-delayed dynamical nodes, and an estimate of the upper bound of impulsive intervals ensuring global exponential stability of the synchronization process is also given. Numerical simulations are presented finally to demonstrate the effectiveness of the theoretical results.
Identification of Complex Dynamical Systems with Neural Networks (2/2)
CERN. Geneva
2016-01-01
The identification and analysis of high dimensional nonlinear systems is obviously a challenging task. Neural networks have been proven to be universal approximators but this still leaves the identification task a hard one. To do it efficiently, we have to violate some of the rules of classical regression theory. Furthermore we should focus on the interpretation of the resulting model to overcome its black box character. First, we will discuss function approximation with 3 layer feedforward neural networks up to new developments in deep neural networks and deep learning. These nets are not only of interest in connection with image analysis but are a center point of the current artificial intelligence developments. Second, we will focus on the analysis of complex dynamical system in the form of state space models realized as recurrent neural networks. After the introduction of small open dynamical systems we will study dynamical systems on manifolds. Here manifold and dynamics have to be identified in parall...
Identification of Complex Dynamical Systems with Neural Networks (1/2)
CERN. Geneva
2016-01-01
The identification and analysis of high dimensional nonlinear systems is obviously a challenging task. Neural networks have been proven to be universal approximators but this still leaves the identification task a hard one. To do it efficiently, we have to violate some of the rules of classical regression theory. Furthermore we should focus on the interpretation of the resulting model to overcome its black box character. First, we will discuss function approximation with 3 layer feedforward neural networks up to new developments in deep neural networks and deep learning. These nets are not only of interest in connection with image analysis but are a center point of the current artificial intelligence developments. Second, we will focus on the analysis of complex dynamical system in the form of state space models realized as recurrent neural networks. After the introduction of small open dynamical systems we will study dynamical systems on manifolds. Here manifold and dynamics have to be identified in parall...
Energy Technology Data Exchange (ETDEWEB)
Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teachers' College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Sun Wen [School of Mathematics and Information, Yangtze University, Hubei Jingzhou 434023 (China)
2010-04-05
This Letter investigates the synchronization of a general complex dynamical network with non-derivative and derivative coupling. Based on LaSalle's invariance principle, adaptive synchronization criteria are obtained. Analytical result shows that under the designed adaptive controllers, a general complex dynamical network with non-derivative and derivative coupling can asymptotically synchronize to a given trajectory, and several useful criteria for synchronization are given. What is more, the coupling matrix is not assumed to be symmetric or irreducible. Finally, simulations results show the method is effective.
Phase dynamics of complex-valued neural networks and its application to traffic signal control.
Nishikawa, Ikuko; Iritani, Takeshi; Sakakibara, Kazutoshi; Kuroe, Yasuaki
2005-01-01
Complex-valued Hopfield networks which possess the energy function are analyzed. The dynamics of the network with certain forms of an activation function is de-composable into the dynamics of the amplitude and phase of each neuron. Then the phase dynamics is described as a coupled system of phase oscillators with a pair-wise sinusoidal interaction. Therefore its phase synchronization mechanism is useful for the area-wide offset control of the traffic signals. The computer simulations show the effectiveness under the various traffic conditions.
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.
Using chemistry and microfluidics to understand the spatial dynamics of complex biological networks.
Kastrup, Christian J; Runyon, Matthew K; Lucchetta, Elena M; Price, Jessica M; Ismagilov, Rustem F
2008-04-01
Understanding the spatial dynamics of biochemical networks is both fundamentally important for understanding life at the systems level and also has practical implications for medicine, engineering, biology, and chemistry. Studies at the level of individual reactions provide essential information about the function, interactions, and localization of individual molecular species and reactions in a network. However, analyzing the spatial dynamics of complex biochemical networks at this level is difficult. Biochemical networks are nonequilibrium systems containing dozens to hundreds of reactions with nonlinear and time-dependent interactions, and these interactions are influenced by diffusion, flow, and the relative values of state-dependent kinetic parameters. To achieve an overall understanding of the spatial dynamics of a network and the global mechanisms that drive its function, networks must be analyzed as a whole, where all of the components and influential parameters of a network are simultaneously considered. Here, we describe chemical concepts and microfluidic tools developed for network-level investigations of the spatial dynamics of these networks. Modular approaches can be used to simplify these networks by separating them into modules, and simple experimental or computational models can be created by replacing each module with a single reaction. Microfluidics can be used to implement these models as well as to analyze and perturb the complex network itself with spatial control on the micrometer scale. We also describe the application of these network-level approaches to elucidate the mechanisms governing the spatial dynamics of two networkshemostasis (blood clotting) and early patterning of the Drosophila embryo. To investigate the dynamics of the complex network of hemostasis, we simplified the network by using a modular mechanism and created a chemical model based on this mechanism by using microfluidics. Then, we used the mechanism and the model to
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
Synchronization criterion for Lur'e type complex dynamical networks with time-varying delay
International Nuclear Information System (INIS)
Ji, D.H.; Park, Ju H.; Yoo, W.J.; Won, S.C.; Lee, S.M.
2010-01-01
In this Letter, the synchronization problem for a class of complex dynamical networks in which every identical node is a Lur'e system with time-varying delay is considered. A delay-dependent synchronization criterion is derived for the synchronization of complex dynamical network that represented by Lur'e system with sector restricted nonlinearities. The derived criterion is a sufficient condition for absolute stability of error dynamics between the each nodes and the isolated node. Using a convex representation of the nonlinearity for error dynamics, the stability condition based on the discretized Lyapunov-Krasovskii functional is obtained via LMI formulation. The proposed delay-dependent synchronization criterion is less conservative than the existing ones. The effectiveness of our work is verified through numerical examples.
The dynamics of financial stability in complex networks
da Cruz, J. P.; Lind, P. G.
2012-08-01
We address the problem of banking system resilience by applying off-equilibrium statistical physics to a system of particles, representing the economic agents, modelled according to the theoretical foundation of the current banking regulation, the so called Merton-Vasicek model. Economic agents are attracted to each other to exchange `economic energy', forming a network of trades. When the capital level of one economic agent drops below a minimum, the economic agent becomes insolvent. The insolvency of one single economic agent affects the economic energy of all its neighbours which thus become susceptible to insolvency, being able to trigger a chain of insolvencies (avalanche). We show that the distribution of avalanche sizes follows a power-law whose exponent depends on the minimum capital level. Furthermore, we present evidence that under an increase in the minimum capital level, large crashes will be avoided only if one assumes that agents will accept a drop in business levels, while keeping their trading attitudes and policies unchanged. The alternative assumption, that agents will try to restore their business levels, may lead to the unexpected consequence that large crises occur with higher probability.
Identifying partial topology of complex dynamical networks via a pinning mechanism
Zhu, Shuaibing; Zhou, Jin; Lu, Jun-an
2018-04-01
In this paper, we study the problem of identifying the partial topology of complex dynamical networks via a pinning mechanism. By using the network synchronization theory and the adaptive feedback controlling method, we propose a method which can greatly reduce the number of nodes and observers in the response network. Particularly, this method can also identify the whole topology of complex networks. A theorem is established rigorously, from which some corollaries are also derived in order to make our method more cost-effective. Several numerical examples are provided to verify the effectiveness of the proposed method. In the simulation, an approach is also given to avoid possible identification failure caused by inner synchronization of the drive network.
Analysis of Social Network Dynamics with Models from the Theory of Complex Adaptive Systems
Lymperopoulos , Ilias; Lekakos , George
2013-01-01
Part 4: Protocols, Regulation and Social Networking; International audience; The understanding and modeling of social dynamics in a complex and unpredictable world, emerges as a research target of particular importance. Success in this direction can yield valuable knowledge as to how social phenomena form and evolve in varying socioeconomic contexts comprising economic crises, societal disasters, cultural differences and security threats among others. The study of social dynamics occurring in...
Inferring the physical connectivity of complex networks from their functional dynamics
Directory of Open Access Journals (Sweden)
Holm Liisa
2010-05-01
background network to the observed change of the functional activities in the system. Conclusions The results presented in this study indicate a strong relationship between the structure and dynamics of complex network systems. As coupling strength increases, synchronization emerges among hub nodes and recruits small-degree nodes. The results show that the onset of global synchronization in the system hinders the reconstruction of an underlying complex structure. Our analysis helps to clarify how the synchronization is achieved in systems of different network topologies.
Local difference measures between complex networks for dynamical system model evaluation.
Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen
2015-01-01
A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node
Modeling and dynamical topology properties of VANET based on complex networks theory
Energy Technology Data Exchange (ETDEWEB)
Zhang, Hong; Li, Jie, E-mail: prof.li@foxmail.com [School of Civil Engineering and Mechanics, Huazhong University of Science and Technology, Wuhan, 430074 (China)
2015-01-15
Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a
Complex fluid network optimization and control integrative design based on nonlinear dynamic model
International Nuclear Information System (INIS)
Sui, Jinxue; Yang, Li; Hu, Yunan
2016-01-01
In view of distribution according to complex fluid network’s needs, this paper proposed one optimization computation method of the nonlinear programming mathematical model based on genetic algorithm. The simulation result shows that the overall energy consumption of the optimized fluid network has a decrease obviously. The control model of the fluid network is established based on nonlinear dynamics. We design the control law based on feedback linearization, take the optimal value by genetic algorithm as the simulation data, can also solve the branch resistance under the optimal value. These resistances can provide technical support and reference for fluid network design and construction, so can realize complex fluid network optimization and control integration design.
Macroscopic description of complex adaptive networks coevolving with dynamic node states
Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen
2015-05-01
In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.
Coronges, Kate; Gonçalves, Bruno; Sinatra, Roberta; Vespignani, Alessandro; Proceedings of the 9th Conference on Complex Networks; CompleNet 2018
2018-01-01
This book aims to bring together researchers and practitioners working across domains and research disciplines to measure, model, and visualize complex networks. It collects the works presented at the 9th International Conference on Complex Networks (CompleNet) 2018 in Boston, MA in March, 2018. With roots in physical, information and social science, the study of complex networks provides a formal set of mathematical methods, computational tools and theories to describe prescribe and predict dynamics and behaviors of complex systems. Despite their diversity, whether the systems are made up of physical, technological, informational, or social networks, they share many common organizing principles and thus can be studied with similar approaches. This book provides a view of the state-of-the-art in this dynamic field and covers topics such as group decision-making, brain and cellular connectivity, network controllability and resiliency, online activism, recommendation systems, and cyber security.
Outer synchronization between two different fractional-order general complex dynamical networks
International Nuclear Information System (INIS)
Xiang-Jun, Wu; Hong-Tao, Lu
2010-01-01
Outer synchronization between two different fractional-order general complex dynamical networks is investigated in this paper. Based on the stability theory of the fractional-order system, the sufficient criteria for outer synchronization are derived analytically by applying the nonlinear control and the bidirectional coupling methods. The proposed synchronization method is applicable to almost all kinds of coupled fractional-order general complex dynamical networks. Neither a symmetric nor irreducible coupling configuration matrix is required. In addition, no constraint is imposed on the inner-coupling matrix. Numerical examples are also provided to demonstrate the validity of the presented synchronization scheme. Numeric evidence shows that both the feedback strength k and the fractional order α can be chosen appropriately to adjust the synchronization effect effectively. (general)
Energy Technology Data Exchange (ETDEWEB)
Cai Shuiming, E-mail: caishuiming2008@yahoo.com.c [Department of Mathematics, Shanghai University, Shanghai 200444 (China); Institute of System Biology, Shanghai University, Shanghai 200444 (China); Hao Junjun [Institute of System Biology, Shanghai University, Shanghai 200444 (China); He, Qinbin [Department of Mathematics, Taizhou University, Linhai 317000 (China); Institute of System Biology, Shanghai University, Shanghai 200444 (China); Liu Zengrong, E-mail: zrongliu@126.co [Department of Mathematics, Shanghai University, Shanghai 200444 (China) and Institute of System Biology, Shanghai University, Shanghai 200444 (China)
2011-05-09
The problem of synchronization for a class of complex delayed dynamical networks via pinning periodically intermittent control is considered in this Letter. Some novel and useful exponential synchronization criteria are obtained by utilizing the methods which are different from the techniques employed in the existing works, and the derived results are less conservative. Especially, the traditional assumptions on control width and time delays are released in our results. Moreover, a pinning scheme deciding what nodes should be chosen as pinned candidates and how many nodes are needed to be pinned for a fixed coupling strength is provided. A Barabasi-Albert network example is finally given to illustrate the effectiveness of the theoretical results. - Highlights: Pinning control problem of complex networks via intermittent control is investigated. The traditional assumptions on control width and time delays are removed. A scheme deciding what nodes should be chosen as pinned candidates is proposed. A scheme deciding how many nodes are needed to be pinned is provided.
A complex-valued firing-rate model that approximates the dynamics of spiking networks.
Directory of Open Access Journals (Sweden)
Evan S Schaffer
2013-10-01
Full Text Available 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.
A complex-valued firing-rate model that approximates the dynamics of spiking networks.
Schaffer, Evan S; Ostojic, Srdjan; Abbott, L F
2013-10-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.
Modeling Air Traffic Situation Complexity with a Dynamic Weighted Network Approach
Directory of Open Access Journals (Sweden)
Hongyong Wang
2018-01-01
Full Text Available In order to address the flight delays and risks associated with the forecasted increase in air traffic, there is a need to increase the capacity of air traffic management systems. This should be based on objective measurements of traffic situation complexity. In current air traffic complexity research, no simple means is available to integrate airspace and traffic flow characteristics. In this paper, we propose a new approach for the measurement of air traffic situation complexity. This approach considers the effects of both airspace and traffic flow and objectively quantifies air traffic situation complexity. Considering the aircraft, waypoints, and airways as nodes, and the complexity relationships among these nodes as edges, a dynamic weighted network is constructed. Air traffic situation complexity is defined as the sum of the weights of all edges in the network, and the relationships of complexity with some commonly used indices are statistically analyzed. The results indicate that the new complexity index is more accurate than traffic count and reflects the number of trajectory changes as well as the high-risk situations. Additionally, analysis of potential applications reveals that this new index contributes to achieving complexity-based management, which represents an efficient method for increasing airspace system capacity.
Local and global synchronization in general complex dynamical networks with delay coupling
International Nuclear Information System (INIS)
Lu Jianquan; Ho, Daniel W.C.
2008-01-01
Local and global synchronization of complex dynamical networks are studied in this paper. Some simple yet generic criteria ensuring delay-independent and delay-dependent synchronization are derived in terms of linear matrix inequalities (LMIs), which can be verified easily via interior-point algorithm. The assumption that the coupling configuration matrix is symmetric and irreducible, which is frequently used in other literatures, is removed. A network with a fixed delay and a special coupling scheme is given as an example to illustrate the theoretical results and the effectiveness of the proposed synchronization scheme
The diminishing role of hubs in dynamical processes on complex networks.
Quax, Rick; Apolloni, Andrea; Sloot, Peter M A
2013-11-06
It is notoriously difficult to predict the behaviour of a complex self-organizing system, where the interactions among dynamical units form a heterogeneous topology. Even if the dynamics of each microscopic unit is known, a real understanding of their contributions to the macroscopic system behaviour is still lacking. Here, we develop information-theoretical methods to distinguish the contribution of each individual unit to the collective out-of-equilibrium dynamics. We show that for a system of units connected by a network of interaction potentials with an arbitrary degree distribution, highly connected units have less impact on the system dynamics when compared with intermediately connected units. In an equilibrium setting, the hubs are often found to dictate the long-term behaviour. However, we find both analytically and experimentally that the instantaneous states of these units have a short-lasting effect on the state trajectory of the entire system. We present qualitative evidence of this phenomenon from empirical findings about a social network of product recommendations, a protein-protein interaction network and a neural network, suggesting that it might indeed be a widespread property in nature.
Novel approaches to pin cluster synchronization on complex dynamical networks in Lur'e forms
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.
Complex network analysis of phase dynamics underlying oil-water two-phase flows
Gao, Zhong-Ke; Zhang, Shan-Shan; Cai, Qing; Yang, Yu-Xuan; Jin, Ning-De
2016-01-01
Characterizing the complicated flow behaviors arising from high water cut and low velocity oil-water flows is an important problem of significant challenge. We design a high-speed cycle motivation conductance sensor and carry out experiments for measuring the local flow information from different oil-in-water flow patterns. We first use multivariate time-frequency analysis to probe the typical features of three flow patterns from the perspective of energy and frequency. Then we infer complex networks from multi-channel measurements in terms of phase lag index, aiming to uncovering the phase dynamics governing the transition and evolution of different oil-in-water flow patterns. In particular, we employ spectral radius and weighted clustering coefficient entropy to characterize the derived unweighted and weighted networks and the results indicate that our approach yields quantitative insights into the phase dynamics underlying the high water cut and low velocity oil-water flows. PMID:27306101
Mata-Machuca, Juan L.; Aguilar-López, Ricardo
2018-01-01
This work deals with the adaptative synchronization of complex dynamical networks with fractional-order nodes and its application in secure communications employing chaotic parameter modulation. The complex network is composed of multiple fractional-order systems with mismatch parameters and the coupling functions are given to realize the network synchronization. We introduce a fractional algebraic synchronizability condition (FASC) and a fractional algebraic identifiability condition (FAIC) which are used to know if the synchronization and parameters estimation problems can be solved. To overcome these problems, an adaptative synchronization methodology is designed; the strategy consists in proposing multiple receiver systems which tend to follow asymptotically the uncertain transmitters systems. The coupling functions and parameters of the receiver systems are adjusted continually according to a convenient sigmoid-like adaptative controller (SLAC), until the measurable output errors converge to zero, hence, synchronization between transmitter and receivers is achieved and message signals are recovered. Indeed, the stability analysis of the synchronization error is based on the fractional Lyapunov direct method. Finally, numerical results corroborate the satisfactory performance of the proposed scheme by means of the synchronization of a complex network consisting of several fractional-order unified chaotic systems.
Optimal system size for complex dynamics in random neural networks near criticality
Energy Technology Data Exchange (ETDEWEB)
Wainrib, Gilles, E-mail: wainrib@math.univ-paris13.fr [Laboratoire Analyse Géométrie et Applications, Université Paris XIII, Villetaneuse (France); García del Molino, Luis Carlos, E-mail: garciadelmolino@ijm.univ-paris-diderot.fr [Institute Jacques Monod, Université Paris VII, Paris (France)
2013-12-15
In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices.
Optimal system size for complex dynamics in random neural networks near criticality
International Nuclear Information System (INIS)
Wainrib, Gilles; García del Molino, Luis Carlos
2013-01-01
In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices
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.
International Nuclear Information System (INIS)
Peng Haipeng; Wei Nan; Li Lixiang; Xie Weisheng; Yang Yixian
2010-01-01
In this Letter, time-delay has been introduced in to split the networks, upon which a model of complex dynamical networks with multi-links has been constructed. Moreover, based on Lyapunov stability theory and some hypotheses, we achieve synchronization between two complex networks with different structures by designing effective controllers. The validity of the results was proved through numerical simulations of this Letter.
Carleson, Lennart
1993-01-01
Complex dynamics is today very much a focus of interest. Though several fine expository articles were available, by P. Blanchard and by M. Yu. Lyubich in particular, until recently there was no single source where students could find the material with proofs. For anyone in our position, gathering and organizing the material required a great deal of work going through preprints and papers and in some cases even finding a proof. We hope that the results of our efforts will be of help to others who plan to learn about complex dynamics and perhaps even lecture. Meanwhile books in the field a. re beginning to appear. The Stony Brook course notes of J. Milnor were particularly welcome and useful. Still we hope that our special emphasis on the analytic side will satisfy a need. This book is a revised and expanded version of notes based on lectures of the first author at UCLA over several \\Vinter Quarters, particularly 1986 and 1990. We owe Chris Bishop a great deal of gratitude for supervising the production of cour...
Fu, Peihua; Zhu, Anding; Ni, He; Zhao, Xin; Li, Xiulin
2018-01-01
Ponzi schemes always lead to mass disasters after collapse. It is important to study the critical behaviors of both social dynamics and financial outcomes for Ponzi scheme diffusion in complex networks. We develop the potential-investor-divestor-investor (PIDI) model by considering the individual behavior of direct reinvestment. We find that only the spreading rate relates to the epidemic outbreak while the reinvestment rate relates to the zero and non-zero final states for social dynamics of both homo- and inhomogeneous networks. Financially, we find that there is a critical spreading threshold, above which the scheme needs not to use its own initial capital for taking off, i.e. the starting cost is covered by the rapidly inflowing funds. However, the higher the cost per recruit, the larger the critical spreading threshold and the worse the financial outcomes. Theoretical and simulation results also reveal that schemes are easier to take off in inhomogeneous networks. The reinvestment rate does not affect the starting. However, it improves the financial outcome in the early stages and postpones the outbreak of financial collapse. Some policy suggestions for the regulator from the perspective of social physics are proposed in the end of the paper.
Nonlinear dynamics and complexity
Luo, Albert; Fu, Xilin
2014-01-01
This important collection presents recent advances in nonlinear dynamics including analytical solutions, chaos in Hamiltonian systems, time-delay, uncertainty, and bio-network dynamics. Nonlinear Dynamics and Complexity equips readers to appreciate this increasingly main-stream approach to understanding complex phenomena in nonlinear systems as they are examined in a broad array of disciplines. The book facilitates a better understanding of the mechanisms and phenomena in nonlinear dynamics and develops the corresponding mathematical theory to apply nonlinear design to practical engineering.
Directory of Open Access Journals (Sweden)
Meng Zhou
2016-12-01
Full Text Available Spatial structure is a fundamental characteristic of cities that influences the urban functioning to a large extent. While administrative partitioning is generally done in the form of static spatial division, understanding a more temporally dynamic structure of the urban space would benefit urban planning and management immensely. This study makes use of a large-scale mobile phone positioning dataset to characterize the diurnal dynamics of the interaction-based urban spatial structure. To extract the temporally vibrant structure, spatial interaction networks at different times are constructed based on the movement connections of individuals between geographical units. Complex network community detection technique is applied to identify the spatial divisions as well as to quantify their temporal dynamics. Empirical analysis is conducted using data containing all user positions on a typical weekday in Shenzhen, China. Results are compared with official zoning and planned structure and indicate a certain degree of expansion in urban central areas and fragmentation in industrial suburban areas. A high level of variability in spatial divisions at different times of day is detected with some distinct temporal features. Peak and pre-/post-peak hours witness the most prominent fluctuation in spatial division indicating significant change in the characteristics of movements and activities during these periods of time. Findings of this study demonstrate great potential of large-scale mobility data in supporting intelligent spatial decision making and providing valuable knowledge to the urban planning sectors.
Automation of multi-agent control for complex dynamic systems in heterogeneous computational network
Oparin, Gennady; Feoktistov, Alexander; Bogdanova, Vera; Sidorov, Ivan
2017-01-01
The rapid progress of high-performance computing entails new challenges related to solving large scientific problems for various subject domains in a heterogeneous distributed computing environment (e.g., a network, Grid system, or Cloud infrastructure). The specialists in the field of parallel and distributed computing give the special attention to a scalability of applications for problem solving. An effective management of the scalable application in the heterogeneous distributed computing environment is still a non-trivial issue. Control systems that operate in networks, especially relate to this issue. We propose a new approach to the multi-agent management for the scalable applications in the heterogeneous computational network. The fundamentals of our approach are the integrated use of conceptual programming, simulation modeling, network monitoring, multi-agent management, and service-oriented programming. We developed a special framework for an automation of the problem solving. Advantages of the proposed approach are demonstrated on the parametric synthesis example of the static linear regulator for complex dynamic systems. Benefits of the scalable application for solving this problem include automation of the multi-agent control for the systems in a parallel mode with various degrees of its detailed elaboration.
Organization of complex networks
Kitsak, Maksim
Many large complex systems can be successfully analyzed using the language of graphs and networks. Interactions between the objects in a network are treated as links connecting nodes. This approach to understanding the structure of networks is an important step toward understanding the way corresponding complex systems function. Using the tools of statistical physics, we analyze the structure of networks as they are found in complex systems such as the Internet, the World Wide Web, and numerous industrial and social networks. In the first chapter we apply the concept of self-similarity to the study of transport properties in complex networks. Self-similar or fractal networks, unlike non-fractal networks, exhibit similarity on a range of scales. We find that these fractal networks have transport properties that differ from those of non-fractal networks. In non-fractal networks, transport flows primarily through the hubs. In fractal networks, the self-similar structure requires any transport to also flow through nodes that have only a few connections. We also study, in models and in real networks, the crossover from fractal to non-fractal networks that occurs when a small number of random interactions are added by means of scaling techniques. In the second chapter we use k-core techniques to study dynamic processes in networks. The k-core of a network is the network's largest component that, within itself, exhibits all nodes with at least k connections. We use this k-core analysis to estimate the relative leadership positions of firms in the Life Science (LS) and Information and Communication Technology (ICT) sectors of industry. We study the differences in the k-core structure between the LS and the ICT sectors. We find that the lead segment (highest k-core) of the LS sector, unlike that of the ICT sector, is remarkably stable over time: once a particular firm enters the lead segment, it is likely to remain there for many years. In the third chapter we study how
Duality in Phase Space and Complex Dynamics of an Integrated Pest Management Network Model
Yuan, Baoyin; Tang, Sanyi; Cheke, Robert A.
Fragmented habitat patches between which plants and animals can disperse can be modeled as networks with varying degrees of connectivity. A predator-prey model with network structures is proposed for integrated pest management (IPM) with impulsive control actions. The model was analyzed using numerical methods to investigate how factors such as the impulsive period, the releasing constant of natural enemies and the mode of connections between the patches affect pest outbreak patterns and the success or failure of pest control. The concept of the cluster as defined by Holland and Hastings is used to describe variations in results ranging from global synchrony when all patches have identical fluctuations to n-cluster solutions with all patches having different dynamics. Heterogeneity in the initial densities of either pest or natural enemy generally resulted in a variety of cluster oscillations. Surprisingly, if n > 1, the clusters fall into two groups one with low amplitude fluctuations and the other with high amplitude fluctuations (i.e. duality in phase space), implying that control actions radically alter the system's characteristics by inducing duality and more complex dynamics. When the impulsive period is small enough, i.e. the control strategy is undertaken frequently, the pest can be eradicated. As the period increases, the pest's dynamics shift from a steady state to become chaotic with periodic windows and more multicluster oscillations arise for heterogenous initial density distributions. Period-doubling bifurcation and periodic halving cascades occur as the releasing constant of the natural enemy increases. For the same ecological system with five differently connected networks, as the randomness of the connectedness increases, the transient duration becomes smaller and the probability of multicluster oscillations appearing becomes higher.
A New Recommendation Algorithm Based on User’s Dynamic Information in Complex Social Network
Directory of Open Access Journals (Sweden)
Jiujun Cheng
2015-01-01
Full Text Available The development of recommendation system comes with the research of data sparsity, cold start, scalability, and privacy protection problems. Even though many papers proposed different improved recommendation algorithms to solve those problems, there is still plenty of room for improvement. In the complex social network, we can take full advantage of dynamic information such as user’s hobby, social relationship, and historical log to improve the performance of recommendation system. In this paper, we proposed a new recommendation algorithm which is based on social user’s dynamic information to solve the cold start problem of traditional collaborative filtering algorithm and also considered the dynamic factors. The algorithm takes user’s response information, dynamic interest, and the classic similar measurement of collaborative filtering algorithm into account. Then, we compared the new proposed recommendation algorithm with the traditional user based collaborative filtering algorithm and also presented some of the findings from experiment. The results of experiment demonstrate that the new proposed algorithm has a better recommended performance than the collaborative filtering algorithm in cold start scenario.
Flow-pattern identification and nonlinear dynamics of gas-liquid two-phase flow in complex networks.
Gao, Zhongke; Jin, Ningde
2009-06-01
The identification of flow pattern is a basic and important issue in multiphase systems. Because of the complexity of phase interaction in gas-liquid two-phase flow, it is difficult to discern its flow pattern objectively. In this paper, we make a systematic study on the vertical upward gas-liquid two-phase flow using complex network. Three unique network construction methods are proposed to build three types of networks, i.e., flow pattern complex network (FPCN), fluid dynamic complex network (FDCN), and fluid structure complex network (FSCN). Through detecting the community structure of FPCN by the community-detection algorithm based on K -mean clustering, useful and interesting results are found which can be used for identifying five vertical upward gas-liquid two-phase flow patterns. To investigate the dynamic characteristics of gas-liquid two-phase flow, we construct 50 FDCNs under different flow conditions, and find that the power-law exponent and the network information entropy, which are sensitive to the flow pattern transition, can both characterize the nonlinear dynamics of gas-liquid two-phase flow. Furthermore, we construct FSCN and demonstrate how network statistic can be used to reveal the fluid structure of gas-liquid two-phase flow. In this paper, from a different perspective, we not only introduce complex network theory to the study of gas-liquid two-phase flow but also indicate that complex network may be a powerful tool for exploring nonlinear time series in practice.
Wang, Yan-Wu; Bian, Tao; Xiao, Jiang-Wen; Wen, Changyun
2015-10-01
This paper studies the global synchronization of complex dynamical network (CDN) under digital communication with limited bandwidth. To realize the digital communication, the so-called uniform-quantizer-sets are introduced to quantize the states of nodes, which are then encoded and decoded by newly designed encoders and decoders. To meet the requirement of the bandwidth constraint, a scaling function is utilized to guarantee the quantizers having bounded inputs and thus achieving bounded real-time quantization levels. Moreover, a new type of vector norm is introduced to simplify the expression of the bandwidth limit. Through mathematical induction, a sufficient condition is derived to ensure global synchronization of the CDNs. The lower bound on the sum of the real-time quantization levels is analyzed for different cases. Optimization method is employed to relax the requirements on the network topology and to determine the minimum of such lower bound for each case, respectively. Simulation examples are also presented to illustrate the established results.
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.
Liu, Quan-Hui; Wang, Wei; Tang, Ming; Zhang, Hai-Feng
2016-05-09
Information diffusion and disease spreading in communication-contact layered network are typically asymmetrically coupled with each other, in which disease spreading can be significantly affected by the way an individual being aware of disease responds to the disease. Many recent studies have demonstrated that human behavioral adoption is a complex and non-Markovian process, where the probability of behavior adoption is dependent on the cumulative times of information received and the social reinforcement effect of the cumulative information. In this paper, the impacts of such a non-Markovian vaccination adoption behavior on the epidemic dynamics and the control effects are explored. It is found that this complex adoption behavior in the communication layer can significantly enhance the epidemic threshold and reduce the final infection rate. By defining the social cost as the total cost of vaccination and treatment, it can be seen that there exists an optimal social reinforcement effect and optimal information transmission rate allowing the minimal social cost. Moreover, a mean-field theory is developed to verify the correctness of simulation results.
Castellano, Claudio; Pastor-Satorras, Romualdo
2017-10-01
The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically grounded expression relating the value of the largest eigenvalue of a given network to the largest eigenvalue of two network subgraphs, considered as isolated: the hub with its immediate neighbors and the densely connected set of nodes with maximum K -core index. We validate this formula by showing that it predicts, with good accuracy, the largest eigenvalue of a large set of synthetic and real-world topologies. We also present evidence of the consequences of these findings for broad classes of dynamics taking place on the networks. As a by-product, we reveal that the spectral properties of heterogeneous networks built according to the linear preferential attachment model are qualitatively different from those of their static counterparts.
Effect of interaction strength on robustness of controlling edge dynamics in complex networks
Pang, Shao-Peng; Hao, Fei
2018-05-01
Robustness plays a critical role in the controllability of complex networks to withstand failures and perturbations. Recent advances in the edge controllability show that the interaction strength among edges plays a more important role than network structure. Therefore, we focus on the effect of interaction strength on the robustness of edge controllability. Using three categories of all edges to quantify the robustness, we develop a universal framework to evaluate and analyze the robustness in complex networks with arbitrary structures and interaction strengths. Applying our framework to a large number of model and real-world networks, we find that the interaction strength is a dominant factor for the robustness in undirected networks. Meanwhile, the strongest robustness and the optimal edge controllability in undirected networks can be achieved simultaneously. Different from the case of undirected networks, the robustness in directed networks is determined jointly by the interaction strength and the network's degree distribution. Moreover, a stronger robustness is usually associated with a larger number of driver nodes required to maintain full control in directed networks. This prompts us to provide an optimization method by adjusting the interaction strength to optimize the robustness of edge controllability.
Gong, Tao; Shuai, Lan; Wu, Yicheng
2014-12-01
By analyzing complex networks constructed from authentic language data, Cong and Liu [1] advance linguistics research into the big data era. The network approach has revealed many intrinsic generalities and crucial differences at both the macro and micro scales between human languages. The axiom behind this research is that language is a complex adaptive system [2]. Although many lexical, semantic, or syntactic features have been discovered by means of analyzing the static and dynamic linguistic networks of world languages, available network-based language studies have not explicitly addressed the evolutionary dynamics of language systems and the correlations between language and human cognition. This commentary aims to provide some insights on how to use the network approach to study these issues.
Neuronal avalanches in complex networks
Directory of Open Access Journals (Sweden)
Victor Hernandez-Urbina
2016-12-01
Full Text Available Brain networks are neither regular nor random. Their structure allows for optimal information processing and transmission across the entire neural substrate of an organism. However, for topological features to be appropriately harnessed, brain networks should implement a dynamical regime which prevents phase-locked and chaotic behaviour. Critical neural dynamics refer to a dynamical regime in which the system is poised at the boundary between regularity and randomness. It has been reported that neural systems poised at this boundary achieve maximum computational power. In this paper, we review recent results regarding critical neural dynamics that emerge from systems whose underlying structure exhibits complex network properties.
Epidemic processes in complex networks
Pastor Satorras, Romualdo; Castellano, Claudio; Van Mieghem, Piet; Vespignani, Alessandro
2015-01-01
In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems. The complex properties of real-world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks. The t...
Directory of Open Access Journals (Sweden)
Eric A Yen
2014-05-01
Full Text Available Protein complexes are not static, but rather highly dynamic with subunits that undergo 1-dimensional diffusion with respect to each other. Interactions within protein complexes are modulated through regulatory inputs that alter interactions and introduce new components and deplete existing components through exchange. While it is clear that the structure and function of any given protein complex is coupled to its dynamical properties, it remains a challenge to predict the possible conformations that complexes can adopt. Protein-fragment Complementation Assays detect physical interactions between protein pairs constrained to ≤8 nm from each other in living cells. This method has been used to build networks composed of 1000s of pair-wise interactions. Significantly, these networks contain a wealth of dynamic information, as the assay is fully reversible and the proteins are expressed in their natural context. In this study, we describe a method that extracts this valuable information in the form of predicted conformations, allowing the user to explore the conformational landscape, to search for structures that correlate with an activity state, and estimate the abundance of conformations in the living cell. The generator is based on a Markov Chain Monte Carlo simulation that uses the interaction dataset as input and is constrained by the physical resolution of the assay. We applied this method to an 18-member protein complex composed of the seven core proteins of the budding yeast Arp2/3 complex and 11 associated regulators and effector proteins. We generated 20,480 output structures and identified conformational states using principle component analysis. We interrogated the conformation landscape and found evidence of symmetry breaking, a mixture of likely active and inactive conformational states and dynamic exchange of the core protein Arc15 between core and regulatory components. Our method provides a novel tool for prediction and
Dynamical organization towards consensus in the Axelrod model on complex networks
Guerra, Beniamino; Poncela, Julia; Gómez-Gardeñes, Jesús; Latora, Vito; Moreno, Yamir
2010-05-01
We analyze the dynamics toward cultural consensus in the Axelrod model on scale-free networks. By looking at the microscopic dynamics of the model, we are able to show how culture traits spread across different cultural features. We compare the diffusion at the level of cultural features to the growth of cultural consensus at the global level, finding important differences between these two processes. In particular, we show that even when most of the cultural features have reached macroscopic consensus, there are still no signals of globalization. Finally, we analyze the topology of consensus clusters both for global culture and at the feature level of representation.
A New Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Complex Networks
Directory of Open Access Journals (Sweden)
Guoqiang Chen
2013-01-01
Full Text Available Community detection in dynamic networks is an important research topic and has received an enormous amount of attention in recent years. Modularity is selected as a measure to quantify the quality of the community partition in previous detection methods. But, the modularity has been exposed to resolution limits. In this paper, we propose a novel multiobjective evolutionary algorithm for dynamic networks community detection based on the framework of nondominated sorting genetic algorithm. Modularity density which can address the limitations of modularity function is adopted to measure the snapshot cost, and normalized mutual information is selected to measure temporal cost, respectively. The characteristics knowledge of the problem is used in designing the genetic operators. Furthermore, a local search operator was designed, which can improve the effectiveness and efficiency of community detection. Experimental studies based on synthetic datasets show that the proposed algorithm can obtain better performance than the compared algorithms.
DEFF Research Database (Denmark)
Parraguez, Pedro; Eppinger, Steven D.; Maier, Anja
2015-01-01
The pattern of information flow through the network of interdependent design activities is thought to be an important determinant of engineering design process results. A previously unexplored aspect of such patterns relates to the temporal dynamics of information transfer between activities...... design process and thus support theory-building toward the evolution of information flows through systems engineering stages. Implications include guidance on how to analyze and predict information flows as well as better planning of information flows in engineering design projects according...
Blower, Sally; Go, Myong-Hyun
2011-01-01
Abstract Mathematical models are useful tools for understanding and predicting epidemics. A recent innovative modeling study by Stehle and colleagues addressed the issue of how complex models need to be to ensure accuracy. The authors collected data on face-to-face contacts during a two-day conference. They then constructed a series of dynamic social contact networks, each of which was used to model an epidemic generated by a fast-spreading airborne pathogen. Intriguingly, Stehle and colleagu...
Directory of Open Access Journals (Sweden)
Go Myong-Hyun
2011-07-01
Full Text Available Abstract Mathematical models are useful tools for understanding and predicting epidemics. A recent innovative modeling study by Stehle and colleagues addressed the issue of how complex models need to be to ensure accuracy. The authors collected data on face-to-face contacts during a two-day conference. They then constructed a series of dynamic social contact networks, each of which was used to model an epidemic generated by a fast-spreading airborne pathogen. Intriguingly, Stehle and colleagues found that increasing model complexity did not always increase accuracy. Specifically, the most detailed contact network and a simplified version of this network generated very similar results. These results are extremely interesting and require further exploration to determine their generalizability. Please see related article BMC Medicine, 2011, 9:87
Blower, Sally; Go, Myong-Hyun
2011-07-19
Mathematical models are useful tools for understanding and predicting epidemics. A recent innovative modeling study by Stehle and colleagues addressed the issue of how complex models need to be to ensure accuracy. The authors collected data on face-to-face contacts during a two-day conference. They then constructed a series of dynamic social contact networks, each of which was used to model an epidemic generated by a fast-spreading airborne pathogen. Intriguingly, Stehle and colleagues found that increasing model complexity did not always increase accuracy. Specifically, the most detailed contact network and a simplified version of this network generated very similar results. These results are extremely interesting and require further exploration to determine their generalizability.
RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks
Energy Technology Data Exchange (ETDEWEB)
Balasundaram, Balabhaskar [Oklahoma State Univ., Stillwater, OK (United States); Butenko, Sergiy [Texas A & M Univ., College Station, TX (United States); Boginski, Vladimir [Univ. of Florida, Gainesville, FL (United States); Uryasev, Stan [Univ. of Florida, Gainesville, FL (United States)
2013-12-25
The goal of this project was to study robust connectivity and flow patterns of complex multi-scale systems modeled as networks. Networks provide effective ways to study global, system level properties, as well as local, multi-scale interactions at a component level. Numerous applications from power systems, telecommunication, transportation, biology, social science, and other areas have benefited from novel network-based models and their analysis. Modeling and optimization techniques that employ appropriate measures of risk for identifying robust clusters and resilient network designs in networks subject to uncertain failures were investigated in this collaborative multi-university project. In many practical situations one has to deal with uncertainties associated with possible failures of network components, thereby affecting the overall efficiency and performance of the system (e.g., every node/connection has a probability of partial or complete failure). Some extreme examples include power grid component failures, airline hub failures due to weather, or freeway closures due to emergencies. These are also situations in which people, materials, or other resources need to be managed efficiently. Important practical examples include rerouting flow through power grids, adjusting flight plans, and identifying routes for emergency services and supplies, in the event network elements fail unexpectedly. Solutions that are robust under uncertainty, in addition to being economically efficient, are needed. This project has led to the development of novel models and methodologies that can tackle the optimization problems arising in such situations. A number of new concepts, which have not been previously applied in this setting, were investigated in the framework of the project. The results can potentially help decision-makers to better control and identify robust or risk-averse decisions in such situations. Formulations and optimal solutions of the considered problems need
Mechanisms and dynamics of cooperation and competition emergence in complex networked systems
Gianetto, David A.
Cooperative behavior is a pervasive phenomenon in human interactions and yet how it can evolve and become established, through the selfish process of natural selection, is an enduring puzzle. These behaviors emerge when agents interact in a structured manner; even so, the key structural factors that affect cooperation are not well understood. Moreover, the literature often considers cooperation a single attribute of primitive agents who do not react to environmental changes but real-world actors are more perceptive. The present work moves beyond these assumptions by evolving more realistic game participants, with memories of the past, on complex networks. Agents play repeated games with a three-part Markovian strategy that allows us to separate the cooperation phenomenon into trust, reciprocity, and forgiveness characteristics. Our results show that networks matter most when agents gain the most by acting in a selfish manner, irrespective of how much they may lose by cooperating; since the context provided by neighborhoods inhibits greedy impulses that agents otherwise succumb to in isolation. Network modularity is the most important driver of cooperation emergence in these high-stakes games. However, modularity fails to tell the complete story. Modular scale-free graphs impede cooperation when close coordination is required, partially due to the acyclic nature of scale-free network models. To achieve the highest cooperation in diverse social conditions, both high modularity, low connectivity within modules, and a rich network of long cycles become important. With these findings in hand, we study the influence of networks on coordination and competition within the federal health care insurance exchange. In this applied study, we show that systemic health care coordination is encouraged by the emergent insurance network. The network helps underpin the viability of the exchange and provides an environment of stronger competition once a critical-mass of insurers have
Exploring the dynamics of formal and informal networks in complex multi-team development projects
DEFF Research Database (Denmark)
Kratzer, J.; Gemuenden, H. G.; Lettl, Christopher
2007-01-01
The increasing number of complex multi-team projects and the scarcity of knowledge about how to run them successfully, create a need for systematic empirical studies. We attempt to lessen this empirical gap by examining the overlap and structure of formally ascribed design interfaces and informal...... communication networks between participating teams in two complex multi-team projects in the space industry. We study the two projects longitudinally throughout the design and integration phases of product development. There are three major findings. First, formally ascribed design interfaces and informal...... communication networks overlap only marginally. Second, the structure of informal communication remains largely stable in the transition from the design to the integration phase. The third and most intriguing finding is that the weak overlap between formally ascribed design interfaces and the informal...
Fractional calculus ties the microscopic and macroscopic scales of complex network dynamics
International Nuclear Information System (INIS)
West, B J; Turalska, M; Grigolini, Paolo
2015-01-01
A two-state, master equation-based decision-making model has been shown to generate phase transitions, to be topologically complex, and to manifest temporal complexity through an inverse power-law probability distribution function in the switching times between the two critical states of consensus. These properties are entailed by the fundamental assumption that the network elements in the decision-making model imperfectly imitate one another. The process of subordination establishes that a single network element can be described by a fractional master equation whose analytic solution yields the observed inverse power-law probability distribution obtained by numerical integration of the two-state master equation to a high degree of accuracy. (paper)
Evolving dynamics of trading behavior based on coordination game in complex networks
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.
Wiliński, Mateusz; Szewczak, Bartłomiej; Gubiec, Tomasz; Kutner, Ryszard; Struzik, Zbigniew R.
2015-02-01
We fill a void in merging empirical and phenomenological characterisation of the dynamical phase transitions in complex networks by identifying and thoroughly characterising a triple sequence of such transitions on a real-life financial market. We extract and interpret the empirical, numerical, and analytical evidences for the existence of these dynamical phase transitions, by considering the medium size Frankfurt stock exchange (FSE), as a typical example of a financial market. By using the canonical object for the graph theory, i.e. the minimal spanning tree (MST) network, we observe: (i) the (initial) dynamical phase transition from equilibrium to non-equilibrium nucleation phase of the MST network, occurring at some critical time. Coalescence of edges on the FSE's transient leader (defined by its largest degree) is observed within the nucleation phase; (ii) subsequent acceleration of the process of nucleation and the emergence of the condensation phase (the second dynamical phase transition), forming a logarithmically diverging temporal λ-peak of the leader's degree at the second critical time; (iii) the third dynamical fragmentation phase transition (after passing the second critical time), where the λ-peak logarithmically relaxes over three quarters of the year, resulting in a few loosely connected sub-graphs. This λ-peak (comparable to that of the specific heat vs. temperature forming during the equilibrium continuous phase transition from the normal fluid I 4He to the superfluid II 4He) is considered as a prominent result of a non-equilibrium superstar-like superhub or a dragon-king's abrupt evolution over about two and a half year of market evolution. We capture and meticulously characterise a remarkable phenomenon in which a peripheral company becomes progressively promoted to become the dragon-king strongly dominating the complex network over an exceptionally long period of time containing the crash. Detailed analysis of the complete trio of the
Effects of rewiring strategies on information spreading in complex dynamic networks
Ally, Abdulla F.; Zhang, Ning
2018-04-01
Recent advances in networks and communication services have attracted much interest to understand information spreading in social networks. Consequently, numerous studies have been devoted to provide effective and accurate models for mimicking information spreading. However, knowledge on how to spread information faster and more widely remains a contentious issue. Yet, most existing works are based on static networks which limit the reality of dynamism of entities that participate in information spreading. Using the SIR epidemic model, this study explores and compares effects of two rewiring models (Fermi-Dirac and Linear functions) on information spreading in scale free and small world networks. Our results show that for all the rewiring strategies, the spreading influence replenishes with time but stabilizes in a steady state at later time-steps. This means that information spreading takes-off during the initial spreading steps, after which the spreading prevalence settles toward its equilibrium, with majority of the population having recovered and thus, no longer affecting the spreading. Meanwhile, rewiring strategy based on Fermi-Dirac distribution function in one way or another impedes the spreading process, however, the structure of the networks mimic the spreading, even with a low spreading rate. The worst case can be when the spreading rate is extremely small. The results emphasize that despite a big role of such networks in mimicking the spreading, the role of the parameters cannot be simply ignored. Apparently, the probability of giant degree neighbors being informed grows much faster with the rewiring strategy of linear function compared to that of Fermi-Dirac distribution function. Clearly, rewiring model based on linear function generates the fastest spreading across the networks. Therefore, if we are interested in speeding up the spreading process in stochastic modeling, linear function may play a pivotal role.
Stabilizing weighted complex networks
International Nuclear Information System (INIS)
Xiang Linying; Chen Zengqiang; Liu Zhongxin; Chen Fei; Yuan Zhuzhi
2007-01-01
Real networks often consist of local units which interact with each other via asymmetric and heterogeneous connections. In this paper, the V-stability problem is investigated for a class of asymmetric weighted coupled networks with nonidentical node dynamics, which includes the unweighted network as a special case. Pinning control is suggested to stabilize such a coupled network. The complicated stabilization problem is reduced to measuring the semi-negative property of the characteristic matrix which embodies not only the network topology, but also the node self-dynamics and the control gains. It is found that network stabilizability depends critically on the second largest eigenvalue of the characteristic matrix. The smaller the second largest eigenvalue is, the more the network is pinning controllable. Numerical simulations of two representative networks composed of non-chaotic systems and chaotic systems, respectively, are shown for illustration and verification
Complex dynamics of a delayed discrete neural network of two nonidentical neurons
Energy Technology Data Exchange (ETDEWEB)
Chen, Yuanlong [Mathematics Department, GuangDong University of Finance, Guangzhou 510521 (China); Huang, Tingwen [Mathematics Department, Texas A and M University at Qatar, P. O. Box 23874, Doha (Qatar); Huang, Yu, E-mail: stshyu@mail.sysu.edu.cn [Mathematics Department, Sun Yat-Sen University, Guangzhou 510275, People' s Republic China (China)
2014-03-15
In this paper, we discover that a delayed discrete Hopfield neural network of two nonidentical neurons with self-connections and no self-connections can demonstrate chaotic behaviors. To this end, we first transform the model, by a novel way, into an equivalent system which has some interesting properties. Then, we identify the chaotic invariant set for this system and show that the dynamics of this system within this set is topologically conjugate to the dynamics of the full shift map with two symbols. This confirms chaos in the sense of Devaney. Our main results generalize the relevant results of Huang and Zou [J. Nonlinear Sci. 15, 291–303 (2005)], Kaslik and Balint [J. Nonlinear Sci. 18, 415–432 (2008)] and Chen et al. [Sci. China Math. 56(9), 1869–1878 (2013)]. We also give some numeric simulations to verify our theoretical results.
Complex dynamics of a delayed discrete neural network of two nonidentical neurons
International Nuclear Information System (INIS)
Chen, Yuanlong; Huang, Tingwen; Huang, Yu
2014-01-01
In this paper, we discover that a delayed discrete Hopfield neural network of two nonidentical neurons with self-connections and no self-connections can demonstrate chaotic behaviors. To this end, we first transform the model, by a novel way, into an equivalent system which has some interesting properties. Then, we identify the chaotic invariant set for this system and show that the dynamics of this system within this set is topologically conjugate to the dynamics of the full shift map with two symbols. This confirms chaos in the sense of Devaney. Our main results generalize the relevant results of Huang and Zou [J. Nonlinear Sci. 15, 291–303 (2005)], Kaslik and Balint [J. Nonlinear Sci. 18, 415–432 (2008)] and Chen et al. [Sci. China Math. 56(9), 1869–1878 (2013)]. We also give some numeric simulations to verify our theoretical results
Complex dynamics of a delayed discrete neural network of two nonidentical neurons.
Chen, Yuanlong; Huang, Tingwen; Huang, Yu
2014-03-01
In this paper, we discover that a delayed discrete Hopfield neural network of two nonidentical neurons with self-connections and no self-connections can demonstrate chaotic behaviors. To this end, we first transform the model, by a novel way, into an equivalent system which has some interesting properties. Then, we identify the chaotic invariant set for this system and show that the dynamics of this system within this set is topologically conjugate to the dynamics of the full shift map with two symbols. This confirms chaos in the sense of Devaney. Our main results generalize the relevant results of Huang and Zou [J. Nonlinear Sci. 15, 291-303 (2005)], Kaslik and Balint [J. Nonlinear Sci. 18, 415-432 (2008)] and Chen et al. [Sci. China Math. 56(9), 1869-1878 (2013)]. We also give some numeric simulations to verify our theoretical results.
Ruf, Sebastian F.; Egersted, Magnus; Shamma, Jeff S.
2018-01-01
the ability to drive a system to a specific set in the state space, was recently introduced as an alternative network control notion. This paper considers the application of herdability to the study of complex networks. The herdability of a class of networked
Wilds, Roy; Kauffman, Stuart A.; Glass, Leon
2008-09-01
We study the evolution of complex dynamics in a model of a genetic regulatory network. The fitness is associated with the topological entropy in a class of piecewise linear equations, and the mutations are associated with changes in the logical structure of the network. We compare hill climbing evolution, in which only mutations that increase the fitness are allowed, with neutral evolution, in which mutations that leave the fitness unchanged are allowed. The simple structure of the fitness landscape enables us to estimate analytically the rates of hill climbing and neutral evolution. In this model, allowing neutral mutations accelerates the rate of evolutionary advancement for low mutation frequencies. These results are applicable to evolution in natural and technological systems.
International Nuclear Information System (INIS)
Zheng Song
2012-01-01
In this paper, the exponential synchronization between two nonlinearly coupled complex networks with non-delayed and delayed coupling is investigated with Lyapunov-Krasovskii-type functionals. Based on the stability analysis of the impulsive differential equation and the linear matrix inequality, sufficient delay-dependent conditions for exponential synchronization are derived, and a linear impulsive controller and simple updated laws are also designed. Furthermore, the coupling matrices need not be symmetric or irreducible. Numerical examples are presented to verify the effectiveness and correctness of the synchronization criteria obtained.
Coupled dynamics of node and link states in complex networks: a model for language competition
International Nuclear Information System (INIS)
Carro, Adrián; Toral, Raúl; Miguel, Maxi San
2016-01-01
Inspired by language competition processes, we present a model of coupled evolution of node and link states. In particular, we focus on the interplay between the use of a language and the preference or attitude of the speakers towards it, which we model, respectively, as a property of the interactions between speakers (a link state) and as a property of the speakers themselves (a node state). Furthermore, we restrict our attention to the case of two socially equivalent languages and to socially inspired network topologies based on a mechanism of triadic closure. As opposed to most of the previous literature, where language extinction is an inevitable outcome of the dynamics, we find a broad range of possible asymptotic configurations, which we classify as: frozen extinction states, frozen coexistence states, and dynamically trapped coexistence states. Moreover, metastable coexistence states with very long survival times and displaying a non-trivial dynamics are found to be abundant. Interestingly, a system size scaling analysis shows, on the one hand, that the probability of language extinction vanishes exponentially for increasing system sizes and, on the other hand, that the time scale of survival of the non-trivial dynamical metastable states increases linearly with the size of the system. Thus, non-trivial dynamical coexistence is the only possible outcome for large enough systems. Finally, we show how this coexistence is characterized by one of the languages becoming clearly predominant while the other one becomes increasingly confined to ‘ghetto-like’ structures: small groups of bilingual speakers arranged in triangles, with a strong preference for the minority language, and using it for their intra-group interactions while they switch to the predominant language for communications with the rest of the population. (paper)
Directory of Open Access Journals (Sweden)
Angel Garrido
2011-01-01
Full Text Available In this paper, we analyze a few interrelated concepts about graphs, such as their degree, entropy, or their symmetry/asymmetry levels. These concepts prove useful in the study of different types of Systems, and particularly, in the analysis of Complex Networks. A System can be defined as any set of components functioning together as a whole. A systemic point of view allows us to isolate a part of the world, and so, we can focus on those aspects that interact more closely than others. Network Science analyzes the interconnections among diverse networks from different domains: physics, engineering, biology, semantics, and so on. Current developments in the quantitative analysis of Complex Networks, based on graph theory, have been rapidly translated to studies of brain network organization. The brain's systems have complex network features—such as the small-world topology, highly connected hubs and modularity. These networks are not random. The topology of many different networks shows striking similarities, such as the scale-free structure, with the degree distribution following a Power Law. How can very different systems have the same underlying topological features? Modeling and characterizing these networks, looking for their governing laws, are the current lines of research. So, we will dedicate this Special Issue paper to show measures of symmetry in Complex Networks, and highlight their close relation with measures of information and entropy.
Yang, Hyun Mo
2015-12-01
Currently, discrete modellings are largely accepted due to the access to computers with huge storage capacity and high performance processors and easy implementation of algorithms, allowing to develop and simulate increasingly sophisticated models. Wang et al. [7] present a review of dynamics in complex networks, focusing on the interaction between disease dynamics and human behavioral and social dynamics. By doing an extensive review regarding to the human behavior responding to disease dynamics, the authors briefly describe the complex dynamics found in the literature: well-mixed populations networks, where spatial structure can be neglected, and other networks considering heterogeneity on spatially distributed populations. As controlling mechanisms are implemented, such as social distancing due 'social contagion', quarantine, non-pharmaceutical interventions and vaccination, adaptive behavior can occur in human population, which can be easily taken into account in the dynamics formulated by networked populations.
Binary-State Dynamics on Complex Networks: Pair Approximation and Beyond
Directory of Open Access Journals (Sweden)
James P. Gleeson
2013-04-01
Full Text Available A wide class of binary-state dynamics on networks—including, for example, the voter model, the Bass diffusion model, and threshold models—can be described in terms of transition rates (spin-flip probabilities that depend on the number of nearest neighbors in each of the two possible states. High-accuracy approximations for the emergent dynamics of such models on uncorrelated, infinite networks are given by recently developed compartmental models or approximate master equations (AMEs. Pair approximations (PAs and mean-field theories can be systematically derived from the AME. We show that PA and AME solutions can coincide under certain circumstances, and numerical simulations confirm that PA is highly accurate in these cases. For monotone dynamics (where transitions out of one nodal state are impossible, e.g., susceptible-infected disease spread or Bass diffusion, PA and the AME give identical results for the fraction of nodes in the infected (active state for all time, provided that the rate of infection depends linearly on the number of infected neighbors. In the more general nonmonotone case, we derive a condition—that proves to be equivalent to a detailed balance condition on the dynamics—for PA and AME solutions to coincide in the limit t→∞. This equivalence permits bifurcation analysis, yielding explicit expressions for the critical (ferromagnetic or paramagnetic transition point of such dynamics, that is closely analogous to the critical temperature of the Ising spin model. Finally, the AME for threshold models of propagation is shown to reduce to just two differential equations and to give excellent agreement with numerical simulations. As part of this work, the Octave or Matlab code for implementing and solving the differential-equation systems is made available for download.
Park, Myeongjin; Lee, Seung-Hoon; Kwon, Oh-Min; Seuret, Alexandre
2017-09-06
This paper investigates synchronization in complex dynamical networks (CDNs) with interval time-varying delays. The CDNs are representative of systems composed of a large number of interconnected dynamical units, and for the purpose of the mathematical analysis, the leading work is to model them as graphs whose nodes represent the dynamical units. At this time, we take note of the importance of each node in networks. One way, in this paper, is that the closeness-centrality mentioned in the field of social science is grafted onto the CDNs. By constructing a suitable Lyapunov-Krasovskii functional, and utilizing some mathematical techniques, the sufficient and closeness-centrality-based conditions for synchronization stability of the networks are established in terms of linear matrix inequalities. Ultimately, the use of the closeness-centrality can be weighted with regard to not only the interconnection relation among the nodes, which was utilized in the existing works but also more information about nodes. Here, the centrality will be added as the concerned information. Moreover, to avoid the computational burden causing the nonconvex term including the square of the time-varying delay, how to deal with it is applied by estimating it to the convex term including time-varying delay. Finally, two illustrative examples are given to show the advantage of the closeness-centrality in point of the robustness on time-delay.
Border trees of complex networks
International Nuclear Information System (INIS)
Villas Boas, Paulino R; Rodrigues, Francisco A; Travieso, Gonzalo; Fontoura Costa, Luciano da
2008-01-01
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed
Directory of Open Access Journals (Sweden)
Xiaoguang Zhang
2014-01-01
Full Text Available Most of the current epidemic models assume that the infectious period follows an exponential distribution. However, due to individual heterogeneity and epidemic diversity, these models fail to describe the distribution of infectious periods precisely. We establish a SIS epidemic model with multistaged progression of infectious periods on complex networks, which can be used to characterize arbitrary distributions of infectious periods of the individuals. By using mathematical analysis, the basic reproduction number R0 for the model is derived. We verify that the R0 depends on the average distributions of infection periods for different types of infective individuals, which extend the general theory obtained from the single infectious period epidemic models. It is proved that if R0<1, then the disease-free equilibrium is globally asymptotically stable; otherwise the unique endemic equilibrium exists such that it is globally asymptotically attractive. Finally numerical simulations hold for the validity of our theoretical results is given.
Directory of Open Access Journals (Sweden)
Yuichi eYamashita
2011-04-01
Full Text Available How the brain learns and generates temporal sequences is a fundamental issue in neuroscience. The production of birdsongs, a process which involves complex learned sequences, provides researchers with an excellent biological model for this topic. The Bengalese finch in particular learns a highly complex song with syntactical structure. The nucleus HVC (HVC, a premotor nucleus within the avian song system, plays a key role in generating the temporal structures of their songs. From lesion studies, the nucleus interfacialis (NIf projecting to the HVC is considered one of the essential regions that contribute to the complexity of their songs. However, the types of interaction between the HVC and the NIf that can produce complex syntactical songs remain unclear. In order to investigate the function of interactions between the HVC and NIf, we have proposed a neural network model based on previous biological evidence. The HVC is modeled by a recurrent neural network (RNN that learns to generate temporal patterns of songs. The NIf is modeled as a mechanism that provides auditory feedback to the HVC and generates random noise that feeds into the HVC. The model showed that complex syntactical songs can be replicated by simple interactions between deterministic dynamics of the RNN and random noise. In the current study, the plausibility of the model is tested by the comparison between the changes in the songs of actual birds induced by pharmacological inhibition of the NIf and the changes in the songs produced by the model resulting from modification of parameters representing NIf functions. The efficacy of the model demonstrates that the changes of songs induced by pharmacological inhibition of the NIf can be interpreted as a trade-off between the effects of noise and the effects of feedback on the dynamics of the RNN of the HVC. These facts suggest that the current model provides a convincing hypothesis for the functional role of NIf-HVC interaction.
Nonlinear Dynamics on Interconnected Networks
Arenas, Alex; De Domenico, Manlio
2016-06-01
Networks of dynamical interacting units can represent many complex systems, from the human brain to transportation systems and societies. The study of these complex networks, when accounting for different types of interactions has become a subject of interest in the last few years, especially because its representational power in the description of users' interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.) [1], or in representing different transportation modes in urban networks [2,3]. The general name coined for these networks is multilayer networks, where each layer accounts for a type of interaction (see Fig. 1).
Hierarchy Measure for Complex Networks
Mones, Enys; Vicsek, Lilla; Vicsek, Tamás
2012-01-01
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477
Complex Networks in Psychological Models
Wedemann, R. S.; Carvalho, L. S. A. V. D.; Donangelo, R.
We develop schematic, self-organizing, neural-network models to describe mechanisms associated with mental processes, by a neurocomputational substrate. These models are examples of real world complex networks with interesting general topological structures. Considering dopaminergic signal-to-noise neuronal modulation in the central nervous system, we propose neural network models to explain development of cortical map structure and dynamics of memory access, and unify different mental processes into a single neurocomputational substrate. Based on our neural network models, neurotic behavior may be understood as an associative memory process in the brain, and the linguistic, symbolic associative process involved in psychoanalytic working-through can be mapped onto a corresponding process of reconfiguration of the neural network. The models are illustrated through computer simulations, where we varied dopaminergic modulation and observed the self-organizing emergent patterns at the resulting semantic map, interpreting them as different manifestations of mental functioning, from psychotic through to normal and neurotic behavior, and creativity.
Synchronization in complex networks
Energy Technology Data Exchange (ETDEWEB)
Arenas, A.; Diaz-Guilera, A.; Moreno, Y.; Zhou, C.; Kurths, J.
2007-12-12
Synchronization processes in populations of locally interacting elements are in the focus of intense research in physical, biological, chemical, technological and social systems. The many efforts devoted to understand synchronization phenomena in natural systems take now advantage of the recent theory of complex networks. In this review, we report the advances in the comprehension of synchronization phenomena when oscillating elements are constrained to interact in a complex network topology. We also overview the new emergent features coming out from the interplay between the structure and the function of the underlying pattern of connections. Extensive numerical work as well as analytical approaches to the problem are presented. Finally, we review several applications of synchronization in complex networks to different disciplines: biological systems and neuroscience, engineering and computer science, and economy and social sciences.
Kim, Sang-Yoon; Lim, Woochang
2017-10-01
For studying how dynamical responses to external stimuli depend on the synaptic-coupling type, we consider two types of excitatory and inhibitory synchronization (i.e., synchronization via synaptic excitation and inhibition) in complex small-world networks of excitatory regular spiking (RS) pyramidal neurons and inhibitory fast spiking (FS) interneurons. For both cases of excitatory and inhibitory synchronization, effects of synaptic couplings on dynamical responses to external time-periodic stimuli S ( t ) (applied to a fraction of neurons) are investigated by varying the driving amplitude A of S ( t ). Stimulated neurons are phase-locked to external stimuli for both cases of excitatory and inhibitory couplings. On the other hand, the stimulation effect on non-stimulated neurons depends on the type of synaptic coupling. The external stimulus S ( t ) makes a constructive effect on excitatory non-stimulated RS neurons (i.e., it causes external phase lockings in the non-stimulated sub-population), while S ( t ) makes a destructive effect on inhibitory non-stimulated FS interneurons (i.e., it breaks up original inhibitory synchronization in the non-stimulated sub-population). As results of these different effects of S ( t ), the type and degree of dynamical response (e.g., synchronization enhancement or suppression), characterized by the dynamical response factor [Formula: see text] (given by the ratio of synchronization degree in the presence and absence of stimulus), are found to vary in a distinctly different way, depending on the synaptic-coupling type. Furthermore, we also measure the matching degree between the dynamics of the two sub-populations of stimulated and non-stimulated neurons in terms of a "cross-correlation" measure [Formula: see text]. With increasing A , based on [Formula: see text], we discuss the cross-correlations between the two sub-populations, affecting the dynamical responses to S ( t ).
Complexity and Dynamical Depth
Directory of Open Access Journals (Sweden)
Terrence Deacon
2014-07-01
Full Text Available We argue that a critical difference distinguishing machines from organisms and computers from brains is not complexity in a structural sense, but a difference in dynamical organization that is not well accounted for by current complexity measures. We propose a measure of the complexity of a system that is largely orthogonal to computational, information theoretic, or thermodynamic conceptions of structural complexity. What we call a system’s dynamical depth is a separate dimension of system complexity that measures the degree to which it exhibits discrete levels of nonlinear dynamical organization in which successive levels are distinguished by local entropy reduction and constraint generation. A system with greater dynamical depth than another consists of a greater number of such nested dynamical levels. Thus, a mechanical or linear thermodynamic system has less dynamical depth than an inorganic self-organized system, which has less dynamical depth than a living system. Including an assessment of dynamical depth can provide a more precise and systematic account of the fundamental difference between inorganic systems (low dynamical depth and living systems (high dynamical depth, irrespective of the number of their parts and the causal relations between them.
Advances in network complexity
Dehmer, Matthias; Emmert-Streib, Frank
2013-01-01
A well-balanced overview of mathematical approaches to describe complex systems, ranging from chemical reactions to gene regulation networks, from ecological systems to examples from social sciences. Matthias Dehmer and Abbe Mowshowitz, a well-known pioneer in the field, co-edit this volume and are careful to include not only classical but also non-classical approaches so as to ensure topicality. Overall, a valuable addition to the literature and a must-have for anyone dealing with complex systems.
Directory of Open Access Journals (Sweden)
Rathinasamy Sakthivel
2018-01-01
Full Text Available The problem of robust nonfragile synchronization is investigated in this paper for a class of complex dynamical networks subject to semi-Markov jumping outer coupling, time-varying coupling delay, randomly occurring gain variation, and stochastic noise over a desired finite-time interval. In particular, the network topology is assumed to follow a semi-Markov process such that it may switch from one to another at different instants. In this paper, the random gain variation is represented by a stochastic variable that is assumed to satisfy the Bernoulli distribution with white sequences. Based on these hypotheses and the Lyapunov-Krasovskii stability theory, a new finite-time stochastic synchronization criterion is established for the considered network in terms of linear matrix inequalities. Moreover, the control design parameters that guarantee the required criterion are computed by solving a set of linear matrix inequality constraints. An illustrative example is finally given to show the effectiveness and advantages of the developed analytical results.
Ruf, Sebastian F.
2018-04-12
The problem of controlling complex networks is of interest to disciplines ranging from biology to swarm robotics. However, controllability can be too strict a condition, failing to capture a range of desirable behaviors. Herdability, which describes the ability to drive a system to a specific set in the state space, was recently introduced as an alternative network control notion. This paper considers the application of herdability to the study of complex networks. The herdability of a class of networked systems is investigated and two problems related to ensuring system herdability are explored. The first is the input addition problem, which investigates which nodes in a network should receive inputs to ensure that the system is herdable. The second is a related problem of selecting the best single node from which to herd the network, in the case that a single node is guaranteed to make the system is herdable. In order to select the best herding node, a novel control energy based herdability centrality measure is introduced.
Skjeltorp, Arne T
2006-01-01
The book reviews the synergism between various fields of research that are confronted with networks, such as genetic and metabolic networks, social networks, the Internet and ecological systems. In many cases, the interacting networks manifest so-called emergent properties that are not possessed by any of the individual components. This means that the detailed knowledge of the components is insufficient to describe the whole system. Recent work has indicated that networks in nature have so-called scale-free characteristics, and the associated dynamic network modelling shows unexpected results such as an amazing robustness against accidental failures. Modelling the signal transduction networks in bioprocesses as in living cells is a challenging interdisciplinary research area. It is now realized that the many features of molecular interaction networks within a cell are shared to a large degree by the other complex systems mentioned above, such as the Internet, computer chips and society. Thus knowledge gained ...
Dynamic behaviors in directed networks
International Nuclear Information System (INIS)
Park, Sung Min; Kim, Beom Jun
2006-01-01
Motivated by the abundance of directed synaptic couplings in a real biological neuronal network, we investigate the synchronization behavior of the Hodgkin-Huxley model in a directed network. We start from the standard model of the Watts-Strogatz undirected network and then change undirected edges to directed arcs with a given probability, still preserving the connectivity of the network. A generalized clustering coefficient for directed networks is defined and used to investigate the interplay between the synchronization behavior and underlying structural properties of directed networks. We observe that the directedness of complex networks plays an important role in emerging dynamical behaviors, which is also confirmed by a numerical study of the sociological game theoretic voter model on directed networks
Dynamics of book sales: Endogenous versus exogenous shocks in complex networks
Deschâtres, F.; Sornette, D.
2005-07-01
We present an extensive study of the foreshock and aftershock signatures accompanying peaks of book sales. The time series of book sales are derived from the ranking system of Amazon.com. We present two independent ways of classifying peaks, one based on the acceleration pattern of sales and the other based on the exponent of the relaxation. They are found to be consistent and reveal the coexistence of two types of sales peaks: exogenous peaks occur abruptly and are followed by a power law relaxation, while endogenous sale peaks occur after a progressively accelerating power law growth followed by an approximately symmetrical power law relaxation which is slower than for exogenous peaks. We develop a simple epidemic model of buyers connected within a network of acquaintances which propagates rumors and opinions on books. The comparison between the predictions of the model and the empirical data confirms the validity of the model and suggests in addition that social networks have evolved to converge very close to criticality (here in the sense of critical branching processes of opinion spreading). We test in detail the evidence for a power law distribution of book sales and confirm a previous indirect study suggesting that the fraction of books (density distribution) P(S) of sales S is a power law P(S)˜1/S1+μ with μ≈2 .
Epidemic processes in complex networks
Pastor-Satorras, Romualdo; Castellano, Claudio; Van Mieghem, Piet; Vespignani, Alessandro
2015-07-01
In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems. The complex properties of real-world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks. The theoretical analysis of epidemic spreading in heterogeneous networks requires the development of novel analytical frameworks, and it has produced results of conceptual and practical relevance. A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear. Physicists, mathematicians, epidemiologists, computer, and social scientists share a common interest in studying epidemic spreading and rely on similar models for the description of the diffusion of pathogens, knowledge, and innovation. For this reason, while focusing on the main results and the paradigmatic models in infectious disease modeling, the major results concerning generalized social contagion processes are also presented. Finally, the research activity at the forefront in the study of epidemic spreading in coevolving, coupled, and time-varying networks is reported.
Dynamics of complex interconnected systems: Networks and bioprocesses[A NATO study seminary
Energy Technology Data Exchange (ETDEWEB)
Wilhelmsen, Line K
2005-07-01
Rapid detection of chemical and biological agents and weapons, and rapid diagnosis of their effects on people will require molecular recognition as well as signal discrimination, i.e. avoiding false positives and negatives, and signal transduction. It will be important to have reagentless, cheap, easily manufactured sensors that can be field deployed in large numbers. While this problem is urgent it is not yet solved. This ASI brought together researchers with various interests and background including theoretical physicists, soft condensed matter experimentalists, biological physicists, and molecular biologists to identify and discuss areas where synergism between modem physics and biology may be most fruitfully applied to the study of bioprocesses for molecular recognition and of networks for converting molecular reactions into usable signals and appropriate responses. (Author)
A network dynamics approach to chemical reaction networks
van der Schaft, Abraham; Rao, S.; Jayawardhana, B.
2016-01-01
A treatment of 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
Vulnerability of complex networks
Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco
2011-01-01
We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.
Wells, Chad R.; Galvani, Alison P.
2015-12-01
In a loop of dynamic feedback, behavior such as the decision to vaccinate, hand washing, or avoidance influences the progression of the epidemic, yet behavior is driven by the individual's and population's perceived risk of infection during an outbreak. In what we believe will become a seminal paper that stimulates future research as well as an informative teaching aid, Wang et. al. comprehensively review methodological advances that have been used to incorporate human behavior into epidemiological models on the effects of coupling disease transmission and behavior on complex social networks [1]. As illustrated by the recent outbreaks of measles and Middle Eastern Respiratory Syndrome (MERS), here we highlight the importance of coupling behavior and disease transmission that Wang et al. address.
Rashvand, Habib
2013-01-01
Motivated by the exciting new application paradigm of using amalgamated technologies of the Internet and wireless, the next generation communication networks (also called 'ubiquitous', 'complex' and 'unstructured' networking) are changing the way we develop and apply our future systems and services at home and on local, national and global scales. Whatever the interconnection - a WiMAX enabled networked mobile vehicle, MEMS or nanotechnology enabled distributed sensor systems, Vehicular Ad hoc Networking (VANET) or Mobile Ad hoc Networking (MANET) - all can be classified under new networking s
Persistent homology of complex networks
International Nuclear Information System (INIS)
Horak, Danijela; Maletić, Slobodan; Rajković, Milan
2009-01-01
Long-lived topological features are distinguished from short-lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and presented as a parameterized version of a Betti number. Complex networks with distinct degree distributions exhibit distinct persistent topological features. Persistent topological attributes, shown to be related to the robust quality of networks, also reflect the deficiency in certain connectivity properties of networks. Random networks, networks with exponential connectivity distribution and scale-free networks were considered for homological persistency analysis
Dynamics in Complex Coacervates
Perry, Sarah
Understanding the dynamics of a material provides detailed information about the self-assembly, structure, and intermolecular interactions present in a material. While rheological methods have long been used for the characterization of complex coacervate-based materials, it remains a challenge to predict the dynamics for a new system of materials. Furthermore, most work reports only qualitative trends exist as to how parameters such as charge stoichiometry, ionic strength, and polymer chain length impact self-assembly and material dynamics, and there is little information on the effects of polymer architecture or the organization of charges within a polymer. We seek to link thermodynamic studies of coacervation phase behavior with material dynamics through a carefully-controlled, systematic study of coacervate linear viscoelasticity for different polymer chemistries. We couple various methods of characterizing the dynamics of polymer-based complex coacervates, including the time-salt superposition methods developed first by Spruijt and coworkers to establish a more mechanistic strategy for comparing the material dynamics and linear viscoelasticity of different systems. Acknowledgment is made to the Donors of the American Chemical Society Petroleum Research Fund for support of this research.
7th Workshop on Complex Networks
Gonçalves, Bruno; Menezes, Ronaldo; Sinatra, Roberta
2016-01-01
The last decades have seen the emergence of Complex Networks as the language with which a wide range of complex phenomena in fields as diverse as Physics, Computer Science, and Medicine (to name just a few) can be properly described and understood. This book provides a view of the state of the art in this dynamic field and covers topics ranging from network controllability, social structure, online behavior, recommendation systems, and network structure. This book includes the peer-reviewed list of works presented at the 7th Workshop on Complex Networks CompleNet 2016 which was hosted by the Université de Bourgogne, France, from March 23-25, 2016. The 28 carefully reviewed and selected contributions in this book address many topics related to complex networks and have been organized in seven major groups: (1) Theory of Complex Networks, (2) Multilayer networks, (3) Controllability of networks, (4) Algorithms for networks, (5) Community detection, (6) Dynamics and spreading phenomena on networks, (7) Applicat...
Controlling extreme events on complex networks
Chen, Yu-Zhong; Huang, Zi-Gang; Lai, Ying-Cheng
2014-08-01
Extreme events, a type of collective behavior in complex networked dynamical systems, often can have catastrophic consequences. To develop effective strategies to control extreme events is of fundamental importance and practical interest. Utilizing transportation dynamics on complex networks as a prototypical setting, we find that making the network ``mobile'' can effectively suppress extreme events. A striking, resonance-like phenomenon is uncovered, where an optimal degree of mobility exists for which the probability of extreme events is minimized. We derive an analytic theory to understand the mechanism of control at a detailed and quantitative level, and validate the theory numerically. Implications of our finding to current areas such as cybersecurity are discussed.
Pinning impulsive control algorithms for complex network
International Nuclear Information System (INIS)
Sun, Wen; Lü, Jinhu; Chen, Shihua; Yu, Xinghuo
2014-01-01
In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms
Complexity in Dynamical Systems
Moore, Cristopher David
The study of chaos has shown us that deterministic systems can have a kind of unpredictability, based on a limited knowledge of their initial conditions; after a finite time, the motion appears essentially random. This observation has inspired a general interest in the subject of unpredictability, and more generally, complexity; how can we characterize how "complex" a dynamical system is?. In this thesis, we attempt to answer this question with a paradigm of complexity that comes from computer science, we extract sets of symbol sequences, or languages, from a dynamical system using standard methods of symbolic dynamics; we then ask what kinds of grammars or automata are needed a generate these languages. This places them in the Chomsky heirarchy, which in turn tells us something about how subtle and complex the dynamical system's behavior is. This gives us insight into the question of unpredictability, since these automata can also be thought of as computers attempting to predict the system. In the culmination of the thesis, we find a class of smooth, two-dimensional maps which are equivalent to the highest class in the Chomsky heirarchy, the turning machine; they are capable of universal computation. Therefore, these systems possess a kind of unpredictability qualitatively different from the usual "chaos": even if the initial conditions are known exactly, questions about the system's long-term dynamics are undecidable. No algorithm exists to answer them. Although this kind of unpredictability has been discussed in the context of distributed, many-degree-of -freedom systems (for instance, cellular automata) we believe this is the first example of such phenomena in a smooth, finite-degree-of-freedom system.
Synchronization in complex networks with switching topology
International Nuclear Information System (INIS)
Wang, Lei; Wang, Qing-guo
2011-01-01
This Letter investigates synchronization issues of complex dynamical networks with switching topology. By constructing a common Lyapunov function, we show that local and global synchronization for a linearly coupled network with switching topology can be evaluated by the time average of second smallest eigenvalues corresponding to the Laplacians of switching topology. This result is quite powerful and can be further used to explore various switching cases for complex dynamical networks. Numerical simulations illustrate the effectiveness of the obtained results in the end. -- Highlights: → Synchronization of complex networks with switching topology is investigated. → A common Lyapunov function is established for synchronization of switching network. → The common Lyapunov function is not necessary to monotonically decrease with time. → Synchronization is determined by the second smallest eigenvalue of its Laplacian. → Synchronization criterion can be used to investigate various switching cases.
Physics of flow in weighted complex networks
Wu, Zhenhua
This thesis uses concepts from statistical physics to understand the physics of flow in weighted complex networks. The traditional model for random networks is the Erdoḧs-Renyi (ER.) network, where a network of N nodes is created by connecting each of the N(N - 1)/2 pairs of nodes with a probability p. The degree distribution, which is the probability distribution of the number of links per node, is a Poisson distribution. Recent studies of the topology in many networks such as the Internet and the world-wide airport network (WAN) reveal a power law degree distribution, known as a scale-free (SF) distribution. To yield a better description of network dynamics, we study weighted networks, where each link or node is given a number. One asks how the weights affect the static and the dynamic properties of the network. In this thesis, two important dynamic problems are studied: the current flow problem, described by Kirchhoff's laws, and the maximum flow problem, which maximizes the flow between two nodes. Percolation theory is applied to these studies of the dynamics in complex networks. We find that the current flow in disordered media belongs to the same universality class as the optimal path. In a randomly weighted network, we identify the infinite incipient percolation cluster as the "superhighway", which contains most of the traffic in a network. We propose an efficient strategy to improve significantly the global transport by improving the superhighways, which comprise a small fraction of the network. We also propose a network model with correlated weights to describe weighted networks such as the WAN. Our model agrees with WAN data, and provides insight into the advantages of correlated weights in networks. Lastly, the upper critical dimension is evaluated using two different numerical methods, and the result is consistent with the theoretical prediction.
Statistical mechanics of complex networks
Rubi, Miguel; Diaz-Guilera, Albert
2003-01-01
Networks can provide a useful model and graphic image useful for the description of a wide variety of web-like structures in the physical and man-made realms, e.g. protein networks, food webs and the Internet. The contributions gathered in the present volume provide both an introduction to, and an overview of, the multifaceted phenomenology of complex networks. Statistical Mechanics of Complex Networks also provides a state-of-the-art picture of current theoretical methods and approaches.
Border detection in complex networks
International Nuclear Information System (INIS)
Travencolo, Bruno A N; Viana, Matheus Palhares; Costa, Luciano da Fontoura
2009-01-01
One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded on the recently introduced concept of node diversity. It is shown that this feature does not exhibit any relevant correlation with several well-established complex networks measurements. A methodology for the identification of the borders of complex networks is described and illustrated with respect to theoretical (geographical and knitted networks) as well as real-world networks (urban and word association networks), yielding interesting results and insights in both cases.
Network Dynamics of Innovation Processes
Iacopini, Iacopo; Milojević, Staša; Latora, Vito
2018-01-01
We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.
Waliszewski, P; Molski, M; Konarski, J
1998-06-01
A keystone of the molecular reductionist approach to cellular biology is a specific deductive strategy relating genotype to phenotype-two distinct categories. This relationship is based on the assumption that the intermediary cellular network of actively transcribed genes and their regulatory elements is deterministic (i.e., a link between expression of a gene and a phenotypic trait can always be identified, and evolution of the network in time is predetermined). However, experimental data suggest that the relationship between genotype and phenotype is nonbijective (i.e., a gene can contribute to the emergence of more than just one phenotypic trait or a phenotypic trait can be determined by expression of several genes). This implies nonlinearity (i.e., lack of the proportional relationship between input and the outcome), complexity (i.e. emergence of the hierarchical network of multiple cross-interacting elements that is sensitive to initial conditions, possesses multiple equilibria, organizes spontaneously into different morphological patterns, and is controlled in dispersed rather than centralized manner), and quasi-determinism (i.e., coexistence of deterministic and nondeterministic events) of the network. Nonlinearity within the space of the cellular molecular events underlies the existence of a fractal structure within a number of metabolic processes, and patterns of tissue growth, which is measured experimentally as a fractal dimension. Because of its complexity, the same phenotype can be associated with a number of alternative sequences of cellular events. Moreover, the primary cause initiating phenotypic evolution of cells such as malignant transformation can be favored probabilistically, but not identified unequivocally. Thermodynamic fluctuations of energy rather than gene mutations, the material traits of the fluctuations alter both the molecular and informational structure of the network. Then, the interplay between deterministic chaos, complexity, self
Reconfigurable optical implementation of quantum complex networks
Nokkala, J.; Arzani, F.; Galve, F.; Zambrini, R.; Maniscalco, S.; Piilo, J.; Treps, N.; Parigi, V.
2018-05-01
Network theory has played a dominant role in understanding the structure of complex systems and their dynamics. Recently, quantum complex networks, i.e. collections of quantum systems arranged in a non-regular topology, have been theoretically explored leading to significant progress in a multitude of diverse contexts including, e.g., quantum transport, open quantum systems, quantum communication, extreme violation of local realism, and quantum gravity theories. Despite important progress in several quantum platforms, the implementation of complex networks with arbitrary topology in quantum experiments is still a demanding task, especially if we require both a significant size of the network and the capability of generating arbitrary topology—from regular to any kind of non-trivial structure—in a single setup. Here we propose an all optical and reconfigurable implementation of quantum complex networks. The experimental proposal is based on optical frequency combs, parametric processes, pulse shaping and multimode measurements allowing the arbitrary control of the number of the nodes (optical modes) and topology of the links (interactions between the modes) within the network. Moreover, we also show how to simulate quantum dynamics within the network combined with the ability to address its individual nodes. To demonstrate the versatility of these features, we discuss the implementation of two recently proposed probing techniques for quantum complex networks and structured environments.
Antagonistic Phenomena in Network Dynamics
Motter, Adilson E.; Timme, Marc
2018-03-01
Recent research on the network modeling of complex systems has led to a convenient representation of numerous natural, social, and engineered systems that are now recognized as networks of interacting parts. Such systems can exhibit a wealth of phenomena that not only cannot be anticipated from merely examining their parts, as per the textbook definition of complexity, but also challenge intuition even when considered in the context of what is now known in network science. Here, we review the recent literature on two major classes of such phenomena that have far-reaching implications: (a) antagonistic responses to changes of states or parameters and (b) coexistence of seemingly incongruous behaviors or properties - both deriving from the collective and inherently decentralized nature of the dynamics. They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring across transport and supply networks. They also include remote synchronization, chimera states, and the converse of symmetry breaking in brain, power-grid, and oscillator networks as well as remote control in biological and bioinspired systems. By offering a unified view of these various scenarios, we suggest that they are representative of a yet broader class of unprecedented network phenomena that ought to be revealed and explained by future research.
Maximizing information exchange between complex networks
International Nuclear Information System (INIS)
West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo
2008-01-01
Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain's response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of modern
Maximizing information exchange between complex networks
West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo
2008-10-01
Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain’s response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of
Maximizing information exchange between complex networks
Energy Technology Data Exchange (ETDEWEB)
West, Bruce J. [Mathematical and Information Science, Army Research Office, Research Triangle Park, NC 27708 (United States); Physics Department, Duke University, Durham, NC 27709 (United States)], E-mail: bwest@nc.rr.com; Geneston, Elvis L. [Center for Nonlinear Science, University of North Texas, P.O. Box 311427, Denton, TX 76203-1427 (United States); Physics Department, La Sierra University, 4500 Riverwalk Parkway, Riverside, CA 92515 (United States); Grigolini, Paolo [Center for Nonlinear Science, University of North Texas, P.O. Box 311427, Denton, TX 76203-1427 (United States); Istituto di Processi Chimico Fisici del CNR, Area della Ricerca di Pisa, Via G. Moruzzi, 56124, Pisa (Italy); Dipartimento di Fisica ' E. Fermi' Universita' di Pisa, Largo Pontecorvo 3, 56127 Pisa (Italy)
2008-10-15
Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain's response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of
Bose-Einstein Condensation in Complex Networks
International Nuclear Information System (INIS)
Bianconi, Ginestra; Barabasi, Albert-Laszlo
2001-01-01
The evolution of many complex systems, including the World Wide Web, business, and citation networks, is encoded in the dynamic web describing the interactions between the system's constituents. Despite their irreversible and nonequilibrium nature these networks follow Bose statistics and can undergo Bose-Einstein condensation. Addressing the dynamical properties of these nonequilibrium systems within the framework of equilibrium quantum gases predicts that the 'first-mover-advantage,' 'fit-get-rich,' and 'winner-takes-all' phenomena observed in competitive systems are thermodynamically distinct phases of the underlying evolving networks
Jamming in complex networks with degree correlation
International Nuclear Information System (INIS)
Pastore y Piontti, Ana L.; Braunstein, Lidia A.; Macri, Pablo A.
2010-01-01
We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport through them. This result agree with the fact that many real world transportation networks naturally evolve to this kind of correlation. We explain our results showing that for the disassortative case the clusters in the gradient network turn out to be as much elongated as possible, reducing the pressure congestion J and observing the opposite behavior for the assortative case. Finally we apply our model to real world networks, and the results agree with our theoretical model.
Multifractal analysis of complex networks
International Nuclear Information System (INIS)
Wang Dan-Ling; Yu Zu-Guo; Anh V
2012-01-01
Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions. Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we introduce a new box-covering algorithm for multifractal analysis of complex networks. This algorithm is used to calculate the generalized fractal dimensions D q of some theoretical networks, namely scale-free networks, small world networks, and random networks, and one kind of real network, namely protein—protein interaction networks of different species. Our numerical results indicate the existence of multifractality in scale-free networks and protein—protein interaction networks, while the multifractal behavior is not clear-cut for small world networks and random networks. The possible variation of D q due to changes in the parameters of the theoretical network models is also discussed. (general)
Atomic switch networks as complex adaptive systems
Scharnhorst, Kelsey S.; Carbajal, Juan P.; Aguilera, Renato C.; Sandouk, Eric J.; Aono, Masakazu; Stieg, Adam Z.; Gimzewski, James K.
2018-03-01
Complexity is an increasingly crucial aspect of societal, environmental and biological phenomena. Using a dense unorganized network of synthetic synapses it is shown that a complex adaptive system can be physically created on a microchip built especially for complex problems. These neuro-inspired atomic switch networks (ASNs) are a dynamic system with inherent and distributed memory, recurrent pathways, and up to a billion interacting elements. We demonstrate key parameters describing self-organized behavior such as non-linearity, power law dynamics, and multistate switching regimes. Device dynamics are then investigated using a feedback loop which provides control over current and voltage power-law behavior. Wide ranging prospective applications include understanding and eventually predicting future events that display complex emergent behavior in the critical regime.
Bell Inequalities for Complex Networks
2015-10-26
AFRL-AFOSR-VA-TR-2015-0355 YIP Bell Inequalities for Complex Networks Greg Ver Steeg UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES Final Report 10/26...performance report PI: Greg Ver Steeg Young Investigator Award Grant Title: Bell Inequalities for Complex Networks Grant #: FA9550-12-1-0417 Reporting...October 20, 2015 Final Report for “Bell Inequalities for Complex Networks” Greg Ver Steeg Abstract This effort studied new methods to understand the effect
Measure of robustness for complex networks
Youssef, Mina Nabil
Critical infrastructures are repeatedly attacked by external triggers causing tremendous amount of damages. Any infrastructure can be studied using the powerful theory of complex networks. A complex network is composed of extremely large number of different elements that exchange commodities providing significant services. The main functions of complex networks can be damaged by different types of attacks and failures that degrade the network performance. These attacks and failures are considered as disturbing dynamics, such as the spread of viruses in computer networks, the spread of epidemics in social networks, and the cascading failures in power grids. Depending on the network structure and the attack strength, every network differently suffers damages and performance degradation. Hence, quantifying the robustness of complex networks becomes an essential task. In this dissertation, new metrics are introduced to measure the robustness of technological and social networks with respect to the spread of epidemics, and the robustness of power grids with respect to cascading failures. First, we introduce a new metric called the Viral Conductance (VCSIS ) to assess the robustness of networks with respect to the spread of epidemics that are modeled through the susceptible/infected/susceptible (SIS) epidemic approach. In contrast to assessing the robustness of networks based on a classical metric, the epidemic threshold, the new metric integrates the fraction of infected nodes at steady state for all possible effective infection strengths. Through examples, VCSIS provides more insights about the robustness of networks than the epidemic threshold. In addition, both the paradoxical robustness of Barabasi-Albert preferential attachment networks and the effect of the topology on the steady state infection are studied, to show the importance of quantifying the robustness of networks. Second, a new metric VCSIR is introduced to assess the robustness of networks with respect
Synchronization coupled systems to complex networks
Boccaletti, Stefano; del Genio, Charo I; Amann, Andreas
2018-01-01
A modern introduction to synchronization phenomena, this text presents recent discoveries and the current state of research in the field, from low-dimensional systems to complex networks. The book describes some of the main mechanisms of collective behaviour in dynamical systems, including simple coupled systems, chaotic systems, and systems of infinite-dimension. After introducing the reader to the basic concepts of nonlinear dynamics, the book explores the main synchronized states of coupled systems and describes the influence of noise and the occurrence of synchronous motion in multistable and spatially-extended systems. Finally, the authors discuss the underlying principles of collective dynamics on complex networks, providing an understanding of how networked systems are able to function as a whole in order to process information, perform coordinated tasks, and respond collectively to external perturbations. The demonstrations, numerous illustrations and application examples will help advanced graduate s...
Analysis of complex networks using aggressive abstraction.
Energy Technology Data Exchange (ETDEWEB)
Colbaugh, Richard; Glass, Kristin.; Willard, Gerald
2008-10-01
This paper presents a new methodology for analyzing complex networks in which the network of interest is first abstracted to a much simpler (but equivalent) representation, the required analysis is performed using the abstraction, and analytic conclusions are then mapped back to the original network and interpreted there. We begin by identifying a broad and important class of complex networks which admit abstractions that are simultaneously dramatically simplifying and property preserving we call these aggressive abstractions -- and which can therefore be analyzed using the proposed approach. We then introduce and develop two forms of aggressive abstraction: 1.) finite state abstraction, in which dynamical networks with uncountable state spaces are modeled using finite state systems, and 2.) onedimensional abstraction, whereby high dimensional network dynamics are captured in a meaningful way using a single scalar variable. In each case, the property preserving nature of the abstraction process is rigorously established and efficient algorithms are presented for computing the abstraction. The considerable potential of the proposed approach to complex networks analysis is illustrated through case studies involving vulnerability analysis of technological networks and predictive analysis for social processes.
Bountis, Tassos
2012-01-01
This book introduces and explores modern developments in the well established field of Hamiltonian dynamical systems. It focuses on high degree-of-freedom systems and the transitional regimes between regular and chaotic motion. The role of nonlinear normal modes is highlighted and the importance of low-dimensional tori in the resolution of the famous FPU paradox is emphasized. Novel powerful numerical methods are used to study localization phenomena and distinguish order from strongly and weakly chaotic regimes. The emerging hierarchy of complex structures in such regimes gives rise to particularly long-lived patterns and phenomena called quasi-stationary states, which are explored in particular in the concrete setting of one-dimensional Hamiltonian lattices and physical applications in condensed matter systems. The self-contained and pedagogical approach is blended with a unique balance between mathematical rigor, physics insights and concrete applications. End of chapter exercises and (more demanding) res...
Complex brain networks: From topological communities to clustered
Indian Academy of Sciences (India)
Complex brain networks: From topological communities to clustered dynamics ... Recent research has revealed a rich and complicated network topology in the cortical connectivity of mammalian brains. ... Pramana – Journal of Physics | News.
Chaotification of complex networks with impulsive control.
Guan, Zhi-Hong; Liu, Feng; Li, Juan; Wang, Yan-Wu
2012-06-01
This paper investigates the chaotification problem of complex dynamical networks (CDN) with impulsive control. Both the discrete and continuous cases are studied. The method is presented to drive all states of every node in CDN to chaos. The proposed impulsive control strategy is effective for both the originally stable and unstable CDN. The upper bound of the impulse intervals for originally stable networks is derived. Finally, the effectiveness of the theoretical results is verified by numerical examples.
Revealing networks from dynamics: an introduction
International Nuclear Information System (INIS)
Timme, Marc; Casadiego, Jose
2014-01-01
What can we learn from the collective dynamics of a complex network about its interaction topology? Taking the perspective from nonlinear dynamics, we briefly review recent progress on how to infer structural connectivity (direct interactions) from accessing the dynamics of the units. Potential applications range from interaction networks in physics, to chemical and metabolic reactions, protein and gene regulatory networks as well as neural circuits in biology and electric power grids or wireless sensor networks in engineering. Moreover, we briefly mention some standard ways of inferring effective or functional connectivity. (topical review)
Complex network description of the ionosphere
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.
Learning Latent Structure in Complex Networks
DEFF Research Database (Denmark)
Mørup, Morten; Hansen, Lars Kai
such as the Modularity, it has recently been shown that latent structure in complex networks is learnable by Bayesian generative link distribution models (Airoldi et al., 2008, Hofman and Wiggins, 2008). In this paper we propose a new generative model that allows representation of latent community structure......Latent structure in complex networks, e.g., in the form of community structure, can help understand network dynamics, identify heterogeneities in network properties, and predict ‘missing’ links. While most community detection algorithms are based on optimizing heuristic clustering objectives...... as in the previous Bayesian approaches and in addition allows learning of node specific link properties similar to that in the modularity objective. We employ a new relaxation method for efficient inference in these generative models that allows us to learn the behavior of very large networks. We compare the link...
8th Conference on Complex Networks
Menezes, Ronaldo; Sinatra, Roberta; Zlatic, Vinko
2017-01-01
This book collects the works presented at the 8th International Conference on Complex Networks (CompleNet) 2017 in Dubrovnik, Croatia, on March 21-24, 2017. CompleNet aims at bringing together researchers and practitioners working in areas related to complex networks. The past two decades has witnessed an exponential increase in the number of publications within this field. From biological systems to computer science, from economic to social systems, complex networks are becoming pervasive in many fields of science. It is this interdisciplinary nature of complex networks that CompleNet aims at addressing. The last decades have seen the emergence of complex networks as the language with which a wide range of complex phenomena in fields as diverse as physics, computer science, and medicine (to name a few) can be properly described and understood. This book provides a view of the state-of-the-art in this dynamic field and covers topics such as network controllability, social structure, online behavior, recommend...
Language Networks as Complex Systems
Lee, Max Kueiming; Ou, Sheue-Jen
2008-01-01
Starting in the late eighties, with a growing discontent with analytical methods in science and the growing power of computers, researchers began to study complex systems such as living organisms, evolution of genes, biological systems, brain neural networks, epidemics, ecology, economy, social networks, etc. In the early nineties, the research…
Complex network synchronization of chaotic systems with delay coupling
International Nuclear Information System (INIS)
Theesar, S. Jeeva Sathya; Ratnavelu, K.
2014-01-01
The study of complex networks enables us to understand the collective behavior of the interconnected elements and provides vast real time applications from biology to laser dynamics. In this paper, synchronization of complex network of chaotic systems has been studied. Every identical node in the complex network is assumed to be in Lur’e system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology
Wealth distribution on complex networks
Ichinomiya, Takashi
2012-12-01
We study the wealth distribution of the Bouchaud-Mézard model on complex networks. It is known from numerical simulations that this distribution depends on the topology of the network; however, no one has succeeded in explaining it. Using “adiabatic” and “independent” assumptions along with the central-limit theorem, we derive equations that determine the probability distribution function. The results are compared to those of simulations for various networks. We find good agreement between our theory and the simulations, except for the case of Watts-Strogatz networks with a low rewiring rate due to the breakdown of independent assumption.
Attractors in complex networks
Rodrigues, Alexandre A. P.
2017-10-01
In the framework of the generalized Lotka-Volterra model, solutions representing multispecies sequential competition can be predictable with high probability. In this paper, we show that it occurs because the corresponding "heteroclinic channel" forms part of an attractor. We prove that, generically, in an attracting heteroclinic network involving a finite number of hyperbolic and non-resonant saddle-equilibria whose linearization has only real eigenvalues, the connections corresponding to the most positive expanding eigenvalues form part of an attractor (observable in numerical simulations).
Studies on a network of complex neurons
Chakravarthy, Srinivasa V.; Ghosh, Joydeep
1993-09-01
In the last decade, much effort has been directed towards understanding the role of chaos in the brain. Work with rabbits reveals that in the resting state the electrical activity on the surface of the olfactory bulb is chaotic. But, when the animal is involved in a recognition task, the activity shifts to a specific pattern corresponding to the odor that is being recognized. Unstable, quasiperiodic behavior can be found in a class of conservative, deterministic physical systems called the Hamiltonian systems. In this paper, we formulate a complex version of Hopfield's network of real parameters and show that a variation on this model is a conservative system. Conditions under which the complex network can be used as a Content Addressable memory are studied. We also examine the effect of singularities of the complex sigmoid function on the network dynamics. The network exhibits unpredictable behavior at the singularities due to the failure of a uniqueness condition for the solution of the dynamic equations. On incorporating a weight adaptation rule, the structure of the resulting complex network equations is shown to have an interesting similarity with Kosko's Adaptive Bidirectional Associative Memory.
Measuring distances between complex networks
International Nuclear Information System (INIS)
Andrade, Roberto F.S.; Miranda, Jose G.V.; Pinho, Suani T.R.; Lobao, Thierry Petit
2008-01-01
A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade, J.G.V. Miranda, T.P. Lobao, Phys. Rev. E 73 (2006) 046101] is used to define a distance between networks with the same number of nodes. With such measure, expressed in terms of the matrix elements of the neighborhood matrices of each network, it is possible to compare, in a quantitative way, how far apart in the space of neighborhood matrices two networks are. The distance between these matrices depends on both the network topologies and the adopted node numberings. While the numbering of one network is fixed, a Monte Carlo algorithm is used to find the best numbering of the other network, in the sense that it minimizes the distance between the matrices. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise only from distinct topologies. This procedure ends up by providing a projection of the first network on the pattern of the second one. Examples are worked out allowing for a quantitative comparison for distances among distinct networks, as well as among distinct realizations of random networks
6th Workshop on Complex Networks
Simini, Filippo; Uzzo, Stephen; Wang, Dashun
2015-01-01
Elucidating the spatial and temporal dynamics of how things connect has become one of the most important areas of research in the 21st century. Network science now pervades nearly every science domain, resulting in new discoveries in a host of dynamic social and natural systems, including: how neurons connect and communicate in the brain, how information percolates within and among social networks, the evolution of science research through co-authorship networks, the spread of epidemics, and many other complex phenomena. Over the past decade, advances in computational power have put the tools of network analysis in the hands of increasing numbers of scientists, enabling more explorations of our world than ever before possible. Information science, social sciences, systems biology, ecosystems ecology, neuroscience and physics all benefit from this movement, which combines graph theory with data sciences to develop and validate theories about the world around us. This book brings together cutting-edge research ...
Information communication on complex networks
International Nuclear Information System (INIS)
Igarashi, Akito; Kawamoto, Hiroki; Maruyama, Takahiro; Morioka, Atsushi; Naganuma, Yuki
2013-01-01
Since communication networks such as the Internet, which is regarded as a complex network, have recently become a huge scale and a lot of data pass through them, the improvement of packet routing strategies for transport is one of the most significant themes in the study of computer networks. It is especially important to find routing strategies which can bear as many traffic as possible without congestion in complex networks. First, using neural networks, we introduce a strategy for packet routing on complex networks, where path lengths and queue lengths in nodes are taken into account within a framework of statistical physics. Secondly, instead of using shortest paths, we propose efficient paths which avoid hubs, nodes with a great many degrees, on scale-free networks with a weight of each node. We improve the heuristic algorithm proposed by Danila et. al. which optimizes step by step routing properties on congestion by using the information of betweenness, the probability of paths passing through a node in all optimal paths which are defined according to a rule, and mitigates the congestion. We confirm the new heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in much smaller number of iteration steps. Finally, We model virus spreading and data transfer on peer-to-peer (P2P) networks. Using mean-field approximation, we obtain an analytical formulation and emulate virus spreading on the network and compare the results with those of simulation. Moreover, we investigate the mitigation of information traffic congestion in the P2P networks.
Wang, Pengfei; Jin, Wei; Su, Huan
2018-04-01
This paper deals with the synchronization problem of a class of coupled stochastic complex-valued drive-response networks with time-varying delays via aperiodically intermittent adaptive control. Different from the previous works, the intermittent control is aperiodic and adaptive, and the restrictions on the control width and time delay are removed, which lead to a larger application scope for this control strategy. Then, based on the Lyapunov method and Kirchhoff's Matrix Tree Theorem as well as differential inequality techniques, several novel synchronization conditions are derived for the considered model. Specially, impulsive control is also considered, which can be seen as a special case of the aperiodically intermittent control when the control width tends to zero. And the corresponding synchronization criteria are given as well. As an application of the theoretical results, a class of stochastic complex-valued coupled oscillators with time-varying delays is studied, and the numerical simulations are also given to demonstrate the effectiveness of the control strategies.
Ranking in evolving complex networks
Liao, Hao; Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng; Zhou, Ming-Yang
2017-05-01
Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world problems because it affects how we access online information and products, how success and talent are evaluated in human activities, and how scarce resources are allocated by companies and policymakers, among others. This calls for a deep understanding of how existing ranking algorithms perform, and which are their possible biases that may impair their effectiveness. Many popular ranking algorithms (such as Google's PageRank) are static in nature and, as a consequence, they exhibit important shortcomings when applied to real networks that rapidly evolve in time. At the same time, recent advances in the understanding and modeling of evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account. The aim of this review is to survey the existing ranking algorithms, both static and time-aware, and their applications to evolving networks. We emphasize both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of network traffic, prediction of future links, and identification of significant nodes.
Controlling Complex Systems and Developing Dynamic Technology
Avizienis, Audrius Victor
In complex systems, control and understanding become intertwined. Following Ilya Prigogine, we define complex systems as having control parameters which mediate transitions between distinct modes of dynamical behavior. From this perspective, determining the nature of control parameters and demonstrating the associated dynamical phase transitions are practically equivalent and fundamental to engaging with complexity. In the first part of this work, a control parameter is determined for a non-equilibrium electrochemical system by studying a transition in the morphology of structures produced by an electroless deposition reaction. Specifically, changing the size of copper posts used as the substrate for growing metallic silver structures by the reduction of Ag+ from solution under diffusion-limited reaction conditions causes a dynamical phase transition in the crystal growth process. For Cu posts with edge lengths on the order of one micron, local forces promoting anisotropic growth predominate, and the reaction produces interconnected networks of Ag nanowires. As the post size is increased above 10 microns, the local interfacial growth reaction dynamics couple with the macroscopic diffusion field, leading to spatially propagating instabilities in the electrochemical potential which induce periodic branching during crystal growth, producing dendritic deposits. This result is interesting both as an example of control and understanding in a complex system, and as a useful combination of top-down lithography with bottom-up electrochemical self-assembly. The second part of this work focuses on the technological development of devices fabricated using this non-equilibrium electrochemical process, towards a goal of integrating a complex network as a dynamic functional component in a neuromorphic computing device. Self-assembled networks of silver nanowires were reacted with sulfur to produce interfacial "atomic switches": silver-silver sulfide junctions, which exhibit
A network dynamics approach to chemical reaction networks
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.
Pinning impulsive control algorithms for complex network
Energy Technology Data Exchange (ETDEWEB)
Sun, Wen [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China); Lü, Jinhu [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Chen, Shihua [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Yu, Xinghuo [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)
2014-03-15
In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.
Composing Music with Complex Networks
Liu, Xiaofan; Tse, Chi K.; Small, Michael
In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurrences. We analyze sample compositions from Bach, Mozart, Chopin, as well as other types of music including Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. Power-law exponents of degree distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be created by using a biased random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. The newly created music from complex networks will be played in the presentation.
Modification Propagation in Complex Networks
Mouronte, Mary Luz; Vargas, María Luisa; Moyano, Luis Gregorio; Algarra, Francisco Javier García; Del Pozo, Luis Salvador
To keep up with rapidly changing conditions, business systems and their associated networks are growing increasingly intricate as never before. By doing this, network management and operation costs not only rise, but are difficult even to measure. This fact must be regarded as a major constraint to system optimization initiatives, as well as a setback to derived economic benefits. In this work we introduce a simple model in order to estimate the relative cost associated to modification propagation in complex architectures. Our model can be used to anticipate costs caused by network evolution, as well as for planning and evaluating future architecture development while providing benefit optimization.
The Kuramoto model in complex networks
Rodrigues, Francisco A.; Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen
2016-01-01
Synchronization of an ensemble of oscillators is an emergent phenomenon present in several complex systems, ranging from social and physical to biological and technological systems. The most successful approach to describe how coherent behavior emerges in these complex systems is given by the paradigmatic Kuramoto model. This model has been traditionally studied in complete graphs. However, besides being intrinsically dynamical, complex systems present very heterogeneous structure, which can be represented as complex networks. This report is dedicated to review main contributions in the field of synchronization in networks of Kuramoto oscillators. In particular, we provide an overview of the impact of network patterns on the local and global dynamics of coupled phase oscillators. We cover many relevant topics, which encompass a description of the most used analytical approaches and the analysis of several numerical results. Furthermore, we discuss recent developments on variations of the Kuramoto model in networks, including the presence of noise and inertia. The rich potential for applications is discussed for special fields in engineering, neuroscience, physics and Earth science. Finally, we conclude by discussing problems that remain open after the last decade of intensive research on the Kuramoto model and point out some promising directions for future research.
Complex quantum network geometries: Evolution and phase transitions
Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao
2015-08-01
Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.
Management of complex dynamical systems
MacKay, R. S.
2018-02-01
Complex dynamical systems are systems with many interdependent components which evolve in time. One might wish to control their trajectories, but a more practical alternative is to control just their statistical behaviour. In many contexts this would be both sufficient and a more realistic goal, e.g. climate and socio-economic systems. I refer to it as ‘management’ of complex dynamical systems. In this paper, some mathematics for management of complex dynamical systems is developed in the weakly dependent regime, and questions are posed for the strongly dependent regime.
Complex-Valued Neural Networks
Hirose, Akira
2012-01-01
This book is the second enlarged and revised edition of the first successful monograph on complex-valued neural networks (CVNNs) published in 2006, which lends itself to graduate and undergraduate courses in electrical engineering, informatics, control engineering, mechanics, robotics, bioengineering, and other relevant fields. In the second edition the recent trends in CVNNs research are included, resulting in e.g. almost a doubled number of references. The parametron invented in 1954 is also referred to with discussion on analogy and disparity. Also various additional arguments on the advantages of the complex-valued neural networks enhancing the difference to real-valued neural networks are given in various sections. The book is useful for those beginning their studies, for instance, in adaptive signal processing for highly functional sensing and imaging, control in unknown and changing environment, robotics inspired by human neural systems, and brain-like information processing, as well as interdisciplina...
Oluoch, K.; Marwan, N.; Trauth, M.; Loew, A.; Kurths, J.
2012-04-01
The African continent lie almost entirely within the tropics and as such its (tropical) climate systems are predominantly governed by the heterogeneous, spatial and temporal variability of the Hadley and Walker circulations. The variabilities in these meridional and zonal circulations lead to intensification or suppression of the intensities, durations and frequencies of the Inter-tropical Convergence Zone (ICTZ) migration, trade winds and subtropical high-pressure regions and the continental monsoons. The above features play a central role in determining the African rainfall spatial and temporal variability patterns. The current understanding of these climate features and their influence on the rainfall patterns is not sufficiently understood. Like many real-world systems, atmospheric-oceanic processes exhibit non-linear properties that can be better explored using non-linear (NL) methods of time-series analysis. Over the recent years, the complex network approach has evolved as a powerful new player in understanding spatio-temporal dynamics and evolution of complex systems. Together with NL techniques, it is continuing to find new applications in many areas of science and technology including climate research. We would like to use these two powerful methods to understand the spatial structure and dynamics of African rainfall anomaly patterns and extremes. The method of event synchronization (ES) developed by Quiroga et al., 2002 and first applied to climate networks by Malik et al., 2011 looks at correlations with a dynamic time lag and as such, it is a more intuitive way to correlate a complex and heterogeneous system like climate networks than a fixed time delay most commonly used. On the other hand, the short comings of ES is its lack of vigorous test statistics for the significance level of the correlations, and the fact that only the events' time indices are synchronized while all information about how the relative intensities propagate within network
Recent Progress in Some Active Topics on Complex Networks
International Nuclear Information System (INIS)
Gu, J; Zhu, Y; Wang, Q A; Guo, L; Jiang, J; Chi, L; Li, W; Cai, X
2015-01-01
Complex networks have been extensively studied across many fields, especially in interdisciplinary areas. It has since long been recognized that topological structures and dynamics are important aspects for capturing the essence of complex networks. The recent years have also witnessed the emergence of several new elements which play important roles in network study. By combining the results of different research orientations in our group, we provide here a review of the recent advances in regards to spectral graph theory, opinion dynamics, interdependent networks, graph energy theory and temporal networks. We hope this will be helpful for the newcomers of those fields to discover new intriguing topics. (paper)
Multilevel Complex Networks and Systems
Caldarelli, Guido
2014-03-01
Network theory has been a powerful tool to model isolated complex systems. However, the classical approach does not take into account the interactions often present among different systems. Hence, the scientific community is nowadays concentrating the efforts on the foundations of new mathematical tools for understanding what happens when multiple networks interact. The case of economic and financial networks represents a paramount example of multilevel networks. In the case of trade, trade among countries the different levels can be described by the different granularity of the trading relations. Indeed, we have now data from the scale of consumers to that of the country level. In the case of financial institutions, we have a variety of levels at the same scale. For example one bank can appear in the interbank networks, ownership network and cds networks in which the same institution can take place. In both cases the systemically important vertices need to be determined by different procedures of centrality definition and community detection. In this talk I will present some specific cases of study related to these topics and present the regularities found. Acknowledged support from EU FET Project ``Multiplex'' 317532.
Managing Complex Dynamical Systems
Cox, John C.; Webster, Robert L.; Curry, Jeanie A.; Hammond, Kevin L.
2011-01-01
Management commonly engages in a variety of research designed to provide insight into the motivation and relationships of individuals, departments, organizations, etc. This paper demonstrates how the application of concepts associated with the analysis of complex systems applied to such data sets can yield enhanced insights for managerial action.
Fundamental structures of dynamic social networks
DEFF Research Database (Denmark)
Sekara, Vedran; Stopczynski, Arkadiusz; Jørgensen, Sune Lehmann
2016-01-01
Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships...... and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection......, and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals...
Studying Dynamics in Business Networks
DEFF Research Database (Denmark)
Andersen, Poul Houman; Anderson, Helen; Havila, Virpi
1998-01-01
This paper develops a theory on network dynamics using the concepts of role and position from sociological theory. Moreover, the theory is further tested using case studies from Denmark and Finland......This paper develops a theory on network dynamics using the concepts of role and position from sociological theory. Moreover, the theory is further tested using case studies from Denmark and Finland...
Network Physiology: How Organ Systems Dynamically Interact.
Bartsch, Ronny P; Liu, Kang K L; Bashan, Amir; Ivanov, Plamen Ch
2015-01-01
We systematically study how diverse physiologic systems in the human organism dynamically interact and collectively behave to produce distinct physiologic states and functions. This is a fundamental question in the new interdisciplinary field of Network Physiology, and has not been previously explored. Introducing the novel concept of Time Delay Stability (TDS), we develop a computational approach to identify and quantify networks of physiologic interactions from long-term continuous, multi-channel physiological recordings. We also develop a physiologically-motivated visualization framework to map networks of dynamical organ interactions to graphical objects encoded with information about the coupling strength of network links quantified using the TDS measure. Applying a system-wide integrative approach, we identify distinct patterns in the network structure of organ interactions, as well as the frequency bands through which these interactions are mediated. We establish first maps representing physiologic organ network interactions and discover basic rules underlying the complex hierarchical reorganization in physiologic networks with transitions across physiologic states. Our findings demonstrate a direct association between network topology and physiologic function, and provide new insights into understanding how health and distinct physiologic states emerge from networked interactions among nonlinear multi-component complex systems. The presented here investigations are initial steps in building a first atlas of dynamic interactions among organ systems.
Network Physiology: How Organ Systems Dynamically Interact
Bartsch, Ronny P.; Liu, Kang K. L.; Bashan, Amir; Ivanov, Plamen Ch.
2015-01-01
We systematically study how diverse physiologic systems in the human organism dynamically interact and collectively behave to produce distinct physiologic states and functions. This is a fundamental question in the new interdisciplinary field of Network Physiology, and has not been previously explored. Introducing the novel concept of Time Delay Stability (TDS), we develop a computational approach to identify and quantify networks of physiologic interactions from long-term continuous, multi-channel physiological recordings. We also develop a physiologically-motivated visualization framework to map networks of dynamical organ interactions to graphical objects encoded with information about the coupling strength of network links quantified using the TDS measure. Applying a system-wide integrative approach, we identify distinct patterns in the network structure of organ interactions, as well as the frequency bands through which these interactions are mediated. We establish first maps representing physiologic organ network interactions and discover basic rules underlying the complex hierarchical reorganization in physiologic networks with transitions across physiologic states. Our findings demonstrate a direct association between network topology and physiologic function, and provide new insights into understanding how health and distinct physiologic states emerge from networked interactions among nonlinear multi-component complex systems. The presented here investigations are initial steps in building a first atlas of dynamic interactions among organ systems. PMID:26555073
Relaxation of synchronization on complex networks.
Son, Seung-Woo; Jeong, Hawoong; Hong, Hyunsuk
2008-07-01
We study collective synchronization in a large number of coupled oscillators on various complex networks. In particular, we focus on the relaxation dynamics of the synchronization, which is important from the viewpoint of information transfer or the dynamics of system recovery from a perturbation. We measure the relaxation time tau that is required to establish global synchronization by varying the structural properties of the networks. It is found that the relaxation time in a strong-coupling regime (K>Kc) logarithmically increases with network size N , which is attributed to the initial random phase fluctuation given by O(N-1/2) . After elimination of the initial-phase fluctuation, the relaxation time is found to be independent of the system size; this implies that the local interaction that depends on the structural connectivity is irrelevant in the relaxation dynamics of the synchronization in the strong-coupling regime. The relaxation dynamics is analytically derived in a form independent of the system size, and it exhibits good consistency with numerical simulations. As an application, we also explore the recovery dynamics of the oscillators when perturbations enter the system.
Li, Xiao-Jian; Yang, Guang-Hong
2017-03-01
This paper is concerned with the problem of adaptive fault-tolerant synchronization control of a class of complex dynamical networks (CDNs) with actuator faults and unknown coupling weights. The considered input distribution matrix is assumed to be an arbitrary matrix, instead of a unit one. Within this framework, an adaptive fault-tolerant controller is designed to achieve synchronization for the CDN. Moreover, a convex combination technique and an important graph theory result are developed, such that the rigorous convergence analysis of synchronization errors can be conducted. In particular, it is shown that the proposed fault-tolerant synchronization control approach is valid for the CDN with both time-invariant and time-varying coupling weights. Finally, two simulation examples are provided to validate the effectiveness of the theoretical results.
Dynamic training algorithm for dynamic neural networks
International Nuclear Information System (INIS)
Tan, Y.; Van Cauwenberghe, A.; Liu, Z.
1996-01-01
The widely used backpropagation algorithm for training neural networks based on the gradient descent has a significant drawback of slow convergence. A Gauss-Newton method based recursive least squares (RLS) type algorithm with dynamic error backpropagation is presented to speed-up the learning procedure of neural networks with local recurrent terms. Finally, simulation examples concerning the applications of the RLS type algorithm to identification of nonlinear processes using a local recurrent neural network are also included in this paper
Role models for complex networks
Reichardt, J.; White, D. R.
2007-11-01
We present a framework for automatically decomposing (“block-modeling”) the functional classes of agents within a complex network. These classes are represented by the nodes of an image graph (“block model”) depicting the main patterns of connectivity and thus functional roles in the network. Using a first principles approach, we derive a measure for the fit of a network to any given image graph allowing objective hypothesis testing. From the properties of an optimal fit, we derive how to find the best fitting image graph directly from the network and present a criterion to avoid overfitting. The method can handle both two-mode and one-mode data, directed and undirected as well as weighted networks and allows for different types of links to be dealt with simultaneously. It is non-parametric and computationally efficient. The concepts of structural equivalence and modularity are found as special cases of our approach. We apply our method to the world trade network and analyze the roles individual countries play in the global economy.
5th International Workshop on Complex Networks and their Applications
Gaito, Sabrina; Quattrociocchi, Walter; Sala, Alessandra
2017-01-01
This book highlights cutting-edge research in the field of network science, offering scientists, researchers and graduate students a unique opportunity to catch up on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the fifth International Workshop on Complex Networks & their Applications (COMPLEX NETWORKS 2016), which took place in Milan during the last week of November 2016. The carefully selected papers are divided into 11 sections reflecting the diversity and richness of research areas in the field. More specifically, the following topics are covered: Network models; Network measures; Community structure; Network dynamics; Diffusion, epidemics and spreading processes; Resilience and control; Network visualization; Social and political networks; Networks in finance and economics; Biological and ecological networks; and Network analysis.
The Ultimatum Game in complex networks
International Nuclear Information System (INIS)
Sinatra, R; Gómez-Gardeñes, J; Latora, V; Iranzo, J; Floría, L M; Moreno, Y
2009-01-01
We address the problem of how cooperative (altruistic-like) behavior arises in natural and social systems by analyzing an Ultimatum Game in complex networks. Specifically, players of three types are considered: (a) empathetic, whose aspiration levels, and offers, are equal, (b) pragmatic, who do not distinguish between the different roles and aim to obtain the same benefit, and (c) agents whose aspiration levels, and offers, are independent. We analyze the asymptotic behavior of pure populations with different topologies using two kinds of strategic update rules: natural selection, which relies on replicator dynamics, and social penalty, inspired by the Bak–Sneppen dynamics, in which players are subject to a social selection rule penalizing not only the less fit individuals, but also their first neighbors. We discuss the emergence of fairness in the different settings and network topologies
Emergent explosive synchronization in adaptive complex networks
Avalos-Gaytán, Vanesa; Almendral, Juan A.; Leyva, I.; Battiston, F.; Nicosia, V.; Latora, V.; Boccaletti, S.
2018-04-01
Adaptation plays a fundamental role in shaping the structure of a complex network and improving its functional fitting. Even when increasing the level of synchronization in a biological system is considered as the main driving force for adaptation, there is evidence of negative effects induced by excessive synchronization. This indicates that coherence alone cannot be enough to explain all the structural features observed in many real-world networks. In this work, we propose an adaptive network model where the dynamical evolution of the node states toward synchronization is coupled with an evolution of the link weights based on an anti-Hebbian adaptive rule, which accounts for the presence of inhibitory effects in the system. We found that the emergent networks spontaneously develop the structural conditions to sustain explosive synchronization. Our results can enlighten the shaping mechanisms at the heart of the structural and dynamical organization of some relevant biological systems, namely, brain networks, for which the emergence of explosive synchronization has been observed.
Information Dynamics as Foundation for Network Management
2014-12-04
developed to adapt to channel dynamics in a mobile network environment. We devise a low- complexity online scheduling algorithm integrated with the...has been accepted for the Journal on Network and Systems Management in 2014. - RINC programmable platform for Infrastructure -as-a-Service public... backend servers. Rather than implementing load balancing in dedicated appliances, commodity SDN switches can perform this function. We design
Cognitive Dynamic Optical Networks
DEFF Research Database (Denmark)
de Miguel, Ignacio; Duran, Ramon J.; Lorenzo, Ruben M.
2013-01-01
Cognitive networks are a promising solution for the control of heterogeneous optical networks. We review their fundamentals as well as a number of applications developed in the framework of the EU FP7 CHRON project.......Cognitive networks are a promising solution for the control of heterogeneous optical networks. We review their fundamentals as well as a number of applications developed in the framework of the EU FP7 CHRON project....
Analysis of remote synchronization in complex networks
Gambuzza, Lucia Valentina; Cardillo, Alessio; Fiasconaro, Alessandro; Fortuna, Luigi; Gómez-Gardeñes, Jesus; Frasca, Mattia
2013-12-01
A novel regime of synchronization, called remote synchronization, where the peripheral nodes form a phase synchronized cluster not including the hub, was recently observed in star motifs [Bergner et al., Phys. Rev. E 85, 026208 (2012)]. We show the existence of a more general dynamical state of remote synchronization in arbitrary networks of coupled oscillators. This state is characterized by the synchronization of pairs of nodes that are not directly connected via a physical link or any sequence of synchronized nodes. This phenomenon is almost negligible in networks of phase oscillators as its underlying mechanism is the modulation of the amplitude of those intermediary nodes between the remotely synchronized units. Our findings thus show the ubiquity and robustness of these states and bridge the gap from their recent observation in simple toy graphs to complex networks.
Different Epidemic Models on Complex Networks
International Nuclear Information System (INIS)
Zhang Haifeng; Small, Michael; Fu Xinchu
2009-01-01
Models for diseases spreading are not just limited to SIS or SIR. For instance, for the spreading of AIDS/HIV, the susceptible individuals can be classified into different cases according to their immunity, and similarly, the infected individuals can be sorted into different classes according to their infectivity. Moreover, some diseases may develop through several stages. Many authors have shown that the individuals' relation can be viewed as a complex network. So in this paper, in order to better explain the dynamical behavior of epidemics, we consider different epidemic models on complex networks, and obtain the epidemic threshold for each case. Finally, we present numerical simulations for each case to verify our results.
Measurement methods on the complexity of network
Institute of Scientific and Technical Information of China (English)
LIN Lin; DING Gang; CHEN Guo-song
2010-01-01
Based on the size of network and the number of paths in the network,we proposed a model of topology complexity of a network to measure the topology complexity of the network.Based on the analyses of the effects of the number of the equipment,the types of equipment and the processing time of the node on the complexity of the network with the equipment-constrained,a complexity model of equipment-constrained network was constructed to measure the integrated complexity of the equipment-constrained network.The algorithms for the two models were also developed.An automatic generator of the random single label network was developed to test the models.The results show that the models can correctly evaluate the topology complexity and the integrated complexity of the networks.
Periodic dynamics in queuing networks
Energy Technology Data Exchange (ETDEWEB)
Addabbo, Tommaso [Information Engineering Department, University of Siena, Via Roma 56, 53100 Siena (Italy)], E-mail: addabbo@dii.unisi.it; Kocarev, Ljupco [Macedonian Academy of Sciences and Arts, bul. Krste Misirkov 2, P.O. Box 428, 1000 Skopje, Republic of Macedonia (Macedonia, The Former Yugoslav Republic of)], E-mail: lkocarev@ucsd.edu
2009-08-30
This paper deals with state-dependent open Markovian (or exponential) queuing networks, for which arrival and service rates, as well as routing probabilities, may depend on the queue lengths. For a network of this kind, following Mandelbaum and Pats, we provide a formal definition of its associated fluid model, and we focus on the relationships which may occur between the network stochastic dynamics and the deterministic dynamics of its corresponding fluid model, particularly focusing on queuing networks whose fluid models have global periodic attractors.
Nagurney, Anna; Besik, Deniz; Yu, Min
2018-04-01
In this paper, we construct a competitive food supply chain network model in which the profit-maximizing producers decide not only as to the volume of fresh produce produced and distributed using various supply chain network pathways, but they also decide, with the associated costs, on the initial quality of the fresh produce. Consumers, in turn, respond to the various producers' product outputs through the prices that they are willing to pay, given also the average quality associated with each producer or brand at the retail outlets. The quality of the fresh produce is captured through explicit formulae that incorporate time, temperature, and other link characteristics with links associated with processing, shipment, storage, etc. Capacities on links are also incorporated as well as upper bounds on the initial product quality of the firms at their production/harvesting sites. The governing concept of the competitive supply chain network model is that of Nash Equilibrium, for which alternative variational inequality formulations are derived, along with existence results. An algorithmic procedure, which can be interpreted as a discrete-time tatonnement process, is then described and applied to compute the equilibrium produce flow patterns and accompanying link Lagrange multipliers in a realistic case study, focusing on peaches, which includes disruptions.
Organization of excitable dynamics in hierarchical biological networks.
Directory of Open Access Journals (Sweden)
Mark Müller-Linow
Full Text Available This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.
Modular networks with hierarchical organization: The dynamical ...
Indian Academy of Sciences (India)
Most of the complex systems seen in real life also have associated dynamics [10], and the ... another example, this time a hierarchical structure, viz., the Cayley tree with b ..... natural constraints operating on networks in real life, such as the ...
Discerning connectivity from dynamics in climate networks
Czech Academy of Sciences Publication Activity Database
Paluš, Milan; Hartman, David; Hlinka, Jaroslav; Vejmelka, Martin
2011-01-01
Roč. 18, č. 5 (2011), s. 751-763 ISSN 1023-5809 R&D Projects: GA ČR GCP103/11/J068 Institutional research plan: CEZ:AV0Z10300504 Keywords : complex networks * climate dynamics * connectivity * North Atlantic Oscillation * solar activity Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.597, year: 2011
Cognitive Dynamic Optical Networks
DEFF Research Database (Denmark)
de Miguel, Ignacio; Duran, Ramon J.; Jimenez, Tamara
2013-01-01
The use of cognition is a promising element for the control of heterogeneous optical networks. Not only are cognitive networks able to sense current network conditions and act according to them, but they also take into account the knowledge acquired through past experiences; that is, they include...... learning with the aim of improving performance. In this paper, we review the fundamentals of cognitive networks and focus on their application to the optical networking area. In particular, a number of cognitive network architectures proposed so far, as well as their associated supporting technologies......, are reviewed. Moreover, several applications, mainly developed in the framework of the EU FP7 Cognitive Heterogeneous Reconfigurable Optical Network (CHRON) project, are also described....
On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy
Directory of Open Access Journals (Sweden)
Mikołaj Morzy
2017-01-01
Full Text Available One of the most popular methods of estimating the complexity of networks is to measure the entropy of network invariants, such as adjacency matrices or degree sequences. Unfortunately, entropy and all entropy-based information-theoretic measures have several vulnerabilities. These measures neither are independent of a particular representation of the network nor can capture the properties of the generative process, which produces the network. Instead, we advocate the use of the algorithmic entropy as the basis for complexity definition for networks. Algorithmic entropy (also known as Kolmogorov complexity or K-complexity for short evaluates the complexity of the description required for a lossless recreation of the network. This measure is not affected by a particular choice of network features and it does not depend on the method of network representation. We perform experiments on Shannon entropy and K-complexity for gradually evolving networks. The results of these experiments point to K-complexity as the more robust and reliable measure of network complexity. The original contribution of the paper includes the introduction of several new entropy-deceiving networks and the empirical comparison of entropy and K-complexity as fundamental quantities for constructing complexity measures for networks.
Entropy of dynamical social networks
Zhao, Kun; Karsai, Marton; Bianconi, Ginestra
2012-02-01
Dynamical social networks are evolving rapidly and are highly adaptive. Characterizing the information encoded in social networks is essential to gain insight into the structure, evolution, adaptability and dynamics. Recently entropy measures have been used to quantify the information in email correspondence, static networks and mobility patterns. Nevertheless, we still lack methods to quantify the information encoded in time-varying dynamical social networks. In this talk we present a model to quantify the entropy of dynamical social networks and use this model to analyze the data of phone-call communication. We show evidence that the entropy of the phone-call interaction network changes according to circadian rhythms. Moreover we show that social networks are extremely adaptive and are modified by the use of technologies such as mobile phone communication. Indeed the statistics of duration of phone-call is described by a Weibull distribution and is significantly different from the distribution of duration of face-to-face interactions in a conference. Finally we investigate how much the entropy of dynamical social networks changes in realistic models of phone-call or face-to face interactions characterizing in this way different type human social behavior.
Complex and adaptive dynamical systems a primer
Gros, Claudius
2013-01-01
Complex system theory is rapidly developing and gaining importance, providing tools and concepts central to our modern understanding of emergent phenomena. This primer offers an introduction to this area together with detailed coverage of the mathematics involved. All calculations are presented step by step and are straightforward to follow. This new third edition comes with new material, figures and exercises. Network theory, dynamical systems and information theory, the core of modern complex system sciences, are developed in the first three chapters, covering basic concepts and phenomena like small-world networks, bifurcation theory and information entropy. Further chapters use a modular approach to address the most important concepts in complex system sciences, with the emergence and self-organization playing a central role. Prominent examples are self-organized criticality in adaptive systems, life at the edge of chaos, hypercycles and coevolutionary avalanches, synchronization phenomena, absorbing phase...
Robust adaptive synchronization of general dynamical networks ...
Indian Academy of Sciences (India)
Robust adaptive synchronization; dynamical network; multiple delays; multiple uncertainties. ... Networks such as neural networks, communication transmission networks, social rela- tionship networks etc. ..... a very good effect. Pramana – J.
Design tools for complex dynamic security systems.
Energy Technology Data Exchange (ETDEWEB)
Byrne, Raymond Harry; Rigdon, James Brian; Rohrer, Brandon Robinson; Laguna, Glenn A.; Robinett, Rush D. III (.; ); Groom, Kenneth Neal; Wilson, David Gerald; Bickerstaff, Robert J.; Harrington, John J.
2007-01-01
The development of tools for complex dynamic security systems is not a straight forward engineering task but, rather, a scientific task where discovery of new scientific principles and math is necessary. For years, scientists have observed complex behavior but have had difficulty understanding it. Prominent examples include: insect colony organization, the stock market, molecular interactions, fractals, and emergent behavior. Engineering such systems will be an even greater challenge. This report explores four tools for engineered complex dynamic security systems: Partially Observable Markov Decision Process, Percolation Theory, Graph Theory, and Exergy/Entropy Theory. Additionally, enabling hardware technology for next generation security systems are described: a 100 node wireless sensor network, unmanned ground vehicle and unmanned aerial vehicle.
Complex and adaptive dynamical systems a primer
Gros, Claudius
2007-01-01
We are living in an ever more complex world, an epoch where human actions can accordingly acquire far-reaching potentialities. Complex and adaptive dynamical systems are ubiquitous in the world surrounding us and require us to adapt to new realities and the way of dealing with them. This primer has been developed with the aim of conveying a wide range of "commons-sense" knowledge in the field of quantitative complex system science at an introductory level, providing an entry point to this both fascinating and vitally important subject. The approach is modular and phenomenology driven. Examples of emerging phenomena of generic importance treated in this book are: -- The small world phenomenon in social and scale-free networks. -- Phase transitions and self-organized criticality in adaptive systems. -- Life at the edge of chaos and coevolutionary avalanches resulting from the unfolding of all living. -- The concept of living dynamical systems and emotional diffusive control within cognitive system theory. Techn...
Complex and Adaptive Dynamical Systems A Primer
Gros, Claudius
2011-01-01
We are living in an ever more complex world, an epoch where human actions can accordingly acquire far-reaching potentialities. Complex and adaptive dynamical systems are ubiquitous in the world surrounding us and require us to adapt to new realities and the way of dealing with them. This primer has been developed with the aim of conveying a wide range of "commons-sense" knowledge in the field of quantitative complex system science at an introductory level, providing an entry point to this both fascinating and vitally important subject. The approach is modular and phenomenology driven. Examples of emerging phenomena of generic importance treated in this book are: -- The small world phenomenon in social and scale-free networks. -- Phase transitions and self-organized criticality in adaptive systems. -- Life at the edge of chaos and coevolutionary avalanches resulting from the unfolding of all living. -- The concept of living dynamical systems and emotional diffusive control within cognitive system theory. Techn...
National Research Council Canada - National Science Library
Schott, Brian
2004-01-01
...: Declarative Languages and Execution Environment includes topographical soldier interface and a sensor network simulation environment for algorithm development, deployment planning, and operational support. Finally, Task 3...
Complex Human Dynamics From Mind to Societies
Winkowska-Nowak, Katarzyna; Brée, David
2013-01-01
This book, edited and authored by a closely collaborating network of social scientists and psychologists, recasts typical research topics in these fields into the language of nonlinear, dynamic and complex systems. The aim is to provide scientists with different backgrounds - physics, applied mathematics and computer sciences - with the opportunity to apply the tools of their trade to an altogether new range of possible applications. At the same time, this book will serve as a first reference for a new generation of social scientists and psychologists wishing to familiarize themselves with the new methodology and the "thinking in complexity".
Mathematical Properties of Complex Networks
Directory of Open Access Journals (Sweden)
Angel Garrido
2011-01-01
Full Text Available Many researchers are attempting to create systems which
mimic human thought, or understand speech, or beat to the best human chess-player [14]. Understanding intelligence and Creating intelligent artifacts both are the twin goals of Artificial Intelligence (AI.In more recent times, the interest is focused on problems related with Complex Networks [3, 5,6, 19], in particular on questions such as clustering search and identification. We attempt, in this paper, a panoramic vision of such mathematical methods in AI.
Structural Analysis of Complex Networks
Dehmer, Matthias
2011-01-01
Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science,
Robustness and Optimization of Complex Networks : Reconstructability, Algorithms and Modeling
Liu, D.
2013-01-01
The infrastructure networks, including the Internet, telecommunication networks, electrical power grids, transportation networks (road, railway, waterway, and airway networks), gas networks and water networks, are becoming more and more complex. The complex infrastructure networks are crucial to our
Complex-valued neural networks advances and applications
Hirose, Akira
2013-01-01
Presents the latest advances in complex-valued neural networks by demonstrating the theory in a wide range of applications Complex-valued neural networks is a rapidly developing neural network framework that utilizes complex arithmetic, exhibiting specific characteristics in its learning, self-organizing, and processing dynamics. They are highly suitable for processing complex amplitude, composed of amplitude and phase, which is one of the core concepts in physical systems to deal with electromagnetic, light, sonic/ultrasonic waves as well as quantum waves, namely, electron and
Dynamical systems on networks a tutorial
Porter, Mason A
2016-01-01
This volume is a tutorial for the study of dynamical systems on networks. It discusses both methodology and models, including spreading models for social and biological contagions. The authors focus especially on “simple” situations that are analytically tractable, because they are insightful and provide useful springboards for the study of more complicated scenarios. This tutorial, which also includes key pointers to the literature, should be helpful for junior and senior undergraduate students, graduate students, and researchers from mathematics, physics, and engineering who seek to study dynamical systems on networks but who may not have prior experience with graph theory or networks. Mason A. Porter is Professor of Nonlinear and Complex Systems at the Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, UK. He is also a member of the CABDyN Complexity Centre and a Tutorial Fellow of Somerville College. James P. Gleeson is Professor of Industrial and Appli...
Aguiar, Maíra
2015-12-01
Caused by micro-organisms that are pathogenic to the host, infectious diseases have caused debilitation and premature death to large portions of the human population, leading to serious social-economic concerns. The persistence and increase in the occurrence of infectious diseases as well the emergence or resurgence of vector-borne diseases are closely related with demographic factors such as the uncontrolled urbanization and remarkable population growth, political, social and economical changes, deforestation, development of resistance to insecticides and drugs and increased human travel. In recent years, mathematical modeling became an important tool for the understanding of infectious disease epidemiology and dynamics, addressing ideas about the components of host-pathogen interactions. Acting as a possible tool to understand, predict the spread of infectious diseases these models are also used to evaluate the introduction of intervention strategies like vector control and vaccination. Many scientific papers have been published recently on these topics, and most of the models developed try to incorporate factors focusing on several different aspects of the disease (and eventually biological aspects of the vector), which can imply rich dynamic behavior even in the most basic dynamical models. As one example to be cited, there is a minimalistic dengue model that has shown rich dynamic structures, with bifurcations (Hopf, pitchfork, torus and tangent bifurcations) up to chaotic attractors in unexpected parameter regions [1,2], which was able to describe the large fluctuations observed in empirical outbreak data [3,4].
A new information dimension of complex networks
International Nuclear Information System (INIS)
Wei, Daijun; Wei, Bo; Hu, Yong; Zhang, Haixin; Deng, Yong
2014-01-01
Highlights: •The proposed measure is more practical than the classical information dimension. •The difference of information for box in the box-covering algorithm is considered. •Results indicate the measure can capture the fractal property of complex networks. -- Abstract: The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks.
A new information dimension of complex networks
Energy Technology Data Exchange (ETDEWEB)
Wei, Daijun [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); School of Science, Hubei University for Nationalities, Enshi 445000 (China); Wei, Bo [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); Hu, Yong [Institute of Business Intelligence and Knowledge Discovery, Guangdong University of Foreign Studies, Guangzhou 510006 (China); Zhang, Haixin [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); Deng, Yong, E-mail: ydeng@swu.edu.cn [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); School of Engineering, Vanderbilt University, TN 37235 (United States)
2014-03-01
Highlights: •The proposed measure is more practical than the classical information dimension. •The difference of information for box in the box-covering algorithm is considered. •Results indicate the measure can capture the fractal property of complex networks. -- Abstract: The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks.
Coarse-graining complex dynamics
DEFF Research Database (Denmark)
Sibani, Paolo
2013-01-01
Continuous Time Random Walks (CTRW) are widely used to coarse-grain the evolution of systems jumping from a metastable sub-set of their configuration space, or trap, to another via rare intermittent events. The multi-scaled behavior typical of complex dynamics is provided by a fat...... macroscopic variables all produce identical long time relaxation behaviors. Hence, CTRW shed no light on the link between microscopic and macroscopic dynamics. We then highlight how a more recent approach, Record Dynamics (RD) provides a viable alternative, based on a very different set of physical ideas......: while CTRW make use of a renewal process involving identical traps of infinite size, RD embodies a dynamical entrenchment into a hierarchy of traps which are finite in size and possess different degrees of meta-stability. We show in particular how RD produces the stretched exponential, power...
Introduction to Focus Issue: Complex network perspectives on flow systems.
Donner, Reik V; Hernández-García, Emilio; Ser-Giacomi, Enrico
2017-03-01
During the last few years, complex network approaches have demonstrated their great potentials as versatile tools for exploring the structural as well as dynamical properties of dynamical systems from a variety of different fields. Among others, recent successful examples include (i) functional (correlation) network approaches to infer hidden statistical interrelationships between macroscopic regions of the human brain or the Earth's climate system, (ii) Lagrangian flow networks allowing to trace dynamically relevant fluid-flow structures in atmosphere, ocean or, more general, the phase space of complex systems, and (iii) time series networks unveiling fundamental organization principles of dynamical systems. In this spirit, complex network approaches have proven useful for data-driven learning of dynamical processes (like those acting within and between sub-components of the Earth's climate system) that are hidden to other analysis techniques. This Focus Issue presents a collection of contributions addressing the description of flows and associated transport processes from the network point of view and its relationship to other approaches which deal with fluid transport and mixing and/or use complex network techniques.
Dynamic capabilities and network benefits
Directory of Open Access Journals (Sweden)
Helge Svare
2017-01-01
Full Text Available The number of publicly funded initiatives to establish or strengthen networks and clusters, in order to enhance innovation, has been increasing. Returns on such investments vary, and the aim of this study is to explore to what extent the variation in benefits for firms participating in networks or clusters can be explained by their dynamic capabilities (DC. Based on survey data from five Norwegian networks, the results suggest that firms with higher DC are more successful in harvesting the potential benefits of being member of a network.
Rosati, Dora P.; Molina, Chai; Earn, David J. D.
2015-12-01
Human behaviour and disease dynamics can greatly influence each other. In particular, people often engage in self-protective behaviours that affect epidemic patterns (e.g., vaccination, use of barrier precautions, isolation, etc.). Self-protective measures usually have a mitigating effect on an epidemic [16], but can in principle have negative impacts at the population level [12,15,18]. The structure of underlying social and biological contact networks can significantly influence the specific ways in which population-level effects are manifested. Using a different contact network in a disease dynamics model-keeping all else equal-can yield very different epidemic patterns. For example, it has been shown that when individuals imitate their neighbours' vaccination decisions with some probability, this can lead to herd immunity in some networks [9], yet for other networks it can preserve clusters of susceptible individuals that can drive further outbreaks of infectious disease [12].
Complex and adaptive dynamical systems a primer
Gros, Claudius
2015-01-01
This primer offers readers an introduction to the central concepts that form our modern understanding of complex and emergent behavior, together with detailed coverage of accompanying mathematical methods. All calculations are presented step by step and are easy to follow. This new fourth edition has been fully reorganized and includes new chapters, figures and exercises. The core aspects of modern complex system sciences are presented in the first chapters, covering network theory, dynamical systems, bifurcation and catastrophe theory, chaos and adaptive processes, together with the principle of self-organization in reaction-diffusion systems and social animals. Modern information theoretical principles are treated in further chapters, together with the concept of self-organized criticality, gene regulation networks, hypercycles and coevolutionary avalanches, synchronization phenomena, absorbing phase transitions and the cognitive system approach to the brain. Technical course prerequisites are the standard ...
Quantifying the dynamics of coupled networks of switches and oscillators.
Directory of Open Access Journals (Sweden)
Matthew R Francis
Full Text Available Complex network dynamics have been analyzed with models of systems of coupled switches or systems of coupled oscillators. However, many complex systems are composed of components with diverse dynamics whose interactions drive the system's evolution. We, therefore, introduce a new modeling framework that describes the dynamics of networks composed of both oscillators and switches. Both oscillator synchronization and switch stability are preserved in these heterogeneous, coupled networks. Furthermore, this model recapitulates the qualitative dynamics for the yeast cell cycle consistent with the hypothesized dynamics resulting from decomposition of the regulatory network into dynamic motifs. Introducing feedback into the cell-cycle network induces qualitative dynamics analogous to limitless replicative potential that is a hallmark of cancer. As a result, the proposed model of switch and oscillator coupling provides the ability to incorporate mechanisms that underlie the synchronized stimulus response ubiquitous in biochemical systems.
Complexities of social networks: A Physicist's perspective
Sen, Parongama
2006-01-01
The review is a survey of the present status of research in social networks highlighting the topics of small world property, degree distributions, community structure, assortativity, modelling, dynamics and searching in social networks.
Characterizing time series: when Granger causality triggers complex networks
International Nuclear Information System (INIS)
Ge Tian; Cui Yindong; Lin Wei; Liu Chong; Kurths, Jürgen
2012-01-01
In this paper, we propose a new approach to characterize time series with noise perturbations in both the time and frequency domains by combining Granger causality and complex networks. We construct directed and weighted complex networks from time series and use representative network measures to describe their physical and topological properties. Through analyzing the typical dynamical behaviors of some physical models and the MIT-BIH human electrocardiogram data sets, we show that the proposed approach is able to capture and characterize various dynamics and has much potential for analyzing real-world time series of rather short length. (paper)
Characterizing time series: when Granger causality triggers complex networks
Ge, Tian; Cui, Yindong; Lin, Wei; Kurths, Jürgen; Liu, Chong
2012-08-01
In this paper, we propose a new approach to characterize time series with noise perturbations in both the time and frequency domains by combining Granger causality and complex networks. We construct directed and weighted complex networks from time series and use representative network measures to describe their physical and topological properties. Through analyzing the typical dynamical behaviors of some physical models and the MIT-BIHMassachusetts Institute of Technology-Beth Israel Hospital. human electrocardiogram data sets, we show that the proposed approach is able to capture and characterize various dynamics and has much potential for analyzing real-world time series of rather short length.
Combinations of complex dynamical systems
Pilgrim, Kevin M
2003-01-01
This work is a research-level monograph whose goal is to develop a general combination, decomposition, and structure theory for branched coverings of the two-sphere to itself, regarded as the combinatorial and topological objects which arise in the classification of certain holomorphic dynamical systems on the Riemann sphere. It is intended for researchers interested in the classification of those complex one-dimensional dynamical systems which are in some loose sense tame. The program is motivated by the dictionary between the theories of iterated rational maps and Kleinian groups.
Critical Fluctuations in Spatial Complex Networks
Bradde, Serena; Caccioli, Fabio; Dall'Asta, Luca; Bianconi, Ginestra
2010-05-01
An anomalous mean-field solution is known to capture the nontrivial phase diagram of the Ising model in annealed complex networks. Nevertheless, the critical fluctuations in random complex networks remain mean field. Here we show that a breakdown of this scenario can be obtained when complex networks are embedded in geometrical spaces. Through the analysis of the Ising model on annealed spatial networks, we reveal, in particular, the spectral properties of networks responsible for critical fluctuations and we generalize the Ginsburg criterion to complex topologies.
Robustness and structure of complex networks
Shao, Shuai
This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks
Complex Network Analysis of Guangzhou Metro
Yasir Tariq Mohmand; Fahad Mehmood; Fahd Amjad; Nedim Makarevic
2015-01-01
The structure and properties of public transportation networks can provide suggestions for urban planning and public policies. This study contributes a complex network analysis of the Guangzhou metro. The metro network has 236 kilometers of track and is the 6th busiest metro system of the world. In this paper topological properties of the network are explored. We observed that the network displays small world properties and is assortative in nature. The network possesses a high average degree...
Complexity Characteristics of Currency Networks
Gorski, A. Z.; Drozdz, S.; Kwapien, J.; Oswiecimka, P.
2006-11-01
A large set of daily FOREX time series is analyzed. The corresponding correlation matrices (CM) are constructed for USD, EUR and PLN used as the base currencies. The triangle rule is interpreted as constraints reducing the number of independent returns. The CM spectrum is computed and compared with the cases of shuffled currencies and a fictitious random currency taken as a base currency. The Minimal Spanning Tree (MST) graphs are calculated and the clustering effects for strong currencies are found. It is shown that for MSTs the node rank has power like, scale free behavior. Finally, the scaling exponents are evaluated and found in the range analogous to those identified recently for various complex networks.
Spatially Distributed Social Complex Networks
Directory of Open Access Journals (Sweden)
Gerald F. Frasco
2014-01-01
Full Text Available We propose a bare-bones stochastic model that takes into account both the geographical distribution of people within a country and their complex network of connections. The model, which is designed to give rise to a scale-free network of social connections and to visually resemble the geographical spread seen in satellite pictures of the Earth at night, gives rise to a power-law distribution for the ranking of cities by population size (but for the largest cities and reflects the notion that highly connected individuals tend to live in highly populated areas. It also yields some interesting insights regarding Gibrat’s law for the rates of city growth (by population size, in partial support of the findings in a recent analysis of real data [Rozenfeld et al., Proc. Natl. Acad. Sci. U.S.A. 105, 18702 (2008.]. The model produces a nontrivial relation between city population and city population density and a superlinear relationship between social connectivity and city population, both of which seem quite in line with real data.
Spatially Distributed Social Complex Networks
Frasco, Gerald F.; Sun, Jie; Rozenfeld, Hernán D.; ben-Avraham, Daniel
2014-01-01
We propose a bare-bones stochastic model that takes into account both the geographical distribution of people within a country and their complex network of connections. The model, which is designed to give rise to a scale-free network of social connections and to visually resemble the geographical spread seen in satellite pictures of the Earth at night, gives rise to a power-law distribution for the ranking of cities by population size (but for the largest cities) and reflects the notion that highly connected individuals tend to live in highly populated areas. It also yields some interesting insights regarding Gibrat's law for the rates of city growth (by population size), in partial support of the findings in a recent analysis of real data [Rozenfeld et al., Proc. Natl. Acad. Sci. U.S.A. 105, 18702 (2008).]. The model produces a nontrivial relation between city population and city population density and a superlinear relationship between social connectivity and city population, both of which seem quite in line with real data.
Complexity in neuronal noise depends on network interconnectivity.
Serletis, Demitre; Zalay, Osbert C; Valiante, Taufik A; Bardakjian, Berj L; Carlen, Peter L
2011-06-01
"Noise," or noise-like activity (NLA), defines background electrical membrane potential fluctuations at the cellular level of the nervous system, comprising an important aspect of brain dynamics. Using whole-cell voltage recordings from fast-spiking stratum oriens interneurons and stratum pyramidale neurons located in the CA3 region of the intact mouse hippocampus, we applied complexity measures from dynamical systems theory (i.e., 1/f(γ) noise and correlation dimension) and found evidence for complexity in neuronal NLA, ranging from high- to low-complexity dynamics. Importantly, these high- and low-complexity signal features were largely dependent on gap junction and chemical synaptic transmission. Progressive neuronal isolation from the surrounding local network via gap junction blockade (abolishing gap junction-dependent spikelets) and then chemical synaptic blockade (abolishing excitatory and inhibitory post-synaptic potentials), or the reverse order of these treatments, resulted in emergence of high-complexity NLA dynamics. Restoring local network interconnectivity via blockade washout resulted in resolution to low-complexity behavior. These results suggest that the observed increase in background NLA complexity is the result of reduced network interconnectivity, thereby highlighting the potential importance of the NLA signal to the study of network state transitions arising in normal and abnormal brain dynamics (such as in epilepsy, for example).
Spreading to localized targets in complex networks
Sun, Ye; Ma, Long; Zeng, An; Wang, Wen-Xu
2016-12-01
As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and news propagation, the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, the influential spreaders identified by our method can effectively avoid infecting the non-target nodes in the spreading process.
Exploring the morphospace of communication efficiency in complex networks.
Directory of Open Access Journals (Sweden)
Joaquín Goñi
Full Text Available Graph theoretical analysis has played a key role in characterizing global features of the topology of complex networks, describing diverse systems such as protein interactions, food webs, social relations and brain connectivity. How system elements communicate with each other depends not only on the structure of the network, but also on the nature of the system's dynamics which are constrained by the amount of knowledge and resources available for communication processes. Complementing widely used measures that capture efficiency under the assumption that communication preferentially follows shortest paths across the network ("routing", we define analytic measures directed at characterizing network communication when signals flow in a random walk process ("diffusion". The two dimensions of routing and diffusion efficiency define a morphospace for complex networks, with different network topologies characterized by different combinations of efficiency measures and thus occupying different regions of this space. We explore the relation of network topologies and efficiency measures by examining canonical network models, by evolving networks using a multi-objective optimization strategy, and by investigating real-world network data sets. Within the efficiency morphospace, specific aspects of network topology that differentially favor efficient communication for routing and diffusion processes are identified. Charting regions of the morphospace that are occupied by canonical, evolved or real networks allows inferences about the limits of communication efficiency imposed by connectivity and dynamics, as well as the underlying selection pressures that have shaped network topology.
Nonlinear Dynamics, Chaotic and Complex Systems
Infeld, E.; Zelazny, R.; Galkowski, A.
2011-04-01
Part I. Dynamic Systems Bifurcation Theory and Chaos: 1. Chaos in random dynamical systems V. M. Gunldach; 2. Controlling chaos using embedded unstable periodic orbits: the problem of optimal periodic orbits B. R. Hunt and E. Ott; 3. Chaotic tracer dynamics in open hydrodynamical flows G. Karolyi, A. Pentek, T. Tel and Z. Toroczkai; 4. Homoclinic chaos L. P. Shilnikov; Part II. Spatially Extended Systems: 5. Hydrodynamics of relativistic probability flows I. Bialynicki-Birula; 6. Waves in ionic reaction-diffusion-migration systems P. Hasal, V. Nevoral, I. Schreiber, H. Sevcikova, D. Snita, and M. Marek; 7. Anomalous scaling in turbulence: a field theoretical approach V. Lvov and I. Procaccia; 8. Abelian sandpile cellular automata M. Markosova; 9. Transport in an incompletely chaotic magnetic field F. Spineanu; Part III. Dynamical Chaos Quantum Physics and Foundations Of Statistical Mechanics: 10. Non-equilibrium statistical mechanics and ergodic theory L. A. Bunimovich; 11. Pseudochaos in statistical physics B. Chirikov; 12. Foundations of non-equilibrium statistical mechanics J. P. Dougherty; 13. Thermomechanical particle simulations W. G. Hoover, H. A. Posch, C. H. Dellago, O. Kum, C. G. Hoover, A. J. De Groot and B. L. Holian; 14. Quantum dynamics on a Markov background and irreversibility B. Pavlov; 15. Time chaos and the laws of nature I. Prigogine and D. J. Driebe; 16. Evolutionary Q and cognitive systems: dynamic entropies and predictability of evolutionary processes W. Ebeling; 17. Spatiotemporal chaos information processing in neural networks H. Szu; 18. Phase transitions and learning in neural networks C. Van den Broeck; 19. Synthesis of chaos A. Vanecek and S. Celikovsky; 20. Computational complexity of continuous problems H. Wozniakowski; Part IV. Complex Systems As An Interface Between Natural Sciences and Environmental Social and Economic Sciences: 21. Stochastic differential geometry in finance studies V. G. Makhankov; Part V. Conference Banquet
Decoding network dynamics in cancer
DEFF Research Database (Denmark)
Linding, Rune
2014-01-01
Biological systems are composed of highly dynamic and interconnected molecular networks that drive biological decision processes. The goal of network biology is to describe, quantify and predict the information flow and functional behaviour of living systems in a formal language and with an accur......Biological systems are composed of highly dynamic and interconnected molecular networks that drive biological decision processes. The goal of network biology is to describe, quantify and predict the information flow and functional behaviour of living systems in a formal language...... and with an accuracy that parallels our characterisation of other physical systems such as Jumbo-jets. Decades of targeted molecular and biological studies have led to numerous pathway models of developmental and disease related processes. However, so far no global models have been derived from pathways, capable...
Complex network analysis of state spaces for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)
2008-01-15
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.
Complex network analysis of state spaces for random Boolean networks
International Nuclear Information System (INIS)
Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya
2008-01-01
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two
Dynamics of associating networks
Tang, Shengchang; Habicht, Axel; Wang, Muzhou; Li, Shuaili; Seiffert, Sebastian; Olsen, Bradley
Associating polymers offer important technological solutions to renewable and self-healing materials, conducting electrolytes for energy storage and transport, and vehicles for cell and protein deliveries. The interplay between polymer topologies and association chemistries warrants new interesting physics from associating networks, yet poses significant challenges to study these systems over a wide range of time and length scales. In a series of studies, we explored self-diffusion mechanisms of associating polymers above the percolation threshold, by combining experimental measurements using forced Rayleigh scattering and analytical insights from a two-state model. Despite the differences in molecular structures, a universal super-diffusion phenomenon is observed when diffusion of molecular species is hindered by dissociation kinetics. The molecular dissociation rate can be used to renormalize shear rheology data, which yields an unprecedented time-temperature-concentration superposition. The obtained shear rheology master curves provide experimental evidence of the relaxation hierarchy in associating networks.
Modelling flow dynamics in water distribution networks using ...
African Journals Online (AJOL)
One such approach is the Artificial Neural Networks (ANNs) technique. The advantage of ANNs is that they are robust and can be used to model complex linear and non-linear systems without making implicit assumptions. ANNs can be trained to forecast flow dynamics in a water distribution network. Such flow dynamics ...
Outer Synchronization of Complex Networks by Impulse
International Nuclear Information System (INIS)
Sun Wen; Yan Zizong; Chen Shihua; Lü Jinhu
2011-01-01
This paper investigates outer synchronization of complex networks, especially, outer complete synchronization and outer anti-synchronization between the driving network and the response network. Employing the impulsive control method which is uncontinuous, simple, efficient, low-cost and easy to implement in practical applications, we obtain some sufficient conditions of outer complete synchronization and outer anti-synchronization between two complex networks. Numerical simulations demonstrate the effectiveness of the proposed impulsive control scheme. (general)
Complex networks: Dynamics and security
Indian Academy of Sciences (India)
a theory and numerical support to place the cascading phenomenon in the context .... for a given degree distribution, and self- and repeated links are forbidden. ..... Now we present numerical verification of our main result concerning the effect ...
Inferring topologies of complex networks with hidden variables.
Wu, Xiaoqun; Wang, Weihan; Zheng, Wei Xing
2012-10-01
Network topology plays a crucial role in determining a network's intrinsic dynamics and function, thus understanding and modeling the topology of a complex network will lead to greater knowledge of its evolutionary mechanisms and to a better understanding of its behaviors. In the past few years, topology identification of complex networks has received increasing interest and wide attention. Many approaches have been developed for this purpose, including synchronization-based identification, information-theoretic methods, and intelligent optimization algorithms. However, inferring interaction patterns from observed dynamical time series is still challenging, especially in the absence of knowledge of nodal dynamics and in the presence of system noise. The purpose of this work is to present a simple and efficient approach to inferring the topologies of such complex networks. The proposed approach is called "piecewise partial Granger causality." It measures the cause-effect connections of nonlinear time series influenced by hidden variables. One commonly used testing network, two regular networks with a few additional links, and small-world networks are used to evaluate the performance and illustrate the influence of network parameters on the proposed approach. Application to experimental data further demonstrates the validity and robustness of our method.
Centrality Robustness and Link Prediction in Complex Social Networks
DEFF Research Database (Denmark)
Davidsen, Søren Atmakuri; Ortiz-Arroyo, Daniel
2012-01-01
. Secondly, we present a method to predict edges in dynamic social networks. Our experimental results indicate that the robustness of the centrality measures applied to more realistic social networks follows a predictable pattern and that the use of temporal statistics could improve the accuracy achieved......This chapter addresses two important issues in social network analysis that involve uncertainty. Firstly, we present am analysis on the robustness of centrality measures that extend the work presented in Borgati et al. using three types of complex network structures and one real social network...
Su, Housheng
2013-01-01
Synchronization, consensus and flocking are ubiquitous requirements in networked systems. Pinning Control of Complex Networked Systems investigates these requirements by using the pinning control strategy, which aims to control the whole dynamical network with huge numbers of nodes by imposing controllers for only a fraction of the nodes. As the direct control of every node in a dynamical network with huge numbers of nodes might be impossible or unnecessary, it’s then very important to use the pinning control strategy for the synchronization of complex dynamical networks. The research on pinning control strategy in consensus and flocking of multi-agent systems can not only help us to better understand the mechanisms of natural collective phenomena, but also benefit applications in mobile sensor/robot networks. This book offers a valuable resource for researchers and engineers working in the fields of control theory and control engineering. Housheng Su is an Associate Professor at the Department of Contro...
Rapid Mission Design for Dynamically Complex Environments
National Aeronautics and Space Administration — Designing trajectories in dynamically complex environments is very challenging and easily becomes an intractable problem. More complex planning implies potentially...
Analyzing complex networks evolution through Information Theory quantifiers
International Nuclear Information System (INIS)
Carpi, Laura C.; Rosso, Osvaldo A.; Saco, Patricia M.; Ravetti, Martin Gomez
2011-01-01
A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Nino/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.
Analyzing complex networks evolution through Information Theory quantifiers
Energy Technology Data Exchange (ETDEWEB)
Carpi, Laura C., E-mail: Laura.Carpi@studentmail.newcastle.edu.a [Civil, Surveying and Environmental Engineering, University of Newcastle, University Drive, Callaghan NSW 2308 (Australia); Departamento de Fisica, Instituto de Ciencias Exatas, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Belo Horizonte (31270-901), MG (Brazil); Rosso, Osvaldo A., E-mail: rosso@fisica.ufmg.b [Departamento de Fisica, Instituto de Ciencias Exatas, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Belo Horizonte (31270-901), MG (Brazil); Chaos and Biology Group, Instituto de Calculo, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellon II, Ciudad Universitaria, 1428 Ciudad de Buenos Aires (Argentina); Saco, Patricia M., E-mail: Patricia.Saco@newcastle.edu.a [Civil, Surveying and Environmental Engineering, University of Newcastle, University Drive, Callaghan NSW 2308 (Australia); Departamento de Hidraulica, Facultad de Ciencias Exactas, Ingenieria y Agrimensura, Universidad Nacional de Rosario, Avenida Pellegrini 250, Rosario (Argentina); Ravetti, Martin Gomez, E-mail: martin.ravetti@dep.ufmg.b [Departamento de Engenharia de Producao, Universidade Federal de Minas Gerais, Av. Antonio Carlos, 6627, Belo Horizonte (31270-901), MG (Brazil)
2011-01-24
A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Nino/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.
Solving Dynamic Battlespace Movement Problems Using Dynamic Distributed Computer Networks
National Research Council Canada - National Science Library
Bradford, Robert
2000-01-01
.... The thesis designs a system using this architecture that invokes operations research network optimization algorithms to solve problems involving movement of people and equipment over dynamic road networks...
The complex network reliability and influential nodes
Li, Kai; He, Yongfeng
2017-08-01
In order to study the complex network node important degree and reliability, considering semi-local centrality, betweenness centrality and PageRank algorithm, through the simulation method to gradually remove nodes and recalculate the importance in the random network, small world network and scale-free network. Study the relationship between the largest connected component and node removed proportion, the research results show that betweenness centrality and PageRank algorithm based on the global information network are more effective for evaluating the importance of nodes, and the reliability of the network is related to the network topology.
Temporal node centrality in complex networks
Kim, Hyoungshick; Anderson, Ross
2012-02-01
Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.
Wavelength converter placement in optical networks with dynamic traffic
DEFF Research Database (Denmark)
Buron, Jakob Due; Ruepp, Sarah Renée; Wessing, Henrik
2008-01-01
We evaluate the connection provisioning performance of GMPLS-controlled wavelength routed networks under dynamic traffic load and using three different wavelength converter placement heuristics. Results show that a simple uniform placement heuristic matches the performance of complex heuristics...
Traffic of indistinguishable particles in complex networks
International Nuclear Information System (INIS)
Qing-Kuan, Meng; Jian-Yang, Zhu
2009-01-01
In this paper, we apply a simple walk mechanism to the study of the traffic of many indistinguishable particles in complex networks. The network with particles stands for a particle system, and every vertex in the network stands for a quantum state with the corresponding energy determined by the vertex degree. Although the particles are indistinguishable, the quantum states can be distinguished. When the many indistinguishable particles walk randomly in the system for a long enough time and the system reaches dynamic equilibrium, we find that under different restrictive conditions the particle distributions satisfy different forms, including the Bose–Einstein distribution, the Fermi–Dirac distribution and the non-Fermi distribution (as we temporarily call it). As for the Bose–Einstein distribution, we find that only if the particle density is larger than zero, with increasing particle density, do more and more particles condense in the lowest energy level. While the particle density is very low, the particle distribution transforms from the quantum statistical form to the classically statistical form, i.e., transforms from the Bose distribution or the Fermi distribution to the Boltzmann distribution. The numerical results fit well with the analytical predictions
Nonparametric inference of network structure and dynamics
Peixoto, Tiago P.
The network structure of complex systems determine their function and serve as evidence for the evolutionary mechanisms that lie behind them. Despite considerable effort in recent years, it remains an open challenge to formulate general descriptions of the large-scale structure of network systems, and how to reliably extract such information from data. Although many approaches have been proposed, few methods attempt to gauge the statistical significance of the uncovered structures, and hence the majority cannot reliably separate actual structure from stochastic fluctuations. Due to the sheer size and high-dimensionality of many networks, this represents a major limitation that prevents meaningful interpretations of the results obtained with such nonstatistical methods. In this talk, I will show how these issues can be tackled in a principled and efficient fashion by formulating appropriate generative models of network structure that can have their parameters inferred from data. By employing a Bayesian description of such models, the inference can be performed in a nonparametric fashion, that does not require any a priori knowledge or ad hoc assumptions about the data. I will show how this approach can be used to perform model comparison, and how hierarchical models yield the most appropriate trade-off between model complexity and quality of fit based on the statistical evidence present in the data. I will also show how this general approach can be elegantly extended to networks with edge attributes, that are embedded in latent spaces, and that change in time. The latter is obtained via a fully dynamic generative network model, based on arbitrary-order Markov chains, that can also be inferred in a nonparametric fashion. Throughout the talk I will illustrate the application of the methods with many empirical networks such as the internet at the autonomous systems level, the global airport network, the network of actors and films, social networks, citations among
Approaching human language with complex networks
Cong, Jin; Liu, Haitao
2014-12-01
The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics).
Loppini, Alessandro
2018-03-01
Complex network theory represents a comprehensive mathematical framework to investigate biological systems, ranging from sub-cellular and cellular scales up to large-scale networks describing species interactions and ecological systems. In their exhaustive and comprehensive work [1], Gosak et al. discuss several scenarios in which the network approach was able to uncover general properties and underlying mechanisms of cells organization and regulation, tissue functions and cell/tissue failure in pathology, by the study of chemical reaction networks, structural networks and functional connectivities.
Hamiltonian dynamics for complex food webs
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.
Synchronizability on complex networks via pinning control
Indian Academy of Sciences (India)
Keywords. Complex network; the pinning synchronization; synchronizability. ... The findings reveal the relationship between the decreasing speed of maximum eigenvalue sequence of the principal submatrices for coupling matrix and the synchronizability on complex networks via pinning control. We discuss the ...
Modelling the structure of complex networks
DEFF Research Database (Denmark)
Herlau, Tue
networks has been independently studied as mathematical objects in their own right. As such, there has been both an increased demand for statistical methods for complex networks as well as a quickly growing mathematical literature on the subject. In this dissertation we explore aspects of modelling complex....... The next chapters will treat some of the various symmetries, representer theorems and probabilistic structures often deployed in the modelling complex networks, the construction of sampling methods and various network models. The introductory chapters will serve to provide context for the included written...
Narrowing the gap between network models and real complex systems
Viamontes Esquivel, Alcides
2014-01-01
Simple network models that focus only on graph topology or, at best, basic interactions are often insufficient to capture all the aspects of a dynamic complex system. In this thesis, I explore those limitations, and some concrete methods of resolving them. I argue that, in order to succeed at interpreting and influencing complex systems, we need to take into account slightly more complex parts, interactions and information flows in our models.This thesis supports that affirmation with five a...
Synchronization in complex networks with adaptive coupling
International Nuclear Information System (INIS)
Zhang Rong; Hu Manfeng; Xu Zhenyuan
2007-01-01
Generally it is very difficult to realized synchronization for some complex networks. In order to synchronize, the coupling coefficient of networks has to be very large, especially when the number of coupled nodes is larger. In this Letter, we consider the problem of synchronization in complex networks with adaptive coupling. A new concept about asymptotic stability is presented, then we proved by using the well-known LaSalle invariance principle, that the state of such a complex network can synchronize an arbitrary assigned state of an isolated node of the network as long as the feedback gain is positive. Unified system is simulated as the nodes of adaptive coupling complex networks with different topologies
Contagion on complex networks with persuasion
Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu
2016-03-01
The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense.
Self-organized topology of recurrence-based complex networks
International Nuclear Information System (INIS)
Yang, Hui; Liu, Gang
2013-01-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
Combined Heuristic Attack Strategy on Complex Networks
Directory of Open Access Journals (Sweden)
Marek Šimon
2017-01-01
Full Text Available Usually, the existence of a complex network is considered an advantage feature and efforts are made to increase its robustness against an attack. However, there exist also harmful and/or malicious networks, from social ones like spreading hoax, corruption, phishing, extremist ideology, and terrorist support up to computer networks spreading computer viruses or DDoS attack software or even biological networks of carriers or transport centers spreading disease among the population. New attack strategy can be therefore used against malicious networks, as well as in a worst-case scenario test for robustness of a useful network. A common measure of robustness of networks is their disintegration level after removal of a fraction of nodes. This robustness can be calculated as a ratio of the number of nodes of the greatest remaining network component against the number of nodes in the original network. Our paper presents a combination of heuristics optimized for an attack on a complex network to achieve its greatest disintegration. Nodes are deleted sequentially based on a heuristic criterion. Efficiency of classical attack approaches is compared to the proposed approach on Barabási-Albert, scale-free with tunable power-law exponent, and Erdős-Rényi models of complex networks and on real-world networks. Our attack strategy results in a faster disintegration, which is counterbalanced by its slightly increased computational demands.
Asynchronous networks: modularization of dynamics theorem
Bick, Christian; Field, Michael
2017-02-01
Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.
Weighted Complex Network Analysis of Shanghai Rail Transit System
Directory of Open Access Journals (Sweden)
Yingying Xing
2016-01-01
Full Text Available With increasing passenger flows and construction scale, Shanghai rail transit system (RTS has entered a new era of networking operation. In addition, the structure and properties of the RTS network have great implications for urban traffic planning, design, and management. Thus, it is necessary to acquire their network properties and impacts. In this paper, the Shanghai RTS, as well as passenger flows, will be investigated by using complex network theory. Both the topological and dynamic properties of the RTS network are analyzed and the largest connected cluster is introduced to assess the reliability and robustness of the RTS network. Simulation results show that the distribution of nodes strength exhibits a power-law behavior and Shanghai RTS network shows a strong weighted rich-club effect. This study also indicates that the intentional attacks are more detrimental to the RTS network than to the random weighted network, but the random attacks can cause slightly more damage to the random weighted network than to the RTS network. Our results provide a richer view of complex weighted networks in real world and possibilities of risk analysis and policy decisions for the RTS operation department.
Bipartite quantum states and random complex networks
International Nuclear Information System (INIS)
Garnerone, Silvano; Zanardi, Paolo; Giorda, Paolo
2012-01-01
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs, we derive an analytic expression for the averaged entanglement entropy S-bar while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling S-bar ∼c log n +g e where both the prefactor c and the sub-leading O(1) term g e are characteristic of the different classes of complex networks. In particular, g e encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool for the analysis of large complex networks with non-trivial topological properties. (paper)
Enabling Controlling Complex Networks with Local Topological Information.
Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene
2018-03-15
Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.
Wang, Xibo; Ge, Jianping; Wei, Wendong; Li, Hanshi; Wu, Chen; Zhu, Ge
2016-01-01
Rare earths (RE) are critical materials in many high-technology products. Due to the uneven distribution and important functions for industrial development, most countries import RE from a handful of suppliers that are rich in RE, such as China. However, because of the rapid growth of RE exploitation and pollution of the mining and production process, some of the main suppliers have gradually tended to reduce the RE production and exports. Especially in the last decade, international RE trade has been changing in the trade community and trade volume. Based on complex network theory, we built an unweighted and weighted network to explore the evolution of the communities and identify the role of the major countries in the RE trade. The results show that an international RE trade network was dispersed and unstable because of the existence of five to nine trade communities in the unweighted network and four to eight trade communities in the weighted network in the past 13 years. Moreover, trade groups formed due to the great influence of geopolitical relations. China was often associated with the South America and African countries in the same trade group. In addition, Japan, China, the United States, and Germany had the largest impacts on international RE trade from 2002 to 2014. Last, some policy suggestions were highlighted according to the results.
Directory of Open Access Journals (Sweden)
Xibo Wang
Full Text Available Rare earths (RE are critical materials in many high-technology products. Due to the uneven distribution and important functions for industrial development, most countries import RE from a handful of suppliers that are rich in RE, such as China. However, because of the rapid growth of RE exploitation and pollution of the mining and production process, some of the main suppliers have gradually tended to reduce the RE production and exports. Especially in the last decade, international RE trade has been changing in the trade community and trade volume. Based on complex network theory, we built an unweighted and weighted network to explore the evolution of the communities and identify the role of the major countries in the RE trade. The results show that an international RE trade network was dispersed and unstable because of the existence of five to nine trade communities in the unweighted network and four to eight trade communities in the weighted network in the past 13 years. Moreover, trade groups formed due to the great influence of geopolitical relations. China was often associated with the South America and African countries in the same trade group. In addition, Japan, China, the United States, and Germany had the largest impacts on international RE trade from 2002 to 2014. Last, some policy suggestions were highlighted according to the results.
Blockmodeling techniques for complex networks
Ball, Brian Joseph
The class of network models known as stochastic blockmodels has recently been gaining popularity. In this dissertation, we present new work that uses blockmodels to answer questions about networks. We create a blockmodel based on the idea of link communities, which naturally gives rise to overlapping vertex communities. We derive a fast and accurate algorithm to fit the model to networks. This model can be related to another blockmodel, which allows the method to efficiently find nonoverlapping communities as well. We then create a heuristic based on the link community model whose use is to find the correct number of communities in a network. The heuristic is based on intuitive corrections to likelihood ratio tests. It does a good job finding the correct number of communities in both real networks and synthetic networks generated from the link communities model. Two commonly studied types of networks are citation networks, where research papers cite other papers, and coauthorship networks, where authors are connected if they've written a paper together. We study a multi-modal network from a large dataset of Physics publications that is the combination of the two, allowing for directed links between papers as citations, and an undirected edge between a scientist and a paper if they helped to write it. This allows for new insights on the relation between social interaction and scientific production. We also have the publication dates of papers, which lets us track our measures over time. Finally, we create a stochastic model for ranking vertices in a semi-directed network. The probability of connection between two vertices depends on the difference of their ranks. When this model is fit to high school friendship networks, the ranks appear to correspond with a measure of social status. Students have reciprocated and some unreciprocated edges with other students of closely similar rank that correspond to true friendship, and claim an aspirational friendship with a much
Deterministic ripple-spreading model for complex networks.
Hu, Xiao-Bing; Wang, Ming; Leeson, Mark S; Hines, Evor L; Di Paolo, Ezequiel
2011-04-01
This paper proposes a deterministic complex network model, which is inspired by the natural ripple-spreading phenomenon. The motivations and main advantages of the model are the following: (i) The establishment of many real-world networks is a dynamic process, where it is often observed that the influence of a few local events spreads out through nodes, and then largely determines the final network topology. Obviously, this dynamic process involves many spatial and temporal factors. By simulating the natural ripple-spreading process, this paper reports a very natural way to set up a spatial and temporal model for such complex networks. (ii) Existing relevant network models are all stochastic models, i.e., with a given input, they cannot output a unique topology. Differently, the proposed ripple-spreading model can uniquely determine the final network topology, and at the same time, the stochastic feature of complex networks is captured by randomly initializing ripple-spreading related parameters. (iii) The proposed model can use an easily manageable number of ripple-spreading related parameters to precisely describe a network topology, which is more memory efficient when compared with traditional adjacency matrix or similar memory-expensive data structures. (iv) The ripple-spreading model has a very good potential for both extensions and applications.
The Complexity of Dynamics in Small Neural Circuits.
Directory of Open Access Journals (Sweden)
Diego Fasoli
2016-08-01
Full Text Available 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.
Dynamic social networks based on movement
Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.
2016-01-01
Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.
Cut Based Method for Comparing Complex Networks.
Liu, Qun; Dong, Zhishan; Wang, En
2018-03-23
Revealing the underlying similarity of various complex networks has become both a popular and interdisciplinary topic, with a plethora of relevant application domains. The essence of the similarity here is that network features of the same network type are highly similar, while the features of different kinds of networks present low similarity. In this paper, we introduce and explore a new method for comparing various complex networks based on the cut distance. We show correspondence between the cut distance and the similarity of two networks. This correspondence allows us to consider a broad range of complex networks and explicitly compare various networks with high accuracy. Various machine learning technologies such as genetic algorithms, nearest neighbor classification, and model selection are employed during the comparison process. Our cut method is shown to be suited for comparisons of undirected networks and directed networks, as well as weighted networks. In the model selection process, the results demonstrate that our approach outperforms other state-of-the-art methods with respect to accuracy.
Controlling centrality in complex networks
Nicosia, V.; Criado, R.; Romance, M.; Russo, G.; Latora, V.
2012-01-01
Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by popularity, and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We show that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We found that many large networks from the real world have surprisingly small controlling sets, containing even less than 5 – 10% of the nodes. PMID:22355732
Towards an Information Theory of Complex Networks
Dehmer, Matthias; Mehler, Alexander
2011-01-01
For over a decade, complex networks have steadily grown as an important tool across a broad array of academic disciplines, with applications ranging from physics to social media. A tightly organized collection of carefully-selected papers on the subject, Towards an Information Theory of Complex Networks: Statistical Methods and Applications presents theoretical and practical results about information-theoretic and statistical models of complex networks in the natural sciences and humanities. The book's major goal is to advocate and promote a combination of graph-theoretic, information-theoreti
Applications of Nonlinear Dynamics Model and Design of Complex Systems
In, Visarath; Palacios, Antonio
2009-01-01
This edited book is aimed at interdisciplinary, device-oriented, applications of nonlinear science theory and methods in complex systems. In particular, applications directed to nonlinear phenomena with space and time characteristics. Examples include: complex networks of magnetic sensor systems, coupled nano-mechanical oscillators, nano-detectors, microscale devices, stochastic resonance in multi-dimensional chaotic systems, biosensors, and stochastic signal quantization. "applications of nonlinear dynamics: model and design of complex systems" brings together the work of scientists and engineers that are applying ideas and methods from nonlinear dynamics to design and fabricate complex systems.
Structural constraints in complex networks
International Nuclear Information System (INIS)
Zhou, S; Mondragon, R J
2007-01-01
We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich-club connectivity are preserved. We consider three real networks, the autonomous system (AS)-Internet, protein interaction and scientific collaboration. We show that for a given degree distribution, the rich-club connectivity is sensitive to the degree-degree correlation, and on the other hand the degree-degree correlation is constrained by the rich-club connectivity. In particular, in the case of the Internet, the assortative coefficient is always negative and a minor change in its value can reverse the network's rich-club structure completely; while fixing the degree distribution and the rich-club connectivity restricts the assortative coefficient to such a narrow range, that a reasonable model of the Internet can be produced by considering mainly the degree distribution and the rich-club connectivity. We also comment on the suitability of using the maximal random network as a null model to assess the rich-club connectivity in real networks
Major component analysis of dynamic networks of physiologic organ interactions
International Nuclear Information System (INIS)
Liu, Kang K L; Ma, Qianli D Y; Ivanov, Plamen Ch; Bartsch, Ronny P
2015-01-01
The human organism is a complex network of interconnected organ systems, where the behavior of one system affects the dynamics of other systems. Identifying and quantifying dynamical networks of diverse physiologic systems under varied conditions is a challenge due to the complexity in the output dynamics of the individual systems and the transient and nonlinear characteristics of their coupling. We introduce a novel computational method based on the concept of time delay stability and major component analysis to investigate how organ systems interact as a network to coordinate their functions. We analyze a large database of continuously recorded multi-channel physiologic signals from healthy young subjects during night-time sleep. We identify a network of dynamic interactions between key physiologic systems in the human organism. Further, we find that each physiologic state is characterized by a distinct network structure with different relative contribution from individual organ systems to the global network dynamics. Specifically, we observe a gradual decrease in the strength of coupling of heart and respiration to the rest of the network with transition from wake to deep sleep, and in contrast, an increased relative contribution to network dynamics from chin and leg muscle tone and eye movement, demonstrating a robust association between network topology and physiologic function. (paper)
Chaotic, fractional, and complex dynamics new insights and perspectives
Macau, Elbert; Sanjuan, Miguel
2018-01-01
The book presents nonlinear, chaotic and fractional dynamics, complex systems and networks, together with cutting-edge research on related topics. The fifteen chapters – written by leading scientists working in the areas of nonlinear, chaotic and fractional dynamics, as well as complex systems and networks – offer an extensive overview of cutting-edge research on a range of topics, including fundamental and applied research. These include but are not limited to aspects of synchronization in complex dynamical systems, universality features in systems with specific fractional dynamics, and chaotic scattering. As such, the book provides an excellent and timely snapshot of the current state of research, blending the insights and experiences of many prominent researchers.
Adaptive-network models of collective dynamics
Zschaler, G.
2012-09-01
Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge
Control of multidimensional systems on complex network
Bagnoli, Franco; Battistelli, Giorgio; Chisci, Luigi; Fanelli, Duccio
2017-01-01
Multidimensional systems coupled via complex networks are widespread in nature and thus frequently invoked for a large plethora of interesting applications. From ecology to physics, individual entities in mutual interactions are grouped in families, homogeneous in kind. These latter interact selectively, through a sequence of self-consistently regulated steps, whose deeply rooted architecture is stored in the assigned matrix of connections. The asymptotic equilibrium eventually attained by the system, and its associated stability, can be assessed by employing standard nonlinear dynamics tools. For many practical applications, it is however important to externally drive the system towards a desired equilibrium, which is resilient, hence stable, to external perturbations. To this end we here consider a system made up of N interacting populations which evolve according to general rate equations, bearing attributes of universality. One species is added to the pool of interacting families and used as a dynamical controller to induce novel stable equilibria. Use can be made of the root locus method to shape the needed control, in terms of intrinsic reactivity and adopted protocol of injection. The proposed method is tested on both synthetic and real data, thus enabling to demonstrate its robustness and versatility. PMID:28892493
Modelling, Estimation and Control of Networked Complex Systems
Chiuso, Alessandro; Frasca, Mattia; Rizzo, Alessandro; Schenato, Luca; Zampieri, Sandro
2009-01-01
The paradigm of complexity is pervading both science and engineering, leading to the emergence of novel approaches oriented at the development of a systemic view of the phenomena under study; the definition of powerful tools for modelling, estimation, and control; and the cross-fertilization of different disciplines and approaches. This book is devoted to networked systems which are one of the most promising paradigms of complexity. It is demonstrated that complex, dynamical networks are powerful tools to model, estimate, and control many interesting phenomena, like agent coordination, synchronization, social and economics events, networks of critical infrastructures, resources allocation, information processing, or control over communication networks. Moreover, it is shown how the recent technological advances in wireless communication and decreasing in cost and size of electronic devices are promoting the appearance of large inexpensive interconnected systems, each with computational, sensing and mobile cap...
High-resolution method for evolving complex interface networks
Pan, Shucheng; Hu, Xiangyu Y.; Adams, Nikolaus A.
2018-04-01
In this paper we describe a high-resolution transport formulation of the regional level-set approach for an improved prediction of the evolution of complex interface networks. The novelty of this method is twofold: (i) construction of local level sets and reconstruction of a global level set, (ii) local transport of the interface network by employing high-order spatial discretization schemes for improved representation of complex topologies. Various numerical test cases of multi-region flow problems, including triple-point advection, single vortex flow, mean curvature flow, normal driven flow, dry foam dynamics and shock-bubble interaction show that the method is accurate and suitable for a wide range of complex interface-network evolutions. Its overall computational cost is comparable to the Semi-Lagrangian regional level-set method while the prediction accuracy is significantly improved. The approach thus offers a viable alternative to previous interface-network level-set method.
Anomaly Detection in Dynamic Networks
Energy Technology Data Exchange (ETDEWEB)
Turcotte, Melissa [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2014-10-14
Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the
An Efficient Hierarchy Algorithm for Community Detection in Complex Networks
Directory of Open Access Journals (Sweden)
Lili Zhang
2014-01-01
Full Text Available Community structure is one of the most fundamental and important topology characteristics of complex networks. The research on community structure has wide applications and is very important for analyzing the topology structure, understanding the functions, finding the hidden properties, and forecasting the time-varying of the networks. This paper analyzes some related algorithms and proposes a new algorithm—CN agglomerative algorithm based on graph theory and the local connectedness of network to find communities in network. We show this algorithm is distributed and polynomial; meanwhile the simulations show it is accurate and fine-grained. Furthermore, we modify this algorithm to get one modified CN algorithm and apply it to dynamic complex networks, and the simulations also verify that the modified CN algorithm has high accuracy too.
Modeling the propagation of mobile malware on complex networks
Liu, Wanping; Liu, Chao; Yang, Zheng; Liu, Xiaoyang; Zhang, Yihao; Wei, Zuxue
2016-08-01
In this paper, the spreading behavior of malware across mobile devices is addressed. By introducing complex networks to model mobile networks, which follows the power-law degree distribution, a novel epidemic model for mobile malware propagation is proposed. The spreading threshold that guarantees the dynamics of the model is calculated. Theoretically, the asymptotic stability of the malware-free equilibrium is confirmed when the threshold is below the unity, and the global stability is further proved under some sufficient conditions. The influences of different model parameters as well as the network topology on malware propagation are also analyzed. Our theoretical studies and numerical simulations show that networks with higher heterogeneity conduce to the diffusion of malware, and complex networks with lower power-law exponents benefit malware spreading.
Complex networks principles, methods and applications
Latora, Vito; Russo, Giovanni
2017-01-01
Networks constitute the backbone of complex systems, from the human brain to computer communications, transport infrastructures to online social systems and metabolic reactions to financial markets. Characterising their structure improves our understanding of the physical, biological, economic and social phenomena that shape our world. Rigorous and thorough, this textbook presents a detailed overview of the new theory and methods of network science. Covering algorithms for graph exploration, node ranking and network generation, among the others, the book allows students to experiment with network models and real-world data sets, providing them with a deep understanding of the basics of network theory and its practical applications. Systems of growing complexity are examined in detail, challenging students to increase their level of skill. An engaging presentation of the important principles of network science makes this the perfect reference for researchers and undergraduate and graduate students in physics, ...
Stability analysis of impulsive parabolic complex networks
Energy Technology Data Exchange (ETDEWEB)
Wang Jinliang, E-mail: wangjinliang1984@yahoo.com.cn [Science and Technology on Aircraft Control Laboratory, School of Automation Science and Electrical Engineering, Beihang University, XueYuan Road, No. 37, HaiDian District, Beijing 100191 (China); Wu Huaining [Science and Technology on Aircraft Control Laboratory, School of Automation Science and Electrical Engineering, Beihang University, XueYuan Road, No. 37, HaiDian District, Beijing 100191 (China)
2011-11-15
Highlights: > Two impulsive parabolic complex network models are proposed. > The global exponential stability of impulsive parabolic complex networks are considered. > The robust global exponential stability of impulsive parabolic complex networks are considered. - Abstract: In the present paper, two kinds of impulsive parabolic complex networks (IPCNs) are considered. In the first one, all nodes have the same time-varying delay. In the second one, different nodes have different time-varying delays. Using the Lyapunov functional method combined with the inequality techniques, some global exponential stability criteria are derived for the IPCNs. Furthermore, several robust global exponential stability conditions are proposed to take uncertainties in the parameters of the IPCNs into account. Finally, numerical simulations are presented to illustrate the effectiveness of the results obtained here.
Stability analysis of impulsive parabolic complex networks
International Nuclear Information System (INIS)
Wang Jinliang; Wu Huaining
2011-01-01
Highlights: → Two impulsive parabolic complex network models are proposed. → The global exponential stability of impulsive parabolic complex networks are considered. → The robust global exponential stability of impulsive parabolic complex networks are considered. - Abstract: In the present paper, two kinds of impulsive parabolic complex networks (IPCNs) are considered. In the first one, all nodes have the same time-varying delay. In the second one, different nodes have different time-varying delays. Using the Lyapunov functional method combined with the inequality techniques, some global exponential stability criteria are derived for the IPCNs. Furthermore, several robust global exponential stability conditions are proposed to take uncertainties in the parameters of the IPCNs into account. Finally, numerical simulations are presented to illustrate the effectiveness of the results obtained here.
Cognitive dynamics: complexity and creativity
Energy Technology Data Exchange (ETDEWEB)
Arecchi, F Tito [Dipartimento di Fisica, Universita di Firenze (Italy); Istituto Nazionale di Ottica Applicata, Florence (Italy)
2007-05-15
A scientific problem described within a given code is mapped by a corresponding computational problem. We call (algorithmic) complexity the bit length of the shortest instruction which solves the problem. Deterministic chaos in general affects a dynamical system making the corresponding problem experimentally and computationally heavy, since one must reset the initial conditions at a rate higher than that of information loss (Kolmogorov entropy). One can control chaos by adding to the system new degrees of freedom (information swapping: information lost by chaos is replaced by that arising from the new degrees of freedom). This implies a change of code, or a new augmented model. Within a single code, changing hypotheses is equivalent to fixing different sets of control parameters, each with a different a-priori probability, to be then confirmed and transformed to an a-posteriori probability via Bayes theorem. Sequential application of Bayes rule is nothing else than the Darwinian strategy in evolutionary biology. The sequence is a steepest ascent algorithm, which stops once maximum probability has been reached. At this point the hypothesis exploration stops. By changing code (and hence the set of relevant variables) one can start again to formulate new classes of hypotheses. We call creativity the action of code changing, which is guided by hints not formalized within the previous code, whence not accessible to a computer. We call semantic complexity the number of different scientific codes, or models, that describe a situation. It is however a fuzzy concept, in so far as this number changes due to interaction of the operator with the context. These considerations are illustrated with reference to a cognitive task, starting from synchronization of neuron arrays in a perceptual area and tracing the putative path towards a model building. Since this is a report on work in progress, we skip technicalities in order to stress the gist of the question, and provide
Cognitive dynamics: complexity and creativity
International Nuclear Information System (INIS)
Arecchi, F Tito
2007-01-01
A scientific problem described within a given code is mapped by a corresponding computational problem. We call (algorithmic) complexity the bit length of the shortest instruction which solves the problem. Deterministic chaos in general affects a dynamical system making the corresponding problem experimentally and computationally heavy, since one must reset the initial conditions at a rate higher than that of information loss (Kolmogorov entropy). One can control chaos by adding to the system new degrees of freedom (information swapping: information lost by chaos is replaced by that arising from the new degrees of freedom). This implies a change of code, or a new augmented model. Within a single code, changing hypotheses is equivalent to fixing different sets of control parameters, each with a different a-priori probability, to be then confirmed and transformed to an a-posteriori probability via Bayes theorem. Sequential application of Bayes rule is nothing else than the Darwinian strategy in evolutionary biology. The sequence is a steepest ascent algorithm, which stops once maximum probability has been reached. At this point the hypothesis exploration stops. By changing code (and hence the set of relevant variables) one can start again to formulate new classes of hypotheses. We call creativity the action of code changing, which is guided by hints not formalized within the previous code, whence not accessible to a computer. We call semantic complexity the number of different scientific codes, or models, that describe a situation. It is however a fuzzy concept, in so far as this number changes due to interaction of the operator with the context. These considerations are illustrated with reference to a cognitive task, starting from synchronization of neuron arrays in a perceptual area and tracing the putative path towards a model building. Since this is a report on work in progress, we skip technicalities in order to stress the gist of the question, and provide
Epidemics spreading in interconnected complex networks
International Nuclear Information System (INIS)
Wang, Y.; Xiao, G.
2012-01-01
We study epidemic spreading in two interconnected complex networks. It is found that in our model the epidemic threshold of the interconnected network is always lower than that in any of the two component networks. Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. Theoretical analysis and simulation results show that, generally speaking, the epidemic size is not significantly affected by the inter-network correlation. In interdependent networks which can be viewed as a special case of interconnected networks, however, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant. -- Highlights: ► We study epidemic spreading in two interconnected complex networks. ► The epidemic threshold is lower than that in any of the two networks. And Interconnection correlation has impacts on threshold and average outbreak size. ► Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. ► We demonstrated and proved that Interconnection correlation does not affect epidemic size significantly. ► In interdependent networks, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant.
Epidemics spreading in interconnected complex networks
Energy Technology Data Exchange (ETDEWEB)
Wang, Y. [School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798 (Singapore); Institute of High Performance Computing, Agency for Science, Technology and Research (A-STAR), Singapore 138632 (Singapore); Xiao, G., E-mail: egxxiao@ntu.edu.sg [School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798 (Singapore)
2012-09-03
We study epidemic spreading in two interconnected complex networks. It is found that in our model the epidemic threshold of the interconnected network is always lower than that in any of the two component networks. Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. Theoretical analysis and simulation results show that, generally speaking, the epidemic size is not significantly affected by the inter-network correlation. In interdependent networks which can be viewed as a special case of interconnected networks, however, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant. -- Highlights: ► We study epidemic spreading in two interconnected complex networks. ► The epidemic threshold is lower than that in any of the two networks. And Interconnection correlation has impacts on threshold and average outbreak size. ► Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. ► We demonstrated and proved that Interconnection correlation does not affect epidemic size significantly. ► In interdependent networks, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant.
Abnormal cascading failure spreading on complex networks
International Nuclear Information System (INIS)
Wang, Jianwei; Sun, Enhui; Xu, Bo; Li, Peng; Ni, Chengzhang
2016-01-01
Applying the mechanism of the preferential selection of the flow destination, we develop a new method to quantify the initial load on an edge, of which the flow is transported along the path with the shortest edge weight between two nodes. Considering the node weight, we propose a cascading model on the edge and investigate cascading dynamics induced by the removal of the edge with the largest load. We perform simulated attacks on four types of constructed networks and two actual networks and observe an interesting and counterintuitive phenomenon of the cascading spreading, i.e., gradually improving the capacity of nodes does not lead to the monotonous increase in the robustness of these networks against cascading failures. The non monotonous behavior of cascading dynamics is well explained by the analysis on a simple graph. We additionally study the effect of the parameter of the node weight on cascading dynamics and evaluate the network robustness by a new metric.
Synchronization in complex networks with a modular structure.
Park, Kwangho; Lai, Ying-Cheng; Gupte, Saurabh; Kim, Jong-Won
2006-03-01
Networks with a community (or modular) structure arise in social and biological sciences. In such a network individuals tend to form local communities, each having dense internal connections. The linkage among the communities is, however, much more sparse. The dynamics on modular networks, for instance synchronization, may be of great social or biological interest. (Here by synchronization we mean some synchronous behavior among the nodes in the network, not, for example, partially synchronous behavior in the network or the synchronizability of the network with some external dynamics.) By using a recent theoretical framework, the master-stability approach originally introduced by Pecora and Carroll in the context of synchronization in coupled nonlinear oscillators, we address synchronization in complex modular networks. We use a prototype model and develop scaling relations for the network synchronizability with respect to variations of some key network structural parameters. Our results indicate that random, long-range links among distant modules is the key to synchronization. As an application we suggest a viable strategy to achieve synchronous behavior in social networks.
Attack robustness and centrality of complex networks.
Directory of Open Access Journals (Sweden)
Swami Iyer
Full Text Available Many complex systems can be described by networks, in which the constituent components are represented by vertices and the connections between the components are represented by edges between the corresponding vertices. A fundamental issue concerning complex networked systems is the robustness of the overall system to the failure of its constituent parts. Since the degree to which a networked system continues to function, as its component parts are degraded, typically depends on the integrity of the underlying network, the question of system robustness can be addressed by analyzing how the network structure changes as vertices are removed. Previous work has considered how the structure of complex networks change as vertices are removed uniformly at random, in decreasing order of their degree, or in decreasing order of their betweenness centrality. Here we extend these studies by investigating the effect on network structure of targeting vertices for removal based on a wider range of non-local measures of potential importance than simply degree or betweenness. We consider the effect of such targeted vertex removal on model networks with different degree distributions, clustering coefficients and assortativity coefficients, and for a variety of empirical networks.
Symbolic dynamics and description of complexity
International Nuclear Information System (INIS)
Hao Bailin.
1992-10-01
Symbolic dynamics provides a general framework to describe complexity of dynamical behaviour. After a discussion of the state of the filed special emphasis will be made on the role of transfer matrix (the Stefan matrix) both in deriving the grammar from known symbolic dynamics and in extracting the rules from experimental data. The block structure of the Stefan matrix may serve as another indicator of complexity of the associated dynamics. (author). 33 refs, 6 figs
Weighted Complex Network Analysis of Pakistan Highways
Directory of Open Access Journals (Sweden)
Yasir Tariq Mohmand
2013-01-01
Full Text Available The structure and properties of public transportation networks have great implications in urban planning, public policies, and infectious disease control. This study contributes a weighted complex network analysis of travel routes on the national highway network of Pakistan. The network is responsible for handling 75 percent of the road traffic yet is largely inadequate, poor, and unreliable. The highway network displays small world properties and is assortative in nature. Based on the betweenness centrality of the nodes, the most important cities are identified as this could help in identifying the potential congestion points in the network. Keeping in view the strategic location of Pakistan, such a study is of practical importance and could provide opportunities for policy makers to improve the performance of the highway network.
Predicting and Controlling Complex Networks
2015-06-22
ubiquitous in nature and fundamental to evolution in ecosystems. However, a significant chal- lenge remains in understanding biodiversity since, by the...networks and control . . . . . . . . . . . . . . . . . . . 7 3.4 Pattern formation, synchronization and outbreak of biodiversity in cyclically...Ni, Y.-C. Lai, and C. Grebogi, “Pattern formation, synchronization and outbreak of biodiversity in cyclically competing games,” Physical Review E 83
Complex dynamical invariants for two-dimensional complex potentials
Indian Academy of Sciences (India)
Abstract. Complex dynamical invariants are searched out for two-dimensional complex poten- tials using rationalization method within the framework of an extended complex phase space characterized by x = x1 + ip3, y = x2 + ip4, px = p1 + ix3, py = p2 + ix4. It is found that the cubic oscillator and shifted harmonic oscillator ...
Computational Modeling of Complex Protein Activity Networks
Schivo, Stefano; Leijten, Jeroen; Karperien, Marcel; Post, Janine N.; Prignet, Claude
2017-01-01
Because of the numerous entities interacting, the complexity of the networks that regulate cell fate makes it impossible to analyze and understand them using the human brain alone. Computational modeling is a powerful method to unravel complex systems. We recently described the development of a
The Dynamics of network and dyad level supply management
DEFF Research Database (Denmark)
Ellegaard, Chris
-supplier relation and its immediate network context, are presented. In analysing the data, the dynamic interdependency between management of one level and management of the other, will be demonstrated. The analysis reveals a need for an alternating approach to supply management, which takes the dynamic complexity...
Visualization and Analysis of Complex Covert Networks
DEFF Research Database (Denmark)
Memon, Bisharat
systems that are covert and hence inherently complex. My Ph.D. is positioned within the wider framework of CrimeFighter project. The framework envisions a number of key knowledge management processes that are involved in the workflow, and the toolbox provides supporting tools to assist human end......This report discusses and summarize the results of my work so far in relation to my Ph.D. project entitled "Visualization and Analysis of Complex Covert Networks". The focus of my research is primarily on development of methods and supporting tools for visualization and analysis of networked......-users (intelligence analysts) in harvesting, filtering, storing, managing, structuring, mining, analyzing, interpreting, and visualizing data about offensive networks. The methods and tools proposed and discussed in this work can also be applied to analysis of more generic complex networks....
The physics of communicability in complex networks
International Nuclear Information System (INIS)
Estrada, Ernesto; Hatano, Naomichi; Benzi, Michele
2012-01-01
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that communication and correlation in networks can take place through many more routes than the shortest paths, a fact that may not have been sufficiently appreciated in previously proposed correlation measures. In contrast to these, the communicability measures reviewed in this paper are defined by taking into account all possible routes between two nodes, assigning smaller weights to longer ones. This point of view naturally leads to the definition of communicability in terms of matrix functions, such as the exponential, resolvent, and hyperbolic functions, in which the matrix argument is either the adjacency matrix or the graph Laplacian associated with the network. Considerable insight on communicability can be gained by modeling a network as a system of oscillators and deriving physical interpretations, both classical and quantum-mechanical, of various communicability functions. Applications of communicability measures to the analysis of complex systems are illustrated on a variety of biological, physical and social networks. The last part of the paper is devoted to a review of the notion of locality in complex networks and to computational aspects that by exploiting sparsity can greatly reduce the computational efforts for the calculation of communicability functions for large networks.
Nonparametric Bayesian Modeling of Complex Networks
DEFF Research Database (Denmark)
Schmidt, Mikkel Nørgaard; Mørup, Morten
2013-01-01
an infinite mixture model as running example, we go through the steps of deriving the model as an infinite limit of a finite parametric model, inferring the model parameters by Markov chain Monte Carlo, and checking the model?s fit and predictive performance. We explain how advanced nonparametric models......Modeling structure in complex networks using Bayesian nonparametrics makes it possible to specify flexible model structures and infer the adequate model complexity from the observed data. This article provides a gentle introduction to nonparametric Bayesian modeling of complex networks: Using...
Low Computational Complexity Network Coding For Mobile Networks
DEFF Research Database (Denmark)
Heide, Janus
2012-01-01
Network Coding (NC) is a technique that can provide benefits in many types of networks, some examples from wireless networks are: In relay networks, either the physical or the data link layer, to reduce the number of transmissions. In reliable multicast, to reduce the amount of signaling and enable......-flow coding technique. One of the key challenges of this technique is its inherent computational complexity which can lead to high computational load and energy consumption in particular on the mobile platforms that are the target platform in this work. To increase the coding throughput several...
Hazard tolerance of spatially distributed complex networks
International Nuclear Information System (INIS)
Dunn, Sarah; Wilkinson, Sean
2017-01-01
In this paper, we present a new methodology for quantifying the reliability of complex systems, using techniques from network graph theory. In recent years, network theory has been applied to many areas of research and has allowed us to gain insight into the behaviour of real systems that would otherwise be difficult or impossible to analyse, for example increasingly complex infrastructure systems. Although this work has made great advances in understanding complex systems, the vast majority of these studies only consider a systems topological reliability and largely ignore their spatial component. It has been shown that the omission of this spatial component can have potentially devastating consequences. In this paper, we propose a number of algorithms for generating a range of synthetic spatial networks with different topological and spatial characteristics and identify real-world networks that share the same characteristics. We assess the influence of nodal location and the spatial distribution of highly connected nodes on hazard tolerance by comparing our generic networks to benchmark networks. We discuss the relevance of these findings for real world networks and show that the combination of topological and spatial configurations renders many real world networks vulnerable to certain spatial hazards. - Highlights: • We develop a method for quantifying the reliability of real-world systems. • We assess the spatial resilience of synthetic spatially distributed networks. • We form algorithms to generate spatial scale-free and exponential networks. • We show how these “synthetic” networks are proxies for real world systems. • Conclude that many real world systems are vulnerable to spatially coherent hazard.
Information processing in complex networks
Quax, R.
2013-01-01
Eerste resultaten van onderzoek van Rick Quax suggereren dat een combinatie van informatietheorie, netwerktheorie en statistische mechanica kan leiden tot een veelbelovende theorie om het gedrag van complexe netwerken te voorspellen. Er bestaat nog weinig theorie over het gedrag van dynamische eenheden die verbonden zijn in een netwerk, zoals neuronen in een breinnetwerk of genen in een gen-regulatienetwerk. Quax combineert informatietheorie, netwerktheorie, en statistische onderzoeken en mec...
Qualitative analysis and control of complex neural networks with delays
Wang, Zhanshan; Zheng, Chengde
2016-01-01
This book focuses on the stability of the dynamical neural system, synchronization of the coupling neural system and their applications in automation control and electrical engineering. The redefined concept of stability, synchronization and consensus are adopted to provide a better explanation of the complex neural network. Researchers in the fields of dynamical systems, computer science, electrical engineering and mathematics will benefit from the discussions on complex systems. The book will also help readers to better understand the theory behind the control technique and its design.
Pheromone Static Routing Strategy for Complex Networks
Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui
2012-12-01
We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.
Identify Dynamic Network Modules with Temporal and Spatial Constraints
Energy Technology Data Exchange (ETDEWEB)
Jin, R; McCallen, S; Liu, C; Almaas, E; Zhou, X J
2007-09-24
Despite the rapid accumulation of systems-level biological data, understanding the dynamic nature of cellular activity remains a difficult task. The reason is that most biological data are static, or only correspond to snapshots of cellular activity. In this study, we explicitly attempt to detangle the temporal complexity of biological networks by using compilations of time-series gene expression profiling data.We define a dynamic network module to be a set of proteins satisfying two conditions: (1) they form a connected component in the protein-protein interaction (PPI) network; and (2) their expression profiles form certain structures in the temporal domain. We develop the first efficient mining algorithm to discover dynamic modules in a temporal network, as well as frequently occurring dynamic modules across many temporal networks. Using yeast as a model system, we demonstrate that the majority of the identified dynamic modules are functionally homogeneous. Additionally, many of them provide insight into the sequential ordering of molecular events in cellular systems. We further demonstrate that identifying frequent dynamic network modules can significantly increase the signal to noise separation, despite the fact that most dynamic network modules are highly condition-specific. Finally, we note that the applicability of our algorithm is not limited to the study of PPI systems, instead it is generally applicable to the combination of any type of network and time-series data.
Epidemic extinction paths in complex networks
Hindes, Jason; Schwartz, Ira B.
2017-05-01
We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.
Complex Network Analysis of Guangzhou Metro
Directory of Open Access Journals (Sweden)
Yasir Tariq Mohmand
2015-11-01
Full Text Available The structure and properties of public transportation networks can provide suggestions for urban planning and public policies. This study contributes a complex network analysis of the Guangzhou metro. The metro network has 236 kilometers of track and is the 6th busiest metro system of the world. In this paper topological properties of the network are explored. We observed that the network displays small world properties and is assortative in nature. The network possesses a high average degree of 17.5 with a small diameter of 5. Furthermore, we also identified the most important metro stations based on betweenness and closeness centralities. These could help in identifying the probable congestion points in the metro system and provide policy makers with an opportunity to improve the performance of the metro system.
Cascade-based attacks on complex networks
Motter, Adilson E.; Lai, Ying-Cheng
2002-12-01
We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to collapse. This is relevant for real-world networks that possess a highly heterogeneous distribution of loads, such as the Internet and power grids. We demonstrate that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node. This brings obvious concerns on the security of such systems.
Mapping stochastic processes onto complex networks
International Nuclear Information System (INIS)
Shirazi, A H; Reza Jafari, G; Davoudi, J; Peinke, J; Reza Rahimi Tabar, M; Sahimi, Muhammad
2009-01-01
We introduce a method by which stochastic processes are mapped onto complex networks. As examples, we construct the networks for such time series as those for free-jet and low-temperature helium turbulence, the German stock market index (the DAX), and white noise. The networks are further studied by contrasting their geometrical properties, such as the mean length, diameter, clustering, and average number of connections per node. By comparing the network properties of the original time series investigated with those for the shuffled and surrogate series, we are able to quantify the effect of the long-range correlations and the fatness of the probability distribution functions of the series on the networks constructed. Most importantly, we demonstrate that the time series can be reconstructed with high precision by means of a simple random walk on their corresponding networks
Aging in complex interdependency networks.
Vural, Dervis C; Morrison, Greg; Mahadevan, L
2014-02-01
Although species longevity is subject to a diverse range of evolutionary forces, the mortality curves of a wide variety of organisms are rather similar. Here we argue that qualitative and quantitative features of aging can be reproduced by a simple model based on the interdependence of fault-prone agents on one other. In addition to fitting our theory to the empiric mortality curves of six very different organisms, we establish the dependence of lifetime and aging rate on initial conditions, damage and repair rate, and system size. We compare the size distributions of disease and death and see that they have qualitatively different properties. We show that aging patterns are independent of the details of interdependence network structure, which suggests that aging is a many-body effect, and that the qualitative and quantitative features of aging are not sensitively dependent on the details of dependency structure or its formation.
Tourism-planning network knowledge dynamics
DEFF Research Database (Denmark)
Dredge, Dianne
2014-01-01
This chapter explores the characteristics and functions of tourism networks as a first step in understanding how networks facilitate and reproduce knowledge. A framework to progress understandings of knowledge dynamics in tourism networks is presented that includes four key dimensions: context......, network agents, network boundaries and network resources. A case study of the development of the Next Generation Tourism Handbook (Queensland, Australia), a policy initiative that sought to bring tourism and land use planning knowledge closer together is presented. The case study illustrates...... that the tourism policy and land use planning networks operate in very different spheres and that context, network agents, network boundaries and network resources have a significant influence not only on knowledge dynamics but also on the capacity of network agents to overcome barriers to learning and to innovate....
Average contraction and synchronization of complex switched networks
International Nuclear Information System (INIS)
Wang Lei; Wang Qingguo
2012-01-01
This paper introduces an average contraction analysis for nonlinear switched systems and applies it to investigating the synchronization of complex networks of coupled systems with switching topology. For a general nonlinear system with a time-dependent switching law, a basic convergence result is presented according to average contraction analysis, and a special case where trajectories of a distributed switched system converge to a linear subspace is then investigated. Synchronization is viewed as the special case with all trajectories approaching the synchronization manifold, and is thus studied for complex networks of coupled oscillators with switching topology. It is shown that the synchronization of a complex switched network can be evaluated by the dynamics of an isolated node, the coupling strength and the time average of the smallest eigenvalue associated with the Laplacians of switching topology and the coupling fashion. Finally, numerical simulations illustrate the effectiveness of the proposed methods. (paper)
Complex systems dynamics in aging: new evidence, continuing questions.
Cohen, Alan A
2016-02-01
There have long been suggestions that aging is tightly linked to the complex dynamics of the physiological systems that maintain homeostasis, and in particular to dysregulation of regulatory networks of molecules. This review synthesizes recent work that is starting to provide evidence for the importance of such complex systems dynamics in aging. There is now clear evidence that physiological dysregulation--the gradual breakdown in the capacity of complex regulatory networks to maintain homeostasis--is an emergent property of these regulatory networks, and that it plays an important role in aging. It can be measured simply using small numbers of biomarkers. Additionally, there are indications of the importance during aging of emergent physiological processes, functional processes that cannot be easily understood through clear metabolic pathways, but can nonetheless be precisely quantified and studied. The overall role of such complex systems dynamics in aging remains an important open question, and to understand it future studies will need to distinguish and integrate related aspects of aging research, including multi-factorial theories of aging, systems biology, bioinformatics, network approaches, robustness, and loss of complexity.
Nonlinear and Complex Dynamics in Economics
William Barnett; Apostolos Serletis; Demitre Serletis
2012-01-01
This paper is an up-to-date survey of the state-of-the-art in dynamical systems theory relevant to high levels of dynamical complexity, characterizing chaos and near chaos, as commonly found in the physical sciences. The paper also surveys applications in economics and �finance. This survey does not include bifurcation analyses at lower levels of dynamical complexity, such as Hopf and transcritical bifurcations, which arise closer to the stable region of the parameter space. We discuss the...
Complexity of Resilient Power Distribution Networks
International Nuclear Information System (INIS)
May, Michael
2008-01-01
Power Systems in general and specifically the problems of communication, control, and coordination in human supervisory control of electric power transmission and distribution networks constitute a good case study for resilience engineering. Because of the high cost and high impact on society of transmission disturbances and blackouts and the vulnerability of power networks to terrorist attacks, Transmission Systems Operators (TSOs) are already focusing on organizational structures, procedures, and technical innovations that could improve the flexibility and robustness of power Systems and achieve the overall goal of providing secure power supply. For a number of reasons however the complexity of power Systems is increasing and new problems arise for human supervisory control and the ability of these Systems to implement fast recovery from disturbances. Around the world power Systems are currently being restructured to adapt to regional electricity markets and secure the availability, resilience and sustainability of electric power generation, transmission and distribution. This demands a reconsideration of the available decision support, the activity of human supervisory control of the highly automated processes involved and the procedures regulating it, as well as the role of the TSOs and the regional, national and international organizations set up to manage their activity. Unfortunately we can expect that human supervisory control of power Systems will become more complex in the near future for a number of reasons. The European Union for the Co-ordination of Transmission of Electricity (UCTE) has remarked that although the interconnected Systems of power transmission networks has been developed over the years with the main goal of providing secure power supply through common use of reserve capacities and the optimization of the use of energy resources, today's market dynamics imposing a high level of cross-border exchanges is 'out of the scope of the
Bribery games on interdependent complex networks.
Verma, Prateek; Nandi, Anjan K; Sengupta, Supratim
2018-08-07
Bribe demands present a social conflict scenario where decisions have wide-ranging economic and ethical consequences. Nevertheless, such incidents occur daily in many countries across the globe. Harassment bribery constitute a significant sub-set of such bribery incidents where a government official demands a bribe for providing a service to a citizen legally entitled to it. We employ an evolutionary game-theoretic framework to analyse the evolution of corrupt and honest strategies in structured populations characterized by an interdependent complex network. The effects of changing network topology, average number of links and asymmetry in size of the citizen and officer population on the proliferation of incidents of bribery are explored. A complex network topology is found to be beneficial for the dominance of corrupt strategies over a larger region of phase space when compared with the outcome for a regular network, for equal citizen and officer population sizes. However, the extent of the advantage depends critically on the network degree and topology. A different trend is observed when there is a difference between the citizen and officer population sizes. Under those circumstances, increasing randomness of the underlying citizen network can be beneficial to the fixation of honest officers up to a certain value of the network degree. Our analysis reveals how the interplay between network topology, connectivity and strategy update rules can affect population level outcomes in such asymmetric games. Copyright © 2018 Elsevier Ltd. All rights reserved.
Dynamics of epidemic diseases on a growing adaptive network.
Demirel, Güven; Barter, Edmund; Gross, Thilo
2017-02-10
The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.
Analysis of the airport network of India as a complex weighted network
Bagler, Ganesh
2008-05-01
Transportation infrastructure of a country is one of the most important indicators of its economic growth. Here we study the Airport Network of India (ANI) which represents India’s domestic civil aviation infrastructure as a complex network. We find that ANI, a network of domestic airports connected by air links, is a small-world network characterized by a truncated power-law degree distribution and has a signature of hierarchy. We investigate ANI as a weighted network to explore its various properties and compare them with their topological counterparts. The traffic in ANI, as in the World-wide Airport Network (WAN), is found to be accumulated on interconnected groups of airports and is concentrated between large airports. In contrast to WAN, ANI is found to be having disassortative mixing which is offset by the traffic dynamics. The analysis indicates possible mechanism of formation of a national transportation network, which is different from that on a global scale.
Chaperone-client complexes: A dynamic liaison
Hiller, Sebastian; Burmann, Björn M.
2018-04-01
Living cells contain molecular chaperones that are organized in intricate networks to surveil protein homeostasis by avoiding polypeptide misfolding, aggregation, and the generation of toxic species. In addition, cellular chaperones also fulfill a multitude of alternative functionalities: transport of clients towards a target location, help them fold, unfold misfolded species, resolve aggregates, or deliver clients towards proteolysis machineries. Until recently, the only available source of atomic resolution information for virtually all chaperones were crystal structures of their client-free, apo-forms. These structures were unable to explain details of the functional mechanisms underlying chaperone-client interactions. The difficulties to crystallize chaperones in complexes with clients arise from their highly dynamic nature, making solution NMR spectroscopy the method of choice for their study. With the advent of advanced solution NMR techniques, in the past few years a substantial number of structural and functional studies on chaperone-client complexes have been resolved, allowing unique insight into the chaperone-client interaction. This review summarizes the recent insights provided by advanced high-resolution NMR-spectroscopy to understand chaperone-client interaction mechanisms at the atomic scale.
Intentional risk management through complex networks analysis
Chapela, Victor; Moral, Santiago; Romance, Miguel
2015-01-01
This book combines game theory and complex networks to examine intentional technological risk through modeling. As information security risks are in constant evolution, the methodologies and tools to manage them must evolve to an ever-changing environment. A formal global methodology is explained in this book, which is able to analyze risks in cyber security based on complex network models and ideas extracted from the Nash equilibrium. A risk management methodology for IT critical infrastructures is introduced which provides guidance and analysis on decision making models and real situations. This model manages the risk of succumbing to a digital attack and assesses an attack from the following three variables: income obtained, expense needed to carry out an attack, and the potential consequences for an attack. Graduate students and researchers interested in cyber security, complex network applications and intentional risk will find this book useful as it is filled with a number of models, methodologies a...
Optimal search strategies on complex networks
Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco
2014-01-01
Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road networks, which impact both transportation design and epidemic control. In the brain, neurons are cabled through heterogeneous connections, which support the propagation of electric signals. In all these cases, the true challenge is to unveil the mechanism...
Identifying modular relations in complex brain networks
DEFF Research Database (Denmark)
Andersen, Kasper Winther; Mørup, Morten; Siebner, Hartwig
2012-01-01
We evaluate the infinite relational model (IRM) against two simpler alternative nonparametric Bayesian models for identifying structures in multi subject brain networks. The models are evaluated for their ability to predict new data and infer reproducible structures. Prediction and reproducibility...... and obtains comparable reproducibility and predictability. For resting state functional magnetic resonance imaging data from 30 healthy controls the IRM model is also superior to the two simpler alternatives, suggesting that brain networks indeed exhibit universal complex relational structure...
Analysis and Design of Complex Network Environments
2012-03-01
and J. Lowe, “The myths and facts behind cyber security risks for industrial control systems ,” in the Proceedings of the VDE Kongress, VDE Congress...questions about 1) how to model them, 2) the design of experiments necessary to discover their structure (and thus adapt system inputs to optimize the...theoretical work that clarifies fundamental limitations of complex networks with network engineering and systems biology to implement specific designs and
Network geometry with flavor: From complexity to quantum geometry
Bianconi, Ginestra; Rahmede, Christoph
2016-03-01
Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d -dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s =-1 ,0 ,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d . In d =1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d >1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t . Interestingly the NGF remains fully classical but
Complex interdependent supply chain networks: Cascading failure and robustness
Tang, Liang; Jing, Ke; He, Jie; Stanley, H. Eugene
2016-02-01
A supply chain network is a typical interdependent network composed of an undirected cyber-layer network and a directed physical-layer network. To analyze the robustness of this complex interdependent supply chain network when it suffers from disruption events that can cause nodes to fail, we use a cascading failure process that focuses on load propagation. We consider load propagation via connectivity links as node failure spreads through one layer of an interdependent network, and we develop a priority redistribution strategy for failed loads subject to flow constraint. Using a giant component function and a one-to-one directed interdependence relation between nodes in a cyber-layer network and physical-layer network, we construct time-varied functional equations to quantify the dynamic process of failed loads propagation in an interdependent network. Finally, we conduct a numerical simulation for two cases, i.e., single node removal and multiple node removal at the initial disruption. The simulation results show that when we increase the number of removed nodes in an interdependent supply chain network its robustness undergoes a first-order discontinuous phase transition, and that even removing a small number of nodes will cause it to crash.
Synchronization in Complex Oscillator Networks and Smart Grids
Energy Technology Data Exchange (ETDEWEB)
Dorfler, Florian [Los Alamos National Laboratory; Chertkov, Michael [Los Alamos National Laboratory; Bullo, Francesco [Center for Control, Dynamical Systems and Computation, University of California at Santa Babara, Santa Barbara CA
2012-07-24
The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications.
Team dynamics in complex projects
Oeij, P.; Vroome, E.E.M. de; Dhondt, S.; Gaspersz, J.B.R.
2012-01-01
Complexity of projects is hotly debated and a factor which affects innovativeness of team performance. Much attention in the past is paid to technical complexity and many issues are related to natural and physical sciences. A growing awareness of the importance of socioorganisational issues is
Size reduction of complex networks preserving modularity
Energy Technology Data Exchange (ETDEWEB)
Arenas, A.; Duch, J.; Fernandez, A.; Gomez, S.
2008-12-24
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the NP-hard class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining invariant its modularity. This size reduction allows the heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the Extremal Optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.
Characterizing English Poetic Style Using Complex Networks
Roxas-Villanueva, Ranzivelle Marianne; Nambatac, Maelori Krista; Tapang, Giovanni
Complex networks have been proven useful in characterizing written texts. Here, we use networks to probe if there exist a similarity within, and difference across, era as reflected within the poem's structure. In literary history, boundary lines are set to distinguish the change in writing styles through time. We obtain the network parameters and motif frequencies of 845 poems published from 1522 to 1931 and relate this to the writing of the Elizabethan, 17th Century, Augustan, Romantic and Victorian eras. Analysis of the different network parameters shows a significant difference of the Augustan era (1667-1780) with the rest. The network parameters and the convex hull and centroids of the motif frequencies reflect the adjectival sequence pattern of the poems of the Augustan era.
Competitive cluster growth in complex networks.
Moreira, André A; Paula, Demétrius R; Costa Filho, Raimundo N; Andrade, José S
2006-06-01
In this work we propose an idealized model for competitive cluster growth in complex networks. Each cluster can be thought of as a fraction of a community that shares some common opinion. Our results show that the cluster size distribution depends on the particular choice for the topology of the network of contacts among the agents. As an application, we show that the cluster size distributions obtained when the growth process is performed on hierarchical networks, e.g., the Apollonian network, have a scaling form similar to what has been observed for the distribution of a number of votes in an electoral process. We suggest that this similarity may be due to the fact that social networks involved in the electoral process may also possess an underlining hierarchical structure.
An improved sampling method of complex network
Gao, Qi; Ding, Xintong; Pan, Feng; Li, Weixing
2014-12-01
Sampling subnet is an important topic of complex network research. Sampling methods influence the structure and characteristics of subnet. Random multiple snowball with Cohen (RMSC) process sampling which combines the advantages of random sampling and snowball sampling is proposed in this paper. It has the ability to explore global information and discover the local structure at the same time. The experiments indicate that this novel sampling method could keep the similarity between sampling subnet and original network on degree distribution, connectivity rate and average shortest path. This method is applicable to the situation where the prior knowledge about degree distribution of original network is not sufficient.
Airborne Network Optimization with Dynamic Network Update
2015-03-26
source si and a target ti . For each commodity (si, ki) the commodity specifies a non- negative demand di [5]. The objective of the multi-commodity...queue predictions, and network con- gestion [15]. The implementation of the DRQC uses the Kalman filter to predict the state of the network and optimize
NEXCADE: perturbation analysis for complex networks.
Directory of Open Access Journals (Sweden)
Gitanjali Yadav
Full Text Available Recent advances in network theory have led to considerable progress in our understanding of complex real world systems and their behavior in response to external threats or fluctuations. Much of this research has been invigorated by demonstration of the 'robust, yet fragile' nature of cellular and large-scale systems transcending biology, sociology, and ecology, through application of the network theory to diverse interactions observed in nature such as plant-pollinator, seed-dispersal agent and host-parasite relationships. In this work, we report the development of NEXCADE, an automated and interactive program for inducing disturbances into complex systems defined by networks, focusing on the changes in global network topology and connectivity as a function of the perturbation. NEXCADE uses a graph theoretical approach to simulate perturbations in a user-defined manner, singly, in clusters, or sequentially. To demonstrate the promise it holds for broader adoption by the research community, we provide pre-simulated examples from diverse real-world networks including eukaryotic protein-protein interaction networks, fungal biochemical networks, a variety of ecological food webs in nature as well as social networks. NEXCADE not only enables network visualization at every step of the targeted attacks, but also allows risk assessment, i.e. identification of nodes critical for the robustness of the system of interest, in order to devise and implement context-based strategies for restructuring a network, or to achieve resilience against link or node failures. Source code and license for the software, designed to work on a Linux-based operating system (OS can be downloaded at http://www.nipgr.res.in/nexcade_download.html. In addition, we have developed NEXCADE as an OS-independent online web server freely available to the scientific community without any login requirement at http://www.nipgr.res.in/nexcade.html.
Defining nodes in complex brain networks
Directory of Open Access Journals (Sweden)
Matthew Lawrence Stanley
2013-11-01
Full Text Available Network science holds great promise for expanding our understanding of the human brain in health, disease, development, and aging. Network analyses are quickly becoming the method of choice for analyzing functional MRI data. However, many technical issues have yet to be confronted in order to optimize results. One particular issue that remains controversial in functional brain network analyses is the definition of a network node. In functional brain networks a node represents some predefined collection of brain tissue, and an edge measures the functional connectivity between pairs of nodes. The characteristics of a node, chosen by the researcher, vary considerably in the literature. This manuscript reviews the current state of the art based on published manuscripts and highlights the strengths and weaknesses of three main methods for defining nodes. Voxel-wise networks are constructed by assigning a node to each, equally sized brain area (voxel. The fMRI time-series recorded from each voxel is then used to create the functional network. Anatomical methods utilize atlases to define the nodes based on brain structure. The fMRI time-series from all voxels within the anatomical area are averaged and subsequently used to generate the network. Functional activation methods rely on data from traditional fMRI activation studies, often from databases, to identify network nodes. Such methods identify the peaks or centers of mass from activation maps to determine the location of the nodes. Small (~10-20 millimeter diameter spheres located at the coordinates of the activation foci are then applied to the data being used in the network analysis. The fMRI time-series from all voxels in the sphere are then averaged, and the resultant time series is used to generate the network. We attempt to clarify the discussion and move the study of complex brain networks forward. While the correct method to be used remains an open, possibly unsolvable question that
Networks of networks the last frontier of complexity
Scala, Antonio
2014-01-01
The present work is meant as a reference to provide an organic and comprehensive view of the most relevant results in the exciting new field of Networks of Networks (NetoNets). Seminal papers have recently been published posing the basis to study what happens when different networks interact, thus providing evidence for the emergence of new, unexpected behaviors and vulnerabilities. From those seminal works, the awareness on the importance understanding Networks of Networks (NetoNets) has spread to the entire community of Complexity Science. The reader will benefit from the experience of some of the most well-recognized leaders in this field. The contents have been aggregated under four headings; General Theory, Phenomenology, Applications and Risk Assessment. The reader will be impressed by the different applications of the general paradigm that span from physiology, to financial risk, to transports. We are currently making the first steps to reduce the distance between the language and the way of thinking o...
Collective Dynamics in Physical and Social Networks
Isakov, Alexander
We study four systems where individual units come together to display a range of collective behavior. First, we consider a physical system of phase oscillators on a network that expands the Kuramoto model to include oscillator-network interactions and the presence of noise: using a Hebbian-like learning rule, oscillators that synchronize in turn strengthen their connections to each other. We find that the average degree of connectivity strongly affects rates of flipping between aligned and anti-aligned states, and that this result persists to the case of complex networks. Turning to a fully multi-player, multi-strategy evolutionary dynamics model of cooperating bacteria that change who they give resources to and take resources from, we find several regimes that give rise to high levels of collective structure in the resulting networks. In this setting, we also explore the conditions in which an intervention that affects cooperation itself (e.g. "seeding the network with defectors") can lead to wiping out an infection. We find a non-monotonic connection between the percent of disabled cooperation and cure rate, suggesting that in some regimes a limited perturbation can lead to total population collapse. At a larger scale, we study how the locomotor system recovers after amputation in fruit flies. Through experiment and a theoretical model of multi-legged motion controlled by neural oscillators, we find that proprioception plays a role in the ability of flies to control leg forces appropriately to recover from a large initial turning bias induced by the injury. Finally, at the human scale, we consider a social network in a traditional society in Africa to understand how social ties lead to group formation for collective action (stealth raids). We identify critical and distinct roles for both leadership (important for catalyzing a group) and friendship (important for final composition). We conclude with prospects for future work.
Symbolic Dynamics and Grammatical Complexity
Hao, Bai-Lin; Zheng, Wei-Mou
The following sections are included: * Formal Languages and Their Complexity * Formal Language * Chomsky Hierarchy of Grammatical Complexity * The L-System * Regular Language and Finite Automaton * Finite Automaton * Regular Language * Stefan Matrix as Transfer Function for Automaton * Beyond Regular Languages * Feigenbaum and Generalized Feigenbaum Limiting Sets * Even and Odd Fibonacci Sequences * Odd Maximal Primitive Prefixes and Kneading Map * Even Maximal Primitive Prefixes and Distinct Excluded Blocks * Summary of Results
Dynamical community structure of populations evolving on genotype networks
International Nuclear Information System (INIS)
Capitán, José A.; Aguirre, Jacobo; Manrubia, Susanna
2015-01-01
Neutral evolutionary dynamics of replicators occurs on large and heterogeneous networks of genotypes. These networks, formed by all genotypes that yield the same phenotype, have a complex architecture that conditions the molecular composition of populations and their movements on genome spaces. Here we consider as an example the case of populations evolving on RNA secondary structure neutral networks and study the community structure of the network revealed through dynamical properties of the population at equilibrium and during adaptive transients. We unveil a rich hierarchical community structure that, eventually, can be traced back to the non-trivial relationship between RNA secondary structure and sequence composition. We demonstrate that usual measures of modularity that only take into account the static, topological structure of networks, cannot identify the community structure disclosed by population dynamics
Adaptive learning and complex dynamics
International Nuclear Information System (INIS)
Gomes, Orlando
2009-01-01
In this paper, we explore the dynamic properties of a group of simple deterministic difference equation systems in which the conventional perfect foresight assumption gives place to a mechanism of adaptive learning. These systems have a common feature: under perfect foresight (or rational expectations) they all possess a unique fixed point steady state. This long-term outcome is obtained also under learning if the quality underlying the learning process is high. Otherwise, when the degree of inefficiency of the learning process is relatively strong, nonlinear dynamics (periodic and a-periodic cycles) arise. The specific properties of each one of the proposed systems is explored both in terms of local and global dynamics. One macroeconomic model is used to illustrate how the formation of expectations through learning may eventually lead to awkward long-term outcomes.
Murayama, Shogo; Kinugawa, Hikaru; Tokuda, Isao T.; Gotoda, Hiroshi
2018-02-01
We present an experimental study on the characterization of dynamic behavior of flow velocity field during thermoacoustic combustion oscillations in a turbulent confined combustor from the viewpoints of statistical complexity and complex-network theory, involving detection of a precursor of thermoacoustic combustion oscillations. The multiscale complexity-entropy causality plane clearly shows the possible presence of two dynamics, noisy periodic oscillations and noisy chaos, in the shear layer regions (1) between the outer recirculation region in the dump plate and a recirculation flow in the wake of the centerbody and (2) between the outer recirculation region in the dump plate and a vortex breakdown bubble away from the centerbody. The vertex strength in the turbulence network and the community structure of the vorticity field can identify the vortical interactions during thermoacoustic combustion oscillations. Sequential horizontal visibility graph motifs are useful for capturing a precursor of themoacoustic combustion oscillations.
Learning dynamic Bayesian networks with mixed variables
DEFF Research Database (Denmark)
Bøttcher, Susanne Gammelgaard
This paper considers dynamic Bayesian networks for discrete and continuous variables. We only treat the case, where the distribution of the variables is conditional Gaussian. We show how to learn the parameters and structure of a dynamic Bayesian network and also how the Markov order can be learned...
Temporal fidelity in dynamic social networks
DEFF Research Database (Denmark)
Stopczynski, Arkadiusz; Sapiezynski, Piotr; Pentland, Alex ‘Sandy’
2015-01-01
of the network dynamics can be used to inform the process of measuring social networks. The details of measurement are of particular importance when considering dynamic processes where minute-to-minute details are important, because collection of physical proximity interactions with high temporal resolution...
Formulation and applications of complex network theory
Park, Juyong
algorithms with those officially used in college football's postseason proceedings, highlighting their simliarities and differences. These studies will show that the methods of statistical physics are well-suited for studying networks. As networks of interest become larger and more complex, they will become more relevant and necessary.
Local Dynamics in Trained Recurrent Neural Networks.
Rivkind, Alexander; Barak, Omri
2017-06-23
Learning a task induces connectivity changes in neural circuits, thereby changing their dynamics. To elucidate task-related neural dynamics, we study trained recurrent neural networks. We develop a mean field theory for reservoir computing networks trained to have multiple fixed point attractors. Our main result is that the dynamics of the network's output in the vicinity of attractors is governed by a low-order linear ordinary differential equation. The stability of the resulting equation can be assessed, predicting training success or failure. As a consequence, networks of rectified linear units and of sigmoidal nonlinearities are shown to have diametrically different properties when it comes to learning attractors. Furthermore, a characteristic time constant, which remains finite at the edge of chaos, offers an explanation of the network's output robustness in the presence of variability of the internal neural dynamics. Finally, the proposed theory predicts state-dependent frequency selectivity in the network response.
Local Dynamics in Trained Recurrent Neural Networks
Rivkind, Alexander; Barak, Omri
2017-06-01
Learning a task induces connectivity changes in neural circuits, thereby changing their dynamics. To elucidate task-related neural dynamics, we study trained recurrent neural networks. We develop a mean field theory for reservoir computing networks trained to have multiple fixed point attractors. Our main result is that the dynamics of the network's output in the vicinity of attractors is governed by a low-order linear ordinary differential equation. The stability of the resulting equation can be assessed, predicting training success or failure. As a consequence, networks of rectified linear units and of sigmoidal nonlinearities are shown to have diametrically different properties when it comes to learning attractors. Furthermore, a characteristic time constant, which remains finite at the edge of chaos, offers an explanation of the network's output robustness in the presence of variability of the internal neural dynamics. Finally, the proposed theory predicts state-dependent frequency selectivity in the network response.
The complex network of musical tastes
Buldú, Javier M.; Cano, P.; Koppenberger, M.; Almendral, Juan A.; Boccaletti, S.
2007-06-01
We present an empirical study of the evolution of a social network constructed under the influence of musical tastes. The network is obtained thanks to the selfless effort of a broad community of users who share playlists of their favourite songs with other users. When two songs co-occur in a playlist a link is created between them, leading to a complex network where songs are the fundamental nodes. In this representation, songs in the same playlist could belong to different musical genres, but they are prone to be linked by a certain musical taste (e.g. if songs A and B co-occur in several playlists, an user who likes A will probably like also B). Indeed, playlist collections such as the one under study are the basic material that feeds some commercial music recommendation engines. Since playlists have an input date, we are able to evaluate the topology of this particular complex network from scratch, observing how its characteristic parameters evolve in time. We compare our results with those obtained from an artificial network defined by means of a null model. This comparison yields some insight on the evolution and structure of such a network, which could be used as ground data for the development of proper models. Finally, we gather information that can be useful for the development of music recommendation engines and give some hints about how top-hits appear.
Energy Complexity of Recurrent Neural Networks
Czech Academy of Sciences Publication Activity Database
Šíma, Jiří
2014-01-01
Roč. 26, č. 5 (2014), s. 953-973 ISSN 0899-7667 R&D Projects: GA ČR GAP202/10/1333 Institutional support: RVO:67985807 Keywords : neural network * finite automaton * energy complexity * optimal size Subject RIV: IN - Informatics, Computer Science Impact factor: 2.207, year: 2014
Complex networks from multivariate time series
Czech Academy of Sciences Publication Activity Database
Paluš, Milan; Hartman, David; Vejmelka, Martin
2010-01-01
Roč. 12, - (2010), A-14382 ISSN 1607-7962. [General Asembly of the European Geophysical Society. 02.05.2010-07.05.2010, Vienna] R&D Projects: GA AV ČR IAA300420805 Institutional research plan: CEZ:AV0Z10300504 Keywords : complex network * surface air temperature * reanalysis data * global change Subject RIV: BB - Applied Statistics, Operational Research
Directory of Open Access Journals (Sweden)
Xueling Jiang
2014-01-01
Full Text Available The problem of adaptive asymptotical synchronization is discussed for the stochastic complex dynamical networks with time-delay and Markovian switching. By applying the stochastic analysis approach and the M-matrix method for stochastic complex networks, several sufficient conditions to ensure adaptive asymptotical synchronization for stochastic complex networks are derived. Through the adaptive feedback control techniques, some suitable parameters update laws are obtained. Simulation result is provided to substantiate the effectiveness and characteristics of the proposed approach.
Doubly stochastic coherence in complex neuronal networks
Gao, Yang; Wang, Jianjun
2012-11-01
A system composed of coupled FitzHugh-Nagumo neurons with various topological structures is investigated under the co-presence of two independently additive and multiplicative Gaussian white noises, in which particular attention is paid to the neuronal networks spiking regularity. As the additive noise intensity and the multiplicative noise intensity are simultaneously adjusted to optimal values, the temporal periodicity of the output of the system reaches the maximum, indicating the occurrence of doubly stochastic coherence. The network topology randomness exerts different influences on the temporal coherence of the spiking oscillation for dissimilar coupling strength regimes. At a small coupling strength, the spiking regularity shows nearly no difference in the regular, small-world, and completely random networks. At an intermediate coupling strength, the temporal periodicity in a small-world neuronal network can be improved slightly by adding a small fraction of long-range connections. At a large coupling strength, the dynamical behavior of the neurons completely loses the resonance property with regard to the additive noise intensity or the multiplicative noise intensity, and the spiking regularity decreases considerably with the increase of the network topology randomness. The network topology randomness plays more of a depressed role than a favorable role in improving the temporal coherence of the spiking oscillation in the neuronal network research study.
Recurrence Density Enhanced Complex Networks for Nonlinear Time Series Analysis
Costa, Diego G. De B.; Reis, Barbara M. Da F.; Zou, Yong; Quiles, Marcos G.; Macau, Elbert E. N.
We introduce a new method, which is entitled Recurrence Density Enhanced Complex Network (RDE-CN), to properly analyze nonlinear time series. Our method first transforms a recurrence plot into a figure of a reduced number of points yet preserving the main and fundamental recurrence properties of the original plot. This resulting figure is then reinterpreted as a complex network, which is further characterized by network statistical measures. We illustrate the computational power of RDE-CN approach by time series by both the logistic map and experimental fluid flows, which show that our method distinguishes different dynamics sufficiently well as the traditional recurrence analysis. Therefore, the proposed methodology characterizes the recurrence matrix adequately, while using a reduced set of points from the original recurrence plots.
Using Network Dynamical Influence to Drive Consensus
Punzo, Giuliano; Young, George F.; MacDonald, Malcolm; Leonard, Naomi E.
2016-05-01
Consensus and decision-making are often analysed in the context of networks, with many studies focusing attention on ranking the nodes of a network depending on their relative importance to information routing. Dynamical influence ranks the nodes with respect to their ability to influence the evolution of the associated network dynamical system. In this study it is shown that dynamical influence not only ranks the nodes, but also provides a naturally optimised distribution of effort to steer a network from one state to another. An example is provided where the “steering” refers to the physical change in velocity of self-propelled agents interacting through a network. Distinct from other works on this subject, this study looks at directed and hence more general graphs. The findings are presented with a theoretical angle, without targeting particular applications or networked systems; however, the framework and results offer parallels with biological flocks and swarms and opportunities for design of technological networks.
Dynamic complexity: plant receptor complexes at the plasma membrane.
Burkart, Rebecca C; Stahl, Yvonne
2017-12-01
Plant receptor complexes at the cell surface perceive many different external and internal signalling molecules and relay these signals into the cell to regulate development, growth and immunity. Recent progress in the analyses of receptor complexes using different live cell imaging approaches have shown that receptor complex formation and composition are dynamic and take place at specific microdomains at the plasma membrane. In this review we focus on three prominent examples of Arabidopsis thaliana receptor complexes and how their dynamic spatio-temporal distribution at the PM has been studied recently. We will elaborate on the newly emerging concept of plasma membrane microdomains as potential hubs for specific receptor complex assembly and signalling outputs. Copyright © 2017 Elsevier Ltd. All rights reserved.
Ponzi scheme diffusion in complex networks
Zhu, Anding; Fu, Peihua; Zhang, Qinghe; Chen, Zhenyue
2017-08-01
Ponzi schemes taking the form of Internet-based financial schemes have been negatively affecting China's economy for the last two years. Because there is currently a lack of modeling research on Ponzi scheme diffusion within social networks yet, we develop a potential-investor-divestor (PID) model to investigate the diffusion dynamics of Ponzi scheme in both homogeneous and inhomogeneous networks. Our simulation study of artificial and real Facebook social networks shows that the structure of investor networks does indeed affect the characteristics of dynamics. Both the average degree of distribution and the power-law degree of distribution will reduce the spreading critical threshold and will speed up the rate of diffusion. A high speed of diffusion is the key to alleviating the interest burden and improving the financial outcomes for the Ponzi scheme operator. The zero-crossing point of fund flux function we introduce proves to be a feasible index for reflecting the fast-worsening situation of fiscal instability and predicting the forthcoming collapse. The faster the scheme diffuses, the higher a peak it will reach and the sooner it will collapse. We should keep a vigilant eye on the harm of Ponzi scheme diffusion through modern social networks.
Factors determining nestedness in complex networks.
Directory of Open Access Journals (Sweden)
Samuel Jonhson
Full Text Available Understanding the causes and effects of network structural features is a key task in deciphering complex systems. In this context, the property of network nestedness has aroused a fair amount of interest as regards ecological networks. Indeed, Bastolla et al. introduced a simple measure of network nestedness which opened the door to analytical understanding, allowing them to conclude that biodiversity is strongly enhanced in highly nested mutualistic networks. Here, we suggest a slightly refined version of such a measure of nestedness and study how it is influenced by the most basic structural properties of networks, such as degree distribution and degree-degree correlations (i.e. assortativity. We find that most of the empirically found nestedness stems from heterogeneity in the degree distribution. Once such an influence has been discounted - as a second factor - we find that nestedness is strongly correlated with disassortativity and hence - as random networks have been recently found to be naturally disassortative - they also tend to be naturally nested just as the result of chance.
Network biology concepts in complex disease comorbidities
DEFF Research Database (Denmark)
Hu, Jessica Xin; Thomas, Cecilia Engel; Brunak, Søren
2016-01-01
collected electronically, disease co-occurrences are starting to be quantitatively characterized. Linking network dynamics to the real-life, non-ideal patient in whom diseases co-occur and interact provides a valuable basis for generating hypotheses on molecular disease mechanisms, and provides knowledge......The co-occurrence of diseases can inform the underlying network biology of shared and multifunctional genes and pathways. In addition, comorbidities help to elucidate the effects of external exposures, such as diet, lifestyle and patient care. With worldwide health transaction data now often being...
Complex network analysis in inclined oil–water two-phase flow
International Nuclear Information System (INIS)
Zhong-Ke, Gao; Ning-De, Jin
2009-01-01
Complex networks have established themselves in recent years as being particularly suitable and flexible for representing and modelling many complex natural and artificial systems. Oil–water two-phase flow is one of the most complex systems. In this paper, we use complex networks to study the inclined oil–water two-phase flow. Two different complex network construction methods are proposed to build two types of networks, i.e. the flow pattern complex network (FPCN) and fluid dynamic complex network (FDCN). Through detecting the community structure of FPCN by the community-detection algorithm based on K-means clustering, useful and interesting results are found which can be used for identifying three inclined oil–water flow patterns. To investigate the dynamic characteristics of the inclined oil–water two-phase flow, we construct 48 FDCNs under different flow conditions, and find that the power-law exponent and the network information entropy, which are sensitive to the flow pattern transition, can both characterize the nonlinear dynamics of the inclined oil–water two-phase flow. In this paper, from a new perspective, we not only introduce a complex network theory into the study of the oil–water two-phase flow but also indicate that the complex network may be a powerful tool for exploring nonlinear time series in practice. (general)
Complex dynamic in ecological time series
Peter Turchin; Andrew D. Taylor
1992-01-01
Although the possibility of complex dynamical behaviors-limit cycles, quasiperiodic oscillations, and aperiodic chaos-has been recognized theoretically, most ecologists are skeptical of their importance in nature. In this paper we develop a methodology for reconstructing endogenous (or deterministic) dynamics from ecological time series. Our method consists of fitting...
Stochastic dynamics of genetic broadcasting networks
Potoyan, Davit A.; Wolynes, Peter G.
2017-11-01
The complex genetic programs of eukaryotic cells are often regulated by key transcription factors occupying or clearing out of a large number of genomic locations. Orchestrating the residence times of these factors is therefore important for the well organized functioning of a large network. The classic models of genetic switches sidestep this timing issue by assuming the binding of transcription factors to be governed entirely by thermodynamic protein-DNA affinities. Here we show that relying on passive thermodynamics and random release times can lead to a "time-scale crisis" for master genes that broadcast their signals to a large number of binding sites. We demonstrate that this time-scale crisis for clearance in a large broadcasting network can be resolved by actively regulating residence times through molecular stripping. We illustrate these ideas by studying a model of the stochastic dynamics of the genetic network of the central eukaryotic master regulator NFκ B which broadcasts its signals to many downstream genes that regulate immune response, apoptosis, etc.
Navigation by anomalous random walks on complex networks.
Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan
2016-11-23
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.
Navigation by anomalous random walks on complex networks
Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan
2016-11-01
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.
Explosive synchronization transitions in complex neural networks
Chen, Hanshuang; He, Gang; Huang, Feng; Shen, Chuansheng; Hou, Zhonghuai
2013-09-01
It has been recently reported that explosive synchronization transitions can take place in networks of phase oscillators [Gómez-Gardeñes et al. Phys. Rev. Lett. 106, 128701 (2011)] and chaotic oscillators [Leyva et al. Phys. Rev. Lett. 108, 168702 (2012)]. Here, we investigate the effect of a microscopic correlation between the dynamics and the interacting topology of coupled FitzHugh-Nagumo oscillators on phase synchronization transition in Barabási-Albert (BA) scale-free networks and Erdös-Rényi (ER) random networks. We show that, if natural frequencies of the oscillations are positively correlated with node degrees and the width of the frequency distribution is larger than a threshold value, a strong hysteresis loop arises in the synchronization diagram of BA networks, indicating the evidence of an explosive transition towards synchronization of relaxation oscillators system. In contrast to the results in BA networks, in more homogeneous ER networks, the synchronization transition is always of continuous type regardless of the width of the frequency distribution. Moreover, we consider the effect of degree-mixing patterns on the nature of the synchronization transition, and find that the degree assortativity is unfavorable for the occurrence of such an explosive transition.
The Self as a Complex Dynamic System
Mercer, Sarah
2011-01-01
This article explores the potential offered by complexity theories for understanding language learners' sense of self and attempts to show how the self might usefully be conceived of as a complex dynamic system. Rather than presenting empirical findings, the article discusses existent research on the self and aims at outlining a conceptual…
Kawano, Yu; Cao, Ming
2017-01-01
We define and then study the structural observability for a class of complex networks whose dynamics are governed by the nonlinear balance equations. Although related notions of observability of such complex networks have been studied before and in particular, necessary conditions have been reported
Optimal topology to minimizing congestion in connected communication complex network
Benyoussef, M.; Ez-Zahraouy, H.; Benyoussef, A.
In this paper, a new model of the interdependent complex network is proposed, based on two assumptions that (i) the capacity of a node depends on its degree, and (ii) the traffic load depends on the distribution of the links in the network. Based on these assumptions, the presented model proposes a method of connection not based on the node having a higher degree but on the region containing hubs. It is found that the final network exhibits two kinds of degree distribution behavior, depending on the kind and the way of the connection. This study reveals a direct relation between network structure and traffic flow. It is found that pc the point of transition between the free flow and the congested phase depends on the network structure and the degree distribution. Moreover, this new model provides an improvement in the traffic compared to the results found in a single network. The same behavior of degree distribution found in a BA network and observed in the real world is obtained; except for this model, the transition point between the free phase and congested phase is much higher than the one observed in a network of BA, for both static and dynamic protocols.
Product development projects dynamics and emergent complexity
Schlick, Christopher
2016-01-01
This book primarily explores two topics: the representation of simultaneous, cooperative work processes in product development projects with the help of statistical models, and the assessment of their emergent complexity using a metric from theoretical physics (Effective Measure Complexity, EMC). It is intended to promote more effective management of development projects by shifting the focus from the structural complexity of the product being developed to the dynamic complexity of the development processes involved. The book is divided into four main parts, the first of which provides an introduction to vector autoregression models, periodic vector autoregression models and linear dynamical systems for modeling cooperative work in product development projects. The second part presents theoretical approaches for assessing complexity in the product development environment, while the third highlights and explains closed-form solutions for the complexity metric EMC for vector autoregression models and linear dyn...
Convergent dynamics for multistable delayed neural networks
International Nuclear Information System (INIS)
Shih, Chih-Wen; Tseng, Jui-Pin
2008-01-01
This investigation aims at developing a methodology to establish convergence of dynamics for delayed neural network systems with multiple stable equilibria. The present approach is general and can be applied to several network models. We take the Hopfield-type neural networks with both instantaneous and delayed feedbacks to illustrate the idea. We shall construct the complete dynamical scenario which comprises exactly 2 n stable equilibria and exactly (3 n − 2 n ) unstable equilibria for the n-neuron network. In addition, it is shown that every solution of the system converges to one of the equilibria as time tends to infinity. The approach is based on employing the geometrical structure of the network system. Positively invariant sets and componentwise dynamical properties are derived under the geometrical configuration. An iteration scheme is subsequently designed to confirm the convergence of dynamics for the system. Two examples with numerical simulations are arranged to illustrate the present theory
Information governance in dynamic networked business process management
Rasouli, M.; Eshuis, H.; Grefen, P.W.P.J.; Trienekens, J.J.M.; Kusters, R.J.
2016-01-01
Competition in today’s globalized markets forces organizations to collaborate within dynamic business networks to provide mass-customized integrated solutions for customers. The collaboration within dynamic business networks necessitates forming dynamic networked business processes (DNBPs).
Dynamics of complex quantum systems
Akulin, Vladimir M
2014-01-01
This book gathers together a range of similar problems that can be encountered in different fields of modern quantum physics and that have common features with regard to multilevel quantum systems. The main motivation was to examine from a uniform standpoint various models and approaches that have been developed in atomic, molecular, condensed matter, chemical, laser and nuclear physics in various contexts. The book should help senior-level undergraduate, graduate students and researchers putting particular problems in these fields into a broader scientific context and thereby taking advantage of well-established techniques used in adjacent fields. This second edition has been expanded to include substantial new material (e.g. new sections on Dynamic Localization and on Euclidean Random Matrices and new chapters on Entanglement, Open Quantum Systems, and Coherence Protection). It is based on the author’s lectures at the Moscow Institute of Physics and Technology, at the CNRS Aimé Cotton Laboratory, and on ...
Dynamics in electron transfer protein complexes
Bashir, Qamar
2010-01-01
Recent studies have provided experimental evidence for the existence of an encounter complex, a transient intermediate in the formation of protein complexes. We have used paramagnetic relaxation enhancement NMR spectroscopy in combination with Monte Carlo simulations to characterize and visualize the ensemble of encounter orientations in the short-lived electron transfer complex of yeast Cc and CcP. The complete conformational space sampled by the protein molecules during the dynamic part of ...
Extended shortest path selection for package routing of complex networks
Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi
The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.
Agent Based Modeling on Organizational Dynamics of Terrorist Network
Directory of Open Access Journals (Sweden)
Bo Li
2015-01-01
Full Text Available Modeling organizational dynamics of terrorist network is a critical issue in computational analysis of terrorism research. The first step for effective counterterrorism and strategic intervention is to investigate how the terrorists operate with the relational network and what affects the performance. In this paper, we investigate the organizational dynamics by employing a computational experimentation methodology. The hierarchical cellular network model and the organizational dynamics model are developed for modeling the hybrid relational structure and complex operational processes, respectively. To intuitively elucidate this method, the agent based modeling is used to simulate the terrorist network and test the performance in diverse scenarios. Based on the experimental results, we show how the changes of operational environments affect the development of terrorist organization in terms of its recovery and capacity to perform future tasks. The potential strategies are also discussed, which can be used to restrain the activities of terrorists.
Dynamic hydro-climatic networks in pristine and regulated rivers
Botter, G.; Basso, S.; Lazzaro, G.; Doulatyari, B.; Biswal, B.; Schirmer, M.; Rinaldo, A.
2014-12-01
Flow patterns observed at-a-station are the dynamical byproduct of a cascade of processes involving different compartments of the hydro-climatic network (e.g., climate, rainfall, soil, vegetation) that regulates the transformation of rainfall into streamflows. In complex branching rivers, flow regimes result from the heterogeneous arrangement around the stream network of multiple hydrologic cascades that simultaneously occur within distinct contributing areas. As such, flow regimes are seen as the integrated output of a complex "network of networks", which can be properly characterized by its degree of temporal variability and spatial heterogeneity. Hydrologic networks that generate river flow regimes are dynamic in nature. In pristine rivers, the time-variance naturally emerges at multiple timescales from climate variability (namely, seasonality and inter-annual fluctuations), implying that the magnitude (and the features) of the water flow between two nodes may be highly variable across different seasons and years. Conversely, the spatial distribution of river flow regimes within pristine rivers involves scale-dependent transport features, as well as regional climatic and soil use gradients, which in small and meso-scale catchments (A guarantee quite uniform flow regimes and high spatial correlations. Human-impacted rivers, instead, constitute hybrid networks where observed spatio-temporal patterns are dominated by anthropogenic shifts, such as landscape alterations and river regulation. In regulated rivers, the magnitude and the features of water flows from node to node may change significantly through time due to damming and withdrawals. However, regulation may impact river regimes in a spatially heterogeneous manner (e.g. in localized river reaches), with a significant decrease of spatial correlations and network connectivity. Provided that the spatial and temporal dynamics of flow regimes in complex rivers may strongly impact important biotic processes
Psychology and social networks: a dynamic network theory perspective.
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).
Resumption of dynamism in damaged networks of coupled oscillators
Kundu, Srilena; Majhi, Soumen; Ghosh, Dibakar
2018-05-01
Deterioration in dynamical activities may come up naturally or due to environmental influences in a massive portion of biological and physical systems. Such dynamical degradation may have outright effect on the substantive network performance. This requires us to provide some proper prescriptions to overcome undesired circumstances. In this paper, we present a scheme based on external feedback that can efficiently revive dynamism in damaged networks of active and inactive oscillators and thus enhance the network survivability. Both numerical and analytical investigations are performed in order to verify our claim. We also provide a comparative study on the effectiveness of this mechanism for feedbacks to the inactive group or to the active group only. Most importantly, resurrection of dynamical activity is realized even in time-delayed damaged networks, which are considered to be less persistent against deterioration in the form of inactivity in the oscillators. Furthermore, prominence in our approach is substantiated by providing evidence of enhanced network persistence in complex network topologies taking small-world and scale-free architectures, which makes the proposed remedy quite general. Besides the study in the network of Stuart-Landau oscillators, affirmative influence of external feedback has been justified in the network of chaotic Rössler systems as well.
Modularity and the spread of perturbations in complex dynamical systems.
Kolchinsky, Artemy; Gates, Alexander J; Rocha, Luis M
2015-12-01
We propose a method to decompose dynamical systems based on the idea that modules constrain the spread of perturbations. We find partitions of system variables that maximize "perturbation modularity," defined as the autocovariance of coarse-grained perturbed trajectories. The measure effectively separates the fast intramodular from the slow intermodular dynamics of perturbation spreading (in this respect, it is a generalization of the "Markov stability" method of network community detection). Our approach captures variation of modular organization across different system states, time scales, and in response to different kinds of perturbations: aspects of modularity which are all relevant to real-world dynamical systems. It offers a principled alternative to detecting communities in networks of statistical dependencies between system variables (e.g., "relevance networks" or "functional networks"). Using coupled logistic maps, we demonstrate that the method uncovers hierarchical modular organization planted in a system's coupling matrix. Additionally, in homogeneously coupled map lattices, it identifies the presence of self-organized modularity that depends on the initial state, dynamical parameters, and type of perturbations. Our approach offers a powerful tool for exploring the modular organization of complex dynamical systems.
COMPLEX NETWORKS IN CLIMATE SCIENCE: PROGRESS, OPPORTUNITIES AND CHALLENGES
National Aeronautics and Space Administration — COMPLEX NETWORKS IN CLIMATE SCIENCE: PROGRESS, OPPORTUNITIES AND CHALLENGES KARSTEN STEINHAEUSER, NITESH V. CHAWLA, AND AUROOP R. GANGULY Abstract. Networks have...
Quantum Google in a Complex Network
Paparo, Giuseppe Davide; Müller, Markus; Comellas, Francesc; Martin-Delgado, Miguel Angel
2013-01-01
We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scale-free and random networks. PMID:24091980
Quantum Google in a Complex Network
Paparo, Giuseppe Davide; Müller, Markus; Comellas, Francesc; Martin-Delgado, Miguel Angel
2013-10-01
We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scale-free and random networks.
Complex network approach to fractional time series
Energy Technology Data Exchange (ETDEWEB)
Manshour, Pouya [Physics Department, Persian Gulf University, Bushehr 75169 (Iran, Islamic Republic of)
2015-10-15
In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacency matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.
Electricity Networks: Infrastructure and Operations. Too complex for a resource?
Energy Technology Data Exchange (ETDEWEB)
Volk, Dennis
2013-07-01
Electricity security remains a priority of energy policy and continuous electrification will further enhance the importance in the years to come. Market liberalisation has brought substantial benefits to societies, including competition, innovation, more client-oriented services and the reduced needs for public expenditure. Further, the path of decarbonisation is a must but experiences with many new technologies and policies show their many implications on power systems. Electricity networks form the backbone of reliable and affordable power systems and also significantly support the inception of renewable generation. The importance of distribution and transmission networks has to be well understood by policy makers and regulators to maintain the sensitive balance within the policy triangle of reliability, affordability and sustainability as power systems rapidly change. Failures in choosing the right institutions and regulatory frameworks to operate and build networks will put the sensitive balance within the policy triangle at risk. ''Too complex for a resource?'' identifies the key challenges the electricity distribution and transmission networks face today and in the future. It further provides for best practice examples on institutional design choices and regulatory frameworks for sound network service provision but also highlights the importance of additional responses required. More market-based and dynamic frameworks for various system services, the growing need for active service participation of renewable generators and highly independent and transparent central operators seem to be at the heart of these responses. ''Too complex for a resource?'' finds that the answer to the challenges ahead is not always more infrastructure and that networks and the services they provide have to be regarded as equal part of the total power system. Thus, accurate and dynamic cost allocation can significantly support to transform
Cascade of links in complex networks
Energy Technology Data Exchange (ETDEWEB)
Feng, Yeqian; Sun, Bihui [Department of Management Science, School of Government, Beijing Normal University, 100875 Beijing (China); Zeng, An, E-mail: anzeng@bnu.edu.cn [School of Systems Science, Beijing Normal University, 100875 Beijing (China)
2017-01-30
Cascading failure is an important process which has been widely used to model catastrophic events such as blackouts and financial crisis in real systems. However, so far most of the studies in the literature focus on the cascading process on nodes, leaving the possibility of link cascade overlooked. In many real cases, the catastrophic events are actually formed by the successive disappearance of links. Examples exist in the financial systems where the firms and banks (i.e. nodes) still exist but many financial trades (i.e. links) are gone during the crisis, and the air transportation systems where the airports (i.e. nodes) are still functional but many airlines (i.e. links) stop operating during bad weather. In this letter, we develop a link cascade model in complex networks. With this model, we find that both artificial and real networks tend to collapse even if a few links are initially attacked. However, the link cascading process can be effectively terminated by setting a few strong nodes in the network which do not respond to any link reduction. Finally, a simulated annealing algorithm is used to optimize the location of these strong nodes, which significantly improves the robustness of the networks against the link cascade. - Highlights: • We propose a link cascade model in complex networks. • Both artificial and real networks tend to collapse even if a few links are initially attacked. • The link cascading process can be effectively terminated by setting a few strong nodes. • A simulated annealing algorithm is used to optimize the location of these strong nodes.
Cascade of links in complex networks
International Nuclear Information System (INIS)
Feng, Yeqian; Sun, Bihui; Zeng, An
2017-01-01
Cascading failure is an important process which has been widely used to model catastrophic events such as blackouts and financial crisis in real systems. However, so far most of the studies in the literature focus on the cascading process on nodes, leaving the possibility of link cascade overlooked. In many real cases, the catastrophic events are actually formed by the successive disappearance of links. Examples exist in the financial systems where the firms and banks (i.e. nodes) still exist but many financial trades (i.e. links) are gone during the crisis, and the air transportation systems where the airports (i.e. nodes) are still functional but many airlines (i.e. links) stop operating during bad weather. In this letter, we develop a link cascade model in complex networks. With this model, we find that both artificial and real networks tend to collapse even if a few links are initially attacked. However, the link cascading process can be effectively terminated by setting a few strong nodes in the network which do not respond to any link reduction. Finally, a simulated annealing algorithm is used to optimize the location of these strong nodes, which significantly improves the robustness of the networks against the link cascade. - Highlights: • We propose a link cascade model in complex networks. • Both artificial and real networks tend to collapse even if a few links are initially attacked. • The link cascading process can be effectively terminated by setting a few strong nodes. • A simulated annealing algorithm is used to optimize the location of these strong nodes.
Complex growing networks with intrinsic vertex fitness
International Nuclear Information System (INIS)
Bedogne, C.; Rodgers, G. J.
2006-01-01
One of the major questions in complex network research is to identify the range of mechanisms by which a complex network can self organize into a scale-free state. In this paper we investigate the interplay between a fitness linking mechanism and both random and preferential attachment. In our models, each vertex is assigned a fitness x, drawn from a probability distribution ρ(x). In Model A, at each time step a vertex is added and joined to an existing vertex, selected at random, with probability p and an edge is introduced between vertices with fitnesses x and y, with a rate f(x,y), with probability 1-p. Model B differs from Model A in that, with probability p, edges are added with preferential attachment rather than randomly. The analysis of Model A shows that, for every fixed fitness x, the network's degree distribution decays exponentially. In Model B we recover instead a power-law degree distribution whose exponent depends only on p, and we show how this result can be generalized. The properties of a number of particular networks are examined
Evolution of weighted complex bus transit networks with flow
Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei
2016-02-01
Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.
Lattice dynamics and molecular dynamics simulation of complex materials
International Nuclear Information System (INIS)
Chaplot, S.L.
1997-01-01
In this article we briefly review the lattice dynamics and molecular dynamics simulation techniques, as used for complex ionic and molecular solids, and demonstrate a number of applications through examples of our work. These computational studies, along with experiments, have provided microscopic insight into the structure and dynamics, phase transitions and thermodynamical properties of a variety of materials including fullerene, high temperature superconducting oxides and geological minerals as a function of pressure and temperature. The computational techniques also allow the study of the structures and dynamics associated with disorder, defects, surfaces, interfaces etc. (author)
Dynamics on Networks of Manifolds
DeVille, Lee; Lerman, Eugene
2015-03-01
We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph fibrations give rise to maps of dynamical systems. Consequently surjective graph fibrations give rise to invariant subsystems and injective graph fibrations give rise to projections of dynamical systems.
Extracting neuronal functional network dynamics via adaptive Granger causality analysis.
Sheikhattar, Alireza; Miran, Sina; Liu, Ji; Fritz, Jonathan B; Shamma, Shihab A; Kanold, Patrick O; Babadi, Behtash
2018-04-24
Quantifying the functional relations between the nodes in a network based on local observations is a key challenge in studying complex systems. Most existing time series analysis techniques for this purpose provide static estimates of the network properties, pertain to stationary Gaussian data, or do not take into account the ubiquitous sparsity in the underlying functional networks. When applied to spike recordings from neuronal ensembles undergoing rapid task-dependent dynamics, they thus hinder a precise statistical characterization of the dynamic neuronal functional networks underlying adaptive behavior. We develop a dynamic estimation and inference paradigm for extracting functional neuronal network dynamics in the sense of Granger, by integrating techniques from adaptive filtering, compressed sensing, point process theory, and high-dimensional statistics. We demonstrate the utility of our proposed paradigm through theoretical analysis, algorithm development, and application to synthetic and real data. Application of our techniques to two-photon Ca 2+ imaging experiments from the mouse auditory cortex reveals unique features of the functional neuronal network structures underlying spontaneous activity at unprecedented spatiotemporal resolution. Our analysis of simultaneous recordings from the ferret auditory and prefrontal cortical areas suggests evidence for the role of rapid top-down and bottom-up functional dynamics across these areas involved in robust attentive behavior.
Research on Evolutionary Mechanism of Agile Supply Chain Network via Complex Network Theory
Directory of Open Access Journals (Sweden)
Nai-Ru Xu
2016-01-01
Full Text Available The paper establishes the evolutionary mechanism model of agile supply chain network by means of complex network theory which can be used to describe the growth process of the agile supply chain network and analyze the complexity of the agile supply chain network. After introducing the process and the suitability of taking complex network theory into supply chain network research, the paper applies complex network theory into the agile supply chain network research, analyzes the complexity of agile supply chain network, presents the evolutionary mechanism of agile supply chain network based on complex network theory, and uses Matlab to simulate degree distribution, average path length, clustering coefficient, and node betweenness. Simulation results show that the evolution result displays the scale-free property. It lays the foundations of further research on agile supply chain network based on complex network theory.
An adaptive routing strategy for packet delivery in complex networks
International Nuclear Information System (INIS)
Zhang, Huan; Liu, Zonghua; Tang, Ming; Hui, P.M.
2007-01-01
We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approach that takes into account of the waiting time only at the neighboring nodes. Key features in numerical results are explained by a mean field theory. The approach has the merit that messages are distributed among the nodes according to the capabilities of the nodes in handling messages
Day-Ahead Anticipation of Complex Network Vulnerability
Stefanov, S. Z.; Wang, Paul P.
2017-11-01
In this paper, a day-ahead anticipation of complex network vulnerability for an intentional threat of an attack or a shock is carried out. An ecological observer is introduced for that reason, which is a watch in the intentional multiverse, tiled by cells; dynamics of the intentional threat for a day-ahead is characterized by a space-time cell; spreading of the intentional threat is derived from its energy; duration of the intentional threat is found by the self-assembling of a space-time cell; the lower bound of probability is assessed to anticipate for a day-ahead the intentional threat; it is indicated that this vulnerability anticipation for a day-ahead is right when the intentional threat leads to dimension doubling of the complex network.
On system behaviour using complex networks of a compression algorithm
Walker, David M.; Correa, Debora C.; Small, Michael
2018-01-01
We construct complex networks of scalar time series using a data compression algorithm. The structure and statistics of the resulting networks can be used to help characterize complex systems, and one property, in particular, appears to be a useful discriminating statistic in surrogate data hypothesis tests. We demonstrate these ideas on systems with known dynamical behaviour and also show that our approach is capable of identifying behavioural transitions within electroencephalogram recordings as well as changes due to a bifurcation parameter of a chaotic system. The technique we propose is dependent on a coarse grained quantization of the original time series and therefore provides potential for a spatial scale-dependent characterization of the data. Finally the method is as computationally efficient as the underlying compression algorithm and provides a compression of the salient features of long time series.
Filtering in Hybrid Dynamic Bayesian Networks
Andersen, Morten Nonboe; Andersen, Rasmus Orum; Wheeler, Kevin
2000-01-01
We implement a 2-time slice dynamic Bayesian network (2T-DBN) framework and make a 1-D state estimation simulation, an extension of the experiment in (v.d. Merwe et al., 2000) and compare different filtering techniques. Furthermore, we demonstrate experimentally that inference in a complex hybrid DBN is possible by simulating fault detection in a watertank system, an extension of the experiment in (Koller & Lerner, 2000) using a hybrid 2T-DBN. In both experiments, we perform approximate inference using standard filtering techniques, Monte Carlo methods and combinations of these. In the watertank simulation, we also demonstrate the use of 'non-strict' Rao-Blackwellisation. We show that the unscented Kalman filter (UKF) and UKF in a particle filtering framework outperform the generic particle filter, the extended Kalman filter (EKF) and EKF in a particle filtering framework with respect to accuracy in terms of estimation RMSE and sensitivity with respect to choice of network structure. Especially we demonstrate the superiority of UKF in a PF framework when our beliefs of how data was generated are wrong. Furthermore, we investigate the influence of data noise in the watertank simulation using UKF and PFUKD and show that the algorithms are more sensitive to changes in the measurement noise level that the process noise level. Theory and implementation is based on (v.d. Merwe et al., 2000).
Dynamical Adaptation in Terrorist Cells/Networks
DEFF Research Database (Denmark)
Hussain, Dil Muhammad Akbar; Ahmed, Zaki
2010-01-01
Typical terrorist cells/networks have dynamical structure as they evolve or adapt to changes which may occur due to capturing or killing of a member of the cell/network. Analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long...
The Social Dynamics of Innovation Networks
Rutten, Roel; Benneworth, Paul Stephen; Irawati, Dessy; Boekema, Frans
2014-01-01
The social dynamics of innovation networks captures the important role of trust, social capital, institutions and norms and values in the creation of knowledge in innovation networks. In doing so, this book connects to a long-standing debate on the socio-spatial context of innovation in economic
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
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
Adaptive Synchronization between Two Different Complex Networks with Time-Varying Delay Coupling
International Nuclear Information System (INIS)
Jian-Rui, Chen; Li-Cheng, Jiao; Jian-She, Wu; Xiao-Hua, Wang
2009-01-01
A new general network model for two complex networks with time-varying delay coupling is presented. Then we investigate its synchronization phenomena. The two complex networks of the model differ in dynamic nodes, the number of nodes and the coupling connections. By using adaptive controllers, a synchronization criterion is derived. Numerical examples are given to demonstrate the effectiveness of the obtained synchronization criterion. This study may widen the application range of synchronization, such as in chaotic secure communication. (general)
Dynamic Frequency Control in Power Networks
Zhao, Changhong; Mallada Garcia, Enrique; Low, Steven H.
2016-01-01
Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the proces...
NITRD LSN Workshop Report on Complex Engineered Networks
Networking and Information Technology Research and Development, Executive Office of the President — Complex engineered networks are everywhere: power grids, Internet, transportation networks, and more. They are being used more than ever before, and yet our...
Directory of Open Access Journals (Sweden)
Guang Hu
2017-01-01
Full Text Available The overall topology and interfacial interactions play key roles in understanding structural and functional principles of protein complexes. Elastic Network Model (ENM and Protein Contact Network (PCN are two widely used methods for high throughput investigation of structures and interactions within protein complexes. In this work, the comparative analysis of ENM and PCN relative to hemoglobin (Hb was taken as case study. We examine four types of structural and dynamical paradigms, namely, conformational change between different states of Hbs, modular analysis, allosteric mechanisms studies, and interface characterization of an Hb. The comparative study shows that ENM has an advantage in studying dynamical properties and protein-protein interfaces, while PCN is better for describing protein structures quantitatively both from local and from global levels. We suggest that the integration of ENM and PCN would give a potential but powerful tool in structural systems biology.
The architecture of dynamic reservoir in the echo state network
Cui, Hongyan; Liu, Xiang; Li, Lixiang
2012-09-01
Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.
Synchronization in node of complex networks consist of complex chaotic system
Energy Technology Data Exchange (ETDEWEB)
Wei, Qiang, E-mail: qiangweibeihua@163.com [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China); Xie, Cheng-jun [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Liu, Hong-jun [School of Information Engineering, Weifang Vocational College, Weifang, 261041 (China); Li, Yan-hui [The Library, Weifang Vocational College, Weifang, 261041 (China)
2014-07-15
A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.
Analysis of complex systems using neural networks
International Nuclear Information System (INIS)
Uhrig, R.E.
1992-01-01
The application of neural networks, alone or in conjunction with other advanced technologies (expert systems, fuzzy logic, and/or genetic algorithms), to some of the problems of complex engineering systems has the potential to enhance the safety, reliability, and operability of these systems. Typically, the measured variables from the systems are analog variables that must be sampled and normalized to expected peak values before they are introduced into neural networks. Often data must be processed to put it into a form more acceptable to the neural network (e.g., a fast Fourier transformation of the time-series data to produce a spectral plot of the data). Specific applications described include: (1) Diagnostics: State of the Plant (2) Hybrid System for Transient Identification, (3) Sensor Validation, (4) Plant-Wide Monitoring, (5) Monitoring of Performance and Efficiency, and (6) Analysis of Vibrations. Although specific examples described deal with nuclear power plants or their subsystems, the techniques described can be applied to a wide variety of complex engineering systems
Phase transitions in Pareto optimal complex networks.
Seoane, Luís F; Solé, Ricard
2015-09-01
The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their topological structure can be diverse, resulting from different mechanisms including multiplicative processes and optimization. In spatial networks or in graphs where cost constraints are at work, as it occurs in a plethora of situations from power grids to the wiring of neurons in the brain, optimization plays an important part in shaping their organization. In this paper we study network designs resulting from a Pareto optimization process, where different simultaneous constraints are the targets of selection. We analyze three variations on a problem, finding phase transitions of different kinds. Distinct phases are associated with different arrangements of the connections, but the need of drastic topological changes does not determine the presence or the nature of the phase transitions encountered. Instead, the functions under optimization do play a determinant role. This reinforces the view that phase transitions do not arise from intrinsic properties of a system alone, but from the interplay of that system with its external constraints.
Learning about knowledge: A complex network approach
International Nuclear Information System (INIS)
Fontoura Costa, Luciano da
2006-01-01
An approach to modeling knowledge acquisition in terms of walks along complex networks is described. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks--i.e., networks composed of successive interconnected layers--are related to compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks--i.e., unreachable nodes--the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barabasi-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaus of knowledge stagnation in the case of the preferential movement strategy in the presence of conditional edges
International Symposium on Complex Computing-Networks
Sevgi, L; CCN2005; Complex computing networks: Brain-like and wave-oriented electrodynamic algorithms
2006-01-01
This book uniquely combines new advances in the electromagnetic and the circuits&systems theory. It integrates both fields regarding computational aspects of common interest. Emphasized subjects are those methods which mimic brain-like and electrodynamic behaviour; among these are cellular neural networks, chaos and chaotic dynamics, attractor-based computation and stream ciphers. The book contains carefully selected contributions from the Symposium CCN2005. Pictures from the bestowal of Honorary Doctorate degrees to Leon O. Chua and Leopold B. Felsen are included.
Dynamic Business Networks: A Headache for Sustainable Systems Interoperability
Agostinho, Carlos; Jardim-Goncalves, Ricardo
Collaborative networked environments emerged with the spread of the internet, contributing to overcome past communication barriers, and identifying interoperability as an essential property. When achieved seamlessly, efficiency is increased in the entire product life cycle. Nowadays, most organizations try to attain interoperability by establishing peer-to-peer mappings with the different partners, or in optimized networks, by using international standard models as the core for information exchange. In current industrial practice, mappings are only defined once, and the morphisms that represent them, are hardcoded in the enterprise systems. This solution has been effective for static environments, where enterprise and product models are valid for decades. However, with an increasingly complex and dynamic global market, models change frequently to answer new customer requirements. This paper draws concepts from the complex systems science and proposes a framework for sustainable systems interoperability in dynamic networks, enabling different organizations to evolve at their own rate.
On the dynamics of a gene regulatory network
International Nuclear Information System (INIS)
Grammaticos, B; Carstea, A S; Ramani, A
2006-01-01
We examine the dynamics of a network of genes focusing on a periodic chain of genes, of arbitrary length. We show that within a given class of sigmoids representing the equilibrium probability of the binding of the RNA polymerase to the core promoter, the system possesses a single stable fixed point. By slightly modifying the sigmoid, introducing 'stiffer' forms, we show that it is possible to find network configurations exhibiting bistable behaviour. Our results do not depend crucially on the length of the chain considered: calculations with finite chains lead to similar results. However, a realistic study of regulatory genetic networks would require the consideration of more complex topologies and interactions
A complex network approach to cloud computing
International Nuclear Information System (INIS)
Travieso, Gonzalo; Ruggiero, Carlos Antônio; Bruno, Odemir Martinez; Costa, Luciano da Fontoura
2016-01-01
Cloud computing has become an important means to speed up computing. One problem influencing heavily the performance of such systems is the choice of nodes as servers responsible for executing the clients’ tasks. In this article we report how complex networks can be used to model such a problem. More specifically, we investigate the performance of the processing respectively to cloud systems underlaid by Erdős–Rényi (ER) and Barabási-Albert (BA) topology containing two servers. Cloud networks involving two communities not necessarily of the same size are also considered in our analysis. The performance of each configuration is quantified in terms of the cost of communication between the client and the nearest server, and the balance of the distribution of tasks between the two servers. Regarding the latter, the ER topology provides better performance than the BA for smaller average degrees and opposite behaviour for larger average degrees. With respect to cost, smaller values are found in the BA topology irrespective of the average degree. In addition, we also verified that it is easier to find good servers in ER than in BA networks. Surprisingly, balance and cost are not too much affected by the presence of communities. However, for a well-defined community network, we found that it is important to assign each server to a different community so as to achieve better performance. (paper: interdisciplinary statistical mechanics )
Deciphering the imprint of topology on nonlinear dynamical network stability
International Nuclear Information System (INIS)
Nitzbon, J; Schultz, P; Heitzig, J; Kurths, J; Hellmann, F
2017-01-01
Coupled oscillator networks show complex interrelations between topological characteristics of the network and the nonlinear stability of single nodes with respect to large but realistic perturbations. We extend previous results on these relations by incorporating sampling-based measures of the transient behaviour of the system, its survivability, as well as its asymptotic behaviour, its basin stability. By combining basin stability and survivability we uncover novel, previously unknown asymptotic states with solitary, desynchronized oscillators which are rotating with a frequency different from their natural one. They occur almost exclusively after perturbations at nodes with specific topological properties. More generally we confirm and significantly refine the results on the distinguished role tree-shaped appendices play for nonlinear stability. We find a topological classification scheme for nodes located in such appendices, that exactly separates them according to their stability properties, thus establishing a strong link between topology and dynamics. Hence, the results can be used for the identification of vulnerable nodes in power grids or other coupled oscillator networks. From this classification we can derive general design principles for resilient power grids. We find that striving for homogeneous network topologies facilitates a better performance in terms of nonlinear dynamical network stability. While the employed second-order Kuramoto-like model is parametrised to be representative for power grids, we expect these insights to transfer to other critical infrastructure systems or complex network dynamics appearing in various other fields. (paper)
Incremental Centrality Algorithms for Dynamic Network Analysis
2013-08-01
literature. 7.1.3 Small World Networks In 1998, Watts and Strogatz introduced a model that starts with a regular lattice (ring) of n nodes and...and S. Strogatz , "Collective Dynamics of ‘Small-World’ Networks," Nature, vol. 393, pp. 440-442, 1998. [13] T. Opsahl, "Structure and Evolution of...34On Random Graphs," Publicationes Mathematicae, vol. 6, 1959. [167] D.J. Watts and S.H. Strogatz , "Collective Dynamics of ‘Small-World’ Networks
Ward, A. S.; Schmadel, N.; Wondzell, S. M.
2017-12-01
River networks are broadly recognized to expand and contract in response to hydrologic forcing. Additionally, the individual controls on river corridor dynamics of hydrologic forcing and geologic setting are well recognized. However, we currently lack tools to integrate our understanding of process dynamics in the river corridor and make predictions at the scale of river networks. In this study, we develop a perceptual model of the river corridor in mountain river networks, translate this into a reduced-complexity mechanistic model, and implement the model in a well-studied headwater catchment. We found that the river network was most sensitive to hydrologic dynamics under the lowest discharges (Qgauge managers of water resources who need to estimate connectivity and flow initiation location along the river corridor over broad, unstudied catchments.
The self as a complex dynamic system
Directory of Open Access Journals (Sweden)
Sarah Mercer
2011-04-01
Full Text Available This article explores the potential offered by complexity theories for understanding language learners’ sense of self and attempts to show how the self might usefully be conceived of as a complex dynamic system. Rather than presenting empirical findings, the article discusses existent research on the self and aims at outlining a conceptual perspective that may inform future studies into the self and possibly other individual learner differences. The article concludes by critically considering the merits of a complexity perspective but also reflecting on the challenges it poses for research.
Conflict and convention in dynamic networks.
Foley, Michael; Forber, Patrick; Smead, Rory; Riedl, Christoph
2018-03-01
An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioural strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here, we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models. © 2017 The Author(s).
Learning State Space Dynamics in Recurrent Networks
Simard, Patrice Yvon
Fully recurrent (asymmetrical) networks can be used to learn temporal trajectories. The network is unfolded in time, and backpropagation is used to train the weights. The presence of recurrent connections creates internal states in the system which vary as a function of time. The resulting dynamics can provide interesting additional computing power but learning is made more difficult by the existence of internal memories. This study first exhibits the properties of recurrent networks in terms of convergence when the internal states of the system are unknown. A new energy functional is provided to change the weights of the units in order to the control the stability of the fixed points of the network's dynamics. The power of the resultant algorithm is illustrated with the simulation of a content addressable memory. Next, the more general case of time trajectories on a recurrent network is studied. An application is proposed in which trajectories are generated to draw letters as a function of an input. In another application of recurrent systems, a neural network certain temporal properties observed in human callosally sectioned brains. Finally the proposed algorithm for stabilizing dynamics around fixed points is extended to one for stabilizing dynamics around time trajectories. Its effects are illustrated on a network which generates Lisajous curves.
Dynamic Protection of Optical Networks
DEFF Research Database (Denmark)
Ruepp, Sarah Renée
2008-01-01
This thesis deals with making optical networks resilient to failures. The recovery performance of path, segment and span restoration is evaluated in a network with limited wavelength conversion capability using both standard and enhanced wavelength assignment schemes. The enhanced wavelength...... stubs at the failure adjacent nodes. Both modifcations have a positive influence on the recovery percentage. The recovery enhancements are applicable in both single and multi-domain network environments. Stub release, where the still working parts of a failure affected connection are released prior...... of the modularity of capacity units is investigated for resilient network design. Different span upgrading strategies and algorithms for finding restoration paths are evaluated. Furthermore, the capacity effciency of constraining restoration requests for the same destination node to the same restoration path...
Cognitive radio networks dynamic resource allocation schemes
Wang, Shaowei
2014-01-01
This SpringerBrief presents a survey of dynamic resource allocation schemes in Cognitive Radio (CR) Systems, focusing on the spectral-efficiency and energy-efficiency in wireless networks. It also introduces a variety of dynamic resource allocation schemes for CR networks and provides a concise introduction of the landscape of CR technology. The author covers in detail the dynamic resource allocation problem for the motivations and challenges in CR systems. The Spectral- and Energy-Efficient resource allocation schemes are comprehensively investigated, including new insights into the trade-off
PREFACE: Complex Networks: from Biology to Information Technology
Barrat, A.; Boccaletti, S.; Caldarelli, G.; Chessa, A.; Latora, V.; Motter, A. E.
2008-06-01
The field of complex networks is one of the most active areas in contemporary statistical physics. Ten years after seminal work initiated the modern study of networks, interest in the field is in fact still growing, as indicated by the ever increasing number of publications in network science. The reason for such a resounding success is most likely the simplicity and broad significance of the approach that, through graph theory, allows researchers to address a variety of different complex systems within a common framework. This special issue comprises a selection of contributions presented at the workshop 'Complex Networks: from Biology to Information Technology' held in July 2007 in Pula (Cagliari), Italy as a satellite of the general conference STATPHYS23. The contributions cover a wide range of problems that are currently among the most important questions in the area of complex networks and that are likely to stimulate future research. The issue is organised into four sections. The first two sections describe 'methods' to study the structure and the dynamics of complex networks, respectively. After this methodological part, the issue proceeds with a section on applications to biological systems. The issue closes with a section concentrating on applications to the study of social and technological networks. The first section, entitled Methods: The Structure, consists of six contributions focused on the characterisation and analysis of structural properties of complex networks: The paper Motif-based communities in complex networks by Arenas et al is a study of the occurrence of characteristic small subgraphs in complex networks. These subgraphs, known as motifs, are used to define general classes of nodes and their communities by extending the mathematical expression of the Newman-Girvan modularity. The same line of research, aimed at characterising network structure through the analysis of particular subgraphs, is explored by Bianconi and Gulbahce in Algorithm
Transparency in complex dynamic food supply chains
Trienekens, J.H.; Wognum, P.M.; Beulens, A.J.M.; Vorst, van der J.G.A.J.
2012-01-01
Food supply chains are increasingly complex and dynamic due to (i) increasing product proliferation to serve ever diversifying and globalising markets as a form of mass customisation with resulting global flows of raw materials, ingredients and products, and (ii) the need to satisfy changing and
Improving the Complexity of the Lorenz Dynamics
Directory of Open Access Journals (Sweden)
María Pilar Mareca
2017-01-01
Full Text Available A new four-dimensional, hyperchaotic dynamic system, based on Lorenz dynamics, is presented. Besides, the most representative dynamics which may be found in this new system are located in the phase space and are analyzed here. The new system is especially designed to improve the complexity of Lorenz dynamics, which, despite being a paradigm to understand the chaotic dissipative flows, is a very simple example and shows great vulnerability when used in secure communications. Here, we demonstrate the vulnerability of the Lorenz system in a general way. The proposed 4D system increases the complexity of the Lorenz dynamics. The trajectories of the novel system include structures going from chaos to hyperchaos and chaotic-transient solutions. The symmetry and the stability of the proposed system are also studied. First return maps, Poincaré sections, and bifurcation diagrams allow characterizing the global system behavior and locating some coexisting structures. Numerical results about the first return maps, Poincaré cross sections, Lyapunov spectrum, and Kaplan-Yorke dimension demonstrate the complexity of the proposed equations.
Curvature and temperature of complex networks.
Krioukov, Dmitri; Papadopoulos, Fragkiskos; Vahdat, Amin; Boguñá, Marián
2009-09-01
We show that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space. Fermi-Dirac statistics provides a physical interpretation of hyperbolic distances as energies of links. The hidden space curvature affects the heterogeneity of the degree distribution, while clustering is a function of temperature. We embed the internet into the hyperbolic plane and find a remarkable congruency between the embedding and our hyperbolic model. Besides proving our model realistic, this embedding may be used for routing with only local information, which holds significant promise for improving the performance of internet routing.
Competing dynamic phases of active polymer networks
Freedman, Simon; Banerjee, Shiladitya; Dinner, Aaron R.
Recent experiments on in-vitro reconstituted assemblies of F-actin, myosin-II motors, and cross-linking proteins show that tuning local network properties can changes the fundamental biomechanical behavior of the system. For example, by varying cross-linker density and actin bundle rigidity, one can switch between contractile networks useful for reshaping cells, polarity sorted networks ideal for directed molecular transport, and frustrated networks with robust structural properties. To efficiently investigate the dynamic phases of actomyosin networks, we developed a coarse grained non-equilibrium molecular dynamics simulation of model semiflexible filaments, molecular motors, and cross-linkers with phenomenologically defined interactions. The simulation's accuracy was verified by benchmarking the mechanical properties of its individual components and collective behavior against experimental results at the molecular and network scales. By adjusting the model's parameters, we can reproduce the qualitative phases observed in experiment and predict the protein characteristics where phase crossovers could occur in collective network dynamics. Our model provides a framework for understanding cells' multiple uses of actomyosin networks and their applicability in materials research. Supported by the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program.
Dynamics of High-Resolution Networks
DEFF Research Database (Denmark)
Sekara, Vedran
the unprecedented amounts of information collected by mobile phones to gain detailed insight into the dynamics of social systems. This dissertation presents an unparalleled data collection campaign, collecting highly detailed traces for approximately 1000 people over the course of multiple years. The availability...... are we all affected by an ever changing network structure? Answering these questions will enrich our understanding of ourselves, our organizations, and our societies. Yet, mapping the dynamics of social networks has traditionally been an arduous undertaking. Today, however, it is possible to use...... of such dynamic maps allows us to probe the underlying social network and understand how individuals interact and form lasting friendships. More importantly, these highly detailed dynamic maps provide us new perspectives at traditional problems and allow us to quantify and predict human life....
Control theory of digitally networked dynamic systems
Lunze, Jan
2013-01-01
The book gives an introduction to networked control systems and describes new modeling paradigms, analysis methods for event-driven, digitally networked systems, and design methods for distributed estimation and control. Networked model predictive control is developed as a means to tolerate time delays and packet loss brought about by the communication network. In event-based control the traditional periodic sampling is replaced by state-dependent triggering schemes. Novel methods for multi-agent systems ensure complete or clustered synchrony of agents with identical or with individual dynamic
Network Unfolding Map by Vertex-Edge Dynamics Modeling.
Verri, Filipe Alves Neto; Urio, Paulo Roberto; Zhao, Liang
2018-02-01
The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network, which are called particles, to solve semisupervised learning problems. Three actions govern the particles' dynamics: generation, walking, and absorption. Labeled vertices generate new particles that compete against rival particles for edge domination. Active particles randomly walk in the network until they are absorbed by either a rival vertex or an edge currently dominated by rival particles. The result from the model evolution consists of sets of edges arranged by the label dominance. Each set tends to form a connected subnetwork to represent a data class. Although the intrinsic dynamics of the model is a stochastic one, we prove that there exists a deterministic version with largely reduced computational complexity; specifically, with linear growth. Furthermore, the edge domination process corresponds to an unfolding map in such way that edges "stretch" and "shrink" according to the vertex-edge dynamics. Consequently, the unfolding effect summarizes the relevant relationships between vertices and the uncovered data classes. The proposed model captures important details of connectivity patterns over the vertex-edge dynamics evolution, in contrast to the previous approaches, which focused on only vertex or only edge dynamics. Computer simulations reveal that the new model can identify nonlinear features in both real and artificial data, including boundaries between distinct classes and overlapping structures of data.
Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui
2017-10-06
Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli , and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.
Review of Public Safety in Viewpoint of Complex Networks
International Nuclear Information System (INIS)
Gai Chengcheng; Weng Wenguo; Yuan Hongyong
2010-01-01
In this paper, a brief review of public safety in viewpoint of complex networks is presented. Public safety incidents are divided into four categories: natural disasters, industry accidents, public health and social security, in which the complex network approaches and theories are need. We review how the complex network methods was developed and used in the studies of the three kinds of public safety incidents. The typical public safety incidents studied by the complex network methods in this paper are introduced, including the natural disaster chains, blackouts on electric power grids and epidemic spreading. Finally, we look ahead to the application prospects of the complex network theory on public safety.
Uncertainty Reduction for Stochastic Processes on Complex Networks
Radicchi, Filippo; Castellano, Claudio
2018-05-01
Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules, the ability to predict system configurations is generally characterized by a large uncertainty. Selecting a fraction of the nodes and observing their state may help to reduce the uncertainty about the unobserved nodes. However, choosing these points of observation in an optimal way is a highly nontrivial task, depending on the nature of the stochastic process and on the structure of the underlying interaction pattern. In this paper, we introduce a computationally efficient algorithm to determine quasioptimal solutions to the problem. The method leverages network sparsity to reduce computational complexity from exponential to almost quadratic, thus allowing the straightforward application of the method to mid-to-large-size systems. Although the method is exact only for equilibrium stochastic processes defined on trees, it turns out to be effective also for out-of-equilibrium processes on sparse loopy networks.
Entropy for the Complexity of Physiological Signal Dynamics.
Zhang, Xiaohua Douglas
2017-01-01
Recently, the rapid development of large data storage technologies, mobile network technology, and portable medical devices makes it possible to measure, record, store, and track analysis of biological dynamics. Portable noninvasive medical devices are crucial to capture individual characteristics of biological dynamics. The wearable noninvasive medical devices and the analysis/management of related digital medical data will revolutionize the management and treatment of diseases, subsequently resulting in the establishment of a new healthcare system. One of the key features that can be extracted from the data obtained by wearable noninvasive medical device is the complexity of physiological signals, which can be represented by entropy of biological dynamics contained in the physiological signals measured by these continuous monitoring medical devices. Thus, in this chapter I present the major concepts of entropy that are commonly used to measure the complexity of biological dynamics. The concepts include Shannon entropy, Kolmogorov entropy, Renyi entropy, approximate entropy, sample entropy, and multiscale entropy. I also demonstrate an example of using entropy for the complexity of glucose dynamics.
Consensus and Synchronization in Complex Networks
2013-01-01
Synchronization in complex networks is one of the most captivating cooperative phenomena in nature and has been shown to be of fundamental importance in such varied circumstances as the continued existence of species, the functioning of heart pacemaker cells, epileptic seizures, neuronal firing in the feline visual cortex and cognitive tasks in humans. E.g. coupled visual and acoustic interactions make fireflies flash, crickets chirp, and an audience clap in unison. On the other hand, in distributed systems and networks, it is often necessary for some or all of the nodes to calculate some function of certain parameters, e.g. sink nodes in sensor networks being tasked with calculating the average measurement value of all the sensors or multi-agent systems in which all agents are required to coordinate their speed and direction. When all nodes calculate the same function of the initial values in the system, they are said to reach consensus. Such concepts - sometimes also called state agreement, rendezvous, and ...
Noise-induced polarization switching in complex networks
Haerter, Jan O.; Díaz-Guilera, Albert; Serrano, M. Ángeles
2017-04-01
The combination of bistability and noise is ubiquitous in complex systems, from biology to social interactions, and has important implications for their functioning and resilience. Here we use a simple three-state dynamical process, in which nodes go from one pole to another through an intermediate state, to show that noise can induce polarization switching in bistable systems if dynamical correlations are significant. In large, fully connected networks, where dynamical correlations can be neglected, increasing noise yields a collapse of bistability to an unpolarized configuration where the three possible states of the nodes are equally likely. In contrast, increased noise induces abrupt and irreversible polarization switching in sparsely connected networks. In multiplexes, where each layer can have a different polarization tendency, one layer is dominant and progressively imposes its polarization state on the other, offsetting or promoting the ability of noise to switch its polarization. Overall, we show that the interplay of noise and dynamical correlations can yield discontinuous transitions between extremes, which cannot be explained by a simple mean-field description.
Global synchronization of a class of delayed complex networks
International Nuclear Information System (INIS)
Li Ping; Yi Zhang; Zhang Lei
2006-01-01
Global synchronization of a class of complex networks with time-varying delays is investigated in this paper. Some sufficient conditions are derived. These conditions show that the synchronization of delayed complex networks can be determined by their topologies. In addition, these conditions are simply represented in terms of the networks coupling matrix and are easy to be checked. A typical example of complex networks with chaotic nodes is employed to illustrate the obtained global synchronization results
Traffic Dynamics of Computer Networks
Fekete, Attila
2008-10-01
Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I studied the stochastic behavior of TCP, the primary algorithm governing traffic in the current Internet, in an elementary network scenario consisting of a standalone infinite-sized buffer and an access link. The effect of the fast recovery and fast retransmission (FR/FR) algorithms is also considered. I showed that my model can be extended further to involve the effect of link propagation delay, characteristic of WAN. I continued my thesis with the investigation of finite-sized semi-bottleneck buffers, where packets can be dropped not only at the link, but also at the buffer. I demonstrated that the behavior of the system depends only on a certain combination of the parameters. Moreover, an analytic formula was derived that gives the ratio of packet loss rate at the buffer to the total packet loss rate. This formula makes it possible to treat buffer-losses as if they were link-losses. Finally, I studied computer networks from a structural perspective. I demonstrated through fluid simulations that the distribution of resources, specifically the link bandwidth, has a serious impact on the global performance of the network. Then I analyzed the distribution of edge betweenness in a growing scale-free tree under the condition that a local property, the in-degree of the "younger" node of an arbitrary edge, is known in order to find an optimum distribution of link capacity. The derived formula is exact even for finite-sized networks. I also calculated the conditional expectation of edge betweenness, rescaled for infinite networks.
The dynamics of transmission and the dynamics of networks.
Farine, Damien
2017-05-01
A toy example depicted here highlighting the results of a study in this issue of the Journal of Animal Ecology that investigates the impact of network dynamics on potential disease outbreaks. Infections (stars) that spread by contact only (left) reduce the predicted outbreak size compared to situations where individuals can become infected by moving through areas that previously contained infected individuals (right). This is potentially important in species where individuals, or in this case groups, have overlapping ranges (as depicted on the top right). Incorporating network dynamics that maintain information about the ordering of contacts (central blocks; including the ordering of spatial overlap as noted by the arrows that highlight the blue group arriving after the red group in top-right of the figure) is important for capturing how a disease might not have the opportunity to spread to all individuals. By contrast, a static or 'average' network (lower blocks) does not capture any of these dynamics. Interestingly, although static networks generally predict larger outbreak sizes, the authors find that in cases when transmission probability is low, this prediction can switch as a result of changes in the estimated intensity of contacts among individuals. [Colour figure can be viewed at wileyonlinelibrary.com]. Springer, A., Kappeler, P.M. & Nunn, C.L. (2017) Dynamic vs. static social networks in models of parasite transmission: Predicting Cryptosporidium spread in wild lemurs. Journal of Animal Ecology, 86, 419-433. The spread of disease or information through networks can be affected by several factors. Whether and how these factors are accounted for can fundamentally change the predicted impact of a spreading epidemic. Springer, Kappeler & Nunn () investigate the role of different modes of transmission and network dynamics on the predicted size of a disease outbreak across several groups of Verreaux's sifakas, a group-living species of lemur. While some factors
Complexity, Chaos, and Nonlinear Dynamics: A New Perspective on Career Development Theory
Bloch, Deborah P.
2005-01-01
The author presents a theory of career development drawing on nonlinear dynamics and chaos and complexity theories. Career is presented as a complex adaptive entity, a fractal of the human entity. Characteristics of complex adaptive entities, including (a) autopiesis, or self-regeneration; (b) open exchange; (c) participation in networks; (d)…
Dynamics-based centrality for directed networks.
Masuda, Naoki; Kori, Hiroshi
2010-11-01
Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.