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

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

Correlated multiplexity and connectivity of multiplex random networks

Open access
Lee, Kyu-Min, Kim, Jung Yeol, Cho, Won-kuk, Goh, K-I, Kim, I-M·2012·New Journal of Physics

Abstract

Nodes in a complex networked system often engage in more than one type of interactions among them; they form a multiplex network with multiple types of links. In real-world complex systems, a node's degree for one type of links and that for the other are not randomly distributed but correlated, which we term correlated multiplexity . In this paper, we study a simple model of multiplex random networks and demonstrate that the correlated multiplexity can drastically affect the properties of a giant component in the network. Specifically, when the degrees of a node for different interactions in a duplex Erdős–Rényi network are maximally correlated, the network contains the giant component for any nonzero link density. In contrast, when the degrees of a node are maximally anti-correlated, the emergence of the giant component is significantly delayed, yet the entire network becomes connected into a single component at a finite link density. We also discuss the mixing patterns and the cases with imperfect correlated multiplexity.

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.1088/1367-2630/14/3/033027

Cites

1 of 1 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 162

Metadata

Authors
Lee, K.-M., Kim, J. Y., Cho, W.-K., Goh, K.-I., & Kim, I.-M.
Venue
New Journal of Physics
Published
2012-03-16
Volume
14
Issue
3
Pages
033027
ISSN
1367-2630 (ISSN-L)
OpenAlex
W1968961592
Cited by
162
References
1
FWCI
14.35
Type
journal article
Language
en
Open access
gold

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: Correlated multiplexity and connectivity of multiplex random networks. https://app.cochat.ai/papers/10.1088/1367-2630/14/3/033027
The paper
Lee, K.-M., Kim, J. Y., Cho, W.-K., Goh, K.-I., & Kim, I.-M. (2012). Correlated multiplexity and connectivity of multiplex random networks. New Journal of Physics. https://doi.org/10.1088/1367-2630/14/3/033027

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.