Approximation for the distribution of three-dimensional discrete scan statistic
From MaRDI portal
Abstract: We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan statistics. Importance sampling algorithm is used to obtains sharp bounds for the simulation error. Simulation results and comparisons with other approximations are presented for the binomial and Poisson models.
Recommendations
Cites work
- Approximations for a three dimensional scan statistic
- Estimation for the distribution of two-dimensional discrete scan statistics
- Extreme Value Distribution for the Largest Cube in a Random Lattice
- First passage time for some stationary processes
- Reliability approximation for Markov chain imbeddable systems
- Scan statistics
- Scan statistics. Methods and applications. In honor of Joseph Naus's seventieth birthday
Cited in
(5)- Characteristics of 1-D samplings for calculating the 3-D discrete diamond-shaped frequency distributions
- Efficient statistical tolerance analysis for general distributions using three-point information
- Exact asymptotics for the scan statistic and fast alternatives
- Approximations for a three dimensional scan statistic
- Approximations for two-dimensional discrete scan statistics in some block-factor type dependent models
This page was built for publication: Approximation for the distribution of three-dimensional discrete scan statistic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496946)