Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components
نویسندگان
چکیده
منابع مشابه
Local negative circuits and cyclic attractors in Boolean networks with at most five components
We consider the following question on the relationship between the asymptotic behaviours of Boolean networks and their regulatory structures: does the presence of a cyclic attractor imply the existence of a local negative circuit in the regulatory graph? When the number of model components n verifies n ≥ 6, the answer is known to be negative. We show that the question can be translated into a B...
متن کاملLocal negative circuits and fixed points in Boolean networks
To each Boolean function F : {0, 1} → {0, 1} and each point x ∈ {0, 1}, we associate the signed directed graph GF (x) of order n that contains a positive (resp. negative) arc from j to i if the discrete analogue of (∂fi/∂xj)(x) is positive (resp. negative). We then focus on the following open problem: Is the absence of a negative circuit in GF (x) for all x ∈ {0, 1} a sufficient condition for F...
متن کاملCyclic Boolean circuits
A Boolean circuit is a collection of gates and wires that performs a mapping from Boolean inputs to Boolean outputs. The accepted wisdom is that such circuits must have acyclic (i.e., loop-free or feed-forward) topologies. In fact, the model is often defined this way – as a directed acyclic graph (DAG). And yet simple examples suggest that this is incorrect. We advocate that Boolean circuits sh...
متن کاملNegative local feedbacks in Boolean networks
We study the asymptotic dynamical properties of Boolean networks without local negative cycle. While the properties of Boolean networks without local cycle or without local positive cycle are rather well understood, recent literature raises the following two questions about networks without local negative cycle. Do they have at least one fixed point? Should all their attractors be fixed points?...
متن کاملLocal negative circuits and fixed points in non-expansive Boolean networks
Given a Boolean function F : {0, 1} → {0, 1}, and a point x in {0, 1}, we represent the discrete Jacobian matrix of F at point x by a signed directed graph GF (x). We then focus on the following open problem: Is the absence of a negative circuit in GF (x) for every x in {0, 1} n a sufficient condition for F to have at least one fixed point? As result, we give a positive answer to this question ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Dynamical Systems
سال: 2019
ISSN: 1536-0040
DOI: 10.1137/18m1173988