Bahadur Efficiency of Rank Tests for the Change-Point Problem
变点问题中秩检验的 Bahadur 效率AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究未知变点下的分布变化检验,对应结构变化方向。
变点问题中秩检验的 Bahadur 效率AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
A sequence of independent random variables $X_1, X_2, \cdots, X_N$ is said to have a change point if $X_1, X_2, \cdots, X_n$ have a common distribution $F$ and $X_{n+1}, \cdots, X_N$ have a common distribution $G, G \neq F$. Consider the problem of testing the null hypothesis of no change against the alternative of a change $G < F$ at an unknown change point $n$. Two classes of statistics based upon two-sample linear rank statistics (max- and sum-type) are compared in terms of their Bahadur efficiency. It is shown that for every sequence of sum-type statistics a sequence of max-type statistics can be constructed with at least the same Bahadur slope at all possible alternatives. Special attention is paid to alternatives close to the null hypothesis.