{"title":"DASH: A novel method for dynamically selecting key nodes to spread information rapidly under the graph burning model","authors":"Qinghan Xue, Jiaqi Song, Xingqin Qi","doi":"10.1016/j.physleta.2024.130058","DOIUrl":null,"url":null,"abstract":"<div><div>Seldom research considers both the “speed” of information spreading and also the dynamic way of selecting seeds, i.e., choosing node step by step instead of one-time selecting. Graph burning model is used here to meet these requirements of information spreading, whose objective is to find a shortest sequence of nodes and activate them sequentially so that the network is eventually activated completely. This problem has been proven to be NP-Hard. However, few heuristic or approximate algorithms exist, even for trees. Thus, in this paper we propose a novel tree burning algorithm called DASH, where the node with both a strong burning capacity and large spacing to the existing activated nodes is selected as a new seed sequentially. This DASH algorithm is implemented and compared with existing algorithms on 20 spanning subtrees of real networks and 15 randomly generated trees, and the experimental results demonstrate that DASH performs better.</div></div>","PeriodicalId":20172,"journal":{"name":"Physics Letters A","volume":"528 ","pages":"Article 130058"},"PeriodicalIF":2.3000,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physics Letters A","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0375960124007527","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Seldom research considers both the “speed” of information spreading and also the dynamic way of selecting seeds, i.e., choosing node step by step instead of one-time selecting. Graph burning model is used here to meet these requirements of information spreading, whose objective is to find a shortest sequence of nodes and activate them sequentially so that the network is eventually activated completely. This problem has been proven to be NP-Hard. However, few heuristic or approximate algorithms exist, even for trees. Thus, in this paper we propose a novel tree burning algorithm called DASH, where the node with both a strong burning capacity and large spacing to the existing activated nodes is selected as a new seed sequentially. This DASH algorithm is implemented and compared with existing algorithms on 20 spanning subtrees of real networks and 15 randomly generated trees, and the experimental results demonstrate that DASH performs better.
期刊介绍：
Physics Letters A offers an exciting publication outlet for novel and frontier physics. It encourages the submission of new research on: condensed matter physics, theoretical physics, nonlinear science, statistical physics, mathematical and computational physics, general and cross-disciplinary physics (including foundations), atomic, molecular and cluster physics, plasma and fluid physics, optical physics, biological physics and nanoscience. No articles on High Energy and Nuclear Physics are published in Physics Letters A. The journal''s high standard and wide dissemination ensures a broad readership amongst the physics community. Rapid publication times and flexible length restrictions give Physics Letters A the edge over other journals in the field.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
