How to understand the "s-*" metrics used in hypergraph anlysis?

[brendapraggastis]

Hypergraphs are generalizations of graphs. For many graph metrics distance is defined in terms of the length of the shortest path between nodes. But in hypergraphs paths have both length and width, which we reference with the parameter s. This affords the ability to define an s-distance. We describe this in Tutorial 7 in the library. With large datasets s-connectedness can serve as measure of strength of bond between hyperedges. For a detailed study of s-metrics, please see our paper: Aksoy, S.G., Joslyn, C., Ortiz Marrero, C. et al. Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 9, 16 (2020).

[mgao97]

Thank you!

What are the differences between the s-* metrics in s-linegraph and metrics in hypergraphs?