An approximate entropy test for randomness

Communications in Statistics Part B: Simulation and Computation

Volumn 29, Issue 3, 2000, Pages 655-675

  Chatterjee, Sangit ^a   Yilmaz, Mustafa R ^a   Habibullah, Mohamed ^a   Laudato, Matthew ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b Software Com   (United States)

Author keywords

Approximate entropy; Dependent binary data; Power; Runs test

Indexed keywords

EID: 26944489110     PISSN: 03610918     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Bennet, D. J. (1998). Randomness, Harvard University Press, Cambridge, Massachusetts.
2. Bassein, S. (1996). A Sampler of randomness, American Mathematical Monthly, 103, 6, 483-490.
3. Bloom, D. B. (1998). Singles in a Sequence of Coin Tosses. College Mathematics Journal, 29, 2, 120-127.
4. Chaitin, G. J. (1975). A Theory of Program Size Formally Identical to Information Theory, Journal of the Association for Computing Machinery, 22, 329-340.
5. Cover, T. M. and Thomas, J.A. (1991). Elements of Information Theory, John Wiley, New York.
6. Gilovich, T., Vallone, R. and Tversky, A. (1985). The Hot Hand in Basketball: On the Misperception of Random sequences, Cognitive Psychology, 17, 295-314.
7. Levene, H. and Wolfowitz, J. (1944) The Covariance matrix of Runs Up and Down, Annals of Mathematical Statistics, 15, 58-69.
8. Kolmogorov, A. N. and Uspenskii, V.A. (1987). Algorithms and Randomness, Theory of Probability and its Applications, 32, 389-412.
9. Kullback, S. (1958). Information Theory and Statistics, Dover, New York.
10. Martin-Löf, P. (1966). The Definition of Random sequences, Information and Control, 9, 602-619.
11. Mood, A.M. (1940). The distribution Theory of Runs, Annals of Mathematical Statistics, 11, 367-391.
12. Mosteller, F. (1941). Note on an Application of Runs to Quality Control Charts, Annals of Mathematical Statistics, 12, 228-232.
13. Olmstead, (1946). Distribution of sample Arrangements for Runs Up and Down, Annals of Mathematical Statistics, 17, 24-33.
14. Orenstein, D.B. and Weiss, B. (1990). How sampling reveals a Process, Annals of Probability, 18, 3, 905-929.
15. Peterson, I. (1998). The Jungles of Randomness; A Mathematical Safari, John Wiley & Sons, Inc; New York.
16. Pincus, S. (1991). Approximate Entropy as a Measure of System Complexity, Proceedings of the National Academy of Sciences, 88, 2297-2301.
17. Pincus, S. and Singer, B.H. (1996). Randomness and Degrees of Irregularity, Proceedings of the National Academy of Sciences, 93, 2083-2088.
18. Pincus, S and Kaiman, R. E. (1997). Not all (possibly) "random" sequences are created equal, Proceeding of the National Academy of Sciences, 94, 3513-3518.
19. nd ed.), Cambridge University Press, New York.
20. Renyi, A. (1984). A Diary on Information Theory, John Wiley and Sons, New York.
21. Schilling, M. (1990). The Longest Run of Heads, College Mathematics Journal, 21, 3, 196-207.
22. Shewhart, W. (1939). Statistical Method From the Viewpoint of Quality Control, The Graduate School, Department of Education, Washington.
23. Wolfowitz, J. (1944). Asymptotic Distribution of Runs Up and Down, Annals of Mathematical Statistics, 15, 163-172.