Conservative model for synchronization problems in complex networks

Interacting Social Processes on Interconnected Networks

We propose and study a model for the interplay between two different dynamical processes -one for opinion formation and the other for decision making- on two interconnected networks A and B. The opinion dynamics on network A corresponds to that of the M-model, where the state of each agent can take one of four possible values (S = -2,-1, 1, 2), describing its level of agreement on a given issue. The likelihood to become an extremist (S = ±2) or a moderate (S = ±1) is controlled by a reinforcement parameter r ≥ 0. The decision making dynamics on network B is akin to that of the Abrams-Strogatz model, where agents can be either in favor (S = +1) or against (S = -1) the issue. The probability that an agent changes its state is proportional to the fraction of neighbors that hold the opposite state raised to a power β. Starting from a polarized case scenario in which all agents of network A hold positive orientations while all agents of network B have a negative orientation, we explore the conditions under which one of the dynamics prevails over the other, imposing its initial orientation. We find that, for a given value of β, the two-network system reaches a consensus in the positive state (initial state of network A) when the reinforcement overcomes a crossover value r*(β), while a negative consensus happens for r < r*(β). In the r - β phase space, the system displays a transition at a critical threshold βc, from a coexistence of both orientations for β < βc to a dominance of one orientation for β > βc. We develop an analytical mean-field approach that gives an insight into these regimes and shows that both dynamics are equivalent along the crossover line (r*, β*).

Extreme fluctuations in stochastic network coordination with time delays

We study the effects of uniform time delays on the extreme fluctuations in stochastic synchronization and coordination problems with linear couplings in complex networks. We obtain the average size of the fluctuations at the nodes from the behavior of the underlying modes of the network. We then obtain the scaling behavior of the extreme fluctuations with system size, as well as the distribution of the extremes on complex networks, and compare them to those on regular one-dimensional lattices. For large complex networks, when the delay is not too close to the critical one, fluctuations at the nodes effectively decouple, and the limit distributions converge to the Fisher-Tippett-Gumbel density. In contrast, fluctuations in low-dimensional spatial graphs are strongly correlated, and the limit distribution of the extremes is the Airy density. Finally, we also explore the effects of nonlinear couplings on the stability and on the extremes of the synchronization landscapes.

Epidemic Model with Isolation in Multilayer Networks

The Susceptible-Infected-Recovered (SIR) model has successfully mimicked the propagation of such airborne diseases as influenza A (H1N1). Although the SIR model has recently been studied in a multilayer networks configuration, in almost all the research the isolation of infected individuals is disregarded. Hence we focus our study in an epidemic model in a two-layer network, and we use an isolation parameter w to measure the effect of quarantining infected individuals from both layers during an isolation period tw. We call this process the Susceptible-Infected-Isolated-Recovered (SIIR) model. Using the framework of link percolation we find that isolation increases the critical epidemic threshold of the disease because the time in which infection can spread is reduced. In this scenario we find that this threshold increases with w and tw. When the isolation period is maximum there is a critical threshold for w above which the disease never becomes an epidemic. We simulate the process and find an excellent agreement with the theoretical results.

Network coordination and synchronization in a noisy environment with time delays

We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in complex networks. We consider two types of time delays: transmission delays between interacting nodes and local delays at each node (due to processing, cognitive, or execution delays). By investigating the underlying fluctuations for several delay schemes, we obtain the synchronizability threshold (phase boundary) and the scaling behavior of the width of the synchronization landscape, in some cases for arbitrary networks and in others for specific weighted networks. Numerical computations allow the behavior of these networks to be explored when direct analytical results are not available. We comment on the implications of these findings for simple locally or globally weighted network couplings and possible trade-offs present in such systems.

Analytic treatment of the network synchronization problem with time delays

Motivated by novel results in the theory of network synchronization, we analyze the effects of nonzero time delays in stochastic synchronization problems with linear couplings in an arbitrary network. We determine analytically the fundamental limit of synchronization efficiency in a noisy environment with uniform time delays. We show that the optimal efficiency of the network is achieved for λτ = π(3/2)/(2√π + 4) ≈ 0.738, where λ is the coupling strength (relaxation coefficient) and τ is the characteristic time delay in the communication between pairs of nodes. Our analysis reveals the underlying mechanism responsible for the trade-off phenomena observed in recent numerical simulations of network synchronization problems.

Network synchronization in a noisy environment with time delays: fundamental limits and trade-offs

We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in an arbitrary network. Using the known exact threshold value from the theory of differential equations with delays, we provide the synchronizability threshold for an arbitrary network. Further, by constructing the scaling theory of the underlying fluctuations, we establish the absolute limit of synchronization efficiency in a noisy environment with uniform time delays, i.e., the minimum attainable value of the width of the synchronization landscape. Our results also have strong implications for optimization and trade-offs in network synchronization with delays.