Numerical evaluation of the upper critical dimension of percolation in scale-free networks

Promoting information diffusion through interlayer recovery processes in multiplex networks

For information diffusion in multiplex networks, the effect of interlayer contagion on spreading dynamics has been explored in different settings. Nevertheless, the impact of interlayer recovery processes, i.e., the transition of nodes to stiflers in all layers after they become stiflers in any layer, still remains unclear. In this paper, we propose a modified ignorant-spreader-stifler model of rumor spreading equipped with an interlayer recovery mechanism. We find that the information diffusion can be effectively promoted for a range of interlayer recovery rates. By combining the mean-field approximation and the Markov chain approach, we derive the evolution equations of the diffusion process in two-layer homogeneous multiplex networks. The optimal interlayer recovery rate that achieves the maximal enhancement can be calculated by solving the equations numerically. In addition, we find that the promoting effect on a certain layer can be strengthened if information spreads more extensively within the counterpart layer. When applying the model to two-layer scale-free multiplex networks, with or without degree correlation, similar promoting effect is also observed in simulations. Our work indicates that the interlayer recovery process is beneficial to information diffusion in multiplex networks, which may have implications for designing efficient spreading strategies.

Unification of theoretical approaches for epidemic spreading on complex networks

Models of epidemic spreading on complex networks have attracted great attention among researchers in physics, mathematics, and epidemiology due to their success in predicting and controlling scenarios of epidemic spreading in real-world scenarios. To understand the interplay between epidemic spreading and the topology of a contact network, several outstanding theoretical approaches have been developed. An accurate theoretical approach describing the spreading dynamics must take both the network topology and dynamical correlations into consideration at the expense of increasing the complexity of the equations. In this short survey we unify the most widely used theoretical approaches for epidemic spreading on complex networks in terms of increasing complexity, including the mean-field, the heterogeneous mean-field, the quench mean-field, dynamical message-passing, link percolation, and pairwise approximation. We build connections among these approaches to provide new insights into developing an accurate theoretical approach to spreading dynamics on complex networks.

Percolation under noise: Detecting explosive percolation using the second-largest component

We consider the problem of distinguishing between different rates of percolation under noise. A statistical model of percolation is constructed allowing for the birth and death of edges as well as the presence of noise in the observations. This graph-valued stochastic process is composed of a latent and an observed nonstationary process, where the observed graph process is corrupted by type-I and type-II errors. This produces a hidden Markov graph model. We show that for certain choices of parameters controlling the noise, the classical (Erdős-Rényi) percolation is visually indistinguishable from a more rapid form of percolation. In this setting, we compare two different criteria for discriminating between these two percolation models, based on the interquartile range (IQR) of the first component's size, and on the maximal size of the second-largest component. We show through data simulations that this second criterion outperforms the IQR of the first component's size, in terms of discriminatory power. The maximal size of the second component therefore provides a useful statistic for distinguishing between different rates of percolation, under physically motivated conditions for the birth and death of edges, and under noise. The potential application of the proposed criteria for the detection of clinically relevant percolation in the context of applied neuroscience is also discussed.

Breaking of the site-bond percolation universality in networks

The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system. Percolation has always been regarded as a substrate-dependent but model-independent process, in the sense that the critical exponents of the transition are determined by the geometry of the system, but they are identical for the bond and site percolation models. Here, we report a violation of such assumption. We provide analytical and numerical evidence of a difference in the values of the critical exponents between the bond and site percolation models in networks with null percolation thresholds, such as scale-free graphs with diverging second moment of the degree distribution. We discuss possible implications of our results in real networks, and provide additional insights on the anomalous nature of the percolation transition with null threshold.

The percolation transition has been regarded as model-independent, namely determined by the geometry of a system but otherwise identical for bond or site percolation models. Here, the authors show the violation of this assumption both analytically and numerically for networks with null percolation thresholds.

How multiple social networks affect user awareness: The information diffusion process in multiplex networks

The information diffusion process in single complex networks has been extensively studied, especially for modeling the spreading activities in online social networks. However, individuals usually use multiple social networks at the same time, and can share the information they have learned from one social network to another. This phenomenon gives rise to a new diffusion process on multiplex networks with more than one network layer. In this paper we account for this multiplex network spreading by proposing a model of information diffusion in two-layer multiplex networks. We develop a theoretical framework using bond percolation and cascading failure to describe the intralayer and interlayer diffusion. This allows us to obtain analytical solutions for the fraction of informed individuals as a function of transmissibility T and the interlayer transmission rate θ. Simulation results show that interaction between layers can greatly enhance the information diffusion process. And explosive diffusion can occur even if the transmissibility of the focal layer is under the critical threshold, due to interlayer transmission.

Slow epidemic extinction in populations with heterogeneous infection rates

We explore how heterogeneity in the intensity of interactions between people affects epidemic spreading. For that, we study the susceptible-infected-susceptible model on a complex network, where a link connecting individuals i and j is endowed with an infection rate β(ij)=λw(ij) proportional to the intensity of their contact w(ij), with a distribution P(w(ij)) taken from face-to-face experiments analyzed in Cattuto et al. [PLoS ONE 5, e11596 (2010)]. We find an extremely slow decay of the fraction of infected individuals, for a wide range of the control parameter λ. Using a distribution of width a we identify two large regions in the a-λ space with anomalous behaviors, which are reminiscent of rare region effects (Griffiths phases) found in models with quenched disorder. We show that the slow approach to extinction is caused by isolated small groups of highly interacting individuals, which keep epidemics alive for very long times. A mean-field approximation and a percolation approach capture with very good accuracy the absorbing-active transition line for weak (small a) and strong (large a) disorder, respectively.

Intermittent social distancing strategy for epidemic control

We study the critical effect of an intermittent social distancing strategy on the propagation of epidemics in adaptive complex networks. We characterize the effect of our strategy in the framework of the susceptible-infected-recovered model. In our model, based on local information, a susceptible individual interrupts the contact with an infected individual with a probability σ and restores it after a fixed time t(b). We find that, depending on the network topology, in our social distancing strategy there exists a cutoff threshold σ(c) beyond which the epidemic phase disappears. Our results are supported by a theoretical framework and extensive simulations of the model. Furthermore we show that this strategy is very efficient because it leads to a "susceptible herd behavior" that protects a large fraction of susceptible individuals. We explain our results using percolation arguments.

Quarantine-generated phase transition in epidemic spreading

We study the critical effect of quarantine on the propagation of epidemics on an adaptive network of social contacts. For this purpose, we analyze the susceptible-infected-recovered model in the presence of quarantine, where susceptible individuals protect themselves by disconnecting their links to infected neighbors with probability w and reconnecting them to other susceptible individuals chosen at random. Starting from a single infected individual, we show by an analytical approach and simulations that there is a phase transition at a critical rewiring (quarantine) threshold w(c) separating a phase (w<w(c)) where the disease reaches a large fraction of the population from a phase (w≥w(c)) where the disease does not spread out. We find that in our model the topology of the network strongly affects the size of the propagation and that w(c) increases with the mean degree and heterogeneity of the network. We also find that w(c) is reduced if we perform a preferential rewiring, in which the rewiring probability is proportional to the degree of infected nodes.

Explosive percolation in scale-free networks

We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the choice of each new link depends on the mass of the clusters that this link will merge. Networks constructed via this biased procedure show a percolation transition which strongly differs from the one observed in standard percolation, where links are introduced just randomly. The different growth process leads to a phase transition with a nonvanishing percolation threshold already for lambda>lambda(c) approximately 2.2. More interestingly, the transition is continuous when lambda<or=3 but becomes discontinuous when lambda>3. This may have important consequences for both the structure of networks and for the dynamics of processes taking place on them.

Site percolation on planar Phi(3) random graphs

In this paper, site percolation on random Phi(3) planar graphs is studied by Monte Carlo numerical techniques. The method consists in randomly removing a fraction q = 1-p of vertices from graphs generated by Monte Carlo simulations, where p is the occupation probability. The resulting graphs are made of clusters of occupied sites. By measuring several properties of their distribution, it is shown that percolation occurs for an occupation probability above a percolation threshold p(c) = 0.7360(5) . Moreover, critical exponents are compatible with those analytically known for bond percolation.

Transport on weighted networks: When the correlations are independent of the degree

Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study nondegree dependent correlations between edge weights, generalizing thus the correlations beyond the degree dependent case. We propose a simple method to introduce weight-weight correlations in topologically uncorrelated graphs. This allows us to test different measures to discriminate between the different correlation types and to quantify their intensity. We also discuss here the effect of weight correlations on the transport properties of the networks, showing that positive correlations dramatically improve transport. Finally, we give two examples of real-world networks (social and transport graphs) in which weight-weight correlations are present.