Consider $e_n = \inf \exp \int \log \parallel x - f(x) \parallel dP(x)$, where $p$ is a probability measure on $\real^d$ and the infimum is taken over all measurable maps $f{:}\ \real^d \rightarrow \real^d$ with $| f(\real^d)| \leq n$. We study solutions $f$ of this minimization problem. For absolutely continuous distributions and for self-similar distributions we derive the exact rates of convergence to zero of the $n$th quantization error $e_n$ as $n \rightarrow \infty$. We establish a relationship between the quantization dimension that rules the rates and the Hausdorff dimension of $P$.
The exact Hausdorff dimension function is determined for sets in R"' constructed by using a recursion that is governed by some given law of randomness.We present a method of determining the exact Hausdorff dimension function for a wide class of random recursive constructions. Let us recall the setting. Fix the compact subset J of Rm with J = cl(int(J)) and a positive integer n. An n-ary random recursion modeled on J is a probability space (Ql, (ii) For almost every wt E f and for every o E {1,:
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.