Efficient sampling algorithms for both Archimedean and nested Archimedean copulas are presented. First, efficient sampling algorithms for the nested Archimedean families of Ali-Mikhail-Haq, Frank, and Joe are introduced. Second, a general strategy how to build a nested Archimedean copula from a given Archimedean generator is presented. Sampling this copula involves sampling an exponentially tilted stable distribution. A fast rejection algorithm is developed for the more general class of tilted Archimedean generators. It is proven that this algorithm reduces the complexity of the standard rejection algorithm to logarithmic complexity. As an application it is shown that the fast rejection algorithm outperforms existing algorithms for sampling exponentially tilted stable distributions involved, e.g., in nested Clayton copulas. Third, with the additional help of randomization of generator parameters, explicit sampling algorithms for several nested Archimedean copulas based on different Archimedean families are found. Additional results include approximations and some dependence properties, such as Kendall's tau and tail dependence parameters. The presented ideas may also apply in the more general context of sampling distributions given by their Laplace-Stieltjes transforms.
