Share Email Print

Proceedings Paper

A fast Monte Carlo algorithm for source localization on graphs
Author(s): Ameya Agaskar; Yue M. Lu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Epidemic models on networks have long been studied by biologists and social sciences to determine the steady state levels of an infection on a network. Recently, however, several authors have begun considering the more difficult problem of estimating the source of an infection given information about its behavior some time after the initial infection. In this paper, we describe a technique to estimate the source of an infection on a general graph based on observations from a small set of observers during a fixed time window at some unknown time after the initial infection. We describe an alternate representation for the susceptible-infected (SI) infection model based on geodesic distances on a randomly-weighted version of the graph; this representation allows us to exploit fast algorithms to compute geodesic distances to estimate the marginal distributions for each observer and compute a pseudo-likelihood function that is maximized to find the source.

Paper Details

Date Published: 26 September 2013
PDF: 6 pages
Proc. SPIE 8858, Wavelets and Sparsity XV, 88581N (26 September 2013); doi: 10.1117/12.2023039
Show Author Affiliations
Ameya Agaskar, Harvard School of Engineering and Applied Sciences (United States)
MIT Lincoln Lab. (United States)
Yue M. Lu, Harvard School of Engineering and Applied Sciences (United States)

Published in SPIE Proceedings Vol. 8858:
Wavelets and Sparsity XV
Dimitri Van De Ville; Vivek K. Goyal; Manos Papadakis, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?