Estimation of Hierarchical Archimedean Copulas as a Shortest Path Prob lem

Dmytro Matsypura, Emily Neo and Artem Prokhorov

Working Papers from University of Sydney Business School, Discipline of Business Analytics

Abstract: We formulate the problem of finding and estimating the optimal hierarchical Archimedean copula as an amended shortest path problem. The standard network flow problem is amended by certain constraints specific to copulas, which limit scalability of the problem. However, we show in dimensions as high as twenty that the new approach dominates the alternatives which usually require recursive estimation or full enumeration.

Keywords: copulas; network flow problem (search for similar items in EconPapers)
Date: 2016-04-16
New Economics Papers: this item is included in nep-ecm
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/2123/14745

Related works:
Journal Article: Estimation of Hierarchical Archimedean Copulas as a Shortest Path Problem (2016)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:syb:wpbsba:2123/14745

Access Statistics for this paper

More papers in Working Papers from University of Sydney Business School, Discipline of Business Analytics Contact information at EDIRC.
Bibliographic data for series maintained by Artem Prokhorov (artem.prokhorov@sydney.edu.au).