A General Asymptotic Framework for Distribution-Free Graph-Based Two-Sample Tests
分布无关的图型两样本检验:统一渐近框架AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:这里的图用于构造多元两样本检验,摘要未研究经济网络或处理干扰。
反馈分类问题分布无关的图型两样本检验:统一渐近框架AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary Testing equality of two multivariate distributions is a classical problem for which many non-parametric tests have been proposed over the years. Most of the popular two-sample tests, which are asymptotically distribution free, are based either on geometric graphs constructed by using interpoint distances between the observations (multivariate generalizations of the Wald–Wolfowitz runs test) or on multivariate data depth (generalizations of the Mann–Whitney rank test). The paper introduces a general notion of distribution-free graph-based two-sample tests and provides a unified framework for analysing and comparing their asymptotic properties. The asymptotic (Pitman) efficiency of a general graph-based test is derived, which includes tests based on geometric graphs, such as the Friedman–Rafsky test, the test based on the K-nearest-neighbour graph, the cross-match test and the generalized edge count test, as well as tests based on multivariate depth functions (the Liu–Singh rank sum statistic). The results show how the combinatorial properties of the underlying graph affect the performance of the associated two-sample test and can be used to validate and decide which tests to use in practice. Applications of the results are illustrated both on synthetic and on real data sets.