A. Richard

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 2016Show all

2 papers · 1 filter

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 $f : {0, 1}^{n} \to {0, 1}^{n}$ without negative loop can be simulated, in a very specific way, by a monotone Boolean n…

math.CO2016

Number of fixed points and disjoint cycles in monotone Boolean networks

Julio Aracena, Adrien Richard, Lilian Salinas

Given a digraph $G$ , a lot of attention has been deserved on the maximum number $ϕ (G)$ of fixed points in a Boolean network $f : {0, 1}^{n} \to {0, 1}^{n}$ with $G$ as interaction graph.…