Physical review. E
Higher-order shortest paths in hypergraphs.
Berné L Nortier, Simon Dobson, Federico Battiston
Published: 202510.1103/1mxy-3cnl
Abstract
One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with nondyadic, higher-order interactions. Neve…
Preview only. Read the full abstract at the source