Estimating infection sources in networks using partial timestamps
We study the problem of identifying infection sources in a network based on the network topology, and a subset of infection timestamps. In the case of a single infection source in a tree network, we derive the maximum likelihood estimator of the source and the unknown diffusion parameters. We then i...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/102679 http://hdl.handle.net/10220/47788 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-102679 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1026792020-03-07T14:00:34Z Estimating infection sources in networks using partial timestamps Tang, Wenchang Ji, Feng Tay, Wee Peng School of Electrical and Electronic Engineering Infection Source Rumor Source DRNTU::Engineering::Electrical and electronic engineering We study the problem of identifying infection sources in a network based on the network topology, and a subset of infection timestamps. In the case of a single infection source in a tree network, we derive the maximum likelihood estimator of the source and the unknown diffusion parameters. We then introduce a new heuristic involving an optimization over a parametrized family of Gromov matrices to develop a single source estimation algorithm for general graphs. Compared with the breadth-first search tree heuristic commonly adopted in the literature, simulations demonstrate that our approach achieves better estimation accuracy than several other benchmark algorithms, even though these require more information like the diffusion parameters. We next develop a multiple sources estimation algorithm for general graphs, which first partitions the graph into source candidate clusters, and then applies our single source estimation algorithm to each cluster. We show that if the graph is a tree, then each source candidate cluster contains at least one source. Simulations using synthetic and real networks, and experiments using real-world data suggest that our proposed algorithms are able to estimate the true infection source(s) to within a small number of hops with a small portion of the infection timestamps being observed. MOE (Min. of Education, S’pore) Accepted version 2019-03-07T05:43:22Z 2019-12-06T20:58:57Z 2019-03-07T05:43:22Z 2019-12-06T20:58:57Z 2018 Journal Article Tang, W., Ji, F., & Tay, W. P. (2018). Estimating infection sources in networks using partial timestamps. IEEE Transactions on Information Forensics and Security, 13(12), 3035-3049. doi:10.1109/TIFS.2018.2837655 1556-6013 https://hdl.handle.net/10356/102679 http://hdl.handle.net/10220/47788 10.1109/TIFS.2018.2837655 en IEEE Transactions on Information Forensics and Security © 2018 Institute of Electrical and Electronics Engineers (IEEE). All rights reserved. This paper was published in IEEE Transactions on Information Forensics and Security and is made available with permission of Institute of Electrical and Electronics Engineers (IEEE). 15 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Infection Source Rumor Source DRNTU::Engineering::Electrical and electronic engineering |
spellingShingle |
Infection Source Rumor Source DRNTU::Engineering::Electrical and electronic engineering Tang, Wenchang Ji, Feng Tay, Wee Peng Estimating infection sources in networks using partial timestamps |
description |
We study the problem of identifying infection sources in a network based on the network topology, and a subset of infection timestamps. In the case of a single infection source in a tree network, we derive the maximum likelihood estimator of the source and the unknown diffusion parameters. We then introduce a new heuristic involving an optimization over a parametrized family of Gromov matrices to develop a single source estimation algorithm for general graphs. Compared with the breadth-first search tree heuristic commonly adopted in the literature, simulations demonstrate that our approach achieves better estimation accuracy than several other benchmark algorithms, even though these require more information like the diffusion parameters. We next develop a multiple sources estimation algorithm for general graphs, which first partitions the graph into source candidate clusters, and then applies our single source estimation algorithm to each cluster. We show that if the graph is a tree, then each source candidate cluster contains at least one source. Simulations using synthetic and real networks, and experiments using real-world data suggest that our proposed algorithms are able to estimate the true infection source(s) to within a small number of hops with a small portion of the infection timestamps being observed. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Tang, Wenchang Ji, Feng Tay, Wee Peng |
format |
Article |
author |
Tang, Wenchang Ji, Feng Tay, Wee Peng |
author_sort |
Tang, Wenchang |
title |
Estimating infection sources in networks using partial timestamps |
title_short |
Estimating infection sources in networks using partial timestamps |
title_full |
Estimating infection sources in networks using partial timestamps |
title_fullStr |
Estimating infection sources in networks using partial timestamps |
title_full_unstemmed |
Estimating infection sources in networks using partial timestamps |
title_sort |
estimating infection sources in networks using partial timestamps |
publishDate |
2019 |
url |
https://hdl.handle.net/10356/102679 http://hdl.handle.net/10220/47788 |
_version_ |
1681034575363440640 |