具有容量和负载的部分相互依存网络的渗透行为

IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Mengjiao Chen, Niu Wang, Daijun Wei, Changcheng Xiang
{"title":"具有容量和负载的部分相互依存网络的渗透行为","authors":"Mengjiao Chen,&nbsp;Niu Wang,&nbsp;Daijun Wei,&nbsp;Changcheng Xiang","doi":"10.1016/j.chaos.2024.115674","DOIUrl":null,"url":null,"abstract":"<div><div>Capacity-loaded networks with interdependent topologies accurately mirror various infrastructure networks. In this work, a partially interdependent network with capacity and loads model is proposed to portray the network structure in real systems. The theoretical framework based on percolation theory for predicting percolation thresholds in partially interdependent networks with capacity and loads is established using generating functions and self-consistent equations. The percolation transition of network is analyzed by initially removing <span><math><mrow><mn>1</mn><mo>−</mo><mi>p</mi></mrow></math></span> fraction nodes and exploring the size of the giant component of the network after cascade failure. Random and scale-free networks are used for numerical and simulation experiments. We find that increasing the capacity parameter enhances the robustness of interdependent networks and alters the percolation characteristics within the network. The phase transition types in random networks exhibit notable variations across different average degrees, while those in scale-free networks are influenced by power-law exponents. Finally, the validity and accuracy of the proposed model is confirmed by a double-layer empirical network consisting of the World Cities Network and the U.S. Electricity Network.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"189 ","pages":"Article 115674"},"PeriodicalIF":5.3000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Percolation behavior of partially interdependent networks with capacity and loads\",\"authors\":\"Mengjiao Chen,&nbsp;Niu Wang,&nbsp;Daijun Wei,&nbsp;Changcheng Xiang\",\"doi\":\"10.1016/j.chaos.2024.115674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Capacity-loaded networks with interdependent topologies accurately mirror various infrastructure networks. In this work, a partially interdependent network with capacity and loads model is proposed to portray the network structure in real systems. The theoretical framework based on percolation theory for predicting percolation thresholds in partially interdependent networks with capacity and loads is established using generating functions and self-consistent equations. The percolation transition of network is analyzed by initially removing <span><math><mrow><mn>1</mn><mo>−</mo><mi>p</mi></mrow></math></span> fraction nodes and exploring the size of the giant component of the network after cascade failure. Random and scale-free networks are used for numerical and simulation experiments. We find that increasing the capacity parameter enhances the robustness of interdependent networks and alters the percolation characteristics within the network. The phase transition types in random networks exhibit notable variations across different average degrees, while those in scale-free networks are influenced by power-law exponents. Finally, the validity and accuracy of the proposed model is confirmed by a double-layer empirical network consisting of the World Cities Network and the U.S. Electricity Network.</div></div>\",\"PeriodicalId\":9764,\"journal\":{\"name\":\"Chaos Solitons & Fractals\",\"volume\":\"189 \",\"pages\":\"Article 115674\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos Solitons & Fractals\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0960077924012268\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos Solitons & Fractals","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0960077924012268","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

具有相互依存拓扑结构的容量负载网络能准确反映各种基础设施网络。本文提出了一个具有容量和负载的部分相互依赖网络模型,以描绘真实系统中的网络结构。利用生成函数和自洽方程,建立了基于渗流理论的理论框架,用于预测具有容量和负载的部分相互依赖网络的渗流阈值。通过初始移除 1-p 部分节点和探索级联失效后网络巨大分量的大小,分析了网络的渗滤转变。随机网络和无标度网络被用于数值和模拟实验。我们发现,增加容量参数会增强相互依存网络的鲁棒性,并改变网络内部的渗流特性。随机网络中的相变类型在不同的平均度上表现出明显的差异,而无标度网络中的相变类型则受到幂律指数的影响。最后,由世界城市网络和美国电力网络组成的双层实证网络证实了所提模型的有效性和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Percolation behavior of partially interdependent networks with capacity and loads
Capacity-loaded networks with interdependent topologies accurately mirror various infrastructure networks. In this work, a partially interdependent network with capacity and loads model is proposed to portray the network structure in real systems. The theoretical framework based on percolation theory for predicting percolation thresholds in partially interdependent networks with capacity and loads is established using generating functions and self-consistent equations. The percolation transition of network is analyzed by initially removing 1p fraction nodes and exploring the size of the giant component of the network after cascade failure. Random and scale-free networks are used for numerical and simulation experiments. We find that increasing the capacity parameter enhances the robustness of interdependent networks and alters the percolation characteristics within the network. The phase transition types in random networks exhibit notable variations across different average degrees, while those in scale-free networks are influenced by power-law exponents. Finally, the validity and accuracy of the proposed model is confirmed by a double-layer empirical network consisting of the World Cities Network and the U.S. Electricity Network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Chaos Solitons & Fractals
Chaos Solitons & Fractals 物理-数学跨学科应用
CiteScore
13.20
自引率
10.30%
发文量
1087
审稿时长
9 months
期刊介绍: Chaos, Solitons & Fractals strives to establish itself as a premier journal in the interdisciplinary realm of Nonlinear Science, Non-equilibrium, and Complex Phenomena. It welcomes submissions covering a broad spectrum of topics within this field, including dynamics, non-equilibrium processes in physics, chemistry, and geophysics, complex matter and networks, mathematical models, computational biology, applications to quantum and mesoscopic phenomena, fluctuations and random processes, self-organization, and social phenomena.
×
引用
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学术官方微信