Selection and optimization of drive nodes in drive-response networks.

IF 2.7 2区 数学 Q1 MATHEMATICS, APPLIED
Chaos Pub Date : 2025-01-01 DOI:10.1063/5.0226760
Zihao Yan, Ziye Fan, Jie Hu, Hui Liu, Xiaoqun Wu
{"title":"Selection and optimization of drive nodes in drive-response networks.","authors":"Zihao Yan, Ziye Fan, Jie Hu, Hui Liu, Xiaoqun Wu","doi":"10.1063/5.0226760","DOIUrl":null,"url":null,"abstract":"<p><p>This paper considers the selection and optimization of drive nodes based on the controllability of multilayer networks. The intra-layer network topologies are arbitrary, and the node dynamics are linear time-invariant dynamical systems. The study focuses on the number and selection of drive nodes in a special class of drive-response networks. Several conclusions are drawn through the investigation: (1) All the drive nodes cannot be placed in the response layer but can be contained in the drive layer; (2) The minimum number of drive nodes placed in the drive layer is equal to the maximum geometric multiplicity of the system matrix of the drive layer; (3) The configuration of interlayer coupling weight significantly affects the number and distribution of drive nodes. Moreover, an optimization scheme is proposed based on the Gershgorin circle theorem, which aims to minimize the number of drive nodes in the entire network. This scheme ensures that regardless of the drive nodes originally needed, they can be reduced to the maximum geometric multiplicity of the system matrix of the drive layer. Numerical simulations on a general two-layer network as well as various synthetic networks are provided to validate the results.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0226760","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

This paper considers the selection and optimization of drive nodes based on the controllability of multilayer networks. The intra-layer network topologies are arbitrary, and the node dynamics are linear time-invariant dynamical systems. The study focuses on the number and selection of drive nodes in a special class of drive-response networks. Several conclusions are drawn through the investigation: (1) All the drive nodes cannot be placed in the response layer but can be contained in the drive layer; (2) The minimum number of drive nodes placed in the drive layer is equal to the maximum geometric multiplicity of the system matrix of the drive layer; (3) The configuration of interlayer coupling weight significantly affects the number and distribution of drive nodes. Moreover, an optimization scheme is proposed based on the Gershgorin circle theorem, which aims to minimize the number of drive nodes in the entire network. This scheme ensures that regardless of the drive nodes originally needed, they can be reduced to the maximum geometric multiplicity of the system matrix of the drive layer. Numerical simulations on a general two-layer network as well as various synthetic networks are provided to validate the results.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信