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

  title={On the influence of the interaction graph on a finite dynamical system},
  author={Maximilien Gadouleau},
  journal={Natural Computing},
  • M. Gadouleau
  • Published 30 May 2018
  • Mathematics, Computer Science
  • Natural Computing
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… 

Isomorphic Boolean networks and dense interaction graphs

A Boolean network (BN) with n components is a discrete dynamical system described by the successive iterations of a function f : {0, 1} → {1, . . . , n} that contains an arc from j to i if fi depends on input j.

Dynamical properties of disjunctive Boolean networks

This paper first review the different defining characteristics of disjunctive networks and several ways of representing them using graphs, Boolean matrices, or binary relations, and focuses on three dynamical properties of dis junctive networks: their image points, their periodic points, and their fixed points.

On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks

A proof technique based on an operation of glueing of networks, which allows to produce complex orbits in large networks from compatible pseudo-orbits in small networks, is developed.

Intrinsic Simulations and Universality in Automata Networks

A theory of intrinsic simulations and universality for families of automata networks is developed and a short proof that the family of networks were each node obeys the rule of the ’game of life’ cellular automaton is strongly universal is given.

Threshold-based Network Structural Dynamics

This paper rigorously exhibit the claim about the expressiveness of ( α, β)-Dynamics, both by designing a simple protocol that provably computes the k-core of the network as well as by showing that (α,β)-D dynamics is in fact Turing-Complete.

Cold Dynamics in Cellular Automata: a Tutorial

This tutorial shows how the richness and complexity of the model of cellular automata are preserved under such strong constraints as zero Kolmogorov-Sinai entropy, stabilization of all orbits, trivial asymptotic dynamics, or similar properties.

On Simulation in Automata Networks

This paper study how some (sets of) automata networks can be simulated by some other (set of) Automata networks with prescribed update mode or interaction graph, and characterize the set of functions that are generated by non-bijective sequential updates.

Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings

Read Mapping Through Hardware/Software Co-design Through hardware/ software co-design is explored through hardware-based and software-based approaches.

Expansive Automata Networks



On the Rank and Periodic Rank of Finite Dynamical Systems

  • M. Gadouleau
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2018
The maximum rank and the maximum periodic rank of a finite dynamical system with a given interaction graph over any non-Boolean alphabet are determined and it is proved that the average rank is relatively close (as the size of the alphabet is large) to the maximum.

On the Stability and Instability of Finite Dynamical Systems with Prescribed Interaction Graphs

This paper studies the value of the (in)stability of FDSs with prescribed interaction graphs, and conjecture that all non-acyclic graphs will have an average instability which does not tend to zero when the alphabet is large, and proves this conjecture for some classes of graphs, including cycles.

Simple dynamics on graphs

Maximum Number of Fixed Points in Regulatory Boolean Networks

  • J. Aracena
  • Mathematics
    Bulletin of mathematical biology
  • 2008
An upper bound for the number of fixed points in a particular class of BNs called regulatory Boolean networks is exhibited in terms of minimum cardinality of a set of vertices meeting all positive cycles of the network, which can be applied in the design of genetic regulatory networks.

On Circuit Functionality in Boolean Networks

Focusing on Boolean networks, some definitions concerning the notion of functionality are recalled and proposed and some results are proposed along with associated mathematical results.

On the possible values of the entropy of undirected graphs

  • M. Gadouleau
  • Computer Science, Mathematics
    J. Graph Theory
  • 2018
Any bounded interval only contains finitely many possible values of the entropy of an undirected graph and any bounded interval up to the value of four is proved.