• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

复杂网络的最优钉扎可控性:对网络结构的依赖性。

Optimal pinning controllability of complex networks: dependence on network structure.

作者信息

Jalili Mahdi, Askari Sichani Omid, Yu Xinghuo

机构信息

Department of Computer Engineering, Sharif University of Technology, Tehran, Iran and School of Electrical and Computer Engineering, RMIT University, Melbourne 3001, Australia.

Department of Computer Engineering, Sharif University of Technology, Tehran, Iran.

出版信息

Phys Rev E Stat Nonlin Soft Matter Phys. 2015 Jan;91(1):012803. doi: 10.1103/PhysRevE.91.012803. Epub 2015 Jan 5.

DOI:10.1103/PhysRevE.91.012803
PMID:25679653
Abstract

Controlling networked structures has many applications in science and engineering. In this paper, we consider the problem of pinning control (pinning the dynamics into the reference state), and optimally placing the driver nodes, i.e., the nodes to which the control signal is fed. Considering the local controllability concept, a metric based on the eigenvalues of the Laplacian matrix is taken into account as a measure of controllability. We show that the proposed optimal placement strategy considerably outperforms heuristic methods including choosing hub nodes with high degree or betweenness centrality as drivers. We also study properties of optimal drivers in terms of various centrality measures including degree, betweenness, closeness, and clustering coefficient. The profile of these centrality values depends on the network structure. For homogeneous networks such as random small-world networks, the optimal driver nodes have almost the mean centrality value of the population (much lower than the centrality value of hub nodes), whereas the centrality value of optimal drivers in heterogeneous networks such as scale-free ones is much higher than the average and close to that of hub nodes. However, as the degree of heterogeneity decreases in such networks, the profile of centrality approaches the population mean.

摘要

控制网络结构在科学和工程领域有许多应用。在本文中,我们考虑了牵制控制问题(将动力学牵制到参考状态),并优化驱动节点(即输入控制信号的节点)的放置。考虑到局部可控性概念,基于拉普拉斯矩阵特征值的一个度量被用作可控性的一种度量。我们表明,所提出的最优放置策略显著优于启发式方法,包括选择具有高度或中介中心性的枢纽节点作为驱动节点。我们还根据包括度、中介性、接近性和聚类系数在内的各种中心性度量来研究最优驱动节点的性质。这些中心性值的分布取决于网络结构。对于诸如随机小世界网络这样的均匀网络,最优驱动节点几乎具有总体的平均中心性值(远低于枢纽节点的中心性值),而在诸如无标度网络这样的异质网络中,最优驱动节点的中心性值远高于平均值且接近枢纽节点的中心性值。然而,随着此类网络中异质性程度的降低,中心性分布趋近于总体平均值。

相似文献

1
Optimal pinning controllability of complex networks: dependence on network structure.复杂网络的最优钉扎可控性:对网络结构的依赖性。
Phys Rev E Stat Nonlin Soft Matter Phys. 2015 Jan;91(1):012803. doi: 10.1103/PhysRevE.91.012803. Epub 2015 Jan 5.
2
Optimizing Dynamical Network Structure for Pinning Control.用于牵制控制的动态网络结构优化
Sci Rep. 2016 Apr 12;6:24252. doi: 10.1038/srep24252.
3
Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains.提高钉扎同步性的速度:具有高反馈增益的低度节点。
Sci Rep. 2015 Dec 2;5:17459. doi: 10.1038/srep17459.
4
Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks.分形和非分形无标度模型网络的中介中心性及对真实网络的测试
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 May;75(5 Pt 2):056115. doi: 10.1103/PhysRevE.75.056115. Epub 2007 May 31.
5
Heuristic Strategies for Persuader Selection in Contagions on Complex Networks.复杂网络上传染病传播中说服者选择的启发式策略
PLoS One. 2017 Jan 10;12(1):e0169771. doi: 10.1371/journal.pone.0169771. eCollection 2017.
6
Subgraph centrality in complex networks.复杂网络中的子图中心性。
Phys Rev E Stat Nonlin Soft Matter Phys. 2005 May;71(5 Pt 2):056103. doi: 10.1103/PhysRevE.71.056103. Epub 2005 May 6.
7
Dynamics-based centrality for directed networks.基于动态性的有向网络中心性
Phys Rev E Stat Nonlin Soft Matter Phys. 2010 Nov;82(5 Pt 2):056107. doi: 10.1103/PhysRevE.82.056107. Epub 2010 Nov 8.
8
Computing Influential Nodes Using the Nearest Neighborhood Trust Value and PageRank in Complex Networks.利用复杂网络中的最近邻信任值和PageRank算法计算有影响力的节点
Entropy (Basel). 2022 May 16;24(5):704. doi: 10.3390/e24050704.
9
Centrality in networks of urban streets.城市街道网络中的中心性
Chaos. 2006 Mar;16(1):015113. doi: 10.1063/1.2150162.
10
Identification and evolution of structurally dominant nodes in protein-protein interaction networks.蛋白质-蛋白质相互作用网络中结构主导节点的识别与演化
IEEE Trans Biomed Circuits Syst. 2014 Feb;8(1):87-97. doi: 10.1109/TBCAS.2014.2303160.

引用本文的文献

1
Low-dimensional controllability of brain networks.脑网络的低维可控性
PLoS Comput Biol. 2025 Jan 7;21(1):e1012691. doi: 10.1371/journal.pcbi.1012691. eCollection 2025 Jan.
2
Finding influential nodes in networks using pinning control: Centrality measures confirmed with electrochemical oscillators.使用牵制控制在网络中寻找有影响力的节点:用电化学振荡器验证中心性度量
Chaos. 2023 Sep 1;33(9). doi: 10.1063/5.0163899.
3
A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.一种用于任意网络可控性的并行自适应量子遗传算法。
PLoS One. 2018 Mar 19;13(3):e0193827. doi: 10.1371/journal.pone.0193827. eCollection 2018.
4
The amyloid interactome: Exploring protein aggregation.淀粉样蛋白相互作用组:探索蛋白质聚集
PLoS One. 2017 Mar 1;12(3):e0173163. doi: 10.1371/journal.pone.0173163. eCollection 2017.
5
Optimizing Dynamical Network Structure for Pinning Control.用于牵制控制的动态网络结构优化
Sci Rep. 2016 Apr 12;6:24252. doi: 10.1038/srep24252.
6
Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains.提高钉扎同步性的速度:具有高反馈增益的低度节点。
Sci Rep. 2015 Dec 2;5:17459. doi: 10.1038/srep17459.