Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.