Departmental Papers (ESE)


We present a methodology for efficient, robust determination of the interaction topology of networked dynamical systems using time series data collected from experiments, under the assumption that these networks are sparse, i.e., have much less edges than the full graph with the same vertex set. To achieve this, we minimize the 1-norm of the decision variables while keeping the data in close Euler fit, thus putting more emphasis on determining the interconnection pattern rather than the closeness of fit. First, we consider a networked system in which the interconnection strength enters in an affine way in the system dynamics. We demonstrate the ability of our method to identify a network structure through numerical examples. Second, we extend our approach to the case of gene regulatory networks, in which the system dynamics are much more complicated.

Document Type

Conference Paper

Subject Area


Date of this Version



August, E.; Papachristodoulou, A.; Recht, B.; Roberts, M.; Jadbabaie, A., "Determining interconnections in biochemical networks using linear programming," 47th IEEE Conference on Decision and Control, 2008. (CDC 2008), pp.3311-3316, 9-11 Dec. 2008 URL:

Copyright 2008 IEEE. Reprinted from Proceedings of the 47th IEEE Conference on Decision and Control, 2008 (CDC 2008), pp.3311-3316, 9-11 Dec. 2008

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.



Date Posted: 21 May 2009