Reconstructing a point set from a random subset of its pairwise distances
DOI10.1137/23M1586860MaRDI QIDQ6633133
Alexander Scott, Lukas Michel, António Girão, Emil Powierski, Freddie Illingworth
Publication date: 5 November 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Combinatorial reconstruction problems
- Generic global rigidity
- Random graphs.
- The 2-dimensional rigidity of certain families of graphs
- Characterizing generic global rigidity
- Finite Subsets of the Plane are 18-Reconstructible
- On rigidity, orientability, and cores of random graphs with sliders
- The Diameter of Sparse Random Graphs
- Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices
- The rigidity transition in random graphs
- Sharp threshold for rigidity of random graphs
- Maximum likelihood thresholds via graph rigidity
This page was built for publication: Reconstructing a point set from a random subset of its pairwise distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633133)
