Rank in Similarity Graph Edge-Count Two-Sample Test (RISE)
Overview
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.
Install
Health
- OK13 OK2026-08-05
- NOTE12 OK, 1 NOTE2026-08-01
- OK13 OK2026-06-09
- ERROR12 OK, 1 ERROR2026-06-08
- OK14 OK2026-03-10
Documentation
- Help pages
- 5 (4 internal)includes a package overview page
- Examples that run
- 100%1 run in a plain check
- Exported functions with examples
- 25%
- Documented parameters
- 100%
- Return-value docs
- 100%
- Help pages citing references
- 40%
Downloads
Dependencies
Installing GraphRankTest adds 57 packages (31 with compiled code, 62 MB of source tarballs). Heaviest: stringi 11 MB, ggplot2 6.0 MB, data.table 5.7 MB.
Code & Tests
People & History
- RR 4.6.0 released · 2026-04-24
- 0.1Latest2025-11-12 · current release
- RR 4.5.0 released · 2025-04-11
Package metadata
- First published
- 2025-11-12
- Total releases
- 1 / 1 yrs
- License
- GPL (>= 2) OSI
- Minimum R
- ≥ 3.5.0
- Download size
- 6.0 KB
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("GraphRankTest")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-22, which the citation names so these numbers can be found later. More on citing and the projects behind them.