Initially, the cascade starts with one unknown, affected vertex and spreads deterministically at each time step. The goal is to find an adaptive procedure that outputs an estimate for the source as fast as possible, subject to a bound on the estimation error.
We begin by reviewing a model for network cascades with real-time noisy observations. We then study the problem of minimizing the expected run time of a ...
For a general class of graphs, a family of matrix sequential probability ratio tests (MSPRTs) are described that are first-order asymptotically optimal up ...
We assume that at time zero, the cascade starts with one unknown vertex and spreads deterministically at each time step. The goal is to find a sequential ...
Initially, the cascade starts with one unknown, affected vertex and spreads deterministically at each time step. The goal is to find an adaptive procedure that ...
Moreover, the infinite graph setting allows us to capture scenarios where the size of the cascade is small compared to the total population without ...
We assume that at time zero, the cascade starts with one unknown vertex and spreads deterministically at each time step. The goal is to find a sequential ...
Abstract: We consider the problem of locating the source of a network cascade, given a noisy time-series of network data. Initially, the cascade starts with ...
Initially, the cascade starts with one unknown, affected vertex and spreads deterministically at each time step. The goal is to find an adaptive procedure that ...
The degree sequence product of a particular path multiplies the degree every node in the path except the first one. The degree sequence product of the path in ...