2013
DOI: 10.1007/s10884-013-9312-7
|View full text |Cite
|
Sign up to set email alerts
|

Dynamics and Control at Feedback Vertex Sets. I: Informative and Determining Nodes in Regulatory Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
185
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 131 publications
(188 citation statements)
references
References 27 publications
3
185
0
Order By: Relevance
“…Roughly speaking, (42) is controllable if one can steer it from any point x 0 ∈ M to any other point x 1 ∈ M by choosing u from a set of admissible controls U, which is a subset of functions mapping R + to U. The controllability of nonlinear systems has been extensively studied since the early 1970s (Brockett, 1972;Conte et al, 2007;Elliot, 1970;de Figueiredo and Chen, 1993;Haynes and Hermes, 1970;Hermann and Krener, 1977;Isidori, 1995;Lobry, 1970;Nijmeijer and van der Schaft, 1990;Rugh, 1981;Sontag, 1998;Sussmann and Jurdjevic, 1972). The goal was to derive results of similar reach and generality as obtained for linear time-invariant systems.…”
Section: Controllability Of Nonlinear Systemsmentioning
confidence: 99%
“…Roughly speaking, (42) is controllable if one can steer it from any point x 0 ∈ M to any other point x 1 ∈ M by choosing u from a set of admissible controls U, which is a subset of functions mapping R + to U. The controllability of nonlinear systems has been extensively studied since the early 1970s (Brockett, 1972;Conte et al, 2007;Elliot, 1970;de Figueiredo and Chen, 1993;Haynes and Hermes, 1970;Hermann and Krener, 1977;Isidori, 1995;Lobry, 1970;Nijmeijer and van der Schaft, 1990;Rugh, 1981;Sontag, 1998;Sussmann and Jurdjevic, 1972). The goal was to derive results of similar reach and generality as obtained for linear time-invariant systems.…”
Section: Controllability Of Nonlinear Systemsmentioning
confidence: 99%
“…In [16], singleton attractors (fixed points) of BNs are characterized from graph structure only. In [52,53], a feedback vertex set of a graph is focused. A feedback vertex set of a graph is a set of vertices whose removal results an acyclic graph.…”
Section: Open Problems In Control Theory Of Probabilistic Boolean Netmentioning
confidence: 99%
“…A minimum feedback vertex set is also not given uniquely. It was shown in [52,53] that in the system given by a differential equation, a certain property of all states can be characterized by analyzing the states relating to a certain feedback vertex set. However, the related results for BNs and PBNs have not been obtained so far.…”
Section: Open Problems In Control Theory Of Probabilistic Boolean Netmentioning
confidence: 99%
“…Each SCC is itself a maximal subnetwork formed by some nodes and the arcs between them, and any node can reach and be reached by any another node of the same SCC through at least one directed path. Directed cycles are usually abundant in the large SCCs (each of which contains many nodes and arcs), and they cause strong feedback effect and make the information-processing dynamics in the network highly complex [15,16].…”
Section: Introductionmentioning
confidence: 99%