arXiv · 1001.4919
Johnson-Lindenstrauss lemma for circulant matrices
Abstract
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides good running times. The price to be paid is the higher dimension of the target space $k=O(ε^{-2}\log^3n)$ instead of the classical bound $k=O(ε^{-2}\log n)$.
Explore related subjects
Keep this discovery
Aicke Hinrichs, Jan Vybíral. 2010-01-27. Johnson-Lindenstrauss lemma for circulant matrices. https://arxiv.org/abs/1001.4919
Cite the original work for its findings. Save a collection to share your selection of sources.