> how do you account for non-binary strength of connections between nodes The adjacency matrix of a graph normally has entries only 0 or 1. https://en.wikiped

> how do you account for non-binary strength of connections between nodes The adjacency matrix of a graph normally has entries only 0 or 1. https://en.wikipedia.org/wiki/Adjacency_matrix https://en.wikipedia.org/wiki/Adjacency_matrix Generalize the adjacency matrices to include values between 0 and 1. Typically, you'd impose some normalization condition like rows and/or columns sum to 1. Then compute the Kronecker product of matrices to obtain the graph tensor product. https://en.wikipedia.org/wiki/Kronecker_product https://en.wikipedia.org/wiki/Kronecker_product