1 problem

0 votes0 replies1 view
Vertex-disjoint path characterization of generic identifiability for analytic network functions
Vertex-disjoint path conjecture. In the full measurement case, a DAG is generically identifiable in the class $\mathcal{F}_A$ if and only if there are vertex-disjoint paths from ex…
Conjectureopendirected-acyclic-graphs network-identifiability nonlinear-systemsarXiv posted 2 days ago

Vertex-disjoint path characterization of generic identifiability for analytic network functions