Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2504.10719

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2504.10719 (math)
[Submitted on 14 Apr 2025 (v1) , last revised 18 Apr 2025 (this version, v2)]

Title: Power properties of the two-sample test based on the nearest neighbors graph

Title: 基于最近邻图的两样本检验的功率特性

Authors:Rahul Raphael Kanekar
Abstract: In this paper, we study the problem of testing the equality of two multivariate distributions. One class of tests used for this purpose utilizes geometric graphs constructed using inter-point distances. So far, the asymptotic theory of these tests applies only to graphs which fall under the stabilizing graphs framework of \citet{penroseyukich2003weaklaws}. We study the case of the $K$-nearest neighbors graph where $K=k_N$ increases with the sample size, which does not fall under the stabilizing graphs framework. Our main result gives detection thresholds for this test in parametrized families when $k_N = o(N^{1/4})$, thus extending the family of graphs where the theoretical behavior is known. We propose a 2-sided version of the test which removes an exponent gap that plagues the 1-sided test. Our result also shows that increasing the number of nearest neighbors boosts the power of the test. This provides theoretical justification for using denser graphs in testing equality of two distributions.
Abstract: 本文研究了检验两个多元分布是否相等的问题。一类用于此目的的检验方法利用了基于点间距离构造的几何图。到目前为止,这些检验的渐近理论仅适用于属于\citet{penroseyukich2003weaklaws}的稳定图框架的图。我们研究了当$K=k_N$随样本量增加时的$K$-最近邻图的情况,这并不属于稳定图框架。我们的主要结果给出了当$k_N = o(N^{1/4})$时,该检验在参数化族中的检测阈值,从而扩展了已知理论行为的图类。我们提出了一个两面版本的检验,消除了困扰单面检验的指数差距。我们的结果还表明,增加最近邻的数量可以提高检验的功效。这为在检验两个分布相等时使用更密集的图提供了理论依据。
Comments: 62 pages, 12 figures. Author's contact information added, minor changes done to make results easier to understand
Subjects: Statistics Theory (math.ST)
Cite as: arXiv:2504.10719 [math.ST]
  (or arXiv:2504.10719v2 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2504.10719
arXiv-issued DOI via DataCite

Submission history

From: Rahul Raphael Kanekar [view email]
[v1] Mon, 14 Apr 2025 21:24:22 UTC (1,905 KB)
[v2] Fri, 18 Apr 2025 23:58:41 UTC (1,823 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.ST
< prev   |   next >
new | recent | 2025-04
Change to browse by:
math
stat
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号