Skip to content

Quickest Detection

Spend $50 to get a free movie!

ISBN-10: 0521621046

ISBN-13: 9780521621045

Edition: 2008

Authors: Vincent Poor, H. Vincent Poor, Olympia Hadjiliadis

List price: $105.99
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

This unified treatment of the quickest detection problem provides the background necessary to design, analyse, and understand quickest detection algorithms.
Customers also bought

Book details

List price: $105.99
Copyright year: 2008
Publisher: Cambridge University Press
Publication date: 11/20/2008
Binding: Hardcover
Pages: 244
Size: 7.00" wide x 9.75" long x 0.50" tall
Weight: 1.386
Language: English

Olympia Hadjiliadis is an Assistant Professor in the Department of Mathematics at Brooklyn College, City University of New York. She was awarded her M.Math in Statistics and Finance in 1999 from the University of Waterloo, Canada. After receiving her Ph.D. in Statistics with distinction from Columbia University in 2005, Dr. Hadjiladis joined the Electrical Engineering Department at Princeton as a Postdoctoral Fellow, where she is also currently appointed as a Research Collaborator.

List of figures
Frequently used notation
Probabilistic framework
Basic setting
Probability spaces
Random variables
Radon-Nikodym derivatives
Conditional expectation and independence
Random sequences
Martingales and stopping times
Stopping times
Continuous-time analogs
Brownian motion and Poisson processes
Brownian motion
Poisson processes
Continuous-time semimartingales
Stochastic integration
Markov optimal stopping theory
Markov optimal stopping problems
The finite-horizon case: dynamic programming
The general case
The Markov case
The infinite-horizon case
A martingale interpretation of the finite-horizon results
The infinite-horizon case for bounded reward
The general infinite-horizon case
The infinite-horizon case with Markov rewards
Markov optimal stopping in continuous time
Appendix: a proof of Lemma 3.8
Sequential detection
Optimal detection
Performance analysis
The continuous-time case
The Brownian case
The Brownian case - an alternative proof
An interesting extension of Wald-Wolfowitz
The case of It� processes
The Poisson case
The compound Poisson case
Bayesian quickest detection
Shiryaev's problem
The continuous-time case
Brownian observations
Poisson observations
A probability maximizing approach
Other penalty functions
A game theoretic formulation
Non-Bayesian quickest detection
Lorden's problem
Performance of Page's test
The continuous-time case
Brownian observations
It&ocaron; processes
Brownian motion with an unknown drift parameter
Poisson observations
Asymptotic results
Lorden's approach
Brownian motion with two-sided alternatives
Comments on the false-alarm constraint
Additional topics
Decentralized sequential and quickest detection
Decentralized sequential detection with a fusion center
Decentralized quickest detection with a fusion center
Decentralized sequential detection without fusion
Quickest detection with modeling uncertainty
Robust quickest detection
Adaptive quickest detection
Quickest detection with dependent observations
Quickest detection with independent likelihood ratio sequences
Locally asymptotically normal distributions
Sequential detection (local hypothesis approach)
Quickest detection (local hypothesis approach)