Fig. 3From: Utilizing the simple graph convolutional neural network as a model for simulating influence spread in networksApplication to a network with three dense clusters of nodes. a The group membership of the nodes over k and how the vicinity allows the influence of the largest group to dominate the network labels of all other nodes. b The changes to each individual node and how the red group can find a k values to exploit a local network structure where it briefly dominates some orange nodes more than the more numerous blue group. c The individual change of the group over kBack to article page