In the paper:Asymmetric Transitivity Preserving Graph Embedding,the authors state that they will not calculate S in this part
so that in this algorithm, they do not explicitly perform the polynomial operation on adjacency matrix in Ml and Mg, but in the implementation the S matrix is calculated fully as this shows,
I can't understand it so anyone please could explain this to me, thank you
In the paper:Asymmetric Transitivity Preserving Graph Embedding,the authors state that they will not calculate S in this part
so that in this algorithm, they do not explicitly perform the polynomial operation on adjacency matrix in Ml and Mg, but in the implementation the S matrix is calculated fully as this shows, I can't understand it so anyone please could explain this to me, thank you