Efficiency of pattern-based independence test
L. Baringhaus, R. Gr\"ubel

TL;DR
This paper explores the efficiency and theoretical foundations of pattern-based independence tests, extending their connections to discrete mathematics and analyzing their asymptotic properties.
Contribution
It provides a comprehensive description of the limiting null distributions and asymptotic efficiencies of pattern-based independence tests, including new consistent tests for large classes of alternatives.
Findings
Derived detailed null distribution descriptions for pattern-based tests.
Identified asymptotic relative efficiencies of these tests.
Supported theoretical results with simulation studies.
Abstract
Tests of independence are an important tool in applications, specifically in connection with the detection of a relationship between variables; they also have initiated many developments in statistical theory. In the present paper we build upon and extend a recently established link to Discrete Mathematics and Theoretical Computer Science, exemplified by the appearance of copulas in connection with limits of permutation sequences, and by the connection between quasi-randomness and consistency of pattern-based tests of independence. The latter include classical procedures, such as Kendall's tau, which uses patterns of length two. Longer patterns lead to tests that are consistent against large classes of alternatives, as first shown by Hoeffding (1948) with patterns of length five, and by Yanagimoto (1970) and Bergsma and Dassios (2014) for patterns of length four. More recently Chan et…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
