On fixable families of Boolean networks

by   Maximilien Gadouleau, et al.

The asynchronous dynamics associated with a Boolean network f : {0,1}^n →{0,1}^n is a finite deterministic automaton considered in many applications. The set of states is {0,1}^n, the alphabet is [n], and the action of letter i on a state x consists in either switching the ith component if f_i(x)≠ x_i or doing nothing otherwise. This action is extended to words in the natural way. We then say that a word w fixes f if, for all states x, the result of the action of w on x is a fixed point of f. A whole family of networks is fixable if its members are all fixed by the same word, and the fixing length of the family is the minimum length of such a word. In this paper, we are interested in families of Boolean networks with relatively small fixing lengths. Firstly, we prove that fixing length of the family of networks with acyclic asynchronous graphs is Θ(n 2^n). Secondly, it is known that the fixing length of the whole family of monotone networks is O(n^3). We then exhibit two families of monotone networks with fixing length Θ(n) and Θ(n^2) respectively, namely monotone networks with tree interaction graphs and conjunctive networks with symmetric interaction graphs.


page 1

page 2

page 3

page 4


Fixing monotone Boolean networks asynchronously

The asynchronous automaton associated with a Boolean network f:{0,1}^n→{...

Synchronizing Boolean networks asynchronously

The asynchronous automaton associated with a Boolean network f:{0,1}^n→{...

The number of tangencies between two families of curves

We prove that the number of tangencies between the members of two famili...

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components

To simplify the analysis of Boolean networks, a reduction in the number ...

Attractor identification in asynchronous Boolean dynamics with network reduction

Identification of attractors, that is, stable states and sustained oscil...

Generating Boolean Functions on Totalistic Automata Networks

We consider the problem of studying the simulation capabilities of the d...

The Family Tree Graph as a Predictor of the Family Members' Satisfaction with One Another

Individuals' satisfaction with their nuclear and extended family plays a...

Please sign up or login with your details

Forgot password? Click here to reset