On hypergraph centrality: Some clusters of vertices with equal importance
From MaRDI portal
Abstract: To keep track of the importance of each vertex and each hyperedge of a hypergraph, we introduce some positive valued functions on the set of vertices and hyperedges, respectively. The terms vertex centrality and hyperedge centrality, respectively, refer to these functions on the set of vertices and hyperedges. The concepts of centrality vary according to the sense of importance. We introduce and investigate two eigenvector-based vertex centralities and one eigenvector-based hyperedge centrality here. We introduce some distance-based hypergraph centrality on the set of vertices by employing a pseudo metric called unit-distance. We also explore random walk-based hypergraph centralities. Our study shows that these centrality functions become constant on some clusters of vertices and thus provide some clusters of equally important vertices. Some of these clusters appear only in networks with multi-body interactions and disappear in networks with only pair-wise interactions.
This page was built for publication: On hypergraph centrality: Some clusters of vertices with equal importance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419537)
