A robust framework for graph-based two-sample tests using weights
From MaRDI portal
Cites work
- A distribution-free two-sample run test applicable to high-dimensional data
- A kernel two-sample test
- A multivariate two-sample test based on the number of nearest neighbor type coincidences
- A nearest-neighbor based nonparametric test for viral remodeling in heterogeneous single-cell proteomic data
- A nonparametric two-sample test applicable to high dimensional data
- A Quality Index Based on Data Depth and Multivariate Rank Tests
- A weighted edge-count two-sample test for multivariate and object data
- An Exact Distribution-Free Test Comparing Two Multivariate Distributions based on Adjacency
- Asymptotic distribution-free change-point detection for multivariate and non-Euclidean data
- Asymptotic normality of interpoint distances for high-dimensional data with applications to the two-sample problem
- Bootstrapped Edge Count Tests for Nonparametric Two-Sample Inference Under Heterogeneity
- Generalized kernel two-sample tests
- Hubs in space: popular nearest neighbors in high-dimensional data
- Interpoint distance based two sample tests in high dimension
- Limiting distributions of graph-based test statistics on sparse and dense graphs
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- Multivariate Two-Sample Tests Based on Nearest Neighbors
- On a new multivariate two-sample test.
- Permutation tests for equality of distributions in high-dimensional settings
This page was built for publication: A robust framework for graph-based two-sample tests using weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396712)
