Simulation of hyper-inverse Wishart distributions for non-decomposable graphs

Abstract

We propose an efficient solution to the problem of direct sampling from a hyper-inverse Wishart distribution in non-decomposable graphs. The method relies on local computations based on the standard junction tree representation of graphs and distribution theoretical results of constraint Wishart matrices.