On the influence of the interaction graph on a finite dynamical system
Maximilien Gadouleau

TL;DR
This paper explores how the structure of the interaction graph influences key properties of finite dynamical systems, providing bounds and classifications for their dynamics based on graph features and alphabet size.
Contribution
It introduces the concept of absolute minimum rank and offers the first meaningful bounds, along with a comprehensive survey of related results and open questions.
Findings
Minimum rank decreases with alphabet size.
Bounds on absolute minimum rank are established.
Classification of graphs with extreme rank values.
Abstract
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which indicates which local functions depend on which variables; the interaction graph is a qualitative representation of the interactions amongst entities on the network. As such, a major problem is to determine the effect of the interaction graph on the dynamics of the FDS. In this paper, we are interested in three main properties of an FDS: the number of images (the so-called rank), the number of periodic points (the so-called periodic rank) and the number of fixed points. In particular, we investigate the minimum, average, and maximum number of images (or periodic points, or fixed points) of FDSs with a prescribed interaction graph and a given alphabet…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
