## Abstract

This paper studies the problem of locating multiple diffusion sources in networks with partial observations. We propose a new source localization algorithm, named Optimal-Jordan-Cover (OJC). The algorithm first extracts a subgraph using a candidate selection algorithm that selects source candidates based on the number of observed infected nodes in their neighborhoods. Then, in the extracted subgraph, OJC finds a set of nodes that "cover" all observed infected nodes with the minimum radius. The set of nodes is called the Jordan cover, and is regarded as the set of diffusion sources. Considering the heterogeneous susceptible-infected-recovered (SIR) diffusion in the Erdos-Rényi (ER) random graph, we prove that OJC can locate all sources with probability one asymptotically with partial observations. OJC is a polynomial-time algorithm in terms of network size. However, the computational complexity increases exponentially in m, the number of sources. We further propose a low-complexity heuristic based on the K-Means for approximating the Jordan cover, named Approximate-Jordan-Cover (AJC). Simulations on random graphs and real networks demonstrate that both AJC and OJC significantly outperform other heuristic algorithms.

Original language | English (US) |
---|---|

Title of host publication | 31st AAAI Conference on Artificial Intelligence, AAAI 2017 |

Publisher | AAAI press |

Pages | 1676-1682 |

Number of pages | 7 |

State | Published - 2017 |

Event | 31st AAAI Conference on Artificial Intelligence, AAAI 2017 - San Francisco, United States Duration: Feb 4 2017 → Feb 10 2017 |

### Other

Other | 31st AAAI Conference on Artificial Intelligence, AAAI 2017 |
---|---|

Country/Territory | United States |

City | San Francisco |

Period | 2/4/17 → 2/10/17 |

## ASJC Scopus subject areas

- Artificial Intelligence