Reconstructing a giant component of a point set in R
math.CO
Submitted: 2026-02-26
Updated: 2026-11-11
Terminology
Sources
- Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
- Determining a Points Configuration from a Subset of the Pairwise Distances
- Global rigidity of random graphs in $\mathbb{R}$
- On the Rigidity of Random Graphs in high-dimensional spaces
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality