Percolation in networks composed of connectivity and dependency links
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second-order transition found in classical networks. We analytically analyze the effect of different distributions of dependencies links on the robustness of networks. For a random Erd\"os-R\'enyi (ER) network with average degree $k$ that is divided into dependency clusters of size $s$, the fraction of nodes that belong to the giant component ${P}_{\ensuremath{\infty}}$ is given by ${P}_{\ensuremath{\infty}}={p}^{s\ensuremath{-}1}[1\ensuremath{-}\mathrm{exp}(\ensuremath{-}{\mathit{kpP}}_{\ensuremath{\infty}})]{}^{s}$, where $1\ensuremath{-}p$ is the initial fraction of removed nodes. Our general result coincides with the known Erd$\mathrm{o\ifmmode \ddot{}\else \"{}\fi{}}$s-R\'enyi equation for random networks for $s=1$. For networks with Poissonian distribution of dependency links we find that ${P}_{\ensuremath{\infty}}$ is given by ${P}_{\ensuremath{\infty}}={f}_{k,p}({P}_{\ensuremath{\infty}}){e}^{(\ensuremath{\langle}s\ensuremath{\rangle}\ensuremath{-}1)[{\mathit{pf}}_{k,p}({P}_{\ensuremath{\infty}})\ensuremath{-}1]}$, where ${f}_{k,p}({P}_{\ensuremath{\infty}})\ensuremath{\equiv}1\ensuremath{-}\mathrm{exp}(\ensuremath{-}{\mathit{kpP}}_{\ensuremath{\infty}})$ and $\ensuremath{\langle}s\ensuremath{\rangle}$ is the mean value of the size of dependency clusters. For networks with Gaussian distribution of dependency links we show how the average and width of the distribution affect the robustness of the networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 2×
“20 57 v1 [ co nd -m at .s ta tm ec h] 1 1 Ja n 20 11 Percolation in networks composed of connectivity and dependency links Amir Bashan,1 Roni Parshani,1 and Shlomo Havlin1 1Department of Physics, Bar-Ilan University, Ramat Gan, Israel (Dated: January 12, 2011) Networks composed from both connectivity and dependency li…”
BackgroundA simple model of global cascades on random networks
Watts, D. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.082090499 · Cited by 2,673
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Cascade-based attacks on complex networks
Motter, A. E., & Lai, Y.-C. (2002) · Physical Review E · doi:10.1103/physreve.66.065102 · Cited by 1,929
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788
Self-citationCascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
Bootstrap percolation on a Bethe lattice
Chalupa, J., Leath, P. L., & Reich, G. R. (1979) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/12/1/008 · Cited by 572
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Self-citationRobustness of interdependent networks under targeted attack
Huang, X., Gao, J., Buldyrev, S. V., Havlin, S., & Stanley, H. E. (2011) · Physical Review E · doi:10.1103/physreve.83.065101 · Cited by 527
Self-citationPercolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Metadata
- Authors
- Bashan, A., Parshani, R., & Havlin, S.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-05-20
- Volume
- 83
- Issue
- 5
- Pages
- 051127-051127
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1985129160
- Cited by
- 148
- References
- 11
- FWCI
- 9.46
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.