Interdependent Lattice Networks in High Dimensions
Steven Lowinger, Gabriel A. Cwilich, Sergey V. Buldyrev

TL;DR
This paper investigates how the percolation threshold and nature of cascading failures in interdependent lattice networks vary with dimension and interdependence range, revealing phase transition behaviors and maximal vulnerabilities.
Contribution
It introduces a detailed analysis of mutual percolation in high-dimensional interdependent lattices, identifying critical interdependence ranges and transition types.
Findings
Discontinuous first-order transitions occur for large interdependence range in dimensions less than 6.
At dimension 6, the transition behavior matches that of random regular graphs.
Maximal vulnerability occurs at a specific interdependence distance, decreasing with increasing dimension.
Abstract
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as . We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a certain value, . For each value of and , we find the mutual percolation threshold, below which the system completely collapses through a cascade of failures following an initial destruction of a fraction of the nodes in one of the lattices. We find that for each dimension, , there is a value of such that for the cascading failures occur as a discontinuous first order transition, while for the system undergoes a continuous second order transition, as in the classical percolation theory. Remarkably, for , which is the same as in random regular (RR) graphs with the same degree…
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.
Taxonomy
TopicsComplex Network Analysis Techniques · Graph theory and applications
