1990
DOI: 10.1080/01621459.1990.10474985
|View full text |Cite
|
Sign up to set email alerts
|

A Distribution-Free Test for Symmetry Based on a Runs Statistic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
74
0
1

Year Published

2004
2004
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 68 publications
(75 citation statements)
references
References 7 publications
0
74
0
1
Order By: Relevance
“…P(T 1,n = 1) = P(−X (2) < X (1) < −X (1) ) = P(F(X (1) ) < F(−X (1) )) − P(F(X (1) ) < F(−X (2) )) = P(U (1) ) < 0.5) − P(U (1) + U (2) < 1) = P(X (1) < −X (t) ) − P(X (1) < −X (t+1) ) = P(F(X (1) ) < F(−X (t) )) − P(F(X (1) ) < F(−X (t+1) )) = P(U (1) + U (t) < 1) − P(U (1) + U (t+1) < 1) = P(X (i) < −X (t) ) − P(X (i) < −X (t+1) ) = P(F(X (i) ) < F(−X (t) )) − P(F(X (i) ) < F(−X (t+1) )) = P(U (i) + U (t) < 1) − P(U (i) + U (t+1) < 1) = P(X (i) < −X (i−1) ) − P(X (i) < −X (i) ) = P(F(X (i) ) < F(−X (i−1) )) − P(F(X (i) ) < F(−X (i) )) = P(U (i−1) + U (i) < 1) − P(U (i) < 0.5) = P(X (i) < −X (i) ) − P(X (i) < −X (i+1) ) = P(F(X (i) ) < F(−X (i) )) − P(F(X (i) ) < F(−X (i+1) )) = P(U (i) < 0.5) − P(U (i) + U (i+1) < 1) and P(T i,n = t) = P(−X (t+1) < X (i) < −X (t) ) = P(X (i) < −X (t) ) − P(X (i) < −X (t+1) ) = P(F(X (i) ) < F(−X (t) )) − P(F(X (i) ) < F(−X (t+1) )) = P(X (n) < −X (t) ) − P(X (n) < −X (t+1) ) = P(F(X (n) ) < F(−X (t) )) − P(F(X (n) ) < F(−X (t+1) )) = P(U (n) + U (t) < 1) − P(U (n) + U (t+1) < 1)…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…P(T 1,n = 1) = P(−X (2) < X (1) < −X (1) ) = P(F(X (1) ) < F(−X (1) )) − P(F(X (1) ) < F(−X (2) )) = P(U (1) ) < 0.5) − P(U (1) + U (2) < 1) = P(X (1) < −X (t) ) − P(X (1) < −X (t+1) ) = P(F(X (1) ) < F(−X (t) )) − P(F(X (1) ) < F(−X (t+1) )) = P(U (1) + U (t) < 1) − P(U (1) + U (t+1) < 1) = P(X (i) < −X (t) ) − P(X (i) < −X (t+1) ) = P(F(X (i) ) < F(−X (t) )) − P(F(X (i) ) < F(−X (t+1) )) = P(U (i) + U (t) < 1) − P(U (i) + U (t+1) < 1) = P(X (i) < −X (i−1) ) − P(X (i) < −X (i) ) = P(F(X (i) ) < F(−X (i−1) )) − P(F(X (i) ) < F(−X (i) )) = P(U (i−1) + U (i) < 1) − P(U (i) < 0.5) = P(X (i) < −X (i) ) − P(X (i) < −X (i+1) ) = P(F(X (i) ) < F(−X (i) )) − P(F(X (i) ) < F(−X (i+1) )) = P(U (i) < 0.5) − P(U (i) + U (i+1) < 1) and P(T i,n = t) = P(−X (t+1) < X (i) < −X (t) ) = P(X (i) < −X (t) ) − P(X (i) < −X (t+1) ) = P(F(X (i) ) < F(−X (t) )) − P(F(X (i) ) < F(−X (t+1) )) = P(X (n) < −X (t) ) − P(X (n) < −X (t+1) ) = P(F(X (n) ) < F(−X (t) )) − P(F(X (n) ) < F(−X (t+1) )) = P(U (n) + U (t) < 1) − P(U (n) + U (t+1) < 1)…”
Section: Resultsmentioning
confidence: 99%
“…. , X n be a random sample from an absolutely continuous distribution F with median zero and X (1) , . .…”
Section: Introduction and Proposed Testmentioning
confidence: 99%
“…, I n weighted according to their positions. A critical region for the J k test can be built following the argument of McWilliams [1], which establishes that under asymmetry of F and, for b > a > 0, either…”
Section: The Modified Testmentioning
confidence: 99%
“…This test problem has received considerable attention in the literature; see, for example [1][2][3][4][5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%
“…Each adaptive procedure uses in its first stage some measure or test of symmetry to decide whether the W + test or the S + test should be used to test the hypothesis about the median of the distribution. The first test (R) is based on calculating the runs statistic of symmetry [5]. A disadvantage with the procedure is that the runs test may give highly significant values, not because the distribution is asymmetric but because it is symmetric about the true value of the median which is different from the one specified by the null hypothesis.…”
Section: Introductionmentioning
confidence: 99%