Optimal percolation in correlated multilayer networks with overlap

  title={Optimal percolation in correlated multilayer networks with overlap},
  author={Andrea Santoro and Vincenzo Nicosia},
We show that the size of the optimal percolation set of a multilayer network is substantially affected by the presence of interlayer degree correlations and edge overlap. We provide extensive numerical evidence to confirm that the state-of-the-art optimal percolation strategies normally fail to identify minimal percolation sets in synthetic and real-world correlated multilayer networks, thus underestimating their fragility. We propose a family of Pareto-efficient strategies for optimal… 
1 Citations

Figures and Tables from this paper



Optimal percolation on multiplex networks

It is shown that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system.

Percolation in real multiplex networks.

Results from the method confirm previous claims about the robustness of real multiplex networks, in the sense that the average connectedness of the system does not exhibit any significant abrupt change as its individual components are randomly destroyed.

Influence maximization in complex networks through optimal percolation

This work maps the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network.

Network robustness of multiplex networks with interlayer degree correlations.

It is found that correlated coupling can affect the structural robustness of multiplex networks in diverse fashion, especially for maximally correlated duplex networks.

Percolation in multiplex networks with overlap.

It is shown that the overlap among layers can improve the robustness of interdependent multiplex systems and change the critical behavior of the percolation phase transition in a complex way.

Network robustness and fragility: percolation on random graphs.

This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.

Message passing theory for percolation models on multiplex networks with link overlap.

A message passing theory for characterizing the percolation transition in multiplex networks with link overlap and an arbitrary number of layers M, and proposes and compares two message passing algorithms that generalize the algorithm widely used to study this transition.

Controlling the uncertain response of real multiplex networks to random damage

It is shown that safeguarding the function of top-scoring nodes is sufficient to prevent system collapse, and a metric is proposed, named safeguard centrality, able to single out the nodes that control the response of the entire multiplex network to random damage.

Algorithmic complexity of multiplex networks

It is found that there exists a maximum amount of additional information that a multilayer model can encode with respect to the equivalent single-layer graph, and an intuitive way to encode a multi-layer network into a bit string is proposed.

Decremental dynamic algorithm to trace mutually connected clusters