pith. sign in

arxiv: 1405.0425 · v1 · pith:PPLF5ICTnew · submitted 2014-05-02 · ⚛️ physics.soc-ph · cond-mat.dis-nn· cs.SI· physics.bio-ph

Layer aggregation and reducibility of multilayer interconnected networks

classification ⚛️ physics.soc-ph cond-mat.dis-nncs.SIphysics.bio-ph
keywords layerscomplexinformationmultilayernetworkscasesdistinctinteractions
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.