使用高级中心性方法识别网络传播源。

IF 2 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY
Entropy Pub Date : 2025-09-12 DOI:10.3390/e27090948
Damian Frąszczak
{"title":"使用高级中心性方法识别网络传播源。","authors":"Damian Frąszczak","doi":"10.3390/e27090948","DOIUrl":null,"url":null,"abstract":"<p><p>We live in a time dominated by interconnected networks surrounding us on all fronts. The emergence of social media platforms has driven the expansion of social networks, facilitating fast communication worldwide. Responses to content shared on these platforms can be seen as a propagation process, where information spreads through social networks. Analyzing propagation graphs presents a significant challenge in identifying sources, which is crucial in various fields. This includes detecting the origins of disinformation, identifying patient zero in an epidemic, and tracing the initial sources of viral trends or malware. Numerous studies have attempted to identify these sources using methods similar to centrality measures which assign a value indicating the likelihood of being a source. While centrality measures are a popular topic, with many new measures introduced each year, only a few have been explored in the context of source identification. This article explores a wide range of centrality measures in the context of source identification. The results help identify the most effective measures and pave the way for the development of more efficient detection techniques. Additionally, an analysis was conducted considering multiple hops in the propagation network, providing deeper insights into the impact of extended neighborhood structures on detection performance.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 9","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12469922/pdf/","citationCount":"0","resultStr":"{\"title\":\"Identifying Network Propagation Sources Using Advanced Centrality Measures.\",\"authors\":\"Damian Frąszczak\",\"doi\":\"10.3390/e27090948\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>We live in a time dominated by interconnected networks surrounding us on all fronts. The emergence of social media platforms has driven the expansion of social networks, facilitating fast communication worldwide. Responses to content shared on these platforms can be seen as a propagation process, where information spreads through social networks. Analyzing propagation graphs presents a significant challenge in identifying sources, which is crucial in various fields. This includes detecting the origins of disinformation, identifying patient zero in an epidemic, and tracing the initial sources of viral trends or malware. Numerous studies have attempted to identify these sources using methods similar to centrality measures which assign a value indicating the likelihood of being a source. While centrality measures are a popular topic, with many new measures introduced each year, only a few have been explored in the context of source identification. This article explores a wide range of centrality measures in the context of source identification. The results help identify the most effective measures and pave the way for the development of more efficient detection techniques. Additionally, an analysis was conducted considering multiple hops in the propagation network, providing deeper insights into the impact of extended neighborhood structures on detection performance.</p>\",\"PeriodicalId\":11694,\"journal\":{\"name\":\"Entropy\",\"volume\":\"27 9\",\"pages\":\"\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2025-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12469922/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Entropy\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.3390/e27090948\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e27090948","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

我们生活在一个被相互连接的网络包围的时代。社交媒体平台的出现推动了社交网络的扩张,促进了全球范围内的快速交流。对这些平台上分享的内容的回应可以被视为一个传播过程,信息通过社交网络传播。分析传播图对识别源提出了重大挑战,这在各个领域都是至关重要的。这包括检测虚假信息的来源,确定流行病中的零号患者,以及追踪病毒趋势或恶意软件的最初来源。许多研究试图使用类似于中心性测量的方法来确定这些来源,这些方法指定一个值,表明成为来源的可能性。虽然中心性度量是一个流行的话题,但每年都会引入许多新的度量,只有少数在源识别的背景下进行了探索。本文探讨了来源识别背景下广泛的中心性措施。这些结果有助于确定最有效的措施,并为开发更有效的检测技术铺平道路。此外,还对传播网络中的多跳数进行了分析,从而更深入地了解扩展邻域结构对检测性能的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identifying Network Propagation Sources Using Advanced Centrality Measures.

We live in a time dominated by interconnected networks surrounding us on all fronts. The emergence of social media platforms has driven the expansion of social networks, facilitating fast communication worldwide. Responses to content shared on these platforms can be seen as a propagation process, where information spreads through social networks. Analyzing propagation graphs presents a significant challenge in identifying sources, which is crucial in various fields. This includes detecting the origins of disinformation, identifying patient zero in an epidemic, and tracing the initial sources of viral trends or malware. Numerous studies have attempted to identify these sources using methods similar to centrality measures which assign a value indicating the likelihood of being a source. While centrality measures are a popular topic, with many new measures introduced each year, only a few have been explored in the context of source identification. This article explores a wide range of centrality measures in the context of source identification. The results help identify the most effective measures and pave the way for the development of more efficient detection techniques. Additionally, an analysis was conducted considering multiple hops in the propagation network, providing deeper insights into the impact of extended neighborhood structures on detection performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Entropy
Entropy PHYSICS, MULTIDISCIPLINARY-
CiteScore
4.90
自引率
11.10%
发文量
1580
审稿时长
21.05 days
期刊介绍: Entropy (ISSN 1099-4300), an international and interdisciplinary journal of entropy and information studies, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish as much as possible their theoretical and experimental details. There is no restriction on the length of the papers. If there are computation and the experiment, the details must be provided so that the results can be reproduced.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信