Noisy source location on a line

02/18/2020
by   Victor Lecomte, et al.
0

We study the problem of locating the source of an epidemic diffusion process from a sparse set of sensors, under noise. In a graph G=(V,E), an unknown source node v^* ∈ V is drawn uniformly at random, and unknown edge weights w(e) for e∈ E, representing the propagation delays along the edges, are drawn independently from a Gaussian distribution of mean 1 and variance σ^2. An algorithm then attempts to locate v^* by picking sensor (also called query) nodes s ∈ V and being told the length of the shortest path between s and v^* in graph G weighted by w. We consider two settings: static, in which all query nodes must be decided in advance, and sequential, in which each query can depend on the results of the previous ones. We characterize the query complexity when G is an n-node path. In the static setting, Θ(nσ^2) queries are needed for σ^2 ≤ 1, and Θ(n) for σ^2 ≥ 1. In the sequential setting, somewhat surprisingly, only Θ(loglog_1/σn) are needed when σ^2 ≤ 1/2, and Θ(loglog n)+O_σ(1) when σ^2 ≥ 1/2. This is the first mathematical study of source location under non-trivial amounts of noise.

READ FULL TEXT

page 3

page 11

page 15

research
11/04/2019

Successive shortest paths in complete graphs with random edge weights

Consider a complete graph K_n with edge weights drawn independently from...
research
05/24/2013

Flooding edge or node weighted graphs

Reconstruction closings have all properties of a physical flooding of a ...
research
02/26/2020

On Learning a Hidden Directed Graph with Path Queries

In this paper, we consider the problem of reconstructing a directed grap...
research
04/06/2020

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

The problem of identifying the k-shortest paths (KSPs for short) in a dy...
research
11/10/2020

Adaptive Community Search in Dynamic Networks

Community search is a well-studied problem which, given a static graph a...
research
04/30/2020

An Efficient Noisy Binary Search in Graphs via Median Approximation

Consider a generalization of the classical binary search problem in line...
research
10/03/2022

Online Pen Testing

We study a "pen testing" problem, in which we are given n pens with unkn...

Please sign up or login with your details

Forgot password? Click here to reset