Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints
James Cruickshank, Fatemeh Mohammadi, Anthony Nixon, Shin-ichi, Tanigawa

TL;DR
This paper introduces a unified framework combining graph rigidity and algebraic geometry to analyze the identifiability of points under algebraic constraints, applicable to hypergraphs and secant varieties.
Contribution
It develops necessary and sufficient hypergraph conditions for identifiability, bridging combinatorics, rigidity theory, and algebraic geometry in a novel way.
Findings
Established hypergraph conditions for point identifiability.
Analyzed effects of non-generic projections on secant varieties.
Unified framework applicable to various algebraic measurement scenarios.
Abstract
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank conditions. The identifiability of points on secant varieties has also been a topic of much research in algebraic geometry. It is often formulated as the problem of identifying a set of points satisfying a given set of algebraic relations. A key question then is to prove sufficient conditions for relations to guarantee the identifiability of the points. This paper proposes a new general framework for capturing the identifiability problem when a set of algebraic relations has a combinatorial structure and develops tools to analyse the impact of the underlying combinatorics on the local or global identifiability of points. Our framework is built on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Digital Image Processing Techniques · Data Management and Algorithms
