Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 309

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Inter-similarity between coupled networks

Open access
Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C., Havlin, S.·2010·EPL (Europhysics Letters)

Abstract

Recent studies have shown that a system composed of several randomly interdependent networks is extremely vulnerable to random failure. However, real interdependent networks are usually not randomly interdependent, rather pairs of dependent nodes are coupled according to some regularity which we coin inter-similarity. For example, we study a system composed of an interdependent world wide port network and a world wide airport network and show that well-connected ports tend to couple with well-connected airports. We introduce two quantities for measuring the level of inter-similarity between networks: i) the inter degree-degree correlation (IDDC); ii) the inter-clustering coefficient (ICC). We then show both by simulation models and by analyzing the port-airport system that as the networks become more inter-similar the system becomes significantly more robust to random failure.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1209/0295-5075/92/68002

Cites

2 of 2 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Cited by

See all 309

Metadata

Authors
Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C., & Havlin, S.
Venue
EPL (Europhysics Letters)
Published
2010-12-01
Volume
92
Issue
6
Pages
68002
ISSN
  • 0295-5075 (ISSN-L)
  • 1286-4854
OpenAlex
W2034714338
Cited by
309
References
2
FWCI
6.93
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Inter-similarity between coupled networks. https://app.cochat.ai/papers/10.1209/0295-5075/92/68002
The paper
Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C., & Havlin, S. (2010). Inter-similarity between coupled networks. EPL (Europhysics Letters). https://doi.org/10.1209/0295-5075/92/68002

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.