Does the node features get duplicated for each edge?

[HongtaoYang]

Suppose I have a graph of N nodes and E edges. During the propagation process, I can see that the x_j and x_i are of shape [E, feature_dim], does that mean the node features are duplicated based on the edges?

Does it also mean that the memory footprint is O(E) instead of O(N)?

[rusty1s]

That is correct. Some operators can be implemented more efficiently though, see here.

[HongtaoYang]

Thanks!