{"title":"Reconstruction of Complex Time-varying Weighted Networks Based on LASSO","authors":"Wenxin Zhang, Guanxue Yang, Lin Wang","doi":"10.23919/CHICC.2018.8484148","DOIUrl":null,"url":null,"abstract":"Network reconstruction is significant in a variety of domains including physics, biology, engineering and social science. Although a lot of effort has been put into static network reconstructions, time-varying networks are rarely studied. Existing studies of time-varying networks usually assume nodes' dynamics to be linear or consider nodes' nonlinear dynamics as prior knowledge. In this paper, identification of time-varying weighted networks is discussed under the condition where network topology, link weights and nodes' nonlinear dynamics are all unknown or unavailable. In fact, networks in real world are naturally sparse which enables the transformation from network reconstruction problem into sparse signal recovering, so that $l_{1}$ regularization can be effectively applicable. Based on the assumption that most natural networks can be mathematically expressed by only a few important analytical functions, we construct a function set consisting of both linear and nonlinear candidate functions. Then LASSO is applied to select the possible function assemblies from the proposed set and optimize the coefficients of the corresponding function terms in order to best describe time-varying structures as well as nodes' nonlinear dynamics. To prove the feasibility and effectiveness of this reconstruction method, both two complex models are testified in networks of different sizes. And this method shows potential ability applying to a wide range of dynamical time-varying networks.","PeriodicalId":158442,"journal":{"name":"2018 37th Chinese Control Conference (CCC)","volume":"188 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 37th Chinese Control Conference (CCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/CHICC.2018.8484148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Network reconstruction is significant in a variety of domains including physics, biology, engineering and social science. Although a lot of effort has been put into static network reconstructions, time-varying networks are rarely studied. Existing studies of time-varying networks usually assume nodes' dynamics to be linear or consider nodes' nonlinear dynamics as prior knowledge. In this paper, identification of time-varying weighted networks is discussed under the condition where network topology, link weights and nodes' nonlinear dynamics are all unknown or unavailable. In fact, networks in real world are naturally sparse which enables the transformation from network reconstruction problem into sparse signal recovering, so that $l_{1}$ regularization can be effectively applicable. Based on the assumption that most natural networks can be mathematically expressed by only a few important analytical functions, we construct a function set consisting of both linear and nonlinear candidate functions. Then LASSO is applied to select the possible function assemblies from the proposed set and optimize the coefficients of the corresponding function terms in order to best describe time-varying structures as well as nodes' nonlinear dynamics. To prove the feasibility and effectiveness of this reconstruction method, both two complex models are testified in networks of different sizes. And this method shows potential ability applying to a wide range of dynamical time-varying networks.