2024/12/02 by Cashous Bortner, Bortner, Cashous, John Gilliana +4 · 1 citation
Computer Science · #05C38 #34A30 #37N25 #93B30 #Combinatorics (math.CO) #Data Management and Algorithms #Dynamical Systems (math.DS) #FOS: Mathematics #Graph Theory and Algorithms
paper · pdf · doi:10.48550/arxiv.2412.01135
openalex publication_date 2024/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.