HMSL: Source localization based on higher-order Markov propagation

被引:3
|
作者
Gong, Chang [1 ]
Li, Jichao [1 ]
Qian, Liwei [1 ]
Li, Siwei [1 ]
Yang, Zhiwei [1 ]
Yang, Kewei [1 ]
机构
[1] Natl Univ Def Technol, Coll Syst Engn, Changsha 410073, Peoples R China
基金
中国国家自然科学基金;
关键词
Source localization; Higher-order Markov propagation; Higher-order network; Sensitivity analysis; NETWORKS;
D O I
10.1016/j.chaos.2024.114765
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The widespread use of the Internet and social media has brought us great convenience, but it has also exposed us to a lot of false information and malicious attacks. It is vital to accurately locate the source of the harmful spread to prevent it from spreading further. Most previous studies have assumed that the propagation path is memoryless and always the shortest path. This assumption implies the first-order Markov property of propagation paths. This paper takes into account the higher-order Markov property of propagation paths in the source localization problem. Firstly, the problem of source localization based on observers is formulated. Then, we introduce the higher-order Markov property of propagation paths into the problem and propose a reaction- synchronization-diffusion model to model the propagation process on the higher-order network. On this basis, we build a framework named source localization based on higher-order Markov propagation (HMSL), which is compatible with traditional algorithms for source localization. After that, we conducted experiments on a real dataset and found that the HMSL has significant improvement in the source localization compared to the first-order network. Sensitivity analysis indicates that the degree of improvement is significantly influenced by the probability of infection and the proportion of higher-order nodes. Furthermore, we investigated the reason behind the improvement and found that the first-order network creates paths that do not exist within the raw data. When these fake paths are shorter than actual propagation paths, the length of propagation paths and estimated activation time of observers will be underestimated, thus decreasing the accuracy of source localization. The HMSL framework can solve this problem effectively.
引用
收藏
页数:12
相关论文
共 50 条
  • [11] Fast wideband source separation based on higher-order statistics
    Bourennane, S
    Frikel, M
    Bendjama, A
    PROCEEDINGS OF THE IEEE SIGNAL PROCESSING WORKSHOP ON HIGHER-ORDER STATISTICS, 1997, : 354 - 358
  • [12] HIGHER-ORDER APPROXIMATIONS IN IONOSPHERIC WAVE PROPAGATION
    HINES, CO
    JOURNAL OF GEOPHYSICAL RESEARCH, 1953, 58 (01): : 95 - 98
  • [13] Higher-order Markov Graph based Bug Detection in Cloud-based Deployments
    Cao, Qing
    Niu, Haoran
    2022 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE, IPCCC, 2022,
  • [14] Uniqueness of Markov random fields with higher-order dependencies
    Kepa-Maksymowicz, Dorota
    Kozitsky, Yuri
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2025, 61 (01): : 313 - 328
  • [15] Fading Channel Prediction by Higher-Order Markov Model
    Jarinova, Darina
    PROCEEDINGS OF THE 2020 CONFERENCE ON NEW TRENDS IN SIGNAL PROCESSING (NTSP), 2020, : 39 - 42
  • [16] Higher-order Markov models for metagenomic sequence classification
    Burks, David J.
    Azad, Rajeev K.
    BIOINFORMATICS, 2020, 36 (14) : 4130 - 4136
  • [17] A Higher-Order Language for Markov Kernels and Linear Operators
    de Amorim, Pedro H. Azevedo
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2023, 2023, 13992 : 89 - 112
  • [18] Distributions of Runs and Scans on Higher-Order Markov Trees
    Inoue, Kiyoshi
    Aki, Sigeo
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2009, 38 (05) : 621 - 641
  • [19] A higher-order Markov model for the Newsboy's problem
    Ching, WK
    Fung, ES
    Ng, MK
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (03) : 291 - 298
  • [20] Retrospective Higher-Order Markov Processes for User Trails
    Wu, Tao
    Gleich, David F.
    KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, : 1185 - 1194