基于自适应耦合度的多层网络影响最大化。

IF 2.7 2区 数学 Q1 MATHEMATICS, APPLIED
Chaos Pub Date : 2025-03-01 DOI:10.1063/5.0256704
Su-Su Zhang, Ming Xie, Chuang Liu, Xiu-Xiu Zhan
{"title":"基于自适应耦合度的多层网络影响最大化。","authors":"Su-Su Zhang, Ming Xie, Chuang Liu, Xiu-Xiu Zhan","doi":"10.1063/5.0256704","DOIUrl":null,"url":null,"abstract":"<p><p>Influence maximization (IM) aims to identify highly influential nodes to maximize influence spread in a network. Previous research on the IM problem has mainly concentrated on single-layer networks, disregarding the comprehension of the coupling structure that is inherent in multilayer networks. To solve the IM problem in multilayer networks, we first propose an independent cascade model (MIC) in a multilayer network where propagation occurs simultaneously across different layers. Consequently, a heuristic algorithm, i.e., adaptive coupling degree (ACD), which selects seed nodes with high spread influence and a low degree of overlap of influence, is proposed to identify seed nodes for IM in a multilayer network. By conducting experiments based on MIC, we have demonstrated that our proposed method is superior to the baselines in terms of influence spread and time cost in six synthetic and four real-world multilayer networks.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 3","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Influence maximization in multilayer networks based on adaptive coupling degree.\",\"authors\":\"Su-Su Zhang, Ming Xie, Chuang Liu, Xiu-Xiu Zhan\",\"doi\":\"10.1063/5.0256704\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Influence maximization (IM) aims to identify highly influential nodes to maximize influence spread in a network. Previous research on the IM problem has mainly concentrated on single-layer networks, disregarding the comprehension of the coupling structure that is inherent in multilayer networks. To solve the IM problem in multilayer networks, we first propose an independent cascade model (MIC) in a multilayer network where propagation occurs simultaneously across different layers. Consequently, a heuristic algorithm, i.e., adaptive coupling degree (ACD), which selects seed nodes with high spread influence and a low degree of overlap of influence, is proposed to identify seed nodes for IM in a multilayer network. By conducting experiments based on MIC, we have demonstrated that our proposed method is superior to the baselines in terms of influence spread and time cost in six synthetic and four real-world multilayer networks.</p>\",\"PeriodicalId\":9974,\"journal\":{\"name\":\"Chaos\",\"volume\":\"35 3\",\"pages\":\"\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2025-03-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.0256704\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0256704","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

影响最大化(Influence maximization, IM)是指在网络中识别最具影响力的节点,从而使影响传播最大化。以往对IM问题的研究主要集中在单层网络上,忽视了对多层网络固有耦合结构的理解。为了解决多层网络中的IM问题,我们首先在多层网络中提出了一种独立级联模型(MIC),其中传播在不同层之间同时发生。为此,提出了一种启发式算法,即自适应耦合度(ACD)算法,该算法选择具有高传播影响和低重叠影响的种子节点来识别多层网络中的IM种子节点。通过基于MIC的实验,我们证明了我们提出的方法在六个合成多层网络和四个真实多层网络中的影响传播和时间成本方面优于基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Influence maximization in multilayer networks based on adaptive coupling degree.

Influence maximization (IM) aims to identify highly influential nodes to maximize influence spread in a network. Previous research on the IM problem has mainly concentrated on single-layer networks, disregarding the comprehension of the coupling structure that is inherent in multilayer networks. To solve the IM problem in multilayer networks, we first propose an independent cascade model (MIC) in a multilayer network where propagation occurs simultaneously across different layers. Consequently, a heuristic algorithm, i.e., adaptive coupling degree (ACD), which selects seed nodes with high spread influence and a low degree of overlap of influence, is proposed to identify seed nodes for IM in a multilayer network. By conducting experiments based on MIC, we have demonstrated that our proposed method is superior to the baselines in terms of influence spread and time cost in six synthetic and four real-world multilayer networks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信