Information-Theoretic Limits of Node Localization under Hybrid Graph Positional Encodings
cs.IT, cs.SC, math.IT
Submitted: 2026-03-26
Updated: 2026-03-26
Code: https://github.com/yzz980314/Graph_
Project page: https://snap.stanford.edu/decagon
Terminology
Sources
- Graph-Bert: Only Attention is Needed for Learning Graph Representations
- GraphiT: Encoding Graph Structure in Transformers
- GRPE: Relative Positional Encoding for Graph Transformer
- Bridging Distance and Spectral Positional Encodings via Anchor-Based Diffusion Geometry Approximation
- Resolving Node Identifiability in Graph Neural Processes via Laplacian Spectral Encodings
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound