Notes on sum-tests and independence tests

DOI10.1007/s00224-009-9240-4zbMath1435.68127OpenAlexW2119043560MaRDI QIDQ633759

Bruno Bauwens, Sebastiaan A. Terwijn

Publication date: 30 March 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9240-4

zbMATH Keywords

Kolmogorov complexityindependence testssum-tests

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (1)

Nonapproximability of the normalized information distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blind source separation using algorithmic information theory
• Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Uniform test of algorithmic randomness over a general space
• Algorithmic Randomness and Complexity
• Clustering by Compression
• The Similarity Metric
• Randomness conservation inequalities; information and independence in mathematical theories
• A Bayesian Independence Test for Small Datasets
• Information distance

This page was built for publication: Notes on sum-tests and independence tests