Graph Isomorphism Network (Gin)

Graph Isomorphism Network (GIN) is a theoretically expressive GNN architecture — designed to be as powerful as the Weisfeiler-Lehman (WL) graph isomorphism test, ensuring it can distinguish different graph structures that interactions like GCN or GraphSAGE might conflate.

What Is GIN?

• Insight: Many GNNs (GCN, GraphSAGE) fail to distinguish simple non-isomorphic graphs because their aggregation functions (Mean, Max) lose structural information.
• Update Rule: Uses Sum aggregation (injective) followed by an MLP. $h_v^{(k)} = MLP((1+\epsilon)h_v^{(k-1)} + \sum h_u^{(k-1)})$.
• Theory: Proved that Sum aggregation is necessary for maximum expressiveness.

Why It Matters

• Drug Discovery: Distinguishing two molecules that have the same atoms but different structural rings.
• Benchmarking: Standard SOTA for graph classification tasks (TU Datasets).

Graph Isomorphism Network is structurally aware AI — ensuring the model captures the topology of the graph, not just the statistics of the neighbors.