GRAPH NEURAL NETWORKS · A FIELD GUIDE

A tiny grid.
A local rule.
A wider view.

Follow a feature from one bus to the next. Learn how messages become representations—and what the graph alone cannot promise.

Start reading →
Five-node message graphUndirected toy graph: AB, AC, BC, CD gate 1, DE. A state 2.000; B state 0.000; C state 1.000; D state 3.000; E state 0.000. Layout is not geography; values are dimensionless.C–D: 1 gateA2.000B0.000C1.000D3.000E0.000

Five invented node features. Every number in this graph can be traced by hand.

For the applied-ML reader. We introduce graph notation, shared functions and permutation as they become useful. No electrical-engineering background or GNN framework required.