Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence

  • Felipe S. Abrahão
  • Klaus Wehmuth
  • Artur Ziviani

Resumo


We study emergent information in populations of randomly generated networked computable systems that follow a Susceptible-Infected-Susceptible contagion (or infection) model of imitation of the fittest neighbor. These networks have a scale-free degree distribution in the form of a power-law following the Barabási-Albert model. We show that there is a lower bound for the stationary prevalence (or average density of infected nodes) that triggers an unlimited increase of the expected emergent algorithmic complexity (or information) of a node as the population size grows.

Publicado
26/07/2018
Como Citar

Selecione um Formato
ABRAHÃO, Felipe S.; WEHMUTH, Klaus; ZIVIANI, Artur. Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence. In: ENCONTRO DE TEORIA DA COMPUTAÇÃO (ETC), 3. , 2018, Natal. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2018 . ISSN 2595-6116. DOI: https://doi.org/10.5753/etc.2018.3149.