Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Richard, Adrien"'
A Boolean network is a function $f:\{0,1\}^n\to\{0,1\}^n$ from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asynchronous dynamics. Both are digraphs on $\{0,1\}^n$, but the synchrono
Externí odkaz:
http://arxiv.org/abs/2402.03092
An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction graph of $f
Externí odkaz:
http://arxiv.org/abs/2301.01958
Autor:
Richard, Adrien, Tonello, Elisa
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, the absence of positive cycles guarantees the existence of a unique
Externí odkaz:
http://arxiv.org/abs/2206.11651
The {\em asynchronous automaton} associated with a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$, considered in many applications, is the finite deterministic automaton where the set of states is $\{0,1\}^n$, the alphabet is $[n]$, and the action of lett
Externí odkaz:
http://arxiv.org/abs/2203.05298
Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations have been proposed based on the same logical structure that captures the interactions between Boolean
Externí odkaz:
http://arxiv.org/abs/2203.01620
Autor:
Richard, Adrien
Publikováno v:
Journal of Theoretical Biology, 463:67-76, 2019
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: positive and negative feedback cycles have been largely emphasized by Thoma
Externí odkaz:
http://arxiv.org/abs/2201.08600
Autor:
Richard, Adrien
Publikováno v:
Discrete Applied Mathematics, 267:160-175, 2019
A finite dynamical system with $n$ components is a function $f:X\to X$ where $X=X_1\times\dots\times X_n$ is a product of $n$ finite intervals of integers. The structure of such a system $f$ is represented by a signed digraph $G$, called interaction
Externí odkaz:
http://arxiv.org/abs/2201.08596
A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n\to\{0,1\}^n$. In most applications, the main parameter is the interaction graph of $f$: the digraph with verte
Externí odkaz:
http://arxiv.org/abs/2105.01914
A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n \to \{0,1\}^n$. This model finds applications in biology, where fixed points play a central role. For example,
Externí odkaz:
http://arxiv.org/abs/2012.02513
Autor:
Richard, Adrien, Tonello, Elisa
Publikováno v:
In Theoretical Computer Science 20 February 2023 947