Efficient inference for Kendall's tau

06/08/2022
by   Samuel Perreault, et al.
0

Kendall's tau is a nonparametric measure of correlation. We present an efficient method for computing the empirical estimate of Kendall's tau and the jackknife estimate of its variance. For datasets of fixed dimension, the algorithm's runtime is log-linear in the number of observations. This is achieved by modifying the standard algorithm for computing the empirical Kendall's tau to return estimates of the summands making up its Hájek projection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2017

An Online Algorithm for Nonparametric Correlations

Nonparametric correlations such as Spearman's rank correlation and Kenda...
research
04/07/2019

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces

We give an algorithm that computes a (1+ϵ)-approximate Steiner forest in...
research
01/10/2013

Bayesian Error-Bars for Belief Net Inference

A Bayesian Belief Network (BN) is a model of a joint distribution over a...
research
06/11/2020

Wilks' theorem for semiparametric regressions with weakly dependent data

The empirical likelihood inference is extended to a class of semiparamet...
research
08/30/2020

Blind Determination of the Number of Sources Using Distance Correlation

A novel blind estimate of the number of sources from noisy, linear mixtu...
research
08/02/2022

An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice

Let Ψ(x,y) count the number of positive integers n≤ x such that every pr...

Please sign up or login with your details

Forgot password? Click here to reset