Power of discrete scan statistics: a finite Markov chain imbedding approach

DOI10.1007/S11009-014-9434-3MaRDI QIDQ496978zbMATH OpenOpenAlexFDO

Authors Wan-Chen Lee

Publication date 23 September 2015

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11009-014-9434-3

zbMATH Keywords

hypothesis testpowerscan statisticsFMCI

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Nonparametric hypothesis testing (62G10)

Recommendations

• Publication:4938913
• Tight bounds and approximations for scan statistic probabilities for discrete data
• An efficient algorithm for exact distribution of discrete scan statistics
• Distributions of scan statistics in a sequence of Markov Bernoulli trials
• On the asymptotic distribution of the discrete scan statistic
• Statistical complexity of the power method for Markov chains
• Multiple window discrete scan statistic for higher-order Markovian sequences
• scientific article; zbMATH DE number 1190392

Cites work

• Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials
• Continuous, discrete, and conditional scan statistics
• Distribution of the scan statistic for a sequence of bistate trials
• Power of the scan statistic in detecting a changed segment in a Bernoulli sequence
• Probabilities for a Generalized Birthday Problem

Cited in

(3)

• Discrete, continuous and conditional multiple window scan statistics
• Joint reliability of two consecutive-\((1, l)\) or \((2, k)\)-out-of-\((2, n)\): \(F\) type systems and its application in smart street light deployment
• Power of the scan statistic in detecting a changed segment in a Bernoulli sequence

This page was built for publication: Power of discrete scan statistics: a finite Markov chain imbedding approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496978)