2019/09/04 by Ramón Barral Lijó, Hiraku Nozawa, Lijó, Ramón Barral +1
Mathematics · Computer Science · #Mathematical Dynamics and Fractals #Cellular Automata and Applications #Computability, Logic, AI Algorithms
paper · pdf · doi:10.48550/arxiv.1909.01676
To each colored graph one can associate its closure in the universal space of isomorphism classesof pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this corre-spondence, we introduce two defnitions for chaotic (colored) graphs, one of them analogous to Devaney’s.We show the equivalence of our two novel defnitions of chaos, proving their topological genericity in varioussubsets of the universal space.