A rank-based nearest-neighbor graph yields a scale-invariant Azadkia-Chatterjee correlation coefficient that is consistent and, for d ≠ 2, asymptotically normal under independence.
Extension of Process Convergence With Application to Chatterjee's Rank Correlation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We give conditions under which weak convergence of a stochastic process indexed in the class of $d$-dimensional hyperrectangles is sufficient to ensure convergence in the larger class of functions of uniformly bounded Hardy-Krause variation. When applied to the empirical process, this can further be extended to derive weak convergence of V-processes indexed in the class of kernel functions which are coordinate-wise of uniformly bounded Hardy-Krause variation. Our proofs use a generalisation of the Koksma-Hlawka inequality for linear operators, allowing us to establish our results without any continuity assumptions on the functions involved. Our theory is complemented by two separate applications: First, we establish asymptotic normality of Chatterjee's rank correlation in the fully general setting. Second, we present new limit theorems for U- and V-processes of strongly mixing data.
fields
math.ST 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On a rank-based Azadkia-Chatterjee correlation coefficient
A rank-based nearest-neighbor graph yields a scale-invariant Azadkia-Chatterjee correlation coefficient that is consistent and, for d ≠ 2, asymptotically normal under independence.