which equals 6 times number of triangles in the network [1]}, because a 2-hop walk between adjacent nodes \(i\)  and \(j\)  over a common neighbour \(m\)  is equivalent to a triangle \(i \rightarrow m \rightarrow j \rightarrow i\) . The computational complexity of \(A\circ A^{2}\)  thus reduces to \(O\left(d_{av}\cdot L\right)\) , as presented in Figure REF . For a given matrix \(A\circ A^{2}\) , the computational complexity of the \(N\times N\)  matrix \(W\)  is \(O(L)\) , because (REF ) can be transformed into Hadamard product terms (i.e. element-based operations).
<FIGURE>