Probabilistic divide-and-conquer: deterministic second half

From MaRDI portal
Publication:2407388



Abstract: We present a probabilistic divide-and-conquer (PDC) method for emph{exact} sampling of conditional distributions of the form , where is a random variable on mathcalX, a complete, separable metric space, and event E with mathbbP(E)geq0 is assumed to have sufficient regularity such that the conditional distribution exists and is unique up to almost sure equivalence. The PDC approach is to define a decomposition of mathcalX via sets mathcalA and mathcalB such that mathcalX=mathcalAimesmathcalB, and sample from each separately. The deterministic second half approach is to select the sets mathcalA and mathcalB such that for each element ainmathcalA, there is only one element bainmathcalB for which (a,ba)inE. We show how this simple approach provides non-trivial improvements to several conventional random sampling algorithms in combinatorics, and we demonstrate its versatility with applications to sampling from sufficiently regular conditional distributions.




Cites work









This page was built for publication: Probabilistic divide-and-conquer: deterministic second half

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