Description Usage Arguments Details Value Author(s) References See Also Examples
test.lin.t
find the most almost-linear length k+1 subsequence
of a given sequence and compute the almost-linearity test statistic for
this subsequence. test.lin.p
compute the p-value corresponding to
a computed test statistic. test.lin
compute the test statistics
and the p-values for subsequences of all lengths.
1 2 3 | test.lin(Tn);
test.lin.t(Tn, k);
test.lin.p(t, n, k);
|
Tn |
A sequence of numbers. Currently, only support sequences of length less than 50. |
k |
The length of the subsequences for which we want to test for almost-linearity. |
n |
The length of the sequence for which we want to test for subsequence almost-linearity. |
t |
Test statistic computed for a length k+1 subsequence of a length n+1 sequence. |
Almost-linear means the spacings of the sequence are almost equal, or the distance between the standardized spacings as a vector and (1/k, ..., 1/k) is too small. The p-value is computed by comparing the test statistic to a procomputed test statistic quantile table. See Di and Perlman (2007) for more details.
test.lin.t
returns the most linear length k+1 subsequence of
the input sequence and corresponding almost-linearity test
statistic. test.lin.p
returns the p-value corresponding to the
input test statistic t
. test.lin
has no return value,
instead, a table containing the most almost linear subsequences,
corresponding test staistics and p-values will be outputed.
Yanming Di
Di and Perlman, 2007
1 2 3 4 5 6 7 8 9 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.