CoChat

Structure of triadic relations in multiplex networks

Open access
Cozzo, Emanuele, Kivelä, Mikko, Domenico, Manlio De, Solé-Ribalta, Albert, Arenas, Alex, Gómez, Sergio, Porter, Mason A, Moreno, Yamir · 2015 · New Journal of Physics
Cited by 144

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

Abstract

Recent advances in the study of networked systems have highlighted that our interconnected world is composed of networks that are coupled to each other through different 'layers' that each represent one of many possible subsystems or types of interactions. Nevertheless, it is traditional to aggregate multilayer networks into a single weighted network in order to take advantage of existing tools. This is admittedly convenient, but it is also extremely problematic, as important information can be lost as a result. It is therefore important to develop multilayer generalizations of network concepts. In this paper, we analyze triadic relations and generalize the idea of transitivity to multiplex networks. By focusing on triadic relations, which yield the simplest type of transitivity, we generalize the concept and computation of clustering coefficients to multiplex networks. We show how the layered structure of such networks introduces a new degree of freedom that has a fundamental effect on transitivity. We compute multiplex clustering coefficients for several real multiplex networks and illustrate why one must take great care when generalizing standard network concepts to multiplex networks. We also derive analytical expressions for our clustering coefficients for ensemble averages of networks in a family of random multiplex networks. Our analysis illustrates that social networks have a strong tendency to promote redundancy by closing triads at every layer and that they thereby have a different type of multiplex transitivity from transportation networks, which do not exhibit such a tendency. These insights are invisible if one only studies aggregated 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.1088/1367-2630/17/7/073029

Cites

14 of 14 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

Show all 14 references

Cited by

See all 144

Metadata

Authors
Cozzo, E., Kivelä, M., Domenico, M. D., Solé-Ribalta, A., Arenas, A., Gómez, S., Porter, M. A., & Moreno, Y.
Venue
New Journal of Physics
Published
2015-07-31
Volume
17
Issue
7
Pages
073029
ISSN
1367-2630 (ISSN-L)
OpenAlex
W1845507378
Cited by
144
References
14
FWCI
14.11
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: Structure of triadic relations in multiplex networks. https://app.cochat.ai/papers/10.1088/1367-2630/17/7/073029
The paper
Cozzo, E., Kivelä, M., Domenico, M. D., Solé-Ribalta, A., Arenas, A., Gómez, S., Porter, M. A., & Moreno, Y. (2015). Structure of triadic relations in multiplex networks. New Journal of Physics. https://doi.org/10.1088/1367-2630/17/7/073029

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.