CoChat

Percolation in networks composed of connectivity and dependency links

Open access
Bashan, Amir, Parshani, Roni, Havlin, Shlomo · 2011 · Physical Review E
Cited by 148

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreve.83.051127

Cites

11 of 11 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 148

Metadata

Authors
Bashan, A., Parshani, R., & Havlin, S.
Venue
Physical Review E
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.