Corpus ID: 233204273

Dynamical properties of disjunctive Boolean networks

  title={Dynamical properties of disjunctive Boolean networks},
  author={M. Gadouleau},
A Boolean network is a mapping f : {0, 1} → {0, 1}, which can be used to model networks of n interacting entities, each having a local Boolean state that evolves over time according to a deterministic function of the current configuration of states. In this paper, we are interested in disjunctive networks, where each local function is simply the disjunction of a set of variables. As such, this network is somewhat homogeneous, though the number of variables may vary from entity to entity, thus… Expand

Figures from this paper


The Dynamics of Conjunctive and Disjunctive Boolean Network Models
A sharp lower bound and an upper bound on the number of limit cycles of a given length are provided, in terms of properties of the partially ordered set of strongly connected components. Expand
We study the parallel dynamics of a class of Kauffman boolean nets such that each vertex has a binary state machine {AND, OR} as local transition function. We have called this class of nets AON. In aExpand
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. Expand
Maximum Number of Fixed Points in Regulatory Boolean Networks
  • J. Aracena
  • Medicine, 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. Expand
On the influence of the interaction graph on a finite dynamical system
  • M. Gadouleau
  • Computer Science, Mathematics
  • Natural Computing
  • 2019
It is shown that the minimum rank decreases with the alphabet size, thus yielding the definition of an absolute minimum rank, and lower and upper bounds on thisabsolute minimum rank are obtained. Expand
Simple dynamics on graphs
It is proved that for every signed digraph $G$ there exists a system that converges toward a unique fixed point in at most $\lfloor\log_2 n\rfloor+2$ steps. Expand
Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
This paper presents results in this topic, mainly by focusing on the influence of positive and negative feedbacks inlean networks, by deducing from the interaction graph of the network, which only contains n vertices. Expand
Boolean Monomial Dynamical Systems
Abstract.An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems overExpand
Iterative behaviour of generalized majority functions
Abstract Let us consider a society of n persons { P 1 ,…, P n } with interaction coefficient a ij between P i and P j . Let { θ 1 ,…, θ p } be the set of opinions which may be assumed by any person.Expand
Genetic networks with canalyzing Boolean rules are always stable.
The results indicate that for single cells, the dynamics should become more stable with evolution, and there are hints that genetic networks acquire broader degree distributions with evolution. Expand