A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Network reconstruction of dynamical polytrees with unobserved nodes
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
The paper deals with the problem of unveiling the link structure of a network of linear dynamical systems. A technique is provided guaranteeing an exact detection of the links of a network of dynamical systems with no undirected cycles (Linear Dynamic Polytrees). In particular, the presence of unobserved (latent) nodes is taken into account. Knowledge on the specific number of hidden processes is not required. It is proven that the topology can be consistently reconstructed, as long the degreedoi:10.1109/cdc.2012.6426335 dblp:conf/cdc/MaterassiS12 fatcat:zomsgbnu5vhzbjqdl53ganqpgq