Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 53, Issue 7, Pages 1670-1674Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2008.928114
Keywords
network reconstruction; networked systems; systems biology
Funding
- National Science Foundation [DMS0639328]
- Nuffield Foundation [NAL/01062/G]
- EPSRC [EP/E02761X/1]
- EPSRC [EP/E02761X/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/E02761X/1] Funding Source: researchfish
Ask authors/readers for more resources
This paper formulates and solves the network reconstruction problem for linear time-invariant systems. The problem is motivated from a variety of disciplines, but it has recently received considerable attention from the systems biology community in the study of chemical reaction networks. Here, we demonstrate that even when a transfer function can be identified perfectly from input-output data, not even Boolean reconstruction is possible, in general, without more information about the system. We then completely characterize this additional information that is essential for dynamical reconstruction without appeal to ad-hoc assumptions about the network, such as sparsity or minimality.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available