This paper deals with discrete copulas considered as a class of binary aggregation operators on a finite chain. A representation theorem by means of permutation matrices is given. From this characterization, we study the structure of associative discrete copulas and a theorem of decomposition of any discrete copula in terms of associative discrete copulas is obtained. Finally, some aspects concerning their extension to copulas are dealt with.
This paper deals with the well-known Sklar's theorem, which shows how joint distribution functions are related to their marginals by means of copulas. The main goal is to prove a discrete version of this theorem involving copula-like operators defined on a finite chain, that will be called discrete copulas. First, the idea of subcopulas in this finite setting is introduced and the problem of extending a subcopula to a copula is solved. This is precisely the key point which allows to state and prove the discrete version of Sklar's theorem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.