Complex network analysis in inclined oil--water two-phase flow

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.     

Complex Ginzburg-Landau equation on networks and its non-uniform dynamics

Dynamics of the complex Ginzburg-Landau equation describing networks of diffusively coupled limit-cycle oscillators near the Hopf bifurcation is reviewed. It is shown that the Benjamin-Feir instability destabilizes the uniformly synchronized state and leads to non-uniform pattern dynamics on general networks. Nonlinear dynamics on several network topologies, i.e., local, nonlocal, global, and random networks, are briefly illustrated by numerical simulations.     

Traffic dynamics on layered complex networks

To minimize traffic congestion, understanding how traffic dynamics depend on network structure is necessary. Many real-world complex systems can be described as multilayer structures. In this paper, we introduce the idea of layers to establish a traffic model of two-layer complex networks. By comparing different two-layer complex networks based on random and scale-free networks, we find that the physical layer is much more important to the network capacity of two-layer complex networks than the logical layer. Two-layer complex networks with a homogeneous physical topology are found to be more tolerant to congestion. Moreover, simulation results show that the heterogeneity of logical and physical topologies makes the packet-delivery process of two-layer networks more efficient in the free-flow state, without the occurrence of traffic congestion.     

Synchronizability of chaotic logistic maps in delayed complex networks

We study a network of coupled logistic maps whose interactions occur with a certain distribution of delay times. The local dynamics is chaotic in the absence of coupling and thus the network is a paradigm of a complex system. There are two regimes of synchronization, depending on the distribution of delays: when the delays are sufficiently heterogeneous the network synchronizes on a steady-state (that is unstable for the uncoupled maps); when the delays are homogeneous, it synchronizes in a time-dependent state (that is either periodic or chaotic). Using two global indicators we quantify the synchronizability on the two regimes, focusing on the roles of the network connectivity and the topology. The connectivity is measured in terms of the average number of links per node, and we consider various topologies (scale-free, small-world, star, and nearest-neighbor with and without a central hub). With weak connectivity and weak coupling strength, the network displays an irregular oscillatory dynamics that is largely independent of the topology and of the delay distribution. With heterogeneous delays, we find a threshold connectivity level below which the network does not synchronize, regardless of the network size. This minimum average number of neighbors seems to be independent of the delay distribution. We also analyze the effect of self-feedback loops and find that they have an impact on the synchronizability of small networks with large coupling strengths. The influence of feedback, enhancing or degrading synchronization, depends on the topology and on the distribution of delays.     

基于Kendall改进的同步算法癫痫脑网络分析

提出了一种基于Kendall等级相关改进的同步算法IRC(inverse rank correlation).Kendall等级相关是非线性动力学分析的一般化算法,可有效地度量变量间的非线性相关性.复杂网络的研究已逐渐深入到社会科学的各个领域,脑网络的研究已经成为当今脑功能研究的热点.利用改进的IRC算法,基于脑电EEG(electroencephalogram)数据来构建大脑功能性网络.对构建的脑功能网络的度指标进行了分析,以调查癫痫脑功能网络是否异于正常人.结果显示:使用该改进的算法能够对癫痫和正常脑功能网络显著区分,且只需要记录很短的脑电数据.实验结果数据表明,该方法适用于区分癫痫和正常脑组织网络度指标,它可有助于进一步地加深对大脑的神经动力学行为的研究,并为临床诊断提供有效工具.     

Improved functional-weight approach to oscillatory patterns in excitable networks

Studies of sustained oscillations on complex networks with excitable node dynamics received much interest in recent years. Although an individual unit is non-oscillatory, they may organize to form various collective oscillatory patterns through networked connections. An excitable network usually possesses a number of oscillatory modes dominated by different Winfree loops and numerous spatiotemporal patterns organized by different propagation path distributions. The traditional approach of the so-called dominant phase-advanced drive method has been well applied to the study of stationary oscillation patterns on a network. In this paper, we develop the functional-weight approach that has been successfully used in studies of sustained oscillations in gene-regulated networks by an extension to the high-dimensional node dynamics. This approach can be well applied to the study of sustained oscillations in coupled excitable units. We tested this scheme for different networks, such as homogeneous random networks, small-world networks, and scale-free networks and found it can accurately dig out the oscillation source and the propagation path. The present approach is believed to have the potential in studies competitive non-stationary dynamics.     

Effects of Different Connectivity Topologies in Small World Networks on EEG-Like Activities

Based on our previously pulse-coupled integrate-and-fire neuron model in small world networks, we investigate the effects of different connectivity topologies on complex behavior of electroencephalographic-like signals produced by this model. We show that several times series analysis methods that are often used for analyzing complex behavior of electroencephalographic-like signals, such as reconstruction of the phase space, correlation dimension, fractal dimension, and the Hurst exponent within the rescaled range analysis (R/S). We find that the different connectivity topologies lead to different dynamical behaviors in models of integrate-and-fire neurons.     

Complex Networks: from Graph Theory to Biology

The aim of this text is to show the central role played by networks in complex system science. A remarkable feature of network studies is to lie at the crossroads of different disciplines, from mathematics (graph theory, combinatorics, probability theory) to physics (statistical physics of networks) to computer science (network generating algorithms, combinatorial optimization) to biological issues (regulatory networks). New paradigms recently appeared, like that of ‘scale-free networks’ providing an alternative to the random graph model introduced long ago by Erdös and Renyi. With the notion of statistical ensemble and methods originally introduced for percolation networks, statistical physics is of high relevance to get a deep account of topological and statistical properties of a network. Then their consequences on the dynamics taking place in the network should be investigated. Impact of network theory is huge in all natural sciences, especially in biology with gene networks, metabolic networks, neural networks or food webs. I illustrate this brief overview with a recent work on the influence of network topology on the dynamics of coupled excitable units, and the insights it provides about network emerging features, robustness of network behaviors, and the notion of static or dynamic motif.     

Network robustness to targeted attacks. The interplay of expansibility and degree distribution

We study the property of certain complex networks of being both sparse and highly connected, which is known as “good expansion” (GE). A network has GE properties if every subset S of nodes (up to 50% of the nodes) has a neighborhood that is larger than some “expansion factor” φ multiplied by the number of nodes in S. Using a graph spectral method we introduce here a new parameter measuring the good expansion character of a network. By means of this parameter we are able to classify 51 real-world complex networks — technological, biological, informational, biological and social — as GENs or non-GENs. Combining GE properties and node degree distribution (DD) we classify these complex networks in four different groups, which have different resilience to intentional attacks against their nodes. The simultaneous existence of GE properties and uniform degree distribution contribute significantly to the robustness in complex networks. These features appear solely in 14% of the 51 real-world networks studied here. At the other extreme we find that ∼40% of all networks are very vulnerable to targeted attacks. They lack GE properties, display skewed DD — exponential or power-law — and their topologies are changed more dramatically by targeted attacks directed at bottlenecks than by the removal of network hubs.     

Bridge and brick motifs in complex networks

Acknowledging the expanding role of complex networks in numerous scientific contexts, we examine significant functional and topological differences between bridge and brick motifs for predicting network behaviors and functions. After observing similarities between social networks and their genetic, ecological, and engineering counterparts, we identify a larger number of brick motifs in social networks and bridge motifs in the other three types. We conclude that bridge and brick motif content analysis can assist researchers in understanding the small-world and clustering properties of network structures when investigating network functions and behaviors.     

Understanding the enhanced synchronization of delay-coupled networks with fluctuating topology

We study the dynamics of networks with coupling delay, from which the connectivity changes over time. The synchronization properties are shown to depend on the interplay of three time scales: the internal time scale of the dynamics, the coupling delay along the network links and time scale at which the topology changes. Concentrating on a linearized model, we develop an analytical theory for the stability of a synchronized solution. In two limit cases, the system can be reduced to an “effective” topology: in the fast switching approximation, when the network fluctuations are much faster than the internal time scale and the coupling delay, the effective network topology is the arithmetic mean over the different topologies. In the slow network limit, when the network fluctuation time scale is equal to the coupling delay, the effective adjacency matrix is the geometric mean over the adjacency matrices of the different topologies. In the intermediate regime, the system shows a sensitive dependence on the ratio of time scales, and on the specific topologies, reproduced as well by numerical simulations. Our results are shown to describe the synchronization properties of fluctuating networks of delay-coupled chaotic maps.     

Synchronization in uncertain complex networks

We consider the problem of synchronization in uncertain generic complex networks. For generic complex networks with unknown dynamics of nodes and unknown coupling functions including uniform and nonuniform inner couplings, some simple linear feedback controllers with updated strengths are designed using the well-known LaSalle invariance principle. The state of an uncertain generic complex network can synchronize an arbitrary assigned state of an isolated node of the network. The famous Lorenz system is stimulated as the nodes of the complex networks with different topologies. We found that the star coupled and scale-free networks with nonuniform inner couplings can be in the state of synchronization if only a fraction of nodes are controlled.     

Attractive target wave patterns in complex networks consisting of excitable nodes

This review describes the investigations of oscillatory complex networks consisting of excitable nodes,focusing on the target wave patterns or say the target wave attractors.A method of dominant phase advanced driving(DPAD) is introduced to reveal the dynamic structures in the networks supporting oscillations,such as the oscillation sources and the main excitation propagation paths from the sources to the whole networks.The target center nodes and their drivers are regarded as the key nodes which can completely determine the corresponding target wave patterns.Therefore,the center(say node A) and its driver(say node B) of a target wave can be used as a label,(A,B),of the given target pattern.The label can give a clue to conveniently retrieve,suppress,and control the target waves.Statistical investigations,both theoretically from the label analysis and numerically from direct simulations of network dynamics,show that there exist huge numbers of target wave attractors in excitable complex networks if the system size is large,and all these attractors can be labeled and easily controlled based on the information given by the labels.The possible applications of the physical ideas and the mathematical methods about multiplicity and labelability of attractors to memory problems of neural networks are briefly discussed.     

Evolution of microscopic and mesoscopic synchronized patterns in complex networks

Previous studies about synchronization of Kuramoto oscillators in complex networks have shown how local patterns of synchronization emerge differently in homogeneous and heterogeneous topologies. The main difference between the paths to synchronization in both topologies is rooted in the growth of the largest connected component of synchronized nodes when increasing the coupling between the oscillators. Nevertheless, a recent study focusing on this same phenomenon has claimed the contrary, stating that the statistical distribution of synchronized clusters for both types of networks is similar. Here we provide extensive numerical evidences that confirm the original claims, namely, that the microscopic and mesoscopic dynamics of the synchronized patterns indeed follow different routes.     

Disease spreading on fitness-rewired complex networks

As people travel, human contact networks may change topologically from time to time. In this paper, we study the problem of epidemic spreading on this kind of dynamic network, specifically the one in which the rewiring dynamics of edges are carried out to preserve the degree of each node (called fitness rewiring). We also consider the adaptive rewiring of edges, which encourages disconnections from and discourages connections to infected nodes and eventually leads to the isolation of the infected from the susceptible with only a small number of links between them. We find that while the threshold of epidemic spreading remains unchanged and prevalence increases in the fitness rewiring dynamics, meeting of the epidemic threshold is delayed and prevalence is reduced (if adaptive dynamics are included). To understand these different behaviors, we introduce a new measure called the “mean change of effective links” and find that creation and deletion of pathways for pathogen transmission are the dominant factors in fitness and adaptive rewiring dynamics, respectively.     

Stability and dynamical properties of material flow systems on random networks

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.     

Influence of a network structure on the network effect in the communication service market

In this study, we analyze the network effect in a model of a personal communication market, by using a multi-agent based simulation approach. We introduce into the simulation model complex network structures as the interaction patterns of agents. With complex network models, we investigate the dynamics of a market in which two providers are competing. We also examine the structure of networks that affect the complex behavior of the market. By a series of simulations, we show that the structural properties of complex networks, such as the clustering coefficient and degree correlation, have a major influence on the dynamics of the market. We find that the network effect is increased if the interaction pattern of agents is characterized by a high clustering coefficient, or a positive degree correlation. We also discuss a suitable model of the interaction pattern for reproducing market dynamics in the real world, by performing simulations using real data of a social network.     

Multivariate analysis of spatially heterogeneous phase synchronisation in complex systems: application to self-organised control of material flows in networks

Networks of interacting components are a class of complex systems that has attracted considerable interest over the last decades. In particular, if the dynamics of the autonomous components is characterised by an oscillatory behaviour, different types of synchronisation can be observed in dependence on the type and strength of interactions. In this contribution, we study the transition from non-synchronised to synchronised phase dynamics in complex networks. The most common approach to quantify the degree of phase synchronisation in such systems is the consideration of measures of phase coherence which are averaged over all pairs of interacting components. However, this approach implicitly assumes a spatially homogeneous synchronisation process, which is typically not present in complex networks. As a potential alternative, two novel methods of multivariate phase synchronisation analysis are considered: synchronisation cluster analysis (SCA) and the linear variance decay (LVD) dimension method. The strengths and weaknesses of the traditional as well as both new approaches are briefly illustrated for a Kuramoto model with long-range coupling. As a practical application, we study how spatial heterogeneity influences the transition to phase synchronisation in traffic networks where intersecting material flows are subjected to a self-organised decentralised control. We find that the network performance and the degree of phase synchronisation are closely related to each other and decrease significantly in the case of structural heterogeneities. The influences of the different parameters of our control approach on the synchronisation process are systematically studied, yielding a sequence of Arnold tongues which correspond to different locking modes.     

Measuring distances between complex networks

A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade, J.G.V. Miranda, T.P. Lobão, 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.     

The complex topology of chemical plants

We show that flowsheets of oil refineries can be associated to complex network topologies that are scale-free, display small-world effect and possess hierarchical organization. The emergence of these properties from such man-made networks is explained as a consequence of the currently used principles for process design, which include heuristics as well as algorithmic techniques. We expect these results to be valid for chemical plants of different types and capacities.