Reconstructing almost all of a point set in R^d from randomly revealed pairwise distances

DOI10.1137/24M1706736MaRDI QIDQ6834006zbMATH OpenFDO

Authors Douglas Barnes, Jan Petr, Julien Portier, Benedict Randall Shaw, Alan Sergeev

Publication date 1 April 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1706736

zbMATH Keywords

random graphsreconstructionrigidity

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random graphs (graph-theoretic aspects) (05C80) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites work

• Bootstrap percolation in a polluted environment
• Characterizing generic global rigidity
• Generic global rigidity
• Graph bootstrap percolation
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• scientific article; zbMATH DE number 2209734 (Why is no real title available?)
• scientific article; zbMATH DE number 3076934 (Why is no real title available?)
• Reconstructing a point set from a random subset of its pairwise distances
• Sharp threshold for rigidity of random graphs
• Supersaturated graphs and hypergraphs
• Theory of self-reproducing automata. Edited and completed by Arthur W. Burks
• Threshold functions
• Weakly saturated random graphs

This page was built for publication: Reconstructing almost all of a point set in \(\mathbb{R}^d\) from randomly revealed pairwise distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834006)