High precision numerical computation of principal points for univariate distributions (Q2061781)

From MaRDI portal
scientific article
Language Label Description Also known as
English
High precision numerical computation of principal points for univariate distributions
scientific article

    Statements

    High precision numerical computation of principal points for univariate distributions (English)
    0 references
    0 references
    0 references
    21 December 2021
    0 references
    This paper considers the problem of testing the equality of two multivariate distributions based on geometric graphs constructed using the point distances between observations. These include tests based on the minimum spanning tree and K-nearest neighbor (NN) graphs. These tests are asymptotically distribution less, universally consistent, and computationally efficient, making them particularly useful in modern applications. However, very little is known about the power properties of these tests. In this paper, using the theory of stabilizing geometric graphs, we derive the asymptotic distribution of these tests under general alternatives, in the Poisson framework which, the detection threshold and the limiting local power of the test based on the K-NN graph are obtained. Different examples are given to compare and justify the performance of these tests.
    0 references
    geometric graphs
    0 references
    geometric probability
    0 references
    nearest-neighbor graphs
    0 references
    nonparametric hypothesis testing
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references