Pith. sign in

REVIEW 1 cited by

Layer aggregation and reducibility of multilayer interconnected networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1405.0425 v1 pith:PPLF5ICT submitted 2014-05-02 physics.soc-ph cond-mat.dis-nncs.SIphysics.bio-ph

classification physics.soc-phcond-mat.dis-nncs.SIphysics.bio-ph
keywords layerscomplexinformationmultilayernetworkscasesdistinctinteractions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many complex systems can be represented as networks composed by distinct layers, interacting and depending on each others. For example, in biology, a good description of the full protein-protein interactome requires, for some organisms, up to seven distinct network layers, with thousands of protein-protein interactions each. A fundamental open question is then how much information is really necessary to accurately represent the structure of a multilayer complex system, and if and when some of the layers can indeed be aggregated. Here we introduce a method, based on information theory, to reduce the number of layers in multilayer networks, while minimizing information loss. We validate our approach on a set of synthetic benchmarks, and prove its applicability to an extended data set of protein-genetic interactions, showing cases where a strong reduction is possible and cases where it is not. Using this method we can describe complex systems with an optimal trade--off between accuracy and complexity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Scalable Substructure Discovery Algorithm For Homogeneous Multilayer Networks

    cs.SI 2025-04 reject novelty 5.0 of 10

    A decoupling-based, Map/Reduce iterative composition algorithm (Ho-ICA) discovers substructures in homogeneous multilayer networks with claimed full accuracy on synthetic tests and scalable speedups on Amazon and Live...

Pith tools