Pith. sign in

REVIEW

Quickest Inference of Susceptible-Infected Cascades in Sparse Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.05418 v1 pith:CCDIYDSB submitted 2023-02-10 math.ST cs.ITcs.SImath.ITmath.PRstat.TH

Quickest Inference of Susceptible-Infected Cascades in Sparse Networks

classification math.ST cs.ITcs.SImath.ITmath.PRstat.TH
keywords cascadenetworkspreadestimatefullproceduresourcesusceptible-infected
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the task of estimating a network cascade as fast as possible. The cascade is assumed to spread according to a general Susceptible-Infected process with heterogeneous transmission rates from an unknown source in the network. While the propagation is not directly observable, noisy information about its spread can be gathered through multiple rounds of error-prone diagnostic testing. We propose a novel adaptive procedure which quickly outputs an estimate for the cascade source and the full spread under this observation model. Remarkably, under mild conditions on the network topology, our procedure is able to estimate the full spread of the cascade in an $n$-vertex network, before $\mathrm{poly log}(n)$ vertices are affected by the cascade. We complement our theoretical analysis with simulation results illustrating the effectiveness of our methods.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.