论文信息 - On some topological properties of a strongly connected compartmental system with application to the identifiability problem

On some topological properties of a strongly connected compartmental system with application to the identifiability problem

Abstract In this paper 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 sycles 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.

Leontina D'Angiò

[1] Iterative inversion of single exit compartmental matrices. , 1979, Computers in biology and medicine.

[2] Michel Minoux,et al. Graphs and Algorithms , 1984 .

[3] R. Bellman,et al. On structural identifiability , 1970 .

[4] Livio Colussi,et al. A method of writing symbolically the transfer matrix of a compartmental model , 1979 .

[5] S. Audoly,et al. On the identifiability of linear compartmental systems: a revisited transfer function approach based on topological properties , 1983 .