Graph neural network

A neural-network family that learns node, edge or whole-graph representations by repeatedly aggregating relational information in a permutation-aware graph structure.

Version

v2 · 2026-09-19 · History

Domain-specific #

4770

Domain group

Applied Sciences & Engineering

Origin domain

Computer Science & Software Engineering

Subdomains

Machine Learning, Geometric Deep Learning → Computer Science & Software Engineering

Core Idea

A graph neural network computes representations using the adjacency and features of graph-structured data. At each layer nodes receive transformed messages from neighbors and update their states; pooling yields graph-level outputs while shared functions preserve symmetry under node relabeling. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of machine learning. It is learned relational computation whose architecture respects graph isomorphism symmetries. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that node-level outputs are equivariant and graph-level outputs invariant to permitted vertex permutations, with message and readout semantics explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Whispering Friend Web

Imagine kids sitting in a web of friendships, and each kid whispers a note to their friends, then changes their own idea based on the notes they hear. After a few rounds of whispering, everyone knows something about the whole group. The computer learns how to write and read these notes. It doesn't matter what order you call the kids' names; it still gets the same answer.

Learning From Neighbor Messages

A graph is a bunch of dots connected by lines, like a map of who is friends with whom. A graph neural network is a computer program that learns from this kind of map. In each round, every dot gets messages from the dots it is connected to and updates what it 'knows'. At the end, it can give an answer about each dot or squeeze everything together into one answer about the whole map. Because every dot follows the same rules, renumbering the dots doesn't change the answers.

Permutation-Respecting Message Passing

A graph neural network computes learned representations from graph-structured data: which nodes are connected, plus the features on each node. At every layer, each node receives transformed messages from its neighbors and uses them to update its state. A pooling or readout step can then combine all node states into a single graph-level output. The key requirement is symmetry: if you relabel the nodes, node-level outputs get relabeled the same way (equivariance), and graph-level outputs stay exactly the same (invariance). That is what separates it from an ordinary neural network that is simply fed a list of numbers whose order matters.

 

A graph neural network computes learned representations from a graph's adjacency structure and node (and possibly edge) features. Each layer performs message passing: every node receives messages computed from its neighbors' states, aggregates them, and applies an update function. The message, aggregation and update functions are shared across nodes, which is what makes the architecture respect graph symmetries. Formally, node-level outputs are permutation-equivariant: relabel the vertices and the outputs are relabeled the same way. Graph-level outputs come from a readout or pooling step that is permutation-invariant, so isomorphic graphs get the same answer. The defining feature is not just 'machine learning on graphs' but this symmetry-respecting relational computation. Claiming something is a GNN therefore requires stating the message and readout semantics and checking that the equivariance/invariance conditions actually hold.

Scope of Application

Graph neural network belongs to machine learning and is useful where the analyst can specify a graph with nodes and edges, node and edge features, neighborhood aggregation or message functions, update layers, permutation equivariance, graph readout, learned parameters and prediction target, then evaluate node-level outputs are equivariant and graph-level outputs invariant to permitted vertex permutations, with message and readout semantics explicit. The scope is broad within that domain but bounded by the need for node-level outputs are equivariant and graph-level outputs invariant to permitted vertex permutations, with message and readout semantics explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making node-level outputs are equivariant and graph-level outputs invariant to permitted vertex permutations, with message and readout semantics explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Graph neural network can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Graph neural network. Graph neural network compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: a graph with nodes and edges, node and edge features, neighborhood aggregation or message functions, update layers, permutation equivariance, graph readout, learned parameters and prediction target. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express node-level outputs are equivariant and graph-level outputs invariant to permitted vertex permutations, with message and readout semantics explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of machine learning because they reuse a graph with nodes and edges, node and edge features, neighborhood aggregation or message functions, update layers, permutation equivariance, graph readout, learned parameters and prediction target, At each layer nodes receive transformed messages from neighbors and update their states; pooling yields graph-level outputs while shared functions preserve symmetry under node relabeling., and type the carrier, state every parameter and convention in the definition, test that node-level outputs are equivariant and graph-level outputs invariant to permitted vertex permutations, with message and readout semantics explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Graph neural network Domain-specific

Parents (1) — outgoing typed relations

• Graph neural network is a kind of Learning Prime

  The architecture learns representations from relational examples.

Hierarchy paths (2) — routes to 2 parentless roots

• Graph neural network → is a kind of Learning → is a kind of Adaptation

Show alternative path (1)

Neighborhood in Abstraction Space

Graph neural network sits in a crowded region of the domain-specific corpus (10^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Network Models & Graph Generation (6 abstractions)

Nearest neighbors

• Hidden layer — 0.92
• Double graph — 0.92
• Modularity (networks) — 0.92
• Split graph — 0.91
• Power graph analysis — 0.91

Computed from structural-signature embeddings · 2026-10-25