Answers are grounded in this paper and cite their sources.
We present efficient algorithms for simultaneously computing Kendall's tau and the jackknife estimator of its variance. For the classical pairwise tau, we describe a modification of Knight's algorithm (originally designed to compute only tau) that does so while preserving its O(nlog2n) runtime in the number of observations n. We also introduce a novel algorithm computing a multivariate extension of tau and its jackknife variance in O(nlog2pn) time.
No takes yet. Share an insight, caveat, or question.
Samuel Perreault (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: