Limit theorems of Chatterjee's rank correlation
Not on the map. Why?
Abstract (arXiv)
Establishing the limiting distribution of Chatterjee's rank correlation for a general, possibly non-independent, pair of random variables has been eagerly awaited by many. This paper shows that (a) Chatterjee's rank correlation is asymptotically normal as long as one variable is not a measurable function of the other, (b) the corresponding asymptotic variance is uniformly bounded by 36, and (c) a consistent variance estimator exists. Similar results also hold for Azadkia-Chatterjee's graph-based correlation coefficient, a multivariate analogue of Chatterjee's original proposal. The proof is given by appealing to H'ajek representation and Chatterjee's nearest-neighbor CLT.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 5 of its 29 references that are in the map. First posted on arXiv 17 Apr 2022.
Builds on
5 of 29 references.
References · 5
- 2019A simple measure of conditional dependencecited by 38
- 2016Efficient multivariate entropy estimation via k-nearest neighbour distancescited by 26
- 2020Kernel Partial Correlation Coefficient -- a Measure of Conditional Dependencecited by 21
- 2021On boosting the power of Chatterjee's rank correlationcited by 10
- 2021Exact Detection Thresholds and Minimax Optimality of Chatterjee's Correlation Coefficientcited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
3 papers.
- 2026Nearest-Neighbor Radii under Dependent Sampling14 May 2026
- 2024Variance reduction combining pre-experiment and in-experiment data11 Oct 2024
- 2022A survey of some recent developments in measures of association9 Nov 2022