The transition to synchronization of networked systems.

We study the synchronization properties of a generic networked dynamical system, and show that, under a suitable approximation, the transition to synchronization can be predicted with the only help of eigenvalues and eigenvectors of the graph Laplacian matrix. The transition comes out to be made of a well defined sequence of events, each of which corresponds to a specific clustered state. The network's nodes involved in each of the clusters can be identified, and the value of the coupling strength at which the events are taking place can be approximately ascertained. Finally, we present large-scale simulations which show the accuracy of the approximation made, and of our predictions in describing the synchronization transition of both synthetic and real-world large size networks, and we even report that the observed sequence of clusters is preserved in heterogeneous networks made of slightly non-identical systems.

Distances in Higher-Order Networks and the Metric Structure of Hypergraphs.

We explore the metric structure of networks with higher-order interactions and introduce a novel definition of distance for hypergraphs that extends the classic methods reported in the literature. The new metric incorporates two critical factors: (1) the inter-node distance within each hyperedge, and (2) the distance between hyperedges in the network. As such, it involves the computation of distances in a weighted line graph of the hypergraph. The approach is illustrated with several ad hoc synthetic hypergraphs, where the structural information unveiled by the novel metric is highlighted. Moreover, the method's performance and effectiveness are shown through computations on large real-world hypergraphs, which indeed reveal new insights into the structural features of networks beyond pairwise interactions. Namely, using the new distance measure, we generalize the definitions of efficiency, closeness and betweenness centrality for the case of hypergraphs. Comparing the values of these generalized measures with their analogs calculated for the hypergraph clique projections, we show that our measures provide significantly different assessments on the characteristics (and roles) of the nodes from the information-transferability point of view. The difference is brighter for hypergraphs in which hyperedges of large sizes are frequent, and nodes relating to these hyperedges are rarely connected by other hyperedges of smaller sizes.

Epidemic spreading under mutually independent intra- and inter-host pathogen evolution.

The dynamics of epidemic spreading is often reduced to the single control parameter R0 (reproduction-rate), whose value, above or below unity, determines the state of the contagion. If, however, the pathogen evolves as it spreads, R0 may change over time, potentially leading to a mutation-driven spread, in which an initially sub-pandemic pathogen undergoes a breakthrough mutation. To predict the boundaries of this pandemic phase, we introduce here a modeling framework to couple the inter-host network spreading patterns with the intra-host evolutionary dynamics. We find that even in the extreme case when these two process are driven by mutually independent selection forces, mutations can still fundamentally alter the pandemic phase-diagram. The pandemic transitions, we show, are now shaped, not just by R0, but also by the balance between the epidemic and the evolutionary timescales. If mutations are too slow, the pathogen prevalence decays prior to the appearance of a critical mutation. On the other hand, if mutations are too rapid, the pathogen evolution becomes volatile and, once again, it fails to spread. Between these two extremes, however, we identify a broad range of conditions in which an initially sub-pandemic pathogen can breakthrough to gain widespread prevalence.

Topological synchronization of chaotic systems.

A chaotic dynamics is typically characterized by the emergence of strange attractors with their fractal or multifractal structure. On the other hand, chaotic synchronization is a unique emergent self-organization phenomenon in nature. Classically, synchronization was characterized in terms of macroscopic parameters, such as the spectrum of Lyapunov exponents. Recently, however, we attempted a microscopic description of synchronization, called topological synchronization, and showed that chaotic synchronization is, in fact, a continuous process that starts in low-density areas of the attractor. Here we analyze the relation between the two emergent phenomena by shifting the descriptive level of topological synchronization to account for the multifractal nature of the visited attractors. Namely, we measure the generalized dimension of the system and monitor how it changes while increasing the coupling strength. We show that during the gradual process of topological adjustment in phase space, the multifractal structures of each strange attractor of the two coupled oscillators continuously converge, taking a similar form, until complete topological synchronization ensues. According to our results, chaotic synchronization has a specific trait in various systems, from continuous systems and discrete maps to high dimensional systems: synchronization initiates from the sparse areas of the attractor, and it creates what we termed as the 'zipper effect', a distinctive pattern in the multifractal structure of the system that reveals the microscopic buildup of the synchronization process. Topological synchronization offers, therefore, a more detailed microscopic description of chaotic synchronization and reveals new information about the process even in cases of high mismatch parameters.

Steering complex networks toward desired dynamics.

We consider networks of dynamical units that evolve in time according to different laws, and are coupled to each other in highly irregular ways. Studying how to steer the dynamics of such systems towards a desired evolution is of great practical interest in many areas of science, as well as providing insight into the interplay between network structure and dynamical behavior. We propose a pinning protocol for imposing specific dynamic evolutions compatible with the equations of motion on a networked system. The method does not impose any restrictions on the local dynamics, which may vary from node to node, nor on the interactions between nodes, which may adopt in principle any nonlinear mathematical form and be represented by weighted, directed or undirected links. We first explore our method on small synthetic networks of chaotic oscillators, which allows us to unveil a correlation between the ordered sequence of pinned nodes and their topological influence in the network. We then consider a 12-species trophic web network, which is a model of a mammalian food web. By pinning a relatively small number of species, one can make the system abandon its spontaneous evolution from its (typically uncontrolled) initial state towards a target dynamics, or periodically control it so as to make the populations evolve within stipulated bounds. The relevance of these findings for environment management and conservation is discussed.

Communicating sentiment and outlook reverses inaction against collective risks.

Collective risks permeate society, triggering social dilemmas in which working toward a common goal is impeded by selfish interests. One such dilemma is mitigating runaway climate change. To study the social aspects of climate-change mitigation, we organized an experimental game and asked volunteer groups of three different sizes to invest toward a common mitigation goal. If investments reached a preset target, volunteers would avoid all consequences and convert their remaining capital into monetary payouts. In the opposite case, however, volunteers would lose all their capital with 50% probability. The dilemma was, therefore, whether to invest one's own capital or wait for others to step in. We find that communicating sentiment and outlook helps to resolve the dilemma by a fundamental shift in investment patterns. Groups in which communication is allowed invest persistently and hardly ever give up, even when their current investment deficits are substantial. The improved investment patterns are robust to group size, although larger groups are harder to coordinate, as evidenced by their overall lower success frequencies. A clustering algorithm reveals three behavioral types and shows that communication reduces the abundance of the free-riding type. Climate-change mitigation, however, is achieved mainly by cooperator and altruist types stepping up and increasing contributions as the failure looms. Meanwhile, contributions from free riders remain flat throughout the game. This reveals that the mechanisms behind avoiding collective risks depend on an interaction between behavioral type, communication, and timing.

A novel route to cyclic dominance in voluntary social dilemmas.

Cooperation is the backbone of modern human societies, making it a priority to understand how successful cooperation-sustaining mechanisms operate. Cyclic dominance, a non-transitive set-up comprising at least three strategies wherein the first strategy overrules the second, which overrules the third, which, in turn, overrules the first strategy, is known to maintain biodiversity, drive competition between bacterial strains, and preserve cooperation in social dilemmas. Here, we present a novel route to cyclic dominance in voluntary social dilemmas by adding to the traditional mix of cooperators, defectors and loners, a fourth player type, risk-averse hedgers, who enact tit-for-tat upon paying a hedging cost to avoid being exploited. When this cost is sufficiently small, cooperators, defectors and hedgers enter a loop of cyclic dominance that preserves cooperation even under the most adverse conditions. By contrast, when the hedging cost is large, hedgers disappear, consequently reverting to the traditional interplay of cooperators, defectors, and loners. In the interim region of hedging costs, complex evolutionary dynamics ensues, prompting transitions between states with two, three or four competing strategies. Our results thus reveal that voluntary participation is but one pathway to sustained cooperation via cyclic dominance.

Universal behavior of cascading failures in interdependent networks.

Catastrophic and major disasters in real-world systems, such as blackouts in power grids or global failures in critical infrastructures, are often triggered by minor events which originate a cascading failure in interdependent graphs. We present here a self-consistent theory enabling the systematic analysis of cascading failures in such networks and encompassing a broad range of dynamical systems, from epidemic spreading, to birth-death processes, to biochemical and regulatory dynamics. We offer testable predictions on breakdown scenarios, and, in particular, we unveil the conditions under which the percolation transition is of the first-order or the second-order type, as well as prove that accounting for dynamics in the nodes always accelerates the cascading process. Besides applying directly to relevant real-world situations, our results give practical hints on how to engineer more robust networked systems.

Synchronization in starlike networks of phase oscillators.

We fully describe the mechanisms underlying synchronization in starlike networks of phase oscillators. In particular, the routes to synchronization and the critical points for the associated phase transitions are determined analytically. In contrast to the classical Kuramoto theory, we unveil that relaxation rates to each equilibrium state indeed exist and remain invariant under three levels of descriptions corresponding to different geometric implications. The special symmetry in the coupling determines a quasi-Hamiltonian property, which is further unveiled on the basis of singular perturbation theory. Since starlike coupling configurations constitute the building blocks of technological and biological real world networks, our paper paves the way towards the understanding of the functioning of such real world systems in many practical situations.

Synaptic modifications driven by spike-timing-dependent plasticity in weakly coupled bursting neurons.

In the course of development, sleep, or mental disorders, certain neurons in the brain display spontaneous spike-burst activity. The synaptic plasticity evoked by such activity is here studied in the presence of spike-timing-dependent plasticity (STDP). In two chemically coupled bursting model neurons, the spike-burst activity can translate the STDP related to pre- and postsynaptic spike activity into burst-timing-dependent plasticity (BTDP), based on the timing of bursts of pre- and postsynaptic neurons. The resulting BTDP exhibits exponential decays with the same time scales as those of STDP. In weakly coupled bursting neuron networks, the synaptic modification driven by the spike-burst activity obeys a power-law distribution. The model can also produce a power-law distribution of synaptic weights. Here, the considered bursting behavior is made of stereotypical groups of spikes, and bursting is evenly spaced by long intervals.

Self-organized interdependence among populations promotes cooperation by means of coevolution.

We show that self-organized interdependence promotes the evolution of cooperation in interdependent networks. The evolution of connections between networks occurs according to the following rule: if a player often wins against its opponent (regardless of its strategy), it is allowed to form an external link with the corresponding partner in another network to obtain additional benefit; otherwise, the opportunity to increase its benefit is lost. Through numerical simulation, it is unveiled that cooperation can be significantly promoted due to interdependent network reciprocity. Interestingly, the synchronization of evolutionary processes emerges on both networks, and individuals can take advantage of interdependent network reciprocity when both the strategies and the coevolving times in the two networks are synchronous.

Assortative mixing in spatially-extended networks.

We focus on spatially-extended networks during their transition from short-range connectivities to a scale-free structure expressed by heavy-tailed degree-distribution. In particular, a model is introduced for the generation of such graphs, which combines spatial growth and preferential attachment. In this model the transition to heterogeneous structures is always accompanied by a change in the graph's degree-degree correlation properties: while high assortativity levels characterize the dominance of short distance couplings, long-range connectivity structures are associated with small amounts of disassortativity. Our results allow to infer that a disassortative mixing is essential for establishing long-range links. We discuss also how our findings are consistent with recent experimental studies of 2-dimensional neuronal cultures.

Rhythmic synchronization and hybrid collective states of globally coupled oscillators.

Macroscopic rhythms are often signatures of healthy functioning in living organisms, but they are still poorly understood on their microscopic bases. Globally interacting oscillators with heterogeneous couplings are here considered. Thorough theoretical and numerical analyses indicate the presence of multiple phase transitions between different collective states, with regions of bi-stability. Novel coherent phases are unveiled, and evidence is given of the spontaneous emergence of macroscopic rhythms where oscillators' phases are always found to be self-organized as in Bellerophon states, i.e. in multiple clusters with quantized values of their average frequencies. Due to their rather unconditional appearance, the circumstance is paved that the Bellerophon states grasp the microscopic essentials behind collective rhythms in more general systems of interacting oscillators.

Exploiting a cognitive bias promotes cooperation in social dilemma experiments.

The decoy effect is a cognitive bias documented in behavioural economics by which the presence of a third, (partly) inferior choice causes a significant shift in people's preference for other items. Here, we performed an experiment with human volunteers who played a variant of the repeated prisoner's dilemma game in which the standard options of "cooperate" and "defect" are supplemented with a new, decoy option, "reward". We show that although volunteers rarely chose the decoy option, its availability sparks a significant increase in overall cooperativeness and improves the likelihood of success for cooperative individuals in this game. The presence of the decoy increased willingness of volunteers to cooperate in the first step of each game, leading to subsequent propagation of such willingness by (noisy) tit-for-tat. Our study thus points to decoys as a means to elicit voluntary prosocial action across a spectrum of collective endeavours.

Adaptive control of dynamical synchronization on evolving networks with noise disturbances.

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

Punishment diminishes the benefits of network reciprocity in social dilemma experiments.

Network reciprocity has been widely advertised in theoretical studies as one of the basic cooperation-promoting mechanisms, but experimental evidence favoring this type of reciprocity was published only recently. When organized in an unchanging network of social contacts, human subjects cooperate provided the following strict condition is satisfied: The benefit of cooperation must outweigh the total cost of cooperating with all neighbors. In an attempt to relax this condition, we perform social dilemma experiments wherein network reciprocity is aided with another theoretically hypothesized cooperation-promoting mechanism-costly punishment. The results reveal how networks promote and stabilize cooperation. This stabilizing effect is stronger in a smaller-size neighborhood, as expected from theory and experiments. Contrary to expectations, punishment diminishes the benefits of network reciprocity by lowering assortment, payoff per round, and award for cooperative behavior. This diminishing effect is stronger in a larger-size neighborhood. An immediate implication is that the psychological effects of enduring punishment override the rational response anticipated in quantitative models of cooperation in networks.

Interplay between geo-population factors and hierarchy of cities in multilayer urban networks.

Only taking into consideration the interplay between processes occurring at different levels of a country can provide the complete social and geopolitical plot of its urban system. We study the interaction of the administrative structure and the geographical connectivity between cities with the help of a multiplex network approach. We found that a spatially-distributed geo-network imposes its own ranking to the hierarchical administrative network, while the latter redistributes the shortest paths between nodes in the geographical layer. Using both real demographic data of population censuses of the Republic of Kazakhstan and theoretical models, we show that in a country-scale urban network and for each specific city, the geographical neighbouring with highly populated areas is more important than its political setting. Furthermore, the structure of political subordination is instead crucial for the wealth of transportation network and communication between populated regions of the country.

Interplay of delay and multiplexing: Impact on cluster synchronization.

Communication delays and multiplexing are ubiquitous features of real-world network systems. We here introduce a simple model where these two features are simultaneously present and report the rich phenomenology which is actually due to their interplay on cluster synchronization. A delay in one layer has non trivial impacts on the collective dynamics of the other layers, enhancing or suppressing synchronization. At the same time, multiplexing may also enhance cluster synchronization of delayed layers. We elucidate several nontrivial (and anti-intuitive) scenarios, which are of interest and potential application in various real-world systems, where the introduction of a delay may render synchronization of a layer robust against changes in the properties of the other layers.