Learn R Programming

GraphRankTest (version 0.1)

Rank in Similarity Graph Edge-Count Two-Sample Test (RISE)

Description

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) .

Copy Link

Version

Install

install.packages('GraphRankTest')

Monthly Downloads

151

Version

0.1

License

GPL (>= 2)

Maintainer

Doudou Zhou

Last Published

November 12th, 2025

Functions in GraphRankTest (0.1)

r.stat

Within-Group Sums (Ux, Uy)
RISE

Rank-based Two-Sample Tests on Similarity / Graph-Induced Rank Matrices
GraphRankTest

GraphRankTest: Rank-based Two-Sample Tests via Graph/Similarity-Induced Ranks
Cov.asy

Asymptotic Covariance of (Ux, Uy) under Permutation Null
rTests.base

Core Test on a Given Rank/Graph Matrix R