mlsanityData to 7 Oct 2026

A Simple Proof of the Universality of Invariant/Equivariant Graph Neural Networks

arXiv 1910.03802 ↗First posted 9 Oct 2019cs.LG stat.MLcited by 19

Not on the map. Why?

Abstract (arXiv)

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality conclusions including an open case for higher-order output. We find that our proposed technique not only leads to simple proofs of the universality properties but also gives a natural explanation for the tensorization of the previously studied models. Finally, we give some remarks on the connection between our model and the continuous representation of graphs.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 4; 2023: 4; 2024: 2; 2025: 0; 2026: 2.

19 papers.

Sort:

By area: