Spanning connectivity in a multilayer network and its relationship to site-bond percolation
arXiv:1402.7057 · doi:10.1103/PhysRevE.93.062310
Abstract
We analyze the connectivity of an -layer network over a common set of nodes that are active only in a fraction of the layers. Each layer is assumed to be a subgraph (of an underlying connectivity graph ) induced by each node being active in any given layer with probability . The -layer network is formed by aggregating the edges over all layers. We show that when exceeds a threshold , a giant connected component appears in the -layer network---thereby enabling far-away users to connect using `bridge' nodes that are active in multiple network layers---even though the individual layers may only have small disconnected islands of connectivity. We show that , where is the bond percolation threshold of , and is its site percolation threshold. We find exactly for when is a large random network with an arbitrary node-degree distribution. We find numerically for various regular lattices, and find an exact lower bound for the kagome lattice. Finally, we find an intriguingly close connection between this multilayer percolation model and the well-studied problem of site-bond percolation, in the sense that both models provide a smooth transition between the traditional site and bond percolation models. Using this connection, we translate known analytical approximations of the site-bond critical region, which are functions only of and of the respective lattice, to excellent general approximations of the multilayer connectivity threshold .
arXiv comment17 pages, 12 figures, to appear in Physical Review E
References in corpus (25)
- The structure of scientific collaboration networks
- Random graphs with arbitrary degree distributions and their applications
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Classes of behavior of small-world networks
- Network robustness and fragility: Percolation on random graphs
- Diffusion dynamics on multiplex networks
- Mathematical Formulation of Multi-Layer Networks
- Efficient Monte Carlo algorithm and high-precision results for percolation
- Properties of highly clustered networks
- Competing electronic orders on Kagome lattices at van Hove filling
- Growing multiplex networks
- Spectral properties of the Laplacian of multiplex networks
- Percolation in Multiplex Networks with Overlap
- Multiplexity-facilitated cascades in networks
- Continuum Percolation Thresholds in Two Dimensions
- Correlated multiplexity and connectivity of multiplex random networks
- Modeling the dynamical interaction between epidemics on overlay networks
- Percolation of a general network of networks
- Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
- Multilayer weighted social network model
- Exact bond percolation thresholds in two dimensions
- An investigation of site-bond percolation on many lattices
- Stacked triangular lattice: Percolation properties
- Critical points of Potts and O() models from eigenvalue identities in periodic Temperley-Lieb algebras