How to suppress undesired synchronization

It is delightful to observe the emergence of synchronization in the blinking of fireflies to attract partners and preys. Other charming examples of synchronization can also be found in a wide range of phenomena such as, e.g., neurons firing, lasers cascades, chemical reactions, and opinion formation. However, in many situations the formation of a coherent state is not pleasant and should be mitigated. For example, the onset of synchronization can be the root of epileptic seizures, traffic congestion in communication networks, and the collapse of constructions. Here we propose the use of contrarians to suppress undesired synchronization. We perform a comparative study of different strategies, either requiring local or total knowledge of the system, and show that the most efficient one solely requires local information. Our results also reveal that, even when the distribution of neighboring interactions is narrow, significant improvement in mitigation is observed when contrarians sit at the highly connected elements. The same qualitative results are obtained for artificially generated networks as well as two real ones, namely, the Routers of the Internet and a neuronal network

The physics of spreading processes in multilayer networks

The study of networks plays a crucial role in investigating the structure, dynamics, and function of a wide variety of complex systems in myriad disciplines. Despite the success of traditional network analysis, standard networks provide a limited representation of complex systems, which often include different types of relationships (i.e., "multiplexity") among their constituent components and/or multiple interacting subsystems. Such structural complexity has a significant effect on both dynamics and function. Throwing away or aggregating available structural information can generate misleading results and be a major obstacle towards attempts to understand complex systems. The recent "multilayer" approach for modeling networked systems explicitly allows the incorporation of multiplexity and other features of realistic systems. On one hand, it allows one to couple different structural relationships by encoding them in a convenient mathematical object. On the other hand, it also allows one to couple different dynamical processes on top of such interconnected structures. The resulting framework plays a crucial role in helping achieve a thorough, accurate understanding of complex systems. The study of multilayer networks has also revealed new physical phenomena that remain hidden when using ordinary graphs, the traditional network representation. Here we survey progress towards attaining a deeper understanding of spreading processes on multilayer networks, and we highlight some of the physical phenomena related to spreading processes that emerge from multilayer structure.Comment: 25 pages, 4 figure

Steady-State Dynamics of the Forest Fire Model on Complex Networks

Many sociological networks, as well as biological and technological ones, can be represented in terms of complex networks with a heterogeneous connectivity pattern. Dynamical processes taking place on top of them can be very much influenced by this topological fact. In this paper we consider a paradigmatic model of non-equilibrium dynamics, namely the forest fire model, whose relevance lies in its capacity to represent several epidemic processes in a general parametrization. We study the behavior of this model in complex networks by developing the corresponding heterogeneous mean-field theory and solving it in its steady state. We provide exact and approximate expressions for homogeneous networks and several instances of heterogeneous networks. A comparison of our analytical results with extensive numerical simulations allows to draw the region of the parameter space in which heterogeneous mean-field theory provides an accurate description of the dynamics, and enlights the limits of validity of the mean-field theory in situations where dynamical correlations become important.Comment: 13 pages, 9 figure

Networked buffering: a basic mechanism for distributed robustness in complex adaptive systems

A generic mechanism - networked buffering - is proposed for the generation of robust traits in complex systems. It requires two basic conditions to be satisfied: 1) agents are versatile enough to perform more than one single functional role within a system and 2) agents are degenerate, i.e. there exists partial overlap in the functional capabilities of agents. Given these prerequisites, degenerate systems can readily produce a distributed systemic response to local perturbations. Reciprocally, excess resources related to a single function can indirectly support multiple unrelated functions within a degenerate system. In models of genome:proteome mappings for which localized decision-making and modularity of genetic functions are assumed, we verify that such distributed compensatory effects cause enhanced robustness of system traits. The conditions needed for networked buffering to occur are neither demanding nor rare, supporting the conjecture that degeneracy may fundamentally underpin distributed robustness within several biotic and abiotic systems. For instance, networked buffering offers new insights into systems engineering and planning activities that occur under high uncertainty. It may also help explain recent developments in understanding the origins of resilience within complex ecosystems. \ud \u

Modelling and analysis of influenza A (H1N1) on networks

Network modelling is a useful tool for studying the transmission of H1N1 in China, capturing the main features of the spread of H1N1. The paper calculates the basic reproduction number and studies the effects of various immunization schemes. The final size relation is derived for the network epidemic model. While a uniform, mass-immunization strategy helps control the prevalence, a targeted immunization strategy focusing on specific groups with given connectivity may better control an epidemic

Modeling Abnormal Priming in Alzheimer's Patients with a Free Association Network

Alzheimer's Disease irremediably alters the proficiency of word search and retrieval processes even at its early stages. Such disruption can sometimes be paradoxical in specific language tasks, for example semantic priming. Here we focus in the striking side-effect of hyperpriming in Alzheimer's Disease patients, which has been well-established in the literature for a long time. Previous studies have evidenced that modern network theory can become a powerful complementary tool to gain insight in cognitive phenomena. Here, we first show that network modeling is an appropriate approach to account for semantic priming in normal subjects. Then we turn to priming in degraded cognition: hyperpriming can be readily understood in the scope of a progressive degradation of the semantic network structure. We compare our simulation results with previous empirical observations in diseased patients finding a qualitative agreement. The network approach presented here can be used to accommodate current theories about impaired cognition, and towards a better understanding of lexical organization in healthy and diseased patients

Spreading to localized targets in complex networks.

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.We thank an anonymous reviewer for helpful suggestions which improve this paper. This work is supported by the National Natural Science Foundation of China (Nos 61603046 and 11547188), Natural Science Foundation of Beijing (No. 16L00077) and the Young Scholar Program of Beijing Normal University (No. 2014NT38)