Abstract

This paper discusses a novel approach to obtaining mathematically rigorous results on the global dynamics of ordinary differential equations. We study switching models of regulatory networks. To each switching network we associate a Morse graph, a computable object that describes a Morse decomposition of the dynamics. In this paper we show that all smooth perturbations of the switching system share the same Morse graph and we compute explicit bounds on the size of the allowable perturbation. This shows that computationally tractable switching systems can be used to characterize dynamics of smooth systems with steep nonlinearities.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.