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 |
| id |
doaj-47fa7b2f14a4460196fd43c964397a80 |
|---|---|
| record_format |
Article |
| spelling |
doaj-47fa7b2f14a4460196fd43c964397a802021-10-03T07:42:44ZengDe GruyterTopological Algebra and its Applications2299-32312021-09-0191375210.1515/taa-2020-0105Genericity of chaos for colored graphsLijó Ramón Barral0Nozawa Hiraku1Research Organization of Science and Technology, Ritsumeikan University, Nojihigashi 1-1-1, Kusatsu, Shiga, 525-8577, JapanDepartment of Mathematical Sciences, Colleges of Science and Engineering, Ritsumeikan University, Nojihigashi 1-1-1, Kusatsu, Shiga, 525-8577, JapanTo 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.https://doi.org/10.1515/taa-2020-0105graph coloringsymbolic dynamicscantor setsubshiftchaos theory37b1037d45and 05c15 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Lijó Ramón Barral Nozawa Hiraku |
| spellingShingle |
Lijó Ramón Barral Nozawa Hiraku Genericity of chaos for colored graphs Topological Algebra and its Applications graph coloring symbolic dynamics cantor set subshift chaos theory 37b10 37d45 and 05c15 |
| author_facet |
Lijó Ramón Barral Nozawa Hiraku |
| author_sort |
Lijó Ramón Barral |
| title |
Genericity of chaos for colored graphs |
| title_short |
Genericity of chaos for colored graphs |
| title_full |
Genericity of chaos for colored graphs |
| title_fullStr |
Genericity of chaos for colored graphs |
| title_full_unstemmed |
Genericity of chaos for colored graphs |
| title_sort |
genericity of chaos for colored graphs |
| publisher |
De Gruyter |
| series |
Topological Algebra and its Applications |
| issn |
2299-3231 |
| publishDate |
2021-09-01 |
| description |
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. |
| topic |
graph coloring symbolic dynamics cantor set subshift chaos theory 37b10 37d45 and 05c15 |
| url |
https://doi.org/10.1515/taa-2020-0105 |
| work_keys_str_mv |
AT lijoramonbarral genericityofchaosforcoloredgraphs AT nozawahiraku genericityofchaosforcoloredgraphs |
| _version_ |
1716845803500208128 |