Hypergraphs in the characterization of regular vine copula structures
Not on the map. Why?
Abstract (arXiv)
Vine copulas constitute a flexible way for modeling of dependences using only pair copulas as building blocks. The pair-copula constructions introduced by Joe (1997) are able to encode more types of dependences in the same time since they can be expressed as a product of different types of bi-variate copulas. The Regular-vine structures (R-vines), as pair copulas corresponding to a sequence of trees, have been introduced by Bedford and Cooke (2001, 2002) and further explored by Kurowicka and Cooke (2006). The complexity of these models strongly increases in larger dimensions. Therefore the so called truncated R-vines were introduced in Brechmann et al. (2012). In this paper we express the Regular-vines using a special type of hypergraphs, which encodes the conditional independences.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Apr 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.
- 2025Trunc-Opt vine building algorithmscited by 1
- 2022Matrix and graph representations of vine copula structurescited by 0
- 2025Trunc-Opt vine building algorithms16 Dec 2025
- 2022Matrix and graph representations of vine copula structures10 May 2022