Reconstructing a giant component of a point set in $\mathbb{R}$

Abstract

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+ε)/n$, for some fixed $ε>0$, then we can reconstruct a subset of size $Ω_ε(n)$, up to translation and reflection, with high probability. This confirms a conjecture posed by Girão, Illingworth, Michel, Powierski, and Scott. We also study a deterministic variant proposed by Benjamini and Tzalik. We show that if we are given $m$ distinct pairwise distances of a point set $V \subset \mathbb{R}$ with $|V|=n$, then we can reconstruct a subset of size $Ω(m/ (n \log n)) $, up to translation and reflection. Moreover, we show that this is optimal, which also disproves a conjecture posed by Benjamini and Tzalik.

Theorems & Definitions (54)

• Theorem 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 1.4
• Definition 3.1
• Theorem 3.2
• Lemma 3.3
• proof
• Lemma 3.4
• proof