mlsanityData to 14 Oct 2026

A Robust Information Source Estimator with Sparse Observations

arXiv 1309.4846 ↗First posted 19 Sep 2013cs.SIcited by 3

Not on the map. Why?

Abstract (arXiv)

In this paper, we consider the problem of locating the information source with sparse observations. We assume that a piece of information spreads in a network following a heterogeneous susceptible-infected-recovered (SIR) model and that a small subset of infected nodes are reported, from which we need to find the source of the information. We adopt the sample path based estimator developed in [1], and prove that on infinite trees, the sample path based estimator is a Jordan infection center with respect to the set of observed infected nodes. In other words, the sample path based estimator minimizes the maximum distance to observed infected nodes. We further prove that the distance between the estimator and the actual source is upper bounded by a constant independent of the number of infected nodes with a high probability on infinite trees. Our simulations on tree networks and real world networks show that the sample path based estimator is closer to the actual source than several other algorithms.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Sep 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 2.

3 papers.