# Algorithmic complexity of multiplex networks

**Authors:** Andrea Santoro, Vincenzo Nicosia

arXiv: 1903.08049 · 2020-06-29

## TL;DR

This paper introduces an information-theoretic approach to quantify the complexity of multilayer networks, enabling better understanding, classification, and dynamic analysis of complex systems compared to traditional single-layer models.

## Contribution

It proposes a novel complexity measure based on Kolmogorov complexity for multilayer networks, facilitating low-dimensional representations and dynamic property preservation.

## Key findings

- Multilayer networks encode more information than aggregated graphs.
- The complexity measure helps classify networks into meaningful families.
- Low-dimensional models retain key dynamical properties like epidemic thresholds.

## Abstract

Multilayer networks preserve full information about the different interactions among the constituents of a complex system, and have recently proven quite useful in modelling transportation networks, social circles, and the human brain. A fundamental and still open problem is to assess if and when the multilayer representation of a system provides a qualitatively better model than the classical single-layer aggregated network. Here we tackle this problem from an algorithmic information theory perspective. We propose an intuitive way to encode a multilayer network into a bit string, and we define the complexity of a multilayer network as the ratio of the Kolmogorov complexity of the bit strings associated to the multilayer and to the corresponding aggregated graph. We find that there exists a maximum amount of additional information that a multilayer model can encode with respect to the equivalent single-layer graph. We show how our complexity measure can be used to obtain low-dimensional representations of multidimensional systems, to cluster multilayer networks into a small set of meaningful super-families, and to detect tipping points in the evolution of different time-varying multilayer graphs. Interestingly, the low-dimensional multiplex networks obtained with the proposed method also retain most of the dynamical properties of the original systems, as demonstrated for instance by the preservation of the epidemic threshold in the multiplex SIS model. These results suggest that information-theoretic approaches can be effectively employed for a more systematic analysis of static and time-varying multidimensional complex systems.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1903.08049/full.md

## Figures

17 figures with captions in the complete paper: https://tomesphere.com/paper/1903.08049/full.md

## References

61 references — full list in the complete paper: https://tomesphere.com/paper/1903.08049/full.md

---
Source: https://tomesphere.com/paper/1903.08049