Fig. 2From: Utilizing the simple graph convolutional neural network as a model for simulating influence spread in networksApplication of Eq. 4 to a ring network. a The proportions of the group numbers over the values of k. It can be seen how with increased k, one group dominates producing consensus. b The values of the linear projection for each node as they change with k. c The value rounded to the nearest \([-1,+1]\) to see what ’decision’ would be made by each nodes due to the influence vicinity changes. d Has 3 subplots for the counts of the changes of the node labels over k with the vicinity changesBack to article page