# Phase Transition in the One-bit Johnson-Lindenstrauss Lemma

## TL;DR

This paper demonstrates a phase transition phenomenon in one-bit Johnson-Lindenstrauss embeddings, showing that a small increase in dimension m sharply increases the probability of a successful embedding, with bounds similar to the linear case.

## Contribution

It establishes a phase transition in the probability of one-bit JL embeddings being RIP, matching bounds known for linear JL, and analyzes this using properties of Bernoulli variables.

## Key findings

- Phase transition in embedding success probability with respect to m.
- Bounds on m similar to linear JL Lemma.
- Probabilistic analysis using Bernoulli variables.

## Abstract

The Johnson-Lindenstrauss Lemma (J-L Lemma) is a cornerstone of dimension reduction techniques. We study it in the one-bit context, namely we consider the unit sphere $ \mathbb S ^{N-1}$, with normalized geodesic metric, and map a finite set $ \mathbf{X} \subset \mathbb{S}^{N-1}$ into the Hamming cube $\mathbb{H}_m = \{0,1\}^m$, with normalized Hamming metric. We find that for $ 0< \delta <1$, and $m>\frac{\ln n}{2\delta^2}$ there is a $\delta$-RIP from $\mathbf{X}$ into $\mathbb{H}_m$. This is surprising as the value of $ m$ is virtually identical to best known bound linear J-L Lemma. In both the linear and one-bit case, the maps are randomly constructed. We show that the probability of $B_m$ being a $\delta$-RIP satisfies a phase transition. It passes from probability of nearly zero to nearly one with a very small change in $m$. Our proof relies on delicate properties of Bernoulli random variables.