Authors
Abstract
Large coupled networks of individual entities arise in multiple contexts in nature and engineered systems to produce rich dynamics and achieve complex behaviors. As the state-space dimension increases, the certification of stability and performance properties of these nonlinear dynamical systems becomes an intractable problem. In this thesis we develop decomposition methods that break up such convoluted systems into components of smaller dynamics whose behavior is dependent on the state of the neighboring components. These methods explore useful input-output properties of the subsystems in conjunction with the topology of their interconnections, providing results that scale well to large-scale networks.We begin by developing a mathematical approach to analyze spatial pattern formation in developmental biology that combines graph-theoretical and dynamical systems methods to systematically predict the emergence of patterns. This approach models the contact between cells by a graph and exploits its symmetries to create partitions of cells into classes of equal fate. Using monotone systems theory, we derive verifiable conditions that determine whether patterns consistent with such partitions exist and are stable. Then, we propose an engineered synthetic circuit that mimics contact inhibition by using diffusible molecules to spontaneously generate sharply contrasting patterns. Using a compartmental model, we determine a condition that serves as a parameter tuning guide for patterning.We next focus on exploring the symmetric topology of the interconnection to provide efficient certification of performance properties of large networks. Performance certification can be cast as a distributed optimization problem for which the existence of a solution is equivalent to the existence of a solution with repeated variables. We demonstrate that fast certification of stability and performance is possible by searching over solutions in a reduced order domain.Finally, motivated by the stochastic behavior of biological networks, we provide stochastic stability results for systems modeled by stochastic differential equations. We use stochastic passivity properties of the subsystems and a diagonal stability condition of the interconnection matrix together with the passivity gains to guarantee stochastic stability and noise-to-state stability.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,666
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Complexly Organised Dynamical Systems.John Collier & Cliff Hooker - 1999 - Open Systems and Information Dynamics 6 (3):241–302.
On the Stability of a Class of Kinetic Equations.W. Maass - 1983 - Foundations of Physics 13 (7):715-729.
A Dynamical Account of Emergence.John Collier - 2008 - Cybernetics and Human Knowing 15 (3-4):75-86.
The Reemergence of 'Emergence'.Bryon Cunningham - 2001 - Philosophy of Science 68 (3):62-75.

Analytics

Added to PP index
2017-03-08

Total views
1 ( #1,434,153 of 2,349,163 )

Recent downloads (6 months)
1 ( #511,414 of 2,349,163 )

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes