# Quickest Inference of Network Cascades with Noisy Information

@article{Sridhar2021QuickestIO, title={Quickest Inference of Network Cascades with Noisy Information}, author={Anirudh Sridhar and H. Vincent Poor}, journal={ArXiv}, year={2021}, volume={abs/2110.08115} }

We study the problem of estimating the source of a network cascade given a time series of noisy information about the spread. Initially, there is a single vertex affected by the cascade (the source) and the cascade spreads in discrete time steps across the network. The cascade evolution is hidden, but one can observe a time series of noisy signals from each vertex. The time series of a vertex is assumed to be a sequence of i.i.d. samples from a pre-change distribution Q0 before the cascade…

## References

SHOWING 1-10 OF 53 REFERENCES

Quickest Detection of Significant Events in Structured Networks

- Computer Science2018 52nd Asilomar Conference on Signals, Systems, and Computers
- 2018

A sequential algorithm that can detect a “significant” event, i.e., when the event has affected no fewer than $\eta$ nodes, as quickly as possible, while controlling the false alarm rate is constructed.

Quickest Detection of Dynamic Events in Networks

- Engineering, Computer ScienceIEEE Transactions on Information Theory
- 2020

The goal is to design a sequential algorithm that can detect a “significant” event, i.e., when the event has affected no fewer than $\eta $ nodes, as quickly as possible, while controlling the false alarm rate.

Information cascades in complex networks

- Computer ScienceJ. Complex Networks
- 2017

Simulation results on sample networks reveal just how relevant the centrality of initiator nodes is on the latter development of an information cascade, and the spreading influence of a node is defined as the fraction of nodes that is activated as a result of the initial activation of that node.

Rumors in a Network: Who's the Culprit?

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2011

Simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.

Finding Rumor Sources on Random Trees

- Computer Science, MathematicsOper. Res.
- 2016

The authors proposed the graph score function rumor centrality as an estimator for detecting the source of a rumor and establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected model with exponential spreading times for regular trees.

Detecting sources of computer viruses in networks: theory and experiment

- Computer ScienceSIGMETRICS '10
- 2010

Simulations show that rumor centrality outperforms distance centrality in finding virus sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.

Rumor source detection with multiple observations: fundamental limits and algorithms

- Computer ScienceSIGMETRICS '14
- 2014

Surprisingly, even with merely two observations, the detection probability at least doubles that of a single observation, and further approaches one, i.e., reliable detection, with increasing degree, indicates that a richer diversity enhances detectability.

Confidence Sets for the Source of a Diffusion in Regular Trees

- Mathematics, Computer ScienceIEEE Transactions on Network Science and Engineering
- 2017

A probabilistic analysis of Pólya urns corresponding to the number of uninfected neighbors in specific subtrees of the infection tree is provided to provide an example illustrating the shortcomings of source estimation techniques in settings where the underlying graph is asymmetric.

Rumor Source Detection With Multiple Observations Under Adaptive Diffusions

- Computer Science, MathematicsIEEE Transactions on Network Science and Engineering
- 2021

It is shown that a weak form of source obfuscation is still possible in the case of two independent snapshots, but already with three observations there is a simple algorithm that finds the rumor source with constant probability, regardless of the adaptive diffusion protocol.

Quickest Detection of Growing Dynamic Anomalies in Networks

- Computer Science, MathematicsICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
- 2020

This detection problem is posed as a stochastic optimization problem by using a delay metric that is based on the worst possible path of the anomaly that is proposed that is asymptotically optimal as the mean time to false alarm goes to infinity.