On the influence of the interaction graph on a finite dynamical system
From MaRDI portal
Publication:6151155
DOI10.1007/s11047-019-09732-yzbMath1530.37020arXiv1805.12247OpenAlexW2964274798WikidataQ128369903 ScholiaQ128369903MaRDI QIDQ6151155
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.12247
Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25) Systems biology, networks (92C42)
Related Items (4)
Cold dynamics in cellular automata: a tutorial ⋮ Threshold-based network structural dynamics ⋮ From additive flowers to additive automata networks ⋮ On simulation in automata networks
Cites Work
- Unnamed Item
- Unnamed Item
- Simple dynamics on graphs
- On circuit functionality in Boolean networks
- Combinatorics of Boolean automata circuits dynamics
- Disjunctive networks and update schedules
- Guessing numbers of odd cycles
- The guessing number of undirected graphs
- Relations between gene regulatory networks and cell dynamics in Boolean models
- Maximum number of fixed points in regulatory Boolean networks
- Topological fixed points in Boolean networks
- Iterative behaviour of generalized majority functions
- Dynamics of positive automata networks
- Itérations sur des ensembles finis et automates cellulaires contractants
- On the rank and periodic rank of finite dynamical systems
- Fixed points and maximal independent sets in AND-OR networks
- Complete simulation of automata networks
- On the stability and instability of finite dynamical systems with prescribed interaction graphs
- Information flows, graphs and their guessing numbers
- Maximum number of fixed points in AND-OR-NOT networks
- Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
- Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
- On the possible values of the entropy of undirected graphs
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
- Digraphs
- Synchronism versus asynchronism in monotonic Boolean automata networks
This page was built for publication: On the influence of the interaction graph on a finite dynamical system
