Discrepancy bounds for deterministic acceptance-rejection samplers

From MaRDI portal
Publication:2452111




Abstract: In this paper we propose an acceptance-rejection sampler using stratified inputs as diver sequence. We estimate the discrepancy of the points generated by this algorithm. First we show an upper bound on the star discrepancy of order N1/21/(2s). Further we prove an upper bound on the q-th moment of the Lq-discrepancy (mathbbE[NqLq,Nq])1/q for 2leqleinfty, which is of order N(11/s)(11/q). We also present an improved convergence rate for a deterministic acceptance-rejection algorithm using (t,m,s)nets as driver sequence.



Cites work







This page was built for publication: Discrepancy bounds for deterministic acceptance-rejection samplers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452111)