pith. sign in

arxiv: 1212.4486 · v1 · pith:467S5SASnew · submitted 2012-12-18 · 🧮 math.PR · math.NA

Hit-and-run for numerical integration

classification 🧮 math.PR math.NA
keywords convexdensityhit-and-runintegrationnumericalsatisfiesalgorithmassume
0
0 comments X
read the original abstract

We study the numerical computation of an expectation of a bounded function with respect to a measure given by a non-normalized density on a convex body. We assume that the density is log-concave, satisfies a variability condition and is not too narrow. We consider general convex bodies or even the whole $\R^d$ and show that the integration problem satisfies a refined form of tractability. The main tools are the hit-and-run algorithm and an error bound of a multi run Markov chain Monte Carlo method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.