Weak percolation on multiplex networks with overlapping edges

We solve the weak percolation problem for multiplex networks with overlapping edges. In weak percolation, a vertex belongs to a connected component if at least one of its neighbors in each of the layers is in this component. This is a weaker condition than for a mutually connected component in interdependent networks, in which any two vertices must be connected by a path within each of the layers. The effect of the overlaps on weak percolation turns out to be opposite to that on the giant mutually connected component. While for the giant mutually connected component, overlaps do not change the critical phenomena, our theory shows that in two layers any (nonzero) concentration of overlaps drives the weak percolation transition to the ordinary percolation universality class. In three layers, the phase diagram of the problem contains two lines - of a continuous phase transition and of a discontinuous one - connected in various ways depending on how the layers overlap. In the case of only doubled overlapped edges, two of the end points of these lines coincide, resulting in a tricritical point like that seen in heterogeneous k-core percolation.

Automated summary

We solve the weak percolation problem for multiplex networks with overlapping edges. Our theory shows that in two layers, any (nonzero) concentration of overlaps drives the weak percolation transition to the ordinary percolation universality class. In three layers, the phase diagram of the problem contains two lines - of a continuous phase transition and of a discontinuous one - connected in various ways depending on how the layers overlap.