Asymptotic local uniformity of the quantization error for Ahlfors-David probability measures
Abstract
Let μ be an Ahlfors-David probability measure on Rq, namely, there exist some constants s0>0 and ε0,C1,C2>0 such that \[ C1εs0≤μ(B(x,ε))≤ C2εs0,\;ε∈(0,ε0),\;x∈ supp(μ). \] For n≥ 1, let αn be an n-optimal set for μ of order r and (Pa(αn))a∈αn an arbitrary Voronoi partition with respect to αn. The nth quantization error en,r(μ) for μ of order r is given by ern,r(μ):=∫ d(x,αn)rdμ(x). Write \[ Ia(α,μ):=∫Pa(αn)d(x,αn)rdμ(x),\;a∈αn. \] We prove that, J(αn,μ):=a∈αnIa(α,μ), J(αn,μ):=a∈αnIa(α,μ) and the error difference ern,r(μ)-ern+1,r(μ) are of the same order as 1nern,r(μ). This, together with Graf and Luschgy's work, yields that all the above three quantities are of the same order as n-(1+rs0).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.