Extension to incomplete distance graphs

Extend the benign-landscape results for the complete-graph squared-stress objective to incomplete Euclidean distance graphs, particularly globally or universally rigid frameworks with only a subset of pairwise distances observed.

Background

The main results apply only when every pairwise distance is known. In incomplete graphs, the squared-stress objective uses only the observed edges, and the corresponding stress matrix may fail to be positive semidefinite, which is a central ingredient in the complete-graph proof.

The paper identifies globally and universally rigid incomplete frameworks as the meaningful target because only in those settings does minimizing squared stress correspond to a well-posed recovery problem. The authors mention lateration frameworks as an important structured class, but no general extension is established.

References

To what extent can the results of this paper be extended to incomplete graphs, where only a subset of the pairwise distances is observed? One possible route is suggested by \citep[\S8.8]{Criscitiello2025thesis}. A main obstacle, however, is that our complete-graph analysis relies crucially on the positive semidefiniteness of the stress matrix (Lemma~\ref{lem:stress-psd}).

Doubling the dimension yields a benign landscape for the squared-stress  (2608.16799 - Criscitiello, 17 Aug 2026) in Footnote in Section 1, Introduction; Section Perspectives