Heterogeneous Scale-free Networks Research Articles

Directional switches in network-organized swarming systems with delay.

Coordinated directional switches can emerge between members of moving biological groups. Previous studies have shown that the self-propelled particles model can well reproduce directional switching behaviors, but it neglects the impact of social interactions. Thus, we focus on the influence of social interactions on the ordered directional switching motion of swarming systems, in which homogeneous Erdös-Rényi networks, heterogeneous scale-free networks, networks with community structures, and real-world animal social networks have been considered. The theoretical estimation of mean switching time is obtained, and the results show that the interplay between social and delayed interactions plays an important role in regulating directional switching behavior. To be specific, for homogeneous Erdös-Rényi networks, the increase in mean degree may suppress the directional switching behaviors if the delay is sufficiently small. However, when the delay is large, the large mean degree may promote the directional switching behavior. For heterogeneous scale-free networks, the increase of degree heterogeneity can reduce the mean switching time if the delay is sufficiently small, while the increasing degree heterogeneity may suppress the ordered directional switches if the delay is large. For networks with community structures, higher communities can promote directional switches for small delays, while for large delays, it may inhibit directional switching behavior. For dolphin social networks, delay can promote the directional switching behavior. Our results bring to light the role of social and delayed interactions in the ordered directional switching motion.

Energy cost study for controlling complex social networks with conformity behavior.

To understand controlling a complex system, an estimation of the required effort needed to achieve control is vital. Previous works have addressed this issue by studying the scaling laws of energy cost in a general way with continuous-time linear dynamics. However, continuous-time linear dynamics is unable to capture conformity behavior, which is common in many complex social systems. Therefore, to understand controlling social systems with conformity, discrete-time modeling is used and the energy cost scaling laws are derived. The results are validated numerically with model and real networks. In addition, the energy costs needed for controlling systems with and without conformity are compared, and it was found that controlling networked systems with conformity features always requires less control energy. Finally, it is shown through simulations that heterogeneous scale-free networks are less controllable, requiring a higher number of minimum drivers. Since the conformity-based model relates to various complex systems, such as flocking, or evolutionary games, the results of this paper represent a step forward toward developing realistic control of complex social systems.

Pair approximation for the q-voter model with independence on multiplex networks.

The q-voter model with independence is investigated on multiplex networks with full overlap of nodes in the layers. The layers are various complex networks corresponding to different levels of social influence. Detailed studies are performed for the model on multiplex networks with two layers with identical degree distributions, obeying the LOCAL&AND and GLOBAL&AND spin update rules differing by the way in which the q-lobbies of neighbors within different layers exert their joint influence on the opinion of a given agent. Homogeneous pair approximation is derived for a general case of a two-state spin model on a multiplex network and its predictions are compared with results of mean-field approximation and Monte Carlo simulations of the above-mentioned q-voter model with independence for a broad range of parameters. As the parameter controlling the level of agents' independence is changed ferromagnetic phase transition occurs which can be first- or second-order, depending on the size of the lobby q. Details of this transition, e.g., position of the critical points, critical exponents and the width of the possible hysteresis loop, depend on the topology and other features of the layers, in particular on the mean degree of nodes in the layers which is directly predicted by the homogeneous pair approximation. If the mean degree of nodes is substantially larger than the size of the q-lobby good agreement is obtained between numerical results and theoretical predictions based on the homogeneous pair approximation concerning the order and details of the ferromagnetic transition. In the case of the model on multiplex networks with layers in the form of homogeneous Erdős-Rényi and random regular graphs as well as weakly heterogeneous scale-free networks this agreement is quantitative, while in the case of layers in the form of strongly heterogeneous scale-free networks it is only qualitative. If the mean degree of nodes is small and comparable with q predictions of the homogeneous pair approximation are in general even qualitatively wrong.

Role of vaccine efficacy in the vaccination behavior under myopic update rule on complex networks.

How to effectively prevent the diffusion of infectious disease has become an intriguing topic in the field of public hygienics. To be noted that, for the non-periodic infectious diseases, many people hope to obtain the vaccine of epidemics in time to be inoculated, rather than at the end of the epidemic. However, the vaccine may fail as a result of invalid storage, transportation and usage, and then vaccinated individuals may become re-susceptible and be infected again during the outbreak. To this end, we build a new framework that considers the imperfect vaccination during the one cycle of infectious disease within the spatially structured and heterogeneous population. Meanwhile, we propose a new vaccination update rule: myopic update rule, which is only based on one focal player's own perception regarding the disease outbreak, and one susceptible individual makes a decision to adopt the vaccine just by comparing the perceived payoffs vaccination with the perceived ones of being infected. Extensive Monte-Carlo simulations are performed to demonstrate the imperfect vaccination behavior under the myopic update rule in the spatially structured and heterogeneous population. The results indicate that healthy individuals are often willing to inoculate the vaccine under the myopic update rule, which can stop the infectious disease from being spread, in particular, it is found that the vaccine efficacy influences the fraction of vaccinated individuals much more than the relative cost of vaccination on the regular lattice, Meanwhile, vaccine efficacy is more sensitive on the heterogeneous scale-free network. Current results are helpful to further analyze and model the choice of vaccination strategy during the disease outbreaks.

An Evolutionary Game Coordinated Control Approach to Division of Labor in Multi-Agent Systems

In this paper, we propose an evolutionary game theoretic approach to coordinated control of multi-agent systems. In this mathematical framework, agents play games with their neighbors on the network, and update strategies through local interaction. In order to achieve a certain control objective of the system, we need to select the appropriate game type, design the calculation and evaluation methods of fitness, specify the interactive constraints and updating rules. During the evolutionary process of the system, agents have no predesigned dynamical equations. They adjust their behavior independently for the purpose of increasing their own benefits. The system achieves its final state in the process of individual interaction and autonomous decision-making. Taking division of labor problem as an example, we demonstrate the proposed control approach in detail. The performance of the theoretical method is verified by simulation on the regular graph, the general connected graphs, and heterogeneous scale-free networks, respectively.

Spin glass transition in a simple variant of the Ising model on multiplex networks

Multiplex networks consist of a fixed set of nodes connected by several sets of edges which are generated separately and correspond to different networks (“layers”). Here, the Ising model on multiplex networks with two layers is considered, with spins located in the nodes and edges corresponding to ferromagnetic or antiferromagnetic interactions between them. Critical temperatures for the spin glass and ferromagnetic transitions are evaluated for the layers in the form of random Erdös–Rényi graphs or heterogeneous scale-free networks using the replica method, from the replica symmetric solution. Stability of this solution is investigated and location of the de Almeida–Thouless line is determined. For the Ising model on multiplex networks with scale-free layers it is shown that the critical temperature is finite if the distributions of the degrees of nodes within both layers have a finite second moment, and that depending on the model parameters the transition can be to the ferromagnetic or spin glass phase. It is also shown that the correlation between the degrees of nodes within different layers significantly influences the critical temperatures and the phase diagram. The scaling behavior for the spin glass order parameter is determined and it is shown that for the Ising model on multiplex networks with scale-free layers the scaling exponents can depend on the distributions of the degrees of nodes within layers. The analytic results are partly confirmed by Monte Carlo simulations using the parallel tempering algorithm.

Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

Ferromagnetic transition in a simple variant of the Ising model on multiplex networks

Multiplex networks consist of a fixed set of nodes connected by several sets of edges which are generated separately and correspond to different networks (“layers”). Here, a simple variant of the Ising model on multiplex networks with two layers is considered, with spins located in the nodes and edges corresponding to ferromagnetic interactions between them. Critical temperatures for the ferromagnetic transition are evaluated for the layers in the form of random Erdös–Rényi graphs or heterogeneous scale-free networks using the mean-field approximation and the replica method, from the replica symmetric solution. Both methods require the use of different “partial” magnetizations, associated with different layers of the multiplex network, and yield qualitatively similar results. If the layers are strongly heterogeneous the critical temperature differs noticeably from that for the Ising model on a network being a superposition of the two layers, evaluated in the mean-field approximation neglecting the effect of the underlying multiplex structure on the correlations between the degrees of nodes. The critical temperature evaluated from the replica symmetric solution depends sensitively on the correlations between the degrees of nodes in different layers and shows satisfactory quantitative agreement with that obtained from Monte Carlo simulations. The critical behavior of the magnetization for the model with strongly heterogeneous layers can depend on the distributions of the degrees of nodes and is then determined by the properties of the most heterogeneous layer.

Anomalous Metapopulation Dynamics on Scale-Free Networks.

We model transport of individuals across a heterogeneous scale-free network where a few weakly connected nodes exhibit heavy-tailed residence times. Using the empirical law of the axiom of cumulative inertia and fractional analysis, we show that "anomalous cumulative inertia" overpowers highly connected nodes in attracting network individuals. This fundamentally challenges the classical result that individuals tend to accumulate in high-order nodes. The derived residence time distribution has a nontrivial U shape which we encounter empirically across human residence and employment times.

Broad-scale small-world network topology induces optimal synchronization of flexible oscillators

The discovery of small-world and scale-free properties of many man-made and natural complex networks has attracted increasing attention. Of particular interest is how the structural properties of a network facilitate and constrain its dynamical behavior. In this paper we study the synchronization of weakly coupled limit-cycle oscillators in dependence on the network topology as well as the dynamical features of individual oscillators. We show that flexible oscillators, characterized by near zero values of divergence, express maximal correlation in broad-scale small-world networks, whereas the non-flexible (rigid) oscillators are best correlated in more heterogeneous scale-free networks. We found that the synchronization behavior is governed by the interplay between the networks global efficiency and the mutual frequency adaptation. The latter differs for flexible and rigid oscillators. The results are discussed in terms of evolutionary advantages of broad-scale small-world networks in biological systems.

Robust Control, Optimization, and Applications to Markovian Jumping Systems

Robust Control, Optimization, and Applications to Markovian Jumping Systems

Phase transitions with infinitely many absorbing states in complex networks

We investigate the properties of the threshold contact process (TCP), a process showing an absorbing-state phase transition with infinitely many absorbing states, on random complex networks. The finite-size scaling exponents characterizing the transition are obtained in a heterogeneous mean-field (HMF) approximation and compared with extensive simulations, particularly in the case of heterogeneous scale-free networks. We observe that the TCP exhibits the same critical properties as the contact process, which undergoes an absorbing-state phase transition to a single absorbing state. The accordance among the critical exponents of different models and networks leads to conjecture that the critical behavior of the contact process in a HMF theory is a universal feature of absorbing-state phase transitions in complex networks, depending only on the locality of the interactions and independent of the number of absorbing states. The conditions for the applicability of the conjecture are discussed considering a parallel with the susceptible-infected-susceptible epidemic spreading model, which in fact belongs to a different universality class in complex networks.

Cascading Dynamics of Heterogenous Scale-Free Networks with Recovery Mechanism

In network security, how to use efficient response methods against cascading failures of complex networks is very important. In this paper, concerned with the highest-load attack (HL) and random attack (RA) on one edge, we define five kinds of weighting strategies to assign the external resources for recovering the edges from cascading failures in heterogeneous scale-free (SF) networks. The influence of external resources, the tolerance parameter, and the different weighting strategies on SF networks against cascading failures is investigated carefully. We find that, under HL attack, the fourth kind of weighting method can more effectively improve the integral robustness of SF networks, simultaneously control the spreading velocity, and control the outburst of cascading failures in SF networks than other methods. Moreover, the third method is optimal if we only knew the local structure of SF networks and the uniform assignment is the worst. The simulations of the real-world autonomous system in, Internet have also supported our findings. The results are useful for using efficient response strategy against the emergent accidents and controlling the cascading failures in the real-world networks.

Comparison of immunization strategies in geographical networks

The epidemic spread and immunizations in geographically embedded scale-free (SF) and Watts–Strogatz (WS) networks are numerically investigated. We make a realistic assumption that it takes time which we call the detection time, for a vertex to be identified as infected, and implement two different immunization strategies: one is based on connection neighbors (CN) of the infected vertex with the exact information of the network structure utilized and the other is based on spatial neighbors (SN) with only geographical distances taken into account. We find that the decrease of the detection time is crucial for a successful immunization in general. Simulation results show that for both SF networks and WS networks, the SN strategy always performs better than the CN strategy, especially for more heterogeneous SF networks at long detection time. The observation is verified by checking the number of the infected nodes being immunized. We found that in geographical space, the distance preferences in the network construction process and the geographically decaying infection rate are key factors that make the SN immunization strategy outperforms the CN strategy. It indicates that even in the absence of the full knowledge of network connectivity we can still stop the epidemic spread efficiently only by using geographical information as in the SN strategy, which may have potential applications for preventing the real epidemic spread.

Impact of topology on the dynamical organization of cooperation in the prisoner’s dilemma game

The way cooperation organizes dynamically strongly depends on the topology of the underlying interaction network. We study this dependence using heterogeneous scale-free networks with different levels of (a) degree-degree correlations and (b) enhanced clustering, where the number of neighbors of connected nodes are correlated and the number of closed triangles are enhanced, respectively. Using these networks, we analyze a finite population analog of the evolutionary replicator dynamics of the prisoner's dilemma, the latter being a two-player game with two strategies, defection and cooperation, whose payoff matrix favors defection. Both topological features significantly change the dynamics with respect to the one observed for fully randomized scale-free networks and can strongly facilitate cooperation even for a large temptation to defect, and should hence be considered as important factors in the evolution and sustainment of cooperation.