Reconstruction in one dimension from unlabeled Euclidean lengths
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2020
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929399539957760 |
|---|---|
| author | Connelly, Robert Gortler, Steven J. Theran, Louis |
| author_facet | Connelly, Robert Gortler, Steven J. Theran, Louis |
| contents | Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$ Euclidean lengths of $G$'s edges under $\mathbf{p}$. In this paper, we show that, with high probability over $\mathbf{p}$, we can efficiently reconstruct both $G$ and $\mathbf{p}$ from $\ell$. This reconstruction problem is NP-HARD in the worst case, even if both $G$ and $\ell$ are given. We also show that our results stand in the presence of small amounts of error in $\ell$, and in the real setting, with sufficiently accurate length measurements.
Our method combines lattice reduction, which has previously been used to solve random subset sum problems, with an algorithm of Seymour that can efficiently reconstruct an ordered graph given an independence oracle for its matroid. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_06550 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Reconstruction in one dimension from unlabeled Euclidean lengths Connelly, Robert Gortler, Steven J. Theran, Louis Metric Geometry Combinatorics Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$ Euclidean lengths of $G$'s edges under $\mathbf{p}$. In this paper, we show that, with high probability over $\mathbf{p}$, we can efficiently reconstruct both $G$ and $\mathbf{p}$ from $\ell$. This reconstruction problem is NP-HARD in the worst case, even if both $G$ and $\ell$ are given. We also show that our results stand in the presence of small amounts of error in $\ell$, and in the real setting, with sufficiently accurate length measurements. Our method combines lattice reduction, which has previously been used to solve random subset sum problems, with an algorithm of Seymour that can efficiently reconstruct an ordered graph given an independence oracle for its matroid. |
| title | Reconstruction in one dimension from unlabeled Euclidean lengths |
| topic | Metric Geometry Combinatorics |
| url | https://arxiv.org/abs/2007.06550 |