6 citations · 10 across the 12 of their papers we have counts for
22 papers
Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree
Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto +1
An automata network with components over a finite alphabet of size is a discrete dynamical system described by the successive iterations of a function . I…
Attractor separation and signed cycles in asynchronous Boolean networks
Adrien Richard, Elisa Tonello
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…
Linear cuts in Boolean networks
Aurélien Naldi, Adrien Richard, Elisa Tonello
Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations have been proposed based on the…
Positive and negative cycles in Boolean networks
Adrien Richard
We review and discuss some results about the influence of positive and negative feedback cycles in asynchronous Boolean networks. These results merge several ideas of Thomas: posit…
Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
Adrien Richard
A finite dynamical system with components is a function where is a product of finite intervals of integers. The structure of such a…
Isomorphic Boolean networks and dense interaction graphs
Aymeric Picard Marchetto, Adrien Richard
A Boolean network (BN) with components is a discrete dynamical system described by the successive iterations of a function . In most applications, the…