2020/10/14 by Cashous Bortner, Bortner, Cashous, Nicolette Meshkat +1 · 2 citations
Computer Science · #Algebraic Geometry (math.AG) #Embedded Systems Design Techniques #FOS: Mathematics #Formal Methods in Verification #Model-Driven Software Engineering Techniques
paper · pdf · doi:10.48550/arxiv.2010.07203
openalex publication_date 2020/10/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a class of linear compartmental models called identifiable path/cycle models which have the property that all of the monomial functions of parameters associated to the directed cycles and paths from input compartments to output compartments are identifiable and give sufficient conditions to obtain one. Removing leaks, we then show how one can obtain a locally identifiable model from an identifiable path/cycle model. These identifiable path/cycle models yield the only identifiable models with certain conditions on their graph structure and thus we provide necessary and sufficient conditions for identifiable models with certain graph properties. A sufficient condition based on the graph structure of the model is also provided so that one can test if a model is an identifiable path/cycle model by examining the graph itself. We also provide some necessary conditions for identifiability based on graph structure. Our proofs use algebraic and combinatorial techniques.