Results 31 to 40 of about 4,684,489 (303)
Modular Random Boolean Networks [PDF]
Artificial Life, 2011 Random Boolean networks (RBNs) have been a popular model of genetic regulatory networks for more than four decades. However, most RBN studies have been made with random topologies, while real regulatory networks have been found to be modular. In this work, we extend classical RBNs to define modular RBNs.
Rodrigo Poblanno-Balp, Carlos Gershenson
openaire +5 more sources
On the Lyapunov Exponent of Monotone Boolean Networks †
Mathematics, 2020 Boolean networks are discrete dynamical systems comprised of coupled Boolean functions. An important parameter that characterizes such systems is the Lyapunov exponent, which measures the state stability of the system to small perturbations.
Ilya Shmulevich
doaj +1 more source
Are self-organizing biochemical networks emergent? [PDF]
, 2009 Biochemical networks are often called upon to illustrate emergent properties of living systems. In this contribution, I question such emergentist claims by means of theoretical work on genetic regulatory models and random Boolean networks.
Malaterre, Christophe, C. Malaterre
core +1 more source
On Fixable Families of Boolean Networks [PDF]
, 2018 The asynchronous dynamics associated with a Boolean network $f : \{0,1\}^n \to \{0,1\}^n$ is a finite deterministic automaton considered in many applications. The set of states is $\{0,1\}^n$, the alphabet is $[n]$, and the action of letter $i$ on a state $x$ consists in either switching the $i$th component if $f_i(x)\neq x_i$ or doing nothing ...
Maximilien Gadouleau, Adrien Richard
openaire +2 more sources
nodef/extra-boolean: A collection of common boolean functions
, 2022 <p>A collection of common boolean functions.<br> <a href="https://www.npmjs.com/package/extra-boolean">Node.js</a>, <a href="https://www.npmjs.com/package/extra-boolean.web">Web</a>, <a href="https://unpkg.com ...
Subhajit Sahu, George Pickering
core +1 more source
IEEE/ACM Transactions on Networking, 2018 This paper proposes and investigates a Boolean gossip model as a simplified but non-trivial probabilistic Boolean network. With positive node interactions, in view of standard theories from Markov chains, we prove that the node states asymptotically converge to an agreement at a binary random variable, whose distribution is characterized for large ...
Bo Li 0039 +4 more
openaire +3 more sources
Frontiers in Physiology, 2020 The molecular regulatory network (MRN) within a cell determines cellular states and transitions between them. Thus, modeling of MRNs is crucial, but this usually requires extensive analysis of time-series measurements, which is extremely difficult to ...
Sang-Mok Choo +2 more
doaj +1 more source
Quantum algorithms for testing and learning Boolean functions [PDF]
, 2013 We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Floess, Dominik +2 more
core +1 more source
On Circuit Functionality in Boolean Networks
Bulletin of Mathematical Biology, 2013 It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp.
Comet, Jean-Paul +9 more
openaire +11 more sources
A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We are interested in fixed points in Boolean networks, $\textit{i.e.}$ functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the hypercubes contained in $\{0,1\}^n$, and we exhibit a class $\mathcal{F ...
Adrien Richard
doaj +1 more source