REVIEW 2 cited by
Limit theorems of Chatterjee's rank correlation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
Conditional Mean Independence and Global Sensitivity Analysis using Nearest Neighbor Graphs
A nearest-neighbor graph estimator of the normalized conditional mean discrepancy is consistent, rate-optimal in low dimension, asymptotically normal under the null, and yields a fast test and screening procedure.
-
An association measure for mixed-type variables
ξ′ is a label-invariant, 0–1 association coefficient for a continuous X and a nominal Y, estimated in O(n log n) time from sorted adjacent label matches, with asymptotic tests and intervals.
Discussion (0). Continue with ORCID to comment.