computational graph

[[concept]]

computational graph

The computational graph tracks the communications that each node makes at each layer or iteration of an algorithm/network.

Example

Since 1 and 3 are symmetric, their computational graph is symmetric

Note

$L = 2$ is sufficient because the diameter (or the longest shortest path between two nodes) is of length 2.

File
2025-02-24 graphs lecture 10
2025-03-03 graphs lecture 11