Quantifying the Complexity of Nodes in Higher-Order Networks Using the Infomap Algorithm DOI Creative Commons
Yude Fu,

Xiongyi Lu,

Caixia Yu

et al.

Systems, Journal Year: 2024, Volume and Issue: 12(9), P. 347 - 347

Published: Sept. 3, 2024

Accurately quantifying the complexity of nodes in a network is crucial for revealing their roles and complexity, as well predicting emergent phenomena. In this paper, we propose three novel metrics to reflect extent which they participate organized, structured interactions higher-order networks. Our built using BuildHON+ model, where communities are detected Infomap algorithm. Since physical node may contain one or more networks, it simultaneously exist communities. The defined by number size belongs, contains within same community. Empirical flow datasets used evaluate effectiveness proposed metrics, results demonstrate efficacy characterizing

Language: Английский

Quantifying the Complexity of Nodes in Higher-Order Networks Using the Infomap Algorithm DOI Creative Commons
Yude Fu,

Xiongyi Lu,

Caixia Yu

et al.

Systems, Journal Year: 2024, Volume and Issue: 12(9), P. 347 - 347

Published: Sept. 3, 2024

Accurately quantifying the complexity of nodes in a network is crucial for revealing their roles and complexity, as well predicting emergent phenomena. In this paper, we propose three novel metrics to reflect extent which they participate organized, structured interactions higher-order networks. Our built using BuildHON+ model, where communities are detected Infomap algorithm. Since physical node may contain one or more networks, it simultaneously exist communities. The defined by number size belongs, contains within same community. Empirical flow datasets used evaluate effectiveness proposed metrics, results demonstrate efficacy characterizing

Language: Английский

Citations

0