Replies: 1 comment 2 replies
-
Graph Convolutions follow a simple neighborhood aggregation scheme, where node features from neighbors are transformed and aggregated to each central node. Therefore, only connected nodes will exchange information, and no information is exchanged in case nodes are disconnected. |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Both in general and specifically in Pytorch geometric, do graph convolutions require graphs to be connected? I’m asking because based on my understanding it does not, but I read somewhere that it does.
Beta Was this translation helpful? Give feedback.
All reactions