Generating an equidistributed net on a unit n-sphere using random rotations
Abstract
We develop a randomized algorithm (that succeeds with high probability) for generating an ε-net in a sphere of dimension n. The basic scheme is to pick O(n (1/n) + (1/δ)) random rotations and take all possible words of length O(n (1/ε)) in the same alphabet and act them on a fixed point. We show this set of points is equidistributed at a scale of ε. Our main application is to approximate integration of Lipschitz functions over an n-sphere.
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.