Skip to main navigation Skip to search Skip to main content

Efficient computation of the Bergsma–Dassios sign covariance

  • University of Washington

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

In an extension of Kendall’s (Formula presented.) , Bergsma and Dassios (Bernoulli 20(2):1006–1028, 2014) introduced a covariance measure (Formula presented.) for two ordinal random variables that vanishes if and only if the two variables are independent. For a sample of size n, a direct computation of (Formula presented.) , the empirical version of (Formula presented.) , requires (Formula presented.) operations. We derive an algorithm that computes the statistic using only (Formula presented.) operations.

Original languageEnglish
Pages (from-to)315-328
Number of pages14
JournalComputational Statistics
Volume31
Issue number1
DOIs
StatePublished - 1 Mar 2016
Externally publishedYes

Keywords

  • Binary tree
  • Kendall’s tau
  • Nonparametric correlation
  • Rank correlation
  • Spearman’s rho
  • Test of independence

Fingerprint

Dive into the research topics of 'Efficient computation of the Bergsma–Dassios sign covariance'. Together they form a unique fingerprint.

Cite this