Notes on sum-tests and independence tests

DOI10.1007/S00224-009-9240-4zbMATH Open1435.68127OpenAlexW2119043560MaRDI QIDQ633759FDOQ633759

Authors: B. 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

Recommendations

• A natural approach to the experimental study of dependence between statistical tests
• Generalized mutual-information based independence tests
• Consistent nonparametric tests of independence
• scientific article; zbMATH DE number 4102487
• A combinatorial characterization of sequential p. martin-löf tests

zbMATH Keywords

Kolmogorov complexityindependence testssum-tests

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Correlation and dependence
• Algorithmic randomness and complexity.
• Clustering by Compression
• The Similarity Metric
• Information distance
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Randomness conservation inequalities; information and independence in mathematical theories
• Kernel methods for measuring independence
• Uniform test of algorithmic randomness over a general space
• 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
• A Bayesian Independence Test for Small Datasets

Cited In (1)

• Nonapproximability of the normalized information distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633759)