REDUCTION OF DISCRETE DYNAMICAL SYSTEMS OVER GRAPHS

DOI10.1142/S0219525904000032zbMath1075.37010OpenAlexW2144832928WikidataQ56266978 ScholiaQ56266978MaRDI QIDQ4670805

Christian M. Reidys, Henning S. Mortveit

Publication date: 22 April 2005

Published in: Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219525904000032

zbMATH Keywords

reductiongraph morphismscovering mapssequential dynamical systemsphase psace embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Dynamical aspects of cellular automata (37B15) Simulation of dynamical systems (37M05) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (4)

Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks ⋮ Validating and calibrating agent-based models: a case study ⋮ Agent-Based Modeling, Mathematical Formalism for ⋮ Elements of a theory of simulation. II: Sequential dynamical systems.

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• Acyclic orientations of random graphs
• On acyclic orientations and sequential dynamical systems
• Discrete, sequential dynamical systems
• Equivalence relations on finite dynamical systems

This page was built for publication: REDUCTION OF DISCRETE DYNAMICAL SYSTEMS OVER GRAPHS