Dividing-edge conjecture for linear compartmental models
Dividing-edge conjecture for linear compartmental models
Let be a strongly connected linear compartmental model that is generically locally identifiable, with singular-locus equation . An edge is dividing if its parameter divides . Dividing-edge conjecture. If is a dividing edge of , and the model obtained by deleting the edge is strongly connected, then is unidentifiable. The conjecture is motivated by the converse of the known result that deleting non-dividing edges preserves generic local identifiability. It is proved in cases where deleting the edge increases the shortest input-output path length, but the general claim remains open.
Sources & referencesView supporting material
Primary source
Patrick Chan, Katherine Johnston, Anne Shiu, Aleksandra Sobieska and Clare Spinner, “Identifiability of Linear Compartmental Models: The Impact of Removing Leaks and Edges”, arXiv:2102.04417 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.