{"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}
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 (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.