Emergence of complex data from simple local rules in a network game
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.
Cite
@article{arxiv.2009.12210,
title = {Emergence of complex data from simple local rules in a network game},
author = {Felipe S. Abrahão and Klaus Wehmuth and Artur Ziviani},
journal= {arXiv preprint arXiv:2009.12210},
year = {2020}
}
Comments
arXiv admin note: text overlap with arXiv:1708.09149