Identifiability conjecture for Fin and Wing submodels of cycle graphs

For n3n\geq 3, let GG be a graph obtained from the nn-compartment cycle graph by adding one or more incoming edges or one or more outgoing edges. Let In=Out={1}In=Out=\{1\} and Leak=Leak=\emptyset.

Fin-and-Wing submodel conjecture. The linear compartmental model (G,In,Out,Leak)(G,In,Out,Leak) is generically locally identifiable.

The coefficient maps for these submodels are complicated, so the paper does not analyze their Jacobians completely. It proves identifiability for certain families of added edges and conjectures the broader statement for models with more than one or two incoming or outgoing edges.

Sources & referencesView supporting material

Primary source

Seth Gerberding, Nida Obatake and Anne Shiu, “Identifiability of Linear Compartmental Models: The Effect of Moving Inputs, Outputs, and Leaks”, arXiv:1910.13549 (2020).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.