If you think of a binary matrix as the adjacency matrix of a graph, the kronecker product corresponds to the product of graphs, which is a 100% geometrical cons

If you think of a binary matrix as the adjacency matrix of a graph, the kronecker product corresponds to the product of graphs, which is a 100% geometrical construct. If your matrix has arbitrary weigths, this is the "weighted" graph product, where the weights of the edges are multiplied in the obvious manner (each edge in the product graph comes from a pair of edges of each input graph, and its weight is just the product of the two input weights).