Copula modeling for discrete random vectors

Copulas have now become ubiquitous statistical tools for describing, analysing and modelling dependence between random variables. Sklar’s theorem, “the fundamental theorem of copulas”, makes a clear distinction between the continuous case and the discrete case, though. In particular, the copula of a discrete random vector is not fully identifiable, which causes serious inconsistencies. In spite of this, downplaying statements may be found in the related literature, where copula methods are used for modelling dependence between discrete variables. This paper calls to reconsidering the soundness of copula modelling for discrete data. It suggests a more fundamental construction which allows copula ideas to smoothly carry over to the discrete case. Actually it is an attempt at rejuvenating some century-old ideas of Udny Yule, who mentioned a similar construction a long time before copulas got in fashion.