Following [1]}, given an adjacency graph \(\mathcal {G=\langle \mathcal {V}, \mathcal {E}}\rangle \)  with edges \(\mathcal {E}\)  among nodes \(\mathcal {V}\) , we represent the graph convolution operation as,
\(\mathbf {Z} = \mathbf {\sigma }(\mathbf {A}\mathbf {X}\mathbf {W}_g) + \mathbf {X},\) 
