Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Quickest Inference of Network Cascades With Noisy Information
Anirudh Sridhar,
H. Vincent Poor
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Quickest Inference of Network Cascades With Noisy Information'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Optimal Estimator
100%
Noisy Information
100%
Network Cascades
100%
Minimax
66%
Source Estimation
66%
Network Topology
33%
Near-optimal
33%
Estimation Problem
33%
Noisy Measurements
33%
Sequential Probability Ratio Test
33%
Bayes Optimal
33%
Multi-hypothesis
33%
Discrete Time Steps
33%
Regular Tree
33%
Bayesian Setting
33%
Tree Network
33%
K-regular
33%
Cascaded Network
33%
Dynamic Topology
33%
Bayesian Formulation
33%
General Topology
33%
Cascade Dynamics
33%
Mathematics
Optimal Estimator
100%
Time Step
66%
Minimax
66%
Probability Theory
33%
Lattices
33%
Discrete Time
33%
Dimensional Lattice
33%
Bayesian
33%
Regular Tree
33%
Bayesian Setting
33%
Ratio Test
33%
Tree Network
33%
Engineering
Optimal Estimator
100%
Illustrates
33%
Discrete Time
33%
Network Topology
33%
Sequential Probability Ratio Test
33%