Asymptotic Normality of Chatterjee's Rank Correlation
Marius Kroll

TL;DR
This paper proves that a de-biased version of Chatterjee's rank correlation is asymptotically normal under broad conditions, extending the theoretical understanding of rank-based statistics for dependent data.
Contribution
It establishes the asymptotic normality of a de-biased Chatterjee's rank correlation without restrictive assumptions, and develops new results for empirical process convergence for dependent data.
Findings
Asymptotic normality of de-biased Chatterjee's rank correlation.
Extension of empirical process convergence to larger function classes.
New limit theorem for V- and U-statistics with strongly mixing data.
Abstract
We prove that a suitably de-biased version of Chatterjee's rank correlation based on i.i.d. copies of a random vector is asymptotically normal whenever is not almost surely constant. No further conditions on the joint distribution of and are required. We establish several results which allow us to extend convergence of the empirical process from one function class to larger function classes. These results are of independent interest, and can be used to investigate -statistics and -processes -- or, closely related, -statistics and -processes -- with dependent sample data. As an example, we use these results to prove weak convergence of - and -processes based on strongly mixing data. This implies a new limit theorem for - and -statistics of strongly mixing data.
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.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Advanced Mathematical Theories
