Graph-Based Proofs of Indistinguishability of Linear Compartmental Models
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912140494897152 |
|---|---|
| author | Bortner, Cashous Gilliana, John Patel, Dev Tamras, Zaia |
| author_facet | Bortner, Cashous Gilliana, John Patel, Dev Tamras, Zaia |
| contents | Given experimental data, one of the main objectives of biological modeling is to construct a model which best represents the real world phenomena. In some cases, there could be multiple distinct models exhibiting the exact same dynamics, meaning from the modeling perspective it would be impossible to distinguish which model is ``correct.'' This is the study of indistinguishability of models, and in our case we focus on linear compartmental models which are often used to model pharmacokinetics, cell biology, ecology, and related fields. Specifically, we focus on a family of linear compartmental models called skeletal path models which have an underlying directed path, and have recently been shown to have the first recorded sufficient conditions for indistinguishability based on underlying graph structure. In this recent work, certain families of skeletal path models were proven to be indistinguishable, however the proofs relied heavily on linear algebra. In this work, we reprove several of these indistinguishability results instead using a graph theoretic framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01135 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Graph-Based Proofs of Indistinguishability of Linear Compartmental Models Bortner, Cashous Gilliana, John Patel, Dev Tamras, Zaia Combinatorics Dynamical Systems 05C38, 37N25, 34A30, 93B30 Given experimental data, one of the main objectives of biological modeling is to construct a model which best represents the real world phenomena. In some cases, there could be multiple distinct models exhibiting the exact same dynamics, meaning from the modeling perspective it would be impossible to distinguish which model is ``correct.'' This is the study of indistinguishability of models, and in our case we focus on linear compartmental models which are often used to model pharmacokinetics, cell biology, ecology, and related fields. Specifically, we focus on a family of linear compartmental models called skeletal path models which have an underlying directed path, and have recently been shown to have the first recorded sufficient conditions for indistinguishability based on underlying graph structure. In this recent work, certain families of skeletal path models were proven to be indistinguishable, however the proofs relied heavily on linear algebra. In this work, we reprove several of these indistinguishability results instead using a graph theoretic framework. |
| title | Graph-Based Proofs of Indistinguishability of Linear Compartmental Models |
| topic | Combinatorics Dynamical Systems 05C38, 37N25, 34A30, 93B30 |
| url | https://arxiv.org/abs/2412.01135 |