On the stability and instability of finite dynamical systems with prescribed interaction graphs
zbMath1418.05115arXiv1709.02171MaRDI QIDQ2318780
Publication date: 16 August 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.02171
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Cooperative games (91A12) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Cites Work
- Unnamed Item
- About non-monotony in Boolean automata networks
- An abstraction theory for qualitative models of biological systems
- The three colour hat guessing game on cycle graphs
- The hat guessing number of graphs
- Dynamics of positive automata networks
- Information flows, graphs and their guessing numbers
- For which graphs the sages can guess correctly the color of at least one hat
- On the hat problem on a graph
- Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
- Finite Dynamical Systems, Hat Games, and Coding Theory
- New Constructions and Bounds for Winkler's Hat Game
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
- Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”
- Hat Guessing Games
This page was built for publication: On the stability and instability of finite dynamical systems with prescribed interaction graphs
