Why Are FGM Copulas Successful? A Simple Explanation
One of the most computationally convenient nonredundant ways to describe the dependence between two variables is by describing the corresponding copula. In many applications, a special class of copulas—known as FGM copulas—turned out to be most successful in describing the dependence between quantit...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Advances in Fuzzy Systems |
| Online Access: | http://dx.doi.org/10.1155/2018/5872195 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | One of the most computationally convenient nonredundant ways to describe the dependence between two variables is by describing the corresponding copula. In many applications, a special class of copulas—known as FGM copulas—turned out to be most successful in describing the dependence between quantities. The main result of this paper is that these copulas are the fastest to compute, and this explains their empirical success. As an auxiliary result, we also show that a similar explanation can be given in terms of fuzzy logic. |
|---|---|
| ISSN: | 1687-7101 1687-711X |