Approximations for Distributions of Scan Statistics
研究了固定长度移动区间内点数的极值分布，给出了高精度近似方法，适用于点簇、最长成功游程和广义生日问题等场景。
Abstract Certain statistical applications deal with the extremal distributions of the number of points in a moving interval or window of fixed length. This article gives an approximation that is highly accurate for several of these distributions. Applications include the maximum cluster of points on a line or circle, multiple coverage by subintervals or subarcs of fixed size, the length of the longest success run in Bernoulli trials, and the generalized birthday problem.