On the Equivalence between Positional Node Embeddings and Structural Graph Representations
This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that the relationship between structural representations and node embeddings is analogous to that of a distribution and its samples. We prove that all tasks that can be performed by node embeddings can also be performed by structural representations and vice-versa. We also show that the concept of transductive and inductive learning is unrelated to node embeddings and graph representations, clearing another source of confusion in the literature. Finally, we introduce new practical guidelines to generating and using node embeddings, which fixes significant shortcomings of standard operating procedures used today.
Code (1)
Tasks
Inductive LearningLink PredictionNode ClassificationTriad PredictionSimilar Papers 제목 키워드 기반
Node Proximity Is All You Need: Unified Structural and Positional Node and Graph Embedding
While most network embedding techniques model the relative positions of nodes in a network, recently there has been significant interest in structural embeddings that model node role equivalences, irrespective of their d…
AllGraph EmbeddingNetwork EmbeddingGraph Attention Networks with Positional Embeddings
Graph Neural Networks (GNNs) are deep learning methods which provide the current state of the art performance in node classification tasks. GNNs often assume homophily -- neighboring nodes having similar features and lab…
Graph AttentionNode ClassificationPOSLocal, global and scale-dependent node roles
This paper re-examines the concept of node equivalences like structural equivalence or automorphic equivalence, which have originally emerged in social network analysis to characterize the role an actor plays within a so…
Graph LearningGraph Neural NetworkNode ClassificationContrastive clustering based on regular equivalence for influential node identification in complex networks
Identifying influential nodes in complex networks is a fundamental task in network analysis with wide-ranging applications across domains. While deep learning has advanced node influence detection, existing supervised ap…
Contrastive LearningDeep ClusteringOn Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs
Graph neural networks (GNNs) have been widely used in various graph-related problems such as node classification and graph classification, where superior performance is mainly established when natural node features are a…
ClassificationGraph ClassificationNode Classification