GraphRankTest
Rank in Similarity Graph Edge-Count Two-Sample Test (RISE)
Implements the Rank In Similarity Graph Edge-count two-sample test (RISE) for high-dimensional and non-Euclidean data. The method constructs similarity-based graphs, such as k-nearest neighbor graph (k-NNG), k-minimum spanning tree (k-MST), and k-minimum distance non-bipartite pairing (k-MDP), and evaluates rank-based within-sample edge counts with asymptotic and permutation p-values. For methodological details, see Zhou and Chen (2023) <https://proceedings.mlr.press/v195/zhou23a.html>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1 |
rolling source/ R- | GraphRankTest_0.1.tar.gz |
6.0 KiB |
0.1 |
rolling linux/jammy R-4.5 | GraphRankTest_0.1.tar.gz |
30.7 KiB |
0.1 |
rolling linux/noble R-4.5 | GraphRankTest_0.1.tar.gz |
30.6 KiB |
0.1 |
latest source/ R- | GraphRankTest_0.1.tar.gz |
6.0 KiB |
0.1 |
latest linux/jammy R-4.5 | GraphRankTest_0.1.tar.gz |
30.7 KiB |
0.1 |
latest linux/noble R-4.5 | GraphRankTest_0.1.tar.gz |
30.6 KiB |
0.1 |
2026-04-23 source/ R- | GraphRankTest_0.1.tar.gz |
6.0 KiB |
0.1 |
2026-04-09 windows/windows R-4.5 | GraphRankTest_0.1.zip |
33.6 KiB |