Scaling reparametrization conjecture for identifiable path/cycle models

From papers

Let M=(G,In,Out,V)\mathcal{M}=(G,In,Out,V) be a linear compartmental model. Suppose either that GG is strongly input-output connected and Out=1|Out|=1, or that GG is strongly connected and In=1|In|=1. Scaling reparametrization conjecture. An identifiable scaling reparametrization exists if and only if M=(G,In,Out,V)\mathcal{M}=(G,In,Out,V) is an identifiable path/cycle model. This conjecture aims to generalize necessary and sufficient conditions previously obtained for identifiable scaling reparametrizations in a special single-input/single-output setting; its resolution is left as future work.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Cashous Bortner and Nicolette Meshkat, “Identifiable paths and cycles in linear compartmental models”, arXiv:2010.07203 (2021).

Solutions 0

No solutions have been posted yet.