Skip to content
master
Go to file
Code

Latest commit

* use new Eigen url on windows CI (#516)

* new eigen url on windows

* stupid

* eigen include path

* fix uninitialized npar_ (#515)

* Fix Frank Kendall's tau (#513)

* fix the bug

* simplify debye code

* simplify frank tau_to_parameters code

* move into vinecopulib namespace

* short kLim

* remove double doc

* Discrete fix (#514)

* clarify documentation

* fix empty columns in pdf

* better fix (hfunc1_sub had same problem)

* clarifying comment

* bump version + update NEWS (#517)
658d3bf

Git stats

Files

Permalink
Failed to load latest commit information.

README.md

vinecopulib

Build Status Coverage Status License: MIT Codacy Badge

What are vine copulas?

Vine copulas are a flexible class of dependence models consisting of bivariate building blocks (see e.g., Aas et al., 2009). You can find a comprehensive list of publications and other materials on vine-copula.org.

What is vinecopulib?

vinecopulib is a header-only C++ library for vine copula models based on Eigen. It provides high-performance implementations of the core features of the popular VineCopula R library, in particular inference algorithms for both vine copula and bivariate copula models. Advantages over VineCopula are

  • a stand-alone C++ library with interfaces to both R and Python,
  • a sleaker and more modern API,
  • shorter runtimes and lower memory consumption, especially in high dimensions,
  • nonparametric and multiparameter families.

Status

Version 0.5.4 was released on September 30, 2020. While we did our best to design a user-friendly API, the library is still under active development and changes are to be expected. We are also working on interfaces for R and Python.

Contact

If you have any questions regarding the library, feel free to open an issue or send a mail to info@vinecopulib.org.

Documentation

For documentation of the library's functionality and instructions how to use it, check out our website or the docs/ folder in this repository.

You can’t perform that action at this time.