Emergence of complex data from simple local rules in a network game

TL;DR

This paper introduces a network game model where simple local rules and topological properties lead to the emergence of complex, incompressible data, highlighting phase transitions in networked systems.

Contribution

It presents a novel model linking local communication rules and network topology to emergent complex data in network games.

Findings

Network topological properties influence data complexity.

Simple local rules can induce phase transitions.

Emergent data properties relate to network structure.

Abstract

As one of the main subjects of investigation in data science, network science has been demonstrated a wide range of applications to real-world networks analysis and modeling. For example, the pervasive presence of structural or topological characteristics, such as the small-world phenomenon, small-diameter, scale-free properties, or fat-tailed degree distribution were one of the underlying pillars fostering the study of complex networks. Relating these phenomena with other emergent properties in complex systems became a subject of central importance. By introducing new implications on the interface between data science and complex systems science with the purpose of tackling some of these issues, in this article we present a model for a network game played by complex networks in which nodes are computable systems. In particular, we present and discuss how some network topological properties and simple local communication rules are able to generate a phase transition with respect to the emergence of incompressible data.