IDEAS home Printed from https://ideas.repec.org/a/vrs/demode/v12y2024i1p31n1001.html
   My bibliography  Save this article

Decomposition and graphical correspondence analysis of checkerboard copulas

Author

Listed:
  • Grothe Oliver

    (Karlsruhe Institute of Technology, Institute for Operations Research, Analytics and Statistics, Kaiserstr. 12, 76137 Karlsruhe, Germany)

  • Rieger Jonas

    (Karlsruhe Institute of Technology, Institute for Operations Research, Analytics and Statistics, Kaiserstr. 12, 76137 Karlsruhe, Germany)

Abstract

We analyze optimal low-rank approximations and correspondence analysis of the dependence structure given by arbitrary bivariate checkerboard copulas. Methodologically, we make use of the truncation of singular value decompositions of doubly stochastic matrices representing the copulas. The resulting (truncated) representations of the dependence structures are sparse, in particular, compared to the number of squares on the checkerboard. The additive structure of the decomposition carries through to statistical functionals of the copula, such as Kendall’s τ \tau or Spearman’s ρ \rho , and also motivates similarity measures for checkerboard copulas. We link our analysis to continuous decompositions of copula densities and copula-generating algorithms and discuss further general properties of the decomposition and its truncation. For example, truncated series might lack nonnegativity, and approximation errors increase for monotonicity-like copulas. We provide algorithms and extensions that account for and counteract these properties. The low-rank representation is illustrated for various copula examples, and some analytical results are derived. The resulting correspondence analysis profile plots are analyzed, providing graphical insights into the dependence structure implied by the copula. An illustration is provided with an empirical data set on fuel injector spray characteristics in jet engines.

Suggested Citation

  • Grothe Oliver & Rieger Jonas, 2024. "Decomposition and graphical correspondence analysis of checkerboard copulas," Dependence Modeling, De Gruyter, vol. 12(1), pages 1-31.
  • Handle: RePEc:vrs:demode:v:12:y:2024:i:1:p:31:n:1001
    DOI: 10.1515/demo-2024-0006
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/demo-2024-0006
    Download Restriction: no

    File URL: https://libkey.io/10.1515/demo-2024-0006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vrs:demode:v:12:y:2024:i:1:p:31:n:1001. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.