liveBook · Manning

Graph

As explained in Sutskever's List

A graph is a data structure composed of entities represented as nodes and relationships represented as edges.

A graph represents entities as nodes and relationships as edges. For molecules, atoms form nodes and bonds form edges carrying spatial-distance information; pairwise relationships encode three-dimensional orientation. section 7.3.2

In message-passing neural networks, nodes repeatedly exchange learned messages and update their hidden states. Pooling combines node states into a graph-level prediction, such as molecular energy, dipole, or gap. Information between distant nodes may require many rounds to propagate; virtual edges and master nodes are explored to speed communication. section 7.3.2

How Sutskever's List covers it

How deep it goes
Connects node-edge representation to iterative message passing and pooled graph-level prediction.
Examples
Uses molecules, atoms, bonds, spatial distances, three-dimensional orientation, and predictions of energy, dipole, or gap.
What you can do after
Understand how molecular structure becomes input for graph-level property prediction through message passing and pooling.
How it connects
Links graphs to convolutional neural networks, recurrent neural networks, message-passing neural networks, and gated graph neural networks.

Also explained in

Compare how 21 books explain graph →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.