Adrien Richard
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Adrien Richard has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Annabelle Merieau
Laboratoire de Microbiologie du Froid - Signaux et Micro-Environnement (LMDF-SME), Université de Rouen, Evreux, France
1 shared publicationC. Guyeux
Computer Science Laboratory (LIFC) University of Franche-Comté France
1 shared publication- Damien Regnault
Université d’Évry Val-D’Essonne
1 shared publication Gaelle Rossignol
Laboratoire de Microbiologie du Froid - Signaux et Micro-Environnement (LMDF-SME), Université de Rouen, Evreux, France
1 shared publicationGilles Bernot
Laboratoire d'Informatique, Signaux et Systèmes Complexes de Sophia-Antipolis (I3S), Université de Nice-Sophia Antipolis and Centre National de la Recherche Scientifique (CNRS), Sophia-Antipolis, France
1 shared publicationJ. -F. Couchot
Computer Science Laboratory (LIFC) University of Franche-Comté France
1 shared publication
Latest Publications
- 1 May 2013
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (7-8) , 1106-1117
From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- 1 May 2013
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (7-8) , 1106-1117
From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 124-138
On the Convergence of Boolean Automata Networks without Negative Cycles
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 124-138
On the Convergence of Boolean Automata Networks without Negative Cycles
- Open Access
- 31 January 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (1) , e24651
Boolean Models of Biosurfactants Production in Pseudomonas fluorescens
Cyclolipopeptides (CLPs) are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene ( ) and not restored by complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.
- 31 January 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (1) , e24651
Open AccessBoolean Models of Biosurfactants Production in Pseudomonas fluorescens
Cyclolipopeptides (CLPs) are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene ( ) and not restored by complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.
- Open Access
On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a continuous function, whose discrete-time iterations are chaotic if and only if the iteration graph of the Boolean network is strongly connected. Then, sufficient conditions for this strong connectivity are expressed on the interaction graph of this network, leading to a constructive method of chaotic function computation. The whole approach is evaluated in the chaos-based pseudo-random number generation context.
Open AccessOn the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a continuous function, whose discrete-time iterations are chaotic if and only if the iteration graph of the Boolean network is strongly connected. Then, sufficient conditions for this strong connectivity are expressed on the interaction graph of this network, leading to a constructive method of chaotic function computation. The whole approach is evaluated in the chaos-based pseudo-random number generation context.
- Open Access
Local negative circuits and fixed points in Boolean networks
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 of x_j is positive (resp. negative) at point x. We then focus on the following open problem: Is the absence of a negative circuit in G_F(x) for all x in {0,1}^n a sufficient condition for F to have at least one fixed point? As main result, we settle this problem under the additional condition that, for all x in {0,1}^n, the out-degree of each vertex of G_F(x) is at most one.
Open AccessLocal negative circuits and fixed points in Boolean networks
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 of x_j is positive (resp. negative) at point x. We then focus on the following open problem: Is the absence of a negative circuit in G_F(x) for all x in {0,1}^n a sufficient condition for F to have at least one fixed point? As main result, we settle this problem under the additional condition that, for all x in {0,1}^n, the out-degree of each vertex of G_F(x) is at most one.
- Open Access
Negative circuits and sustained oscillations in asynchronous automata networks
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 paper, we state and prove this conjecture for asynchronous automata networks, a class of discrete dynamical systems extensively used to model the behaviors of gene networks. As a corollary, we obtain the following fixed point theorem: given a product $X$ of $n$ finite intervals of integers, and a map $F$ from $X$ to itself, if the interaction graph associated with $F$ has no negative circuit, then $F$ has at least one fixed point.Open AccessNegative circuits and sustained oscillations in asynchronous automata networks
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 paper, we state and prove this conjecture for asynchronous automata networks, a class of discrete dynamical systems extensively used to model the behaviors of gene networks. As a corollary, we obtain the following fixed point theorem: given a product $X$ of $n$ finite intervals of integers, and a map $F$ from $X$ to itself, if the interaction graph associated with $F$ has no negative circuit, then $F$ has at least one fixed point. - Open Access
Positive circuits and maximal number of fixed points in discrete dynamical systems
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 circuits of the interaction graph associated with F. The proof uses and strongly generalizes a theorem of Richard and Comet which corresponds to a discrete version of the Thomas' conjecture: if the interaction graph associated with F has no positive circuit, then F has at most one fixed point. The obtained upper bound on the number of fixed points also strongly generalizes the one established by Aracena et al for a particular class of Boolean networks.
Open AccessPositive circuits and maximal number of fixed points in discrete dynamical systems
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 circuits of the interaction graph associated with F. The proof uses and strongly generalizes a theorem of Richard and Comet which corresponds to a discrete version of the Thomas' conjecture: if the interaction graph associated with F has no positive circuit, then F has at most one fixed point. The obtained upper bound on the number of fixed points also strongly generalizes the one established by Aracena et al for a particular class of Boolean networks.