Distances in weighted higher-order networks
Charo I. del Genio·Stefano Boccaletti·Liubov Tupikina·Daniil Musatov·Andrei M. Raigorodskii·Dmitriy Fedorov·Ekaterina Vasilyeva
Abstract The concept of distance is a fundamental idea in graphs and hypergraphs. However, its extension to weighted hypergraphs is challenging, since it may result in inconsistencies, especially if the weights are arbitrarily assigned to the hyperedges. We address this challenge by proposing a general distance measure for weighted hypergraphs. Our measure is well-defined, and it reduces to the classic graph distance if the edges in the hypergraph are all pairwise links. We demonstrate the appli