2008
DOI: 10.1016/j.aam.2007.11.003
|View full text |Cite
|
Sign up to set email alerts
|

Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework

Abstract: International audienceTo each Boolean function f : {0, 1}^n → {0, 1}^n and each x ∈ {0, 1}^n, we associate a signed directed graph G(x), and we show that the existence of a positive circuit in G(x) for some x is a necessary condition for the existence of several fixed points in the dynamics (the sign of a circuit being defined as the product of the signs of its edges), and that the existence of a negative circuit is a necessary condition for the existence of an attractive cycle. These two results are inspired … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
143
0
3

Year Published

2008
2008
2022
2022

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 156 publications
(149 citation statements)
references
References 29 publications
(40 reference statements)
3
143
0
3
Order By: Relevance
“…In the field of genetic networks, they have been investigated for various classes of systems, ranging from ordinary differential equations (Soulé 2006) to synchronous (Remy et al 2008) and asynchronous (Richard et al 2004 The vertices represent either genes, metabolites, or proteins, while the edges indicate the regulations among them. Edges with an arrow stand for positive regulations (activations), while edges with a tee head stand for negative regulations (inhibitions).…”
Section: Influence Graphs and Sign Consistency Constraintsmentioning
confidence: 99%
“…In the field of genetic networks, they have been investigated for various classes of systems, ranging from ordinary differential equations (Soulé 2006) to synchronous (Remy et al 2008) and asynchronous (Richard et al 2004 The vertices represent either genes, metabolites, or proteins, while the edges indicate the regulations among them. Edges with an arrow stand for positive regulations (activations), while edges with a tee head stand for negative regulations (inhibitions).…”
Section: Influence Graphs and Sign Consistency Constraintsmentioning
confidence: 99%
“…Since then, these conjectures have been proven in different frameworks [20,21,22,23,24,25,26,27,28,29]. As for intersecting circuits, we will argue here that beyond the impact that circuits have on the dynamical behaviour of a network, the interactions of circuits via their intersections also account significantly for certain dynamical properties of networks.…”
Section: Circuits and Intersecting Circuitsmentioning
confidence: 90%
“…To capture local structural aspects we introduce the concept of local interaction graphs. It has already been used in [5] and [4] (see also references therein). In the following, we denote with s i the state that coincides with s in all components j = i and takes the value 1 − s i in the i-th component.…”
Section: Functionality and Local Interaction Graphsmentioning
confidence: 99%
“…To obtain a refined representation of the structure of the system with respect to its dynamics, we exploit the concept of local interactions graphs. It was already successfully used in [5] and [4], and allows for a better understanding of what structures in the interaction graph influence the system's behavior in a given state. Combining these ideas, we introduce local interaction graphs of singular steady states which allow us to identify subnetworks that govern the behavior of the whole system.…”
Section: Introductionmentioning
confidence: 99%