Search

Cascading failures, triggered by a local perturbation, can be catastrophic and cause irreparable damages in a wide area. Hence, blocking the devastating cascades is an important issue in real world networks. One of the ways to control the cascade is to use protective me‌asures, so that the agents decide to be protected against failure. Here, we consider a coevolution of the linear threshold mo‌del for the spread of cascading failures and a decision-making game based on the perceived risk of failure. Protected agents are less vulnerable to failure and in return the size of the cascade affects the agent's decision to get insured. We find at what range of protection efficiency and cost of failure, the global cascades stop. Also we observe that in some range of protection efficiency, a bistable region emerges for the size of cascade and the prevalence of protected agents. Moreover, we show how savings or the ability of agents to repair can prevent cascades from occurring., (© 2024. The Author(s).)

The brain displays complex dynamics, including collective oscillations, and extensive research has been conducted to understand their generation. However, our understanding of how biological constraints influence these oscillations is incomplete. This study investigates the essential properties of neuronal networks needed to generate oscillations resembling those in the brain. A simple discrete-time model of interconnected excitable elements is developed, capable of closely resembling the complex oscillations observed in biological neural networks. In the model, synaptic connections remain active for a duration exceeding individual neuron activity. We show that the inhibitory synapses must exhibit longer activity than excitatory synapses to produce a diverse range of the dynamical states, including biologically plausible oscillations. Upon meeting this condition, the transition between different dynamical states can be controlled by external stochastic input to the neurons. The study provides a comprehensive explanation for the emergence of distinct dynamical states in neural networks based on specific parameters., Competing Interests: The authors declare no competing interests., (© 2024 The Authors.)

In social networks, the balance theory has been studied by considering either the triple interactions between the links (structural balance) or the triple interaction of nodes and links (coevolutionary balance). In the structural balance theory, the links are not independent from each other, implying a global effect of this term and it leads to a discontinuous phase transition in the system's balanced states as a function of temperature. However, in the coevolutionary balance the links only connect two local nodes and a continuous phase transition emerges. In this paper, we consider a combination of both to understand which of these types of interactions will identify the stability of the network. We are interested to see how adjusting the robustness of each term versus the other might affect the system to reach a balanced state. We use statistical mechanics methods and the mean-field theory and also the Monte Carlo numerical simulations to investigate the behavior of the order parameters and the total energy of the system. We find the phase diagram of the system which demonstrates the competition of these two terms at different ratios against each other and different temperatures. The system shows a tricritical point above which the phase transition switches from continuous to discrete. Also the superiority of the local perspective is observed at low temperatures and the global view will be the dominant term in determining the stability of the system at higher temperatures.

The behaviour of individuals is a main actor in the control of the spread of a communicable disease and, in turn, the spread of an infectious disease can trigger behavioural changes in a population. Here, we study the emergence of individuals' protective behaviours in response to the spread of a disease by considering two different social attitudes within the same population: concerned and risky. Generally speaking, concerned individuals have a larger risk aversion than risky individuals. To study the emergence of protective behaviours, we couple, to the epidemic evolution of a susceptible-infected-susceptible model, a decision game based on the perceived risk of infection. Using this framework, we find the effect of the protection strategy on the epidemic threshold for each of the two subpopulations (concerned and risky), and study under which conditions risky individuals are persuaded to protect themselves or, on the contrary, can take advantage of a herd immunity by remaining healthy without protecting themselves, thanks to the shield provided by concerned individuals. This article is part of the theme issue 'Emergent phenomena in complex physical and socio-technical systems: from cells to societies'.

Fixed-energy sandpile (FES) models, introduced to understand the self-organized criticality, show a continuous phase transition between absorbing and active phases. In this work, we study the dynamics of the deterministic FES models on random networks. We observe that close to absorbing transition the density of active nodes oscillates and nodes topple in synchrony. The deterministic toppling rule and the small-world property of random networks lead to the emergence of sustained oscillations. The amplitude of oscillations becomes larger with increasing the value of network randomness. The bifurcation diagram for the density of active nodes is obtained. We use the activity-dependent rewiring rule and show that the interplay between the network structure and the FES dynamics leads to the emergence of a bistable region with a first-order transition between the absorbing and active states. Furthermore during the rewiring, the ordered activation pattern of the nodes is broken, which causes the oscillations to disappear.

We introduce a k-leaf removal algorithm as a generalization of the so-called leaf removal algorithm. In this pruning algorithm, vertices of degree smaller than k, together with their first nearest neighbors and all incident edges, are progressively removed from a random network. As the result of this pruning the network is reduced to a subgraph which we call the Generalized k-core (Gk-core). Performing this pruning for the sequence of natural numbers k, we decompose the network into a hierarchy of progressively nested Gk-cores. We present an analytical framework for description of Gk-core percolation for undirected uncorrelated networks with arbitrary degree distributions (configuration model). To confirm our results, we also derive rate equations for the k-leaf removal algorithm which enable us to obtain the structural characteristics of the Gk-cores in another way. Also we apply our algorithm to a number of real-world networks and perform the Gk-core decomposition for them.

Memory has a great impact on the evolution of every process related to human societies. Among them, the evolution of an epidemic is directly related to the individuals' experiences. Indeed, any real epidemic process is clearly sustained by a non-Markovian dynamics: memory effects play an essential role in the spreading of diseases. Including memory effects in the susceptible-infected-recovered (SIR) epidemic model seems very appropriate for such an investigation. Thus, the memory prone SIR model dynamics is investigated using fractional derivatives. The decay of long-range memory, taken as a power-law function, is directly controlled by the order of the fractional derivatives in the corresponding nonlinear fractional differential evolution equations. Here we assume "fully mixed" approximation and show that the epidemic threshold is shifted to higher values than those for the memoryless system, depending on this memory "length" decay exponent. We also consider the SIR model on structured networks and study the effect of topology on threshold points in a non-Markovian dynamics. Furthermore, the lack of access to the precise information about the initial conditions or the past events plays a very relevant role in the correct estimation or prediction of the epidemic evolution. Such a "constraint" is analyzed and discussed.

Most studies of disease spreading consider the underlying social network as obtained without the contagion, though epidemic influences people's willingness to contact others: A "friendly" contact may be turned to "unfriendly" to avoid infection. We study the susceptible-infected disease-spreading model on signed networks, in which each edge is associated with a positive or negative sign representing the friendly or unfriendly relation between its end nodes. In a signed network, according to Heider's theory, edge signs evolve such that finally a state of structural balance is achieved, corresponding to no frustration in physics terms. However, the danger of infection affects the evolution of its edge signs. To describe the coupled problem of the sign evolution and disease spreading, we generalize the notion of structural balance by taking into account the state of the nodes. We introduce an energy function and carry out Monte Carlo simulations on complete networks to test the energy landscape, where we find local minima corresponding to the so-called jammed states. We study the effect of the ratio of initial friendly to unfriendly connections on the propagation of disease. The steady state can be balanced or a jammed state such that a coexistence occurs between susceptible and infected nodes in the system.

The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loopless. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called coinfected clusters) in the stationary state, as well as the epidemic spreading thresholds and the phase diagram of the model. With increasing cooperation, we observe a tricritical point and the type of transition changes from continuous to hybrid. Finally, we compare the coinfected clusters in the case of cooperating diseases with the so-called "viable" clusters in networks with dependencies.

We describe the complex global structure of giant components in directed multiplex networks that generalizes the well-known bow-tie structure, generic for ordinary directed networks. By definition, a directed multiplex network contains vertices of one type and directed edges of m different types. In directed multiplex networks, we distinguish a set of different giant components based on the existence of directed paths of different types between their vertices such that for each type of edges, the paths run entirely through only edges of that type. If, in particular, m=2, we define a strongly viable component as a set of vertices in which for each type of edges each two vertices are interconnected by at least two directed paths in both directions, running through the edges of only this type. We show that in this case, a directed multiplex network contains in total nine different giant components including the strongly viable component. In general, the total number of giant components is 3^{m}. For uncorrelated directed multiplex networks, we obtain exactly the size and the emergence point of the strongly viable component and estimate the sizes of other giant components.

We generalize the theory of k-core percolation on complex networks to k-core percolation on multiplex networks, where k≡(k(1),k(2),...,k(M)). Multiplex networks can be defined as networks with vertices of one kind but M different types of edges, representing different types of interactions. For such networks, the k-core is defined as the largest subgraph in which each vertex has at least k(i) edges of each type, i=1,2,...,M. We derive self-consistency equations to obtain the birth points of the k-cores and their relative sizes for uncorrelated multiplex networks with an arbitrary degree distribution. To clarify our general results, we consider in detail multiplex networks with edges of two types and solve the equations in the particular case of Erdős-Rényi and scale-free multiplex networks. We find hybrid phase transitions at the emergence points of k-cores except the (1,1)-core for which the transition is continuous. We apply the k-core decomposition algorithm to air-transportation multiplex networks, composed of two layers, and obtain the size of (k(1),k(2))-cores.

We study critical properties of the continuous Abelian sandpile model with anisotropies in toppling rules that produce ordered patterns on it. Also, we consider the continuous directed sandpile model perturbed by a weak quenched randomness, study critical behavior of the model using perturbative conformal field theory, and show that the model has a random fixed point.