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

TL;DR
This paper investigates the rate of convergence of random polarizations of functions and sets to their symmetric counterparts, providing bounds, optimal rates, and introducing Markov chain-based polarization sequences.
Contribution
It extends previous results by establishing new bounds on convergence rates, including for functions in various spaces, and introduces a Markov chain-based polarization sequence.
Findings
Expected $L^1$ distance bounded by $c_n n^{-1}$ with $ar{c}_n$ limit involving $ abla f$
Convergence rate for sets slower than $n^{-r}$ for any $r>2d$
Existence of polarization sequences converging exponentially for sets with finite perimeter
Abstract
It was shown by Burchard and Fortier that the expected distance between and random polarizations of an essentially bounded function with support in a ball of radius is bounded by . This article complements and extends this result. The expected distance is bounded by with for every . Furthermore, the expected distance is for with and . The rate is best possible: 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic and geometric function theory · Point processes and geometric inequalities
