Flip-Flop Sublinear Models for Graphs: Proof of Theorem 1
Brijnesh Jain

TL;DR
This paper proves that for nearly all sublinear graph models, a class-dual does not exist, highlighting fundamental limitations in their duality properties.
Contribution
It establishes a theoretical proof demonstrating the non-existence of class-duals for most sublinear graph models.
Findings
No class-dual exists for almost all sublinear models on graphs
The result applies broadly to the class of sublinear graph models
Provides theoretical insight into the limitations of sublinear graph models
Abstract
We prove that there is no class-dual for almost all sublinear models on graphs.
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
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Topological and Geometric Data Analysis
