Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread

This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions ar...

Full description

Bibliographic Details
Main Author: Ahn, Hyoung Jun
Format: Others
Published: 2014
Online Access:https://thesis.library.caltech.edu/8391/1/HyoungJunAhn_thesis.pdf
Ahn, Hyoung Jun (2014) Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/MC7M-EE22. https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261 <https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261>
id ndltd-CALTECH-oai-thesis.library.caltech.edu-8391
record_format oai_dc
spelling ndltd-CALTECH-oai-thesis.library.caltech.edu-83912019-10-05T03:03:05Z Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread Ahn, Hyoung Jun This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions are well-studied by researchers. We focus on time-varying case, and assume that regressor matrix is random and identical and independently distributed according to given distribution whose probability distribution function is continuous, supported on whole space, and decaying faster than any polynomial. We study the geometric convergence of the probability distribution. We also study the global dynamics of the epidemic spread over complex networks for various models. For instance, in the discrete-time Markov chain model, each node is either healthy or infected at any given time. In this setting, the number of the state increases exponentially as the size of the network increases. The Markov chain has a unique stationary distribution where all the nodes are healthy with probability 1. Since the probability distribution of Markov chain defined on finite state converges to the stationary distribution, this Markov chain model concludes that epidemic disease dies out after long enough time. To analyze the Markov chain model, we study nonlinear epidemic model whose state at any given time is the vector obtained from the marginal probability of infection of each node in the network at that time. Convergence to the origin in the epidemic map implies the extinction of epidemics. The nonlinear model is upper-bounded by linearizing the model at the origin. As a result, the origin is the globally stable unique fixed point of the nonlinear model if the linear upper bound is stable. The nonlinear model has a second fixed point when the linear upper bound is unstable. We work on stability analysis of the second fixed point for both discrete-time and continuous-time models. Returning back to the Markov chain model, we claim that the stability of linear upper bound for nonlinear model is strongly related with the extinction time of the Markov chain. We show that stable linear upper bound is sufficient condition of fast extinction and the probability of survival is bounded by nonlinear epidemic map. 2014 Thesis NonPeerReviewed application/pdf https://thesis.library.caltech.edu/8391/1/HyoungJunAhn_thesis.pdf https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261 Ahn, Hyoung Jun (2014) Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/MC7M-EE22. https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261 <https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261> https://thesis.library.caltech.edu/8391/
collection NDLTD
format Others
sources NDLTD
description This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions are well-studied by researchers. We focus on time-varying case, and assume that regressor matrix is random and identical and independently distributed according to given distribution whose probability distribution function is continuous, supported on whole space, and decaying faster than any polynomial. We study the geometric convergence of the probability distribution. We also study the global dynamics of the epidemic spread over complex networks for various models. For instance, in the discrete-time Markov chain model, each node is either healthy or infected at any given time. In this setting, the number of the state increases exponentially as the size of the network increases. The Markov chain has a unique stationary distribution where all the nodes are healthy with probability 1. Since the probability distribution of Markov chain defined on finite state converges to the stationary distribution, this Markov chain model concludes that epidemic disease dies out after long enough time. To analyze the Markov chain model, we study nonlinear epidemic model whose state at any given time is the vector obtained from the marginal probability of infection of each node in the network at that time. Convergence to the origin in the epidemic map implies the extinction of epidemics. The nonlinear model is upper-bounded by linearizing the model at the origin. As a result, the origin is the globally stable unique fixed point of the nonlinear model if the linear upper bound is stable. The nonlinear model has a second fixed point when the linear upper bound is unstable. We work on stability analysis of the second fixed point for both discrete-time and continuous-time models. Returning back to the Markov chain model, we claim that the stability of linear upper bound for nonlinear model is strongly related with the extinction time of the Markov chain. We show that stable linear upper bound is sufficient condition of fast extinction and the probability of survival is bounded by nonlinear epidemic map.
author Ahn, Hyoung Jun
spellingShingle Ahn, Hyoung Jun
Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread
author_facet Ahn, Hyoung Jun
author_sort Ahn, Hyoung Jun
title Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread
title_short Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread
title_full Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread
title_fullStr Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread
title_full_unstemmed Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread
title_sort random propagation in complex systems: nonlinear matrix recursions and epidemic spread
publishDate 2014
url https://thesis.library.caltech.edu/8391/1/HyoungJunAhn_thesis.pdf
Ahn, Hyoung Jun (2014) Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/MC7M-EE22. https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261 <https://resolver.caltech.edu/CaltechTHESIS:05232014-172754261>
work_keys_str_mv AT ahnhyoungjun randompropagationincomplexsystemsnonlinearmatrixrecursionsandepidemicspread
_version_ 1719260975179235328