Fig. 3From: Convergence properties of optimal transport-based temporal hypergraphsAdjacency matrices and line graphs. Top: generalized node s-adjacency matrices for different values of s from a given toy graph G. Bottom, from left to right: reference network G, and s-line graphs for \(s=2,3,\) and 4Back to article page