activity
20082023
most citedOn the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems

6 citations · 10 across the 12 of their papers we have counts for

collaborators
Showing cs.DMShow all

11 papers · 1 filter

cs.DM2022★ 1 cited

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…

cs.DM2022

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…

cs.DM2016

Asynchronous simulation of Boolean networks by monotone Boolean networks

Tarek Melliti, Damien Regnault, Adrien Richard +1

We prove that the fully asynchronous dynamics of a Boolean network without negative loop can be simulated, in a very specific way, by a monotone Boolean n…

cs.DM2015

Fixed points and connections between positive and negative cycles in Boolean networks

Adrien Richard

We are interested in the relationships between the number fixed points in a Boolean network and its interaction graph, which is the arc-signed digraph …

cs.DM2015

Simple dynamics on graphs

Maximilien Gadouleau, Adrien Richard

Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers , which are the…

cs.DM2014★ 2 cited

Fixed points of Boolean networks, guessing graphs, and coding theory

Maximilien Gadouleau, Adrien Richard, Søren Riis

In this paper, we are interested in the number of fixed points of functions over a finite alphabet defined on a given signed digraph . We first use techniques…