Multiple window discrete scan statistic for higher-order Markovian sequences
From MaRDI portal
Publication:5130284
DOI10.1080/02664763.2015.1005061OpenAlexW2090606132WikidataQ57436551 ScholiaQ57436551MaRDI QIDQ5130284
Brian J. Reich, Deidra A. Coleman, Donald E. K. Martin
Publication date: 4 November 2020
Published in: Journal of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02664763.2015.1005061
Cites Work
- Scan statistics. Methods and applications. In honor of Joseph Naus's seventieth birthday
- A simpler expression for Kth nearest neighbor coincidence probabilities
- Scan statistics and applications
- Multiple window and cluster size scan procedures
- An efficient algorithm for exact distribution of discrete scan statistics
- Multiple Window Discrete Scan Statistics
- Approximations for Distributions of Scan Statistics
- Probabilities for the Size of Largest Clusters and Smallest Intervals
- Probabilities for a Generalized Birthday Problem
- Determination of the order of a Markov chain by Akaike's information criterion
- An upper bound for the probability of a union
- A spatial scan statistic
- Distribution of the scan statistic for a sequence of bistate trials
- Discrete, Continuous and Conditional Multiple Window Scan Statistics
- Some Probabilities, Expectations and Variances for the Size of Largest Clusters and Smallest Intervals
- The Generalized Birthday Problem
- p-values for the Discrete Scan Statistic through Slack Variables
- Scan statistics
This page was built for publication: Multiple window discrete scan statistic for higher-order Markovian sequences