REVIEW 2 cited by
Identifiability of Linear Compartmental Models: The Impact of Removing Leaks and Edges
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A mathematical model is identifiable if its parameters can be recovered from data. Here, we focus on a particular class of model, linear compartmental models, which are used to represent the transfer of substances in a system. We analyze what happens to identifiability when operations are performed on a model, specifically, adding or deleting a leak or an edge. We first consider the conjecture of Gross et al. that states that removing a leak from an identifiable model yields a model that is again identifiable. We prove a special case of this conjecture, and also show that the conjecture is equivalent to asserting that leak terms do not divide the so-called singular-locus equation. As for edge terms that do divide this equation, we conjecture that removing any one of these edges makes the model become unidentifiable,and then prove a case of this somewhat surprising conjecture.
Forward citations
Cited by 2 Pith papers
-
Identifiability of directed-cycle and catenary linear compartment models
A directed-cycle compartmental model is generically locally identifiable if and only if its leaks are interlaced with inputs and outputs, and catenary models get an explicit coefficient-map formula.
-
Graph-Based Proofs of Indistinguishability of Linear Compartmental Models
Known indistinguishability results for skeletal path compartmental models are reproved using graph-theoretic forest sums.
Discussion (0). Continue with ORCID to comment.