Graph Neural Networks generalize convolution to graph-structured data. In each message passing round, each node aggregates feature vectors from its neighbors. After k rounds, each node's embedding captures its k-hop neighborhood. This visualization shows 3 rounds of message passing on a small graph, animating how information flows through the graph structure.
Part of the EngineersOfAI Interactive 3D - free interactive visualizations covering every major concept in machine learning and AI engineering. Hover any element for a plain-English explanation. No code required.