Finding the Source in Networks: An Approach Based on Structural Entropy

Author:

Zhang Chong1ORCID,Guo Qiang1ORCID,Fu Luoyi1ORCID,Ding Jiaxin1ORCID,Cao Xinde1ORCID,Long Fei2ORCID,Wang Xinbing1ORCID,Zhou Chenghu3ORCID

Affiliation:

1. Shanghai Jiao Tong University, Shanghai, China

2. Xinhua News Agency, Beijing, China

3. Chinese Academy of Sciences, Beijing, China

Abstract

The popularity of intelligent devices provides straightforward access to the Internet and online social networks. However, the quick and easy data updates from networks also benefit the risk spreading, such as rumor, malware, or computer viruses. To this end, this article studies the problem of source detection, which is to infer the source node out of an aftermath of a cascade, that is, the observed infected graph G N of the network at some time. Prior arts have adopted various statistical quantities such as degree, distance, or infection size to reflect the structural centrality of the source. In this article, we propose a new metric that we call the infected tree entropy (ITE), to utilize richer underlying structural features for source detection. Our idea of ITE is inspired by the conception of structural entropy [ 21 ], which demonstrated that the minimization of average bits to encode the network structures with different partitions is the principle for detecting the natural or true structures in real-world networks. Accordingly, our proposed ITE based estimator for the source tries to minimize the coding of network partitions brought by the infected tree rooted at all the potential sources, thus minimizing the structural deviation between the cascades from the potential sources and the actual infection process included in G N . On polynomially growing geometric trees, with increasing tree heterogeneity, the ITE estimator remarkably yields more reliable detection under only moderate infection sizes, and returns an asymptotically complete detection. In contrast, for regular expanding trees, we still observe guaranteed detection probability of ITE estimator even with an infinite infection size, thanks to the degree regularity property. We also algorithmically realize the ITE based detection that enjoys linear time complexity via a message-passing scheme, and further extend it to general graphs. Extensive experiments on synthetic and real datasets confirm the superiority of ITE to the baselines. For example, ITE returns an accuracy of 85%, ranking the source among the top 10%, far exceeding 55% of the classic algorithm on scale-free networks.

Funder

NSF China

100-Talents Program of Xinhua News Agency, and the Program of Shanghai Academic/Technology Research Leader

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference41 articles.

1. Ameya Agaskar and Yue M. Lu. 2013. A fast Monte Carlo algorithm for source localization on graphs. In Proceeding of the Wavelets and Sparsity XV, Vol. 8858, 429–434.

2. Entropy measures for networks: Toward an information theory of complex topologies;Anand Kartik;Physical Review E,2009

3. Emergence of scaling in random networks;Barabási Albert-László;Science,1999

4. Entropy of network ensembles;Bianconi Ginestra;Physical Review E,2009

5. Information theory, distance matrix, and molecular branching;Bonchev D.;The Journal of Chemical Physics,1977

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Disinformation detection using graph neural networks: a survey;Artificial Intelligence Review;2024-02-14

2. Evidence-Aware Fake News Detection: A Review;2023 International Conference on Advanced Computing & Communication Technologies (ICACCTech);2023-12-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3