Genericity of chaos for colored graphs
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 introduce two definitions for chaotic (colored) graphs, one of them analogous to...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2021-09-01
|
| Series: | Topological Algebra and its Applications |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/taa-2020-0105 |
| Summary: | 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 introduce two definitions for chaotic (colored) graphs, one of them analogous to Devaney’s. We show the equivalence of our two novel definitions of chaos, proving their topological genericity in various subsets of the universal space. |
|---|---|
| ISSN: | 2299-3231 |