Exact sampling with highly uniform point sets
نویسندگان
چکیده
In 1996, Propp and Wilson came up with a remarkably clever method for generating exact samples from the stationary distribution of a Markov chain [17]. Their method, called “perfect sampling” or “exact sampling” avoids the inherent bias of samples that are generated by running the chain for a large but fixed number of steps. It does so by using a strategy called “coupling from the past”. Although the sampling mechanism used in their method is typically driven by independent random points, more structured sampling can also be used. Recently, Craiu and Meng [4, 5] suggested to use different forms of antithetic coupling for that purpose. In this paper, we consider the use of highly-uniform point sets to drive the exact sampling in Propp and Wilson’s method, and illustrate the effectiveness of the proposed method with a few numerical examples. ∗Corresponding author
منابع مشابه
Initial Evaluation of Pure and “Latinized” Centroidal Voronoi Tessellation for Non-Uniform Statistical Sampling*
A recently developed Centroidal Voronoi Tessellation (CVT) sampling method is investigated here to assess its suitability for use in statistical sampling applications. CVT efficiently generates a highly uniform distribution of sample points over arbitrarily shaped M-Dimensional parameter spaces. On several 2-D test problems CVT has recently been found to provide exceedingly effective and effici...
متن کاملA New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028–2042] it is based on the optimization algorithm threshold accepting. Our improvements include, amongst others, a non-uniform sampling strategy which is more suited for higher-dimensional inputs, an...
متن کاملA Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028–2042] it is based on the optimization algorithm threshold accepting. Our improvements include, amongst others, a non-uniform sampling strategy which is more suited for higher-dimensional inputs, an...
متن کاملComparison of pure and "Latinized" centroidal Voronoi tessellation against various other statistical sampling methods
A recently developed centroidal Voronoi tessellation (CVT) sampling method is investigated here to assess its suitability for use in statistical sampling applications. CVT efficiently generates a highly uniform distribution of sample points over arbitrarily shaped Mdimensional parameter spaces. On several 2-D test problems CVT has recently been found to provide exceedingly effective and efficie...
متن کاملAdaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement and produces smooth surfaces. It combines adaptive clustering based on quadtrees with piecewise polynomial least squares approximations. The resulting surface components are locally approximated by a smooth B-spline surfa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical and Computer Modelling
دوره 43 شماره
صفحات -
تاریخ انتشار 2006