Related papers: Fixed points and connections between positive and …
To each Boolean function F from {0,1}^n to itself and each point x in {0,1}^n, we associate the signed directed graph G_F(x) of order n that contains a positive (resp. negative) arc from j to i if the partial derivative of f_i with respect…
We consider the Cartesian product X of n finite intervals of integers and a map F from X to itself. As main result, we establish an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive…
We are interested in fixed points in Boolean networks, {\em i.e.} functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the subcubes of $\{0,1\}^n$, and we characterizes a class…
In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…
We study the asymptotic dynamical properties of Boolean networks without local negative cycle. While the properties of Boolean networks without local cycle or without local positive cycle are rather well understood, recent literature raises…
In the modeling of biological systems by Boolean networks a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structural properties of the interaction graph like those proposed…
In the context of discrete dynamical systems and their applications, fixed points often have a clear interpretation. This is indeed a central topic of gene regulatory mechanisms modeled by Boolean automata networks (BANs), where a…
A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n \to \{0,1\}^n$. This model finds applications in biology, where fixed points play a central role.…
The biologist Ren\'e Thomas conjectured, twenty years ago, that the presence of a negative feedback circuit in the interaction graph of a dynamical system is a necessary condition for this system to produce sustained oscillations. In this…
The structure of the graph defined by the interactions in a Boolean network can determine properties of the asymptotic dynamics. For instance, considering the asynchronous dynamics, the absence of positive cycles guarantees the existence of…
Automata networks, and in particular Boolean networks, are used to model diverse networks of interacting entities. The interaction graph of an automata network is its most important parameter, as it represents the overall architecture of…
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks,…
Given a digraph $G$, a lot of attention has been deserved on the maximum number $\phi(G)$ of fixed points in a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$ with $G$ as interaction graph. In particular, a central problem in network coding…
AND-OR networks are Boolean networks where each coordinate function is either the AND or OR logical operator. We study the number of fixed points of these Boolean networks in the case that they have a wiring diagram with chain topology. We…
A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n\to\{0,1\}^n$. In most applications, the main parameter is the interaction graph of $f$: the digraph…
Given a graph $G$, viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with $G$ as interaction graph. We prove that if $G$ has no induced $C_4$, then this quantity equals…
Stability is an important characteristic of network models that has implications for other desirable aspects such as controllability. The stability of a Boolean network depends on various factors, such as the topology of its wiring diagram…
Linear network coding transmits data through networks by letting the intermediate nodes combine the messages they receive and forward the combinations towards their destinations. The solvability problem asks whether the demands of all the…
A Boolean network is a function $f:\{0,1\}^n\to\{0,1\}^n$ from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asynchronous dynamics. Both are digraphs on $\{0,1\}^n$, but the…
Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random…