.png){kind=icon}
返回
Higher-order shortest paths in hypergraphs
.png){kind=icon}
PRE
AI
DOI：10.1103/1mxy-3cnl.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. Nevertheless, the connectivity properties of real-world hypergraphs remain largely understudied. In this work we introduce path size as a measure to characterize higher-order connectivity and quantify the relevance of nondyadic ties for efficient shortest paths in a diverse set of empirical networks with and without temporal information. By comparing our results with simple randomized null models, our analysis presents a nuanced picture, suggesting that nondyadic ties are often central and are vital for system connectivity, while dyadic edges remain essential to connect more peripheral nodes, an effect which is particularly pronounced for time-varying systems. Our work contributes to abetter understanding of the structural organization of systems with higher-order interactions.
Keyword:
SMALL-WORLD
NETWORKS
期刊
IF:
2.4
论文数:
1.4K
被引数:
10.2W
机构
引用论文
分享收藏Exact and sampling methods for mining higher-order motifs in large hypergraphs在大型超图中挖掘高阶图案的精确和采样方法.png)
COMPUTING
OAAI
COMPUTINGIF2.8
OAAI分享收藏分享收藏Quantifying social contacts in a household setting of rural Kenya using wearable proximity sensors使用可穿戴式接近传感器量化肯尼亚农村家庭中的社交联系EPJ DATA SCIENCE
OAAI
EPJ DATA SCIENCEIF2.5
OAAI分享收藏
查看更多内容