On some topological properties of a strongly connected compartmental system with application to the identifiability problem (Q1094365)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On some topological properties of a strongly connected compartmental system with application to the identifiability problem |
scientific article; zbMATH DE number 4025255
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some topological properties of a strongly connected compartmental system with application to the identifiability problem |
scientific article; zbMATH DE number 4025255 |
Statements
On some topological properties of a strongly connected compartmental system with application to the identifiability problem (English)
0 references
1985
0 references
Some structural properties of a strongly connected compartmental system are illustrated. In particular a suitable set of ``cycles'' and ``paths'' associated to the compartmental graph is constructed, such that an application exists between the parameter space and the space of cycles and paths, whose suitable restriction is a bijection. It is shown that this set contains the minimum number of functions necessary to uniquely identify the parametrization vector, and its relevance in identifiability analysis is illustrated.
0 references
strongly connected compartmental system
0 references
compartmental graph
0 references
parameter space
0 references
space of cycles and paths
0 references
identifiability analysis
0 references
0 references
