Known indistinguishability results for skeletal path compartmental models are reproved using graph-theoretic forest sums.
Graph-based sufficien t conditions for the indistinguishabil- ity of linear compartmental models
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
math.CO 1years
2024 1verdicts
ACCEPT 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Graph-Based Proofs of Indistinguishability of Linear Compartmental Models
Known indistinguishability results for skeletal path compartmental models are reproved using graph-theoretic forest sums.