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

Complexity of model testing for dynamical systems with toric steady states

Abstract: In this paper we investigate the complexity of model selection and model testing for dynamical systems with toric steady states. Such systems frequently arise in the study of chemical reaction networks. We do this by formulating these tasks as a constrained optimization problem in Euclidean space. This optimization problem is known as a Euclidean distance problem; the complexity of solving this problem is measured by an invariant called the Euclidean distance (ED) degree. We determine closedform expressions fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 58 publications
0
4
0
Order By: Relevance
“…Such an approach would not only take advantage of information unique to single cells, but may also make it possible to parameterize models too complex for conventional fitting (this is important because fitting conventionally involves many rounds of simulation and is computation-intensive). Because it has explicit connections to CRNT, such a method could be used in conjunction with other recently developed applications of CRNT for data-constrained, ODE model selection [4953]. This provides a principled way to choose among models with different components and topologies, a common goal of systems biology modeling projects.…”
Section: Discussionmentioning
confidence: 99%
“…Such an approach would not only take advantage of information unique to single cells, but may also make it possible to parameterize models too complex for conventional fitting (this is important because fitting conventionally involves many rounds of simulation and is computation-intensive). Because it has explicit connections to CRNT, such a method could be used in conjunction with other recently developed applications of CRNT for data-constrained, ODE model selection [4953]. This provides a principled way to choose among models with different components and topologies, a common goal of systems biology modeling projects.…”
Section: Discussionmentioning
confidence: 99%
“…Such an approach would not only take advantage of information unique to 432 single-cells, but could also make it possible to parameterize models too complex for 433 conventional fitting (fitting involves many rounds of simulation). Because it has explicit 434 connections to CRNT, such a method could be used in conjunction with other recently 435 developed applications of CRNT for data-constrained, ODE model selection [41][42][43][44][45]. 436 This provides a principled way to choose among models with different components and 437 topologies, a common goal of systems biology modeling projects.…”
mentioning
confidence: 99%
“…When X ∩ R n is smooth and compact, the closest point will be a critical point and a solution to the nearest point problem. Results on Euclidean distance degrees have a hypothesis requiring genericity of the data point u [1,2,3,12,14,17,22] or study discriminant loci [13]. Our results allow us to handle situations when the data is not generic.…”
Section: Applications and Examplesmentioning
confidence: 87%
“…, P l in the stratified sense. Then formula (1), written in the language of constructible functions (see Section 2.3), becomes:…”
Section: Introductionmentioning
confidence: 99%