The most efficient algorithm to sample from a log-concave distribution, that volesti supports is the Hamiltonian Monte Carlo with leapfrog...

In this project, we will implement different algorithms to count linear extensions approximately. In the problem of counting the linear extensions,...

Sampling and volume computation of convex polytopes is a challenging computational problem with many applications in inference from linear...

Package dingo is a python package that analyzes metabolic networks. It relies on high dimensional sampling with Markov Chain Monte Carlo (MCMC)...

The relationship between sampling and optimization has gained increasing interest in recent years. A great number of optimization algorithms that are...

We study the sampling of correlation matrices from a given probability density, which has applications in various scientific, engineering and...