Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence
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.
Referências
Abrahão, F. S. (2016). Emergent algorithmic creativity on networked Turing machines. In The 8th International Workshop on Guided Self-Organization at the Fifteenth International Conference on the Synthesis and Simulation of Living Systems (ALIFE), Cancún.
Abrahão, F. S., Wehmuth, K., and Ziviani, A. (2017). Algorithmic Networks: central time to trigger expected emergent open-endedness.
Barabási, A.-L., Albert, R., and Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications, 272(1-2):173–187.
Barabási, A.-L. and Bonabeau, E. (2003). Scale-Free Networks. Scientific American, 288(5):60–69.
Costa, E. C., Vieira, A. B., Wehmuth, K., Ziviani, A., and da Silva, A. P. C. (2015). Time Centrality in Dynamic Complex Networks. Advances in Complex Systems, 18(07n08).
Pastor-Satorras, R. and Vespignani, A. (2001a). Epidemic dynamics and endemic states in complex networks. Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 63(6).
Pastor-Satorras, R. and Vespignani, A. (2001b). Epidemic spreading in scale-free networks. Physical Review Letters, 86(14):3200–3203.
Pastor-Satorras, R. and Vespignani, A. (2002). Immunization of complex networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 65(3):036104.
Abrahão, F. S., Wehmuth, K., and Ziviani, A. (2017). Algorithmic Networks: central time to trigger expected emergent open-endedness.
Barabási, A.-L., Albert, R., and Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications, 272(1-2):173–187.
Barabási, A.-L. and Bonabeau, E. (2003). Scale-Free Networks. Scientific American, 288(5):60–69.
Costa, E. C., Vieira, A. B., Wehmuth, K., Ziviani, A., and da Silva, A. P. C. (2015). Time Centrality in Dynamic Complex Networks. Advances in Complex Systems, 18(07n08).
Pastor-Satorras, R. and Vespignani, A. (2001a). Epidemic dynamics and endemic states in complex networks. Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 63(6).
Pastor-Satorras, R. and Vespignani, A. (2001b). Epidemic spreading in scale-free networks. Physical Review Letters, 86(14):3200–3203.
Pastor-Satorras, R. and Vespignani, A. (2002). Immunization of complex networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 65(3):036104.
Publicado
26/07/2018
Como Citar
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
.
p. 49-52.
ISSN 2595-6116.
DOI: https://doi.org/10.5753/etc.2018.3149.
