Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree

01/05/2023
by   Florian Bridoux, et al.
0

An automata network with n components over a finite alphabet Q of size q is a discrete dynamical system described by the successive iterations of a function f:Q^n→ Q^n. In most applications, the main parameter is the interaction graph of f: the digraph with vertex set [n] that contains an arc from j to i if f_i depends on input j. What can be said on the set 𝔾(f) of the interaction graphs of the automata networks isomorphic to f? It seems that this simple question has never been studied. Here, we report some basic facts. First, we prove that if n≥ 5 or q≥ 3 and f is neither the identity nor constant, then 𝔾(f) always contains the complete digraph K_n, with n^2 arcs. Then, we prove that 𝔾(f) always contains a digraph whose minimum in-degree is bounded as a function of q. Hence, if n is large with respect to q, then 𝔾(f) cannot only contain K_n. However, we prove that 𝔾(f) can contain only dense digraphs, with at least ⌊ n^2/4 ⌋ arcs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2021

Isomorphic Boolean networks and dense interaction graphs

A Boolean network (BN) with n components is a discrete dynamical system ...
research
09/20/2023

Robert's theorem and graphs on complete lattices

Automata networks, and in particular Boolean networks, are used to model...
research
01/21/2022

Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules

A finite dynamical system with n components is a function f:X→ X where X...
research
02/21/2019

Expansive Automata Networks

An Automata Network is a map f:Q^n→ Q^n where Q is a finite alphabet. It...
research
05/30/2018

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

A finite dynamical system (FDS) is a system of multivariate functions ov...
research
08/11/2021

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited

The problem DFA-Intersection-Nonemptiness asks if a given number of dete...
research
10/24/2021

Refuting Tianrong Lin's arXiv:2110.05942 "Resolution of The Linear-Bounded Automata Question”

In the preprint mentioned in the title Mr. Tianrong claims to prove NSPA...

Please sign up or login with your details

Forgot password? Click here to reset