{"title":"Graphical Construction of Stability Certificates for Biomolecular Interaction Networks","authors":"M. A. Al-Radhawi","doi":"10.1109/CDC51059.2022.9993105","DOIUrl":null,"url":null,"abstract":"—We study robust stability of Biological Interaction Networks (BINs) by constructing stability certificates in the form of Robust Lyapunov Functions (RLFs) using graphical methods. Previous works have mainly constructed RLFs by utilizing linear programs or iterative algorithms. Such algo- rithms become tedious or computationally infeasible for large networks. In addition, they do not identify motifs or graph modifications that maintain stability. In this work, we provide several graphical criteria for constructing stability certificates. We characterize a set of stability-preserving graph modifications which include, in particular, the enzymatic catalysis motif. Hence, stability of a class of arbitrarily large networks can be examined by simple visual inspection. We present applications of this technique to Post-Translational Modification (PTM) cycles, Ribosome Flow Model (RFM), and T -cell kinetic proofreading. Index Terms —Nonlinear Systems, Systems Biology, Petri-nets, Lyapunov Functions, Robust Stability, Reaction Networks.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC51059.2022.9993105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
—We study robust stability of Biological Interaction Networks (BINs) by constructing stability certificates in the form of Robust Lyapunov Functions (RLFs) using graphical methods. Previous works have mainly constructed RLFs by utilizing linear programs or iterative algorithms. Such algo- rithms become tedious or computationally infeasible for large networks. In addition, they do not identify motifs or graph modifications that maintain stability. In this work, we provide several graphical criteria for constructing stability certificates. We characterize a set of stability-preserving graph modifications which include, in particular, the enzymatic catalysis motif. Hence, stability of a class of arbitrarily large networks can be examined by simple visual inspection. We present applications of this technique to Post-Translational Modification (PTM) cycles, Ribosome Flow Model (RFM), and T -cell kinetic proofreading. Index Terms —Nonlinear Systems, Systems Biology, Petri-nets, Lyapunov Functions, Robust Stability, Reaction Networks.