arXiv · 1909.01676
Genericity of chaos for colored graphs
Abstract
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of chaotic dynamical systems to colored graphs. We introduce definitions for chaotic and almost chaotic (colored) graphs, and prove their topological genericity in various subsets of the universal space.
Explore related subjects
Keep this discovery
Ramón Barral Lijó, Hiraku Nozawa. 2019-09-04. Genericity of chaos for colored graphs. https://arxiv.org/abs/1909.01676
Cite the original work for its findings. Save a collection to share your selection of sources.