Asymptotic distribution and detection thresholds for two-sample tests based on geometric graphs

From MaRDI portal



Abstract: In this paper, we consider the problem of testing the equality of two multivariate distributions based on geometric graphs constructed using the interpoint distances between the observations. These include the tests based on the minimum spanning tree and the K-nearest neighbor (NN) graphs, among others. These tests are asymptotically distribution-free, 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 Poissonized setting. Using this, the detection threshold and the limiting local power of the test based on the K-NN graph are obtained, where interesting exponents depending on dimension emerge. This provides a way to compare and justify the performance of these tests in different examples.


This work deals with the problem of testing the equality of two multivariate distributions based on geometric graphs constructed using the interpoint distances between the observations. In addition, the author uses the tests based on minimum spanning tree and \(K\)-nearest neighbor (NN) graphs. However, there is little work on the power properties of these tests. Moreover, the theory of stabilizing geometric graphs was used from which the author derives the asymptotic distribution of these tests under general alternatives, in the Fish-filled frame. Thanks to this, the detection threshold and the local limit power of the test based on the \(K\)-NN graph are obtained, where interesting exponents according to the dimension emerge. This makes it possible to compare and justify the performance of these tests in different examples.



Cites work









This page was built for publication: Asymptotic distribution and detection thresholds for two-sample tests based on geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215763)