Approximations and inequalities for moving sums
DOI10.1007/s11009-011-9251-xzbMath1277.60039OpenAlexW2070781245MaRDI QIDQ1930619
Xiao Wang, Joseph Glaz, Joseph I. Naus
Publication date: 11 January 2013
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-011-9251-x
approximationstopping timescan statisticsmultivariate normalprobability inequalitymoving sum\(R\) algorithmsmultivariate \(T\)
Inequalities; stochastic orderings (60E15) Stationary stochastic processes (60G10) Approximations to statistical distributions (nonasymptotic) (62E17) Non-Markovian processes: hypothesis testing (62M07)
Related Items (10)
Cites Work
- Unnamed Item
- Poisson approximation using the Stein-Chen method and coupling: Number of exceedances of Gaussian random variables
- Estimating the distribution of one-dimensional discrete scan statistics viewed as extremes of 1-dependent stationary sequences
- Computation of multivariate normal and \(t\) probabilities
- Tight bounds and approximations for scan statistic probabilities for discrete data
- First passage time for some stationary processes
- Control charts based on weighted sums
- Monitoring Structural Changes in Generalized Linear Models
- Maxima of moving sums in a Poisson random field
- Boundary crossing for moving sums
- An Extension of the MOSUM Technique for Quality Control
- The Use of MOSUMS for Quality Control
- Approximations for Distributions of Scan Statistics
- MOSUM tests for parameter constancy
- Association of Random Variables, with Applications
- Scan statistics
This page was built for publication: Approximations and inequalities for moving sums