A note on the rate of convergence for a sequence of random polarizations

Abstract

It was shown by Burchard and Fortier that the expected L1 distance between f* and n random polarizations of an essentially bounded function f with support in a ball of radius L is bounded by 2dm(B2L)||f||∞n-1. This article complements and extends this result. The expected L1 distance is bounded by cnn-1 with n→ ∞cn ≤ 2d+1||∇ f||1 for every f ∈ W1,1(BL) L∞(BL). Furthermore, the expected L1 distance is O(n-1/q) for f ∈ Lp(BL) with p>1 and 1p + 1q = 1. The rate n-1 is best possible: n times the measure of the symmetric difference between the random polarizations of a ball and its corresponding Schwarz symmetrization converges in distribution to a random variable with moments that are derived. It is also shown that the expected symmetric difference between the random polarizations of a measurable set in BL and its corresponding Schwarz symmetrization is slower than n-r for any r>2d and if the rate is n-1 then n times the measure of the symmetric difference between the random polarizations of the set and its corresponding Schwarz symmetrization converges in distribution. A new sequence of random polarizations is introduced such that the transition probability depends on the state of the underlying Markov chain. For compact sets with finite perimeter, the rate of convergence is O(n-3/2) when d=1 and O(n-(1 + d-1d(d+1))) for d>1. Finally it is shown that for every compact set A in R with finite perimeter there exists a sequence of polarizations An of A converging exponentially to its Schwarz symmetrization.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…