Graph-based sufficient conditions for the indistinguishability of linear compartmental models
DOI10.1137/23M1614663MaRDI QIDQ6598410
Cashous Bortner, Nicolette Meshkat
Publication date: 5 September 2024
Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)
dynamical systemsgraph theoryindistinguishabilityidentifiabilitylinear compartmental modelsdetour models
Applications of graph theory (05C90) General biology and biomathematics (92B05) Systems biology, networks (92C42) Mathematical modeling or simulation for problems pertaining to biology (92-10)
Cites Work
- Indistinguishability and identifiability analysis of linear compartmental models
- Identifiability results for several classes of linear compartment models
- Identifiability and distinguishability testing via computer algebra
- Compartmental-model response function for dendritic trees
- On global identifiability for arbitrary model parametrizations
- Indistinguishability for a class of nonlinear compartmental models
- Nonlinear compartmental model indistinguishability
- Computing all identifiable functions of parameters for ODE models
- Structural identifiability analysis of age-structured PDE epidemic models
- Identifiable reparametrizations of linear compartment models
- Identifiability of linear compartmental tree models and a general formula for input-output equations
- On the structural output distinguishability of parametric models, and its relations with structural identifiability
- Algebraic Tools for the Analysis of State Space Models
- Global Identifiability of Differential Models
- Linear Compartmental Models: Input-Output Equations and Operations That Preserve Identifiability
This page was built for publication: Graph-based sufficient conditions for the indistinguishability of linear compartmental models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598410)
