kendallknight-package: kendallknight: Efficient Implementation of Kendall's...

In kendallknight: Efficient Implementation of Kendall's Correlation Coefficient Computation

kendallknight: Efficient Implementation of Kendall's Correlation Coefficient Computation

Description

The computational complexity of the implemented algorithm for Kendall's correlation is O(n log(n)), which is faster than the base R implementation with a computational complexity of O(n^2). For small vectors (i.e., less than 100 observations), the time difference is negligible. However, for larger vectors, the speed difference can be substantial and the numerical difference is minimal. The references are Knight (1966) \Sexpr[results=rd]{tools:::Rd_expr_doi("10.2307/2282833")}, Abrevaya (1999) \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/S0165-1765(98)00255-9")}, Christensen (2005) \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1007/BF02736122")} and Emara (2024) https://learningcpp.org/. This implementation is described in Vargas Sepulveda (2025) \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1371/journal.pone.0326090")}.

Author(s)

Maintainer: Mauricio Vargas Sepulveda [e-mail] (ORCID)

Other contributors:

• Loader Catherine (original stirlerr implementations in C (2000)) [contributor]

• Ross Ihaka (original chebyshev_eval, gammafn and lgammacor implementations in C (1998)) [contributor]

See Also

Useful links:

• https://pacha.dev/kendallknight/

• https://github.com/pachadotdev/kendallknight

• Report bugs at https://github.com/pachadotdev/kendallknight/issues

kendallknight documentation built on Aug. 31, 2025, 5:07 p.m.