AcrossTic-package {AcrossTic}

A Cost-Minimal Regular Spanning Subgraph with TreeClust

Description

Construct minimum-cost regular spanning subgraph as part of a non-parametric two-sample test for equality of distribution.

Details

The DESCRIPTION file:

Package:	AcrossTic
Version:	1.0-3
Date:	2016-08-12
Title:	A Cost-Minimal Regular Spanning Subgraph with TreeClust
Author:	Dave Ruth, Sam Buttrey
Maintainer:	Sam Buttrey <[e-mail]>
Depends:	treeClust (>= 1.1-6), lpSolve
Description:	Construct minimum-cost regular spanning subgraph as part of a non-parametric two-sample test for equality of distribution.
License:	GPL (>= 2)

Index of help topics:

rRegMatch		Compute r-regular matching spanning trees
print.AcrossTic		print an AcrossTic object, the output from rRegMatch
plot.AcrossTic		print an AcrossTic object, the output from rRegMatch
ptest			perform permutation test on AcrossTic object
print.AcrossTicPtest	print an AcrossTic permutation test object

This primarily provides rRegMatch, which for arguments X and r produces a minimum-distance r-regular subgraph of the rows of X.

Author(s)

Dave Ruth, Sam Buttrey

Maintainer: Sam Buttrey <[e-mail]>

References

David Ruth, "A new multivariate two-sample test using regular minimum-weight spanning subgraphs," J. Stat. Distributions and Applications (2014)

Examples

set.seed (123)
X <- matrix (rnorm (100), 50, 2) # Create data...
y <- rep (c (1, 2), each=25) # ...and class membership
## Not run: rRegMatch (X, r = 3, y = y)