English

Generating an equidistributed net on a unit n-sphere using random rotations

Probability 2025-09-03 v2 Computational Geometry

Abstract

We develop a randomized algorithm (that succeeds with high probability) for generating an ϵ\epsilon-net in a sphere of dimension n. The basic scheme is to pick O(nln(1/n)+ln(1/δ))O(n \ln(1/n) + \ln(1/\delta)) random rotations and take all possible words of length O(nln(1/ϵ))O(n \ln(1/\epsilon)) in the same alphabet and act them on a fixed point. We show this set of points is equidistributed at a scale of ϵ\epsilon. Our main application is to approximate integration of Lipschitz functions over an n-sphere.

Keywords

Cite

@article{arxiv.1812.01845,
  title  = {Generating an equidistributed net on a unit n-sphere using random rotations},
  author = {Somnath Chakraborty and Hariharan Narayanan},
  journal= {arXiv preprint arXiv:1812.01845},
  year   = {2025}
}
R2 v1 2026-06-23T06:32:18.614Z