By Topic

Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Arcak, M. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA

A square matrix E is said to be diagonally stable if there exists a diagonal matrix D >; 0 satisfying DE+ETD <; 0 . This notion has been instrumental in recent studies on stability of interconnected system models in communication and biological networks, in which the subsystems satisfy passivity properties and the matrix E combines this passivity information with the interconnection structure. This paper presents a necessary and sufficient condition for diagonal stability when the digraph describing the network conforms to a “cactus” structure, which means that a pair of distinct simple circuits in the graph have at most one common vertex. In the special case of a single circuit, this diagonal stability test recovers the “secant criterion” that was recently derived for cyclic networks. The paper then incorporates the new diagonal stability test in network stability analysis where the diagonal entries of the matrix D serve as weights in a Lyapunov function constructed from storage functions that verify passivity properties of the components. Finally, the paper illustrates this stability test on examples motivated by gene networks and population dynamics.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 12 )