EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Distances in Higher-Order Networks and the Metric Structure of Hypergraphs

Ekaterina Vasilyeva iD, Miguel Romance iD, Ivan Samoylenko, Kirill Kovalenko iD, Daniil Musatov iD, Andrey Mihailovich Raigorodskii, Stefano Boccaletti

Entropy · 12.06.2023 · 25 (6) · 923

DOI: 10.3390/e25060923 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 12.06.2023. Verfasst von Ekaterina Vasilyeva und 6 weiteren Autor:innen. Beteiligte Einrichtung: The Phystech School of Applied Mathematics and Computer Science, Moscow Institute of Physics and Technology, Institutskiy per., 9, 141701 Dolgoprudny…. Die Arbeit wurde bisher 17-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Rey Juan Carlos University, the program "Leading Scientific Schools "', Italian Ministry of Foreign Affairs and International Cooperation.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We explore the metric structure of networks with higher-order interactions and introduce a novel definition of distance for hypergraphs that extends the classic methods reported in the literature. The new metric incorporates two critical factors: (1) the inter-node distance within each hyperedge, and (2) the distance between hyperedges in the network. As such, it involves the computation of distances in a weighted line graph of the hypergraph. The approach is illustrated with several ad hoc synthetic hypergraphs, where the structural information unveiled by the novel metric is highlighted. Moreover, the method’s performance and effectiveness are shown through computations on large real-world hypergraphs, which indeed reveal new insights into the structural features of networks beyond pairwise interactions. Namely, using the new distance measure, we generalize the definitions of efficiency, closeness and betweenness centrality for the case of hypergraphs. Comparing the values of these generalized measures with their analogs calculated for the hypergraph clique projections, we show that our measures provide significantly different assessments on the characteristics (and roles) of the nodes from the information-transferability point of view. The difference is brighter for hypergraphs in which hyperedges of large sizes are frequent, and nodes relating to these hyperedges are rarely connected by other hyperedges of smaller sizes.

Schlagwörter

Stichwörter der Autor:innen

distances on hypergraphshigher-order networkshypergraphslinegraphs

Autor:innen und Institutionen

  • The Phystech School of Applied Mathematics and Computer Science, Moscow Institute of Physics and Technology, Institutskiy per., 9, 141701 Dolgoprudny, Moscow Region, Russia.
  • P.N. Lebedev Physical Institute of the Russian Academy of Sciences, Leninsky Prosp., 53, 119991 Moscow, Russia.
  • Departamento de Matemática Aplicada, Ciencia e Ingeniería de los Materiales y Tecnología Electrónica, Universidad Rey Juan Carlos, Calle Tulipán s/n, Móstoles, 28933 Madrid, Spain.
  • Mathematical Computation Laboratory on Complex Networks and Its Appliactions, Universidad Rey Juan Carlos, Calle Tulipán s/n, Móstoles, 28933 Madrid, Spain.
  • Faculty of Mathematics, National Research University Higher School of Economics, Usacheva str., 6, 119048 Moscow, Russia.
  • Scuola Superiore Meridionale, Largo S. Marcellino, 10, 80138 Napoli, NA, Italy.

ORCID-Profile: Ekaterina Vasilyeva, Miguel Romance, Kirill Kovalenko, Daniil Musatov

Förderung

  • Rey Juan Carlos University
  • the program "Leading Scientific Schools "'
  • Italian Ministry of Foreign Affairs and International Cooperation
  • the program “Leading Scientific Schools”
  • Vajra project

Zitieren

APA

Vasilyeva, E., Romance, M., Samoylenko, I., Kovalenko, K., Musatov, D., Raigorodskii, A. M., & Boccaletti, S. (2023). Distances in Higher-Order Networks and the Metric Structure of Hypergraphs. Entropy, 25(6), 923. https://doi.org/10.3390/e25060923

Vancouver

Vasilyeva E, Romance M, Samoylenko I, Kovalenko K, Musatov D, Raigorodskii AM, et al. Distances in Higher-Order Networks and the Metric Structure of Hypergraphs. Entropy. 2023;25(6):923. doi:10.3390/e25060923

BibTeX
@article{Vasilyeva2023,
  author = {Vasilyeva, Ekaterina and Romance, Miguel and Samoylenko, Ivan and Kovalenko, Kirill and Musatov, Daniil and Raigorodskii, Andrey Mihailovich and Boccaletti, Stefano},
  title = {Distances in Higher-Order Networks and the Metric Structure of Hypergraphs},
  journal = {Entropy},
  year = {2023},
  volume = {25},
  number = {6},
  pages = {923},
  doi = {10.3390/e25060923}
}
Kostenlos starten →