Distances in Higher-Order Networks and the Metric Structure of Hypergraphs
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, an...
Main Authors: | Ekaterina Vasilyeva, Miguel Romance, Ivan Samoylenko, Kirill Kovalenko, Daniil Musatov, Andrey Mihailovich Raigorodskii, Stefano Boccaletti |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/25/6/923 |
Similar Items
-
Subdivision of hypergraphs and their colorings
by: Moharram N. Iradmusa
Published: (2020-03-01) -
Hypergraph Computation
by: Yue Gao, et al.
Published: (2024-09-01) -
Persistent homology based Bottleneck distance in hypergraph products
by: Archana Babu, et al.
Published: (2024-04-01) -
Hypergraph seminar /
by: Working Seminar on Hypergraph (1st : 1972 : Ohio), et al.
Published: (1974) -
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
by: Kamble Lata N., et al.
Published: (2016-05-01)