Message passing theory for percolation models on multiplex networks with link overlap
Davide Cellai, Sergey N. Dorogovtsev, Ginestra Bianconi

TL;DR
This paper develops a message passing framework to analyze percolation transitions in multiplex networks with link overlap, providing new algorithms and phase diagrams for understanding their connectivity properties.
Contribution
It introduces two generalized message passing algorithms for multiplex networks with link overlap, extending existing methods to include directed percolation and mutual connectivity.
Findings
Two algorithms successfully model percolation and epidemic spreading.
Discontinuous percolation transitions occur in non-trivial cases.
Tricritical points influence the nature of phase transitions.
Abstract
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to characterize the mutually connected giant component in these networks. Here we provide a message passing theory for characterizing the percolation transition in multiplex networks with link overlap and an arbitrary number of layers . Specifically we propose and compare two message passing algorithms, that generalize the algorithm widely used to study the percolation transition in multiplex networks without link overlap. The first algorithm describes a directed percolation transition and admits an epidemic spreading interpretation. The second algorithm describes the emergence of the mutually connected giant component, that is the percolation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
