Consider an unknown networkNχimbedded in a networkNT. Let the accessible nodes be connected to the known part of the networkNT, namely,N = NT - Nχ. The problem of the identifiability ofNχfrom the set of accessible nodes is investigated. It is shown that if a topological condition onNis satisfied then for almost all parameters ofN, anyNχis identifiable. Furthermore, this topological condition is also necessary.
No takes yet. Share an insight, caveat, or question.
Lin et al. (1985) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: