98%
921
2 minutes
20
Due to their ability to express higher-order structures, hypergraphs are becoming a central topic in network analysis. In this paper, we propose a parameter-free clique centrality index for all the hypergraphs, including hypergraphs involving singleton hyperedges and disconnected hypergraphs. We construct a hereditary class by introducing the null simplex into the simplicial complex of a hypergraph. Summarizing the boundary-coboundary relations in the hereditary complex, the hereditary diagram is defined and naturally connected. Inner and outer centrality indices are defined for all simplices with respect to the dual relations of the coboundary and boundary, respectively, and made into a global circuit whose steady state defines the Hereditary DualRank centrality. Based on the ratio of the outer and inner centralities of a simplex, we define its effectiveness, which describes the relative productivity of the corresponding clique. Applying the Hereditary DualRank centrality to a scientific collaboration dataset, we analyze individual choices in collaborations, reflecting, in detail, the trend that scholars seek for relatively effective cooperations in upcoming research. Based on the individual effectiveness values, we define the efficiency index of collaboration and reveal its negative correlation with the dispersity of individual effectiveness values. This work offers an in-depth topological understanding of the evolution and dynamics of hypergraphs.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1063/5.0273245 | DOI Listing |
J Math Biol
August 2025
Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary.
Complex contagion models that involve contagion along higher-order structures, such as simplicial complexes and hypergraphs, yield new classes of mean-field models. Interestingly, the differential equations arising from many such models often exhibit a similar form, resulting in qualitatively comparable global bifurcation patterns. Motivated by this observation, we investigate a generalised mean-field-type model that provides a unified framework for analysing a range of different models.
View Article and Find Full Text PDFChaos
August 2025
School of Mathematics, Shandong University, Jinan 250100, People's Republic of China.
Due to their ability to express higher-order structures, hypergraphs are becoming a central topic in network analysis. In this paper, we propose a parameter-free clique centrality index for all the hypergraphs, including hypergraphs involving singleton hyperedges and disconnected hypergraphs. We construct a hereditary class by introducing the null simplex into the simplicial complex of a hypergraph.
View Article and Find Full Text PDFBull Math Biol
July 2025
School of Mathematical Sciences, Jiangsu University, 212013, Zhenjiang, China.
The higher-order network structure characterized by hypergraphs or simplicial complexes has become a research hotspot in network space. In this paper, a simplicial complex is used to describe the multivariate interaction between populations, and the reaction diffusion equation in higher-order organization is established. Under certain constraints, the Turing instability condition of the system is derived.
View Article and Find Full Text PDFIEEE Trans Pattern Anal Mach Intell
July 2025
Graph neural networks (GNNs) have proven effective in capturing relationships among nodes in a graph. This study introduces a novel perspective by considering a graph as a simplicial complex, encompassing nodes, edges, triangles, and $k$-simplices, enabling the definition of graph-structured data on any $k$-simplices. We design a novel Hodge-Laplacian heterogeneous graph attention network (HL-HGAT) to learn heterogeneous signal representations across $k$-simplices.
View Article and Find Full Text PDFFront Genet
July 2025
School of Information Engineering, Changsha Medical University, Changsha, China.
Circular RNAs (circRNAs) play pivotal roles in various biological processes and disease progression, particularly in modulating drug responses and resistance mechanisms. Accurate prediction of circRNA-drug associations (CDAs) is essential for biomarker discovery and the advancement of therapeutic strategies. Although several computational approaches have been proposed for identifying novel circRNA therapeutic targets, their performance is often limited by inadequate modeling of higher-order geometric information within circRNA-drug interaction networks.
View Article and Find Full Text PDF