Cycle equivalence of graph dynamical systems

DOI10.1088/0951-7715/22/2/010zbMath1159.37010arXiv0802.4412OpenAlexW1981041817WikidataQ59663229 ScholiaQ59663229MaRDI QIDQ3605110

Matthew Macauley, Henning S. Mortveit

Publication date: 20 February 2009

Published in: Nonlinearity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.4412

zbMATH Keywords

cellular automatongraph dynamical systemsequential dynamical systemcycle equivalence

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Dynamical aspects of cellular automata (37B15) Combinatorial dynamics (types of periodic orbits) (37E15) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (9)

An atlas of limit set dynamics for asynchronous elementary cellular automata ⋮ Attractor stability in finite asynchronous biological system models ⋮ On enumeration of conjugacy classes of Coxeter elements ⋮ Attractor stability in nonuniform Boolean networks ⋮ Coxeter Groups and Asynchronous Cellular Automata ⋮ Flexible toggles and symmetric invertible asynchronous elementary cellular automata ⋮ Solutions to all-colors problem on graph cellular automata ⋮ Cycle Equivalence of Finite Dynamical Systems Containing Symmetries ⋮ Existence and non existence of limit cycles in Boolean networks

This page was built for publication: Cycle equivalence of graph dynamical systems