arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.05741math.STmath.NTstat.TH
收藏

关于整数分拆与Wilcoxon秩和统计量

On integer partitions and the Wilcoxon rank-sum statistic

Andrew V. Sills

AI总结:

本文利用Euler和Rothe的经典$q$-级数结果,提出一种通过多项式展开、提取系数并除以二项式系数来推导Wilcoxon秩和统计量精确零分布的简单方法,可处理含结数据,适用于小样本情形。

摘要:

在文献中,当数据中存在一个或多个结(ties)时,秩和统计量的精确零分布推导常常被回避。通过借助Euler和Rothe的经典$q$-级数结果推导无结情形下的零分布,我们展示了如何对该方法进行自然推广,从而即使在数据中存在一个或多个结的情况下也能推导出精确零分布。本文建议该方法可以在计算机代数系统中实现,甚至在更初级的计算机语言中实现,这样在小样本情形下就不必采用正态近似,因为此时正态近似不太可能非常准确。文献中已经给出了若干确定秩和统计量(可能含结)精确分布的算法(参见Streitberg和Röhmel(1986)以及Marx等人(2016)),但似乎没有一个像本文讨论的程序那样简单,该程序相当于将某个多项式展开相乘、提取系数,最后除以一个二项式系数。

英文摘要:

In the literature, derivations of exact null distributions of rank-sum statistics is often avoided in cases where one or more ties exist in the data. By deriving the null distribution in the no-ties case with the aid of classical $q$-series results of Euler and Rothe, we demonstrate how a natural generalization of the method may be employed to derive exact null distributions even when one or more ties are present in the data. It is suggested that this method could be implemented in a computer algebra system, or even a more primitive computer language, so that the normal approximation need not be employed in the case of small sample sizes, when it is less likely to be very accurate. Several algorithms for determining exact distributions of the rank-sum statistic (possibly with ties) have been given in the literature (see Streitberg and Röhmel (1986) and Marx et al. (2016)), but none seem as simple as the procedure discussed here which amounts to multiplying out a certain polynomial, extracting coefficients, and finally dividing by a binomal coefficient.

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

↑