D’Angiò, Leontina On some topological properties of a strongly connected compartmental system with application to the identifiability problem. (English) Zbl 0629.93020 Math. Biosci. 76, 207-220 (1985). 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. Cited in 1 Document MSC: 93B30 System identification 54H99 Connections of general topology with other structures, applications 92Cxx Physiological, cellular and medical topics 05C38 Paths and cycles 05C40 Connectivity Keywords:strongly connected compartmental system; compartmental graph; parameter space; space of cycles and paths; identifiability analysis PDFBibTeX XMLCite \textit{L. D'Angiò}, Math. Biosci. 76, 207--220 (1985; Zbl 0629.93020) Full Text: DOI References: [1] Bossi, A.; Cobelli, C.; Colussi, L.; Jacur, G. Romanin, A method of writing symbolically the transfer matrix of a compartmental model, Math. Biosci., 43, 187-198 (1979) · Zbl 0397.92003 [2] Audoly, S.; D’Angiò, L., On the identifiability of linear compartmental systems: A revisited transfer function approach based on topological properties, Math. Biosci., 66, 2, 201-207 (Oct. 1983) [3] Eisenfeld, J., New techniques for structural identifiability for large linear and non-linear compartmental systems, IMACS, XXIV, 494-501 (1982) · Zbl 0537.93024 [4] Bellman, R.; Aström, K. J., On structural identifiability, Math. Biosci., 7, 329-339 (1970) [5] Gondrand, M.; Minoux, M., Graphs and Algorithms (1984), Wiley-interscience [6] Anderson, D. H., Iterative inversion of single exit compartmental matrices, Comput. Biol. Med., 9, 312-330 (1979) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.