拓扑结构和目的地选择策略对复杂网络中代理动态的影响

IF 2.6 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Journal of Physics Complexity Pub Date : 2024-02-23 DOI:10.1088/2632-072x/ad2971
Satori Tsuzuki, Daichi Yanagisawa, Eri Itoh, Katsuhiro Nishinari
{"title":"拓扑结构和目的地选择策略对复杂网络中代理动态的影响","authors":"Satori Tsuzuki, Daichi Yanagisawa, Eri Itoh, Katsuhiro Nishinari","doi":"10.1088/2632-072x/ad2971","DOIUrl":null,"url":null,"abstract":"We analyzed agent behavior in complex networks: Barabási–Albert, Erdos–Rényi, and Watts–Strogatz models under the following rules: agents (a) randomly select a destination among adjacent nodes; (b) exclude the most congested adjacent node as a potential destination and randomly select a destination among the remaining nodes; or (c) select the sparsest adjacent node as a destination. We focused on small complex networks with node degrees ranging from zero to a maximum of approximately 20 to study agent behavior in traffic and transportation networks. We measured the hunting rate, that is, the rate of change of agent amounts in each node per unit of time, and the imbalance of agent distribution among nodes. Our simulation study reveals that the topological structure of a network precisely determines agent distribution when agents perform full random walks; however, their destination selections alter the agent distribution. Notably, rule (c) makes hunting and imbalance rates significantly high compared with random walk cases (a) and (b), irrespective of network types, when the network has a high degree and high activity rate. Compared with the full random walk in (a) and (b) increases the hunting rate while decreasing the imbalance rate when activity is low; however, both increase when activity is high. These characteristics exhibit slight periodic undulations over time. Furthermore, our analysis shows that in the BA, ER, and WS network models, the hunting rate decreases and the imbalance rate increases when the system disconnects randomly selected nodes in simulations where agents follow rules (a)–(c) and the network has the ability to disconnect nodes within a certain time of all time steps. Our findings can be applied to various applications related to agent dynamics in complex networks.","PeriodicalId":53211,"journal":{"name":"Journal of Physics Complexity","volume":"14 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effects of topological structure and destination selection strategies on agent dynamics in complex networks\",\"authors\":\"Satori Tsuzuki, Daichi Yanagisawa, Eri Itoh, Katsuhiro Nishinari\",\"doi\":\"10.1088/2632-072x/ad2971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyzed agent behavior in complex networks: Barabási–Albert, Erdos–Rényi, and Watts–Strogatz models under the following rules: agents (a) randomly select a destination among adjacent nodes; (b) exclude the most congested adjacent node as a potential destination and randomly select a destination among the remaining nodes; or (c) select the sparsest adjacent node as a destination. We focused on small complex networks with node degrees ranging from zero to a maximum of approximately 20 to study agent behavior in traffic and transportation networks. We measured the hunting rate, that is, the rate of change of agent amounts in each node per unit of time, and the imbalance of agent distribution among nodes. Our simulation study reveals that the topological structure of a network precisely determines agent distribution when agents perform full random walks; however, their destination selections alter the agent distribution. Notably, rule (c) makes hunting and imbalance rates significantly high compared with random walk cases (a) and (b), irrespective of network types, when the network has a high degree and high activity rate. Compared with the full random walk in (a) and (b) increases the hunting rate while decreasing the imbalance rate when activity is low; however, both increase when activity is high. These characteristics exhibit slight periodic undulations over time. Furthermore, our analysis shows that in the BA, ER, and WS network models, the hunting rate decreases and the imbalance rate increases when the system disconnects randomly selected nodes in simulations where agents follow rules (a)–(c) and the network has the ability to disconnect nodes within a certain time of all time steps. Our findings can be applied to various applications related to agent dynamics in complex networks.\",\"PeriodicalId\":53211,\"journal\":{\"name\":\"Journal of Physics Complexity\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Physics Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/2632-072x/ad2971\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2632-072x/ad2971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

我们分析了复杂网络中的代理行为:Barabási-Albert、Erdos-Rényi 和 Watts-Strogatz 模型的规则如下:代理(a)在相邻节点中随机选择一个目的地;(b)排除最拥挤的相邻节点作为潜在目的地,并在其余节点中随机选择一个目的地;或(c)选择最稀疏的相邻节点作为目的地。我们重点研究了节点度从零到最大约 20 度的小型复杂网络,以研究交通和运输网络中的代理行为。我们测量了狩猎率,即单位时间内每个节点上代理数量的变化率,以及代理在节点间分布的不平衡性。我们的模拟研究表明,当代理进行完全随机行走时,网络的拓扑结构精确地决定了代理的分布;然而,代理对目的地的选择改变了代理的分布。值得注意的是,与随机漫步情况(a)和(b)相比,无论网络类型如何,当网络具有高度和高活动率时,规则(c)都会使猎杀率和不平衡率显著提高。与完全随机漫步相比,(a)和(b)中的狩猎率会在活动量较低时增加,而失衡率会降低;但是,在活动量较高时,狩猎率和失衡率都会增加。这些特征随着时间的推移呈现出轻微的周期性起伏。此外,我们的分析表明,在 BA、ER 和 WS 网络模型中,在代理遵循(a)-(c)规则且网络有能力在所有时间步骤的一定时间内断开节点连接的模拟中,当系统断开随机选择的节点连接时,狩猎率会降低,不平衡率会增加。我们的研究结果可应用于与复杂网络中的代理动态相关的各种应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Effects of topological structure and destination selection strategies on agent dynamics in complex networks
We analyzed agent behavior in complex networks: Barabási–Albert, Erdos–Rényi, and Watts–Strogatz models under the following rules: agents (a) randomly select a destination among adjacent nodes; (b) exclude the most congested adjacent node as a potential destination and randomly select a destination among the remaining nodes; or (c) select the sparsest adjacent node as a destination. We focused on small complex networks with node degrees ranging from zero to a maximum of approximately 20 to study agent behavior in traffic and transportation networks. We measured the hunting rate, that is, the rate of change of agent amounts in each node per unit of time, and the imbalance of agent distribution among nodes. Our simulation study reveals that the topological structure of a network precisely determines agent distribution when agents perform full random walks; however, their destination selections alter the agent distribution. Notably, rule (c) makes hunting and imbalance rates significantly high compared with random walk cases (a) and (b), irrespective of network types, when the network has a high degree and high activity rate. Compared with the full random walk in (a) and (b) increases the hunting rate while decreasing the imbalance rate when activity is low; however, both increase when activity is high. These characteristics exhibit slight periodic undulations over time. Furthermore, our analysis shows that in the BA, ER, and WS network models, the hunting rate decreases and the imbalance rate increases when the system disconnects randomly selected nodes in simulations where agents follow rules (a)–(c) and the network has the ability to disconnect nodes within a certain time of all time steps. Our findings can be applied to various applications related to agent dynamics in complex networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Physics Complexity
Journal of Physics Complexity Computer Science-Information Systems
CiteScore
4.30
自引率
11.10%
发文量
45
审稿时长
14 weeks
期刊最新文献
Persistent Mayer Dirac. Fitness-based growth of directed networks with hierarchy The ultrametric backbone is the union of all minimum spanning forests. Exploring the space of graphs with fixed discrete curvatures Augmentations of Forman’s Ricci curvature and their applications in community detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1