arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.6950stat.ME
收藏

由秩集样本推断一个分布函数

Inference on a Distribution Function from Ranked Set Samples

Lutz Duembgen, Ehsan Zamanzade

摘要:

考虑独立观测值$(X_1,R_1)$、$(X_2,R_2)$、\ldots、$(X_n,R_n)$和随机秩或固定秩$R_i \in \{1,2,\ldots,k\}$,当以$R_i = r$为条件时,随机变量$X_i$具有与来自未知连续分布函数$F$的大小为$k$的随机样本内的$r$阶统计量相同的分布。这样的观测方案被用于对观测值进行排序比获得其精确值容易得多的情况。两个著名的特例是排序集抽样(McIntyre 1952)和判断后分层(MacEachern et al. 2004)。在包括不平衡秩集抽样的一般设置中,我们推导并比较了分布函数$F$为$n \to \infty$和固定$k$的三种不同估计量的渐近分布:Stokes和Sager(1988)的分层估计量,Kvam和Samaniego(1994)的非参数最大似然估计量和Chen(2001)的基于矩的估计量。我们的功能中心极限定理推广和完善以前的渐近分析。此外,我们简要地讨论了逐点和同时的分布函数$F$的置信区间,保证覆盖概率有限的样本量。一个真实的数据的例子说明了该方法,并在一个小型的模拟实验的潜在影响的不完美的排名进行了研究。总而言之,除了计算效率之外,基于矩的估计器似乎在效率和鲁棒性与不完美的排名之间提供了一个很好的折衷。

英文摘要:

Consider independent observations $(X_1,R_1)$, $(X_2,R_2)$, \ldots, $(X_n,R_n)$ with random or fixed ranks $R_i \in \{1,2,\ldots,k\}$, while conditional on $R_i = r$, the random variable $X_i$ has the same distribution as the $r$-th order statistic within a random sample of size $k$ from an unknown continuous distribution function $F$. Such observation schemes are utilized in situations in which ranking observations is much easier than obtaining their precise values. Two well-known special cases are ranked set sampling (McIntyre 1952) and judgement post-stratification (MacEachern et al. 2004). Within a general setting including unbalanced ranked set sampling we derive and compare the asymptotic distributions of three different estimators of the distribution function $F$ as $n \to \infty$ with fixed $k$: The stratified estimator of Stokes and Sager (1988), the nonparametric maximum-likelihood estimator of Kvam and Samaniego (1994) and a moment-based estimator of Chen (2001). Our functional central limit theorems generalize and refine previous asymptotic analyses. In addition we discuss briefly pointwise and simultaneous confidence intervals for the distribution function $F$ with guaranteed coverage probability for finite sample sizes. The methods are illustrated with a real data example, and the potential impact of imperfect rankings is investigated in a small simulation experiment. All in all, the moment-based estimator seems to offer a good compromise between efficiency and robustness versus imperfect ranking, in addition to computational efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑