Author
Listed:
- Gong, Chang
- Li, Jichao
- Qian, Liwei
- Li, Siwei
- Yang, Zhiwei
- Yang, Kewei
Abstract
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.
Suggested Citation
Gong, Chang & Li, Jichao & Qian, Liwei & Li, Siwei & Yang, Zhiwei & Yang, Kewei, 2024.
"HMSL: Source localization based on higher-order Markov propagation,"
Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
Handle:
RePEc:eee:chsofr:v:182:y:2024:i:c:s0960077924003175
DOI: 10.1016/j.chaos.2024.114765
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:182:y:2024:i:c:s0960077924003175. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.