Eigenvector centrality in simplicial complexes of hypergraphs
A centrality measure for (weighted) hypergraphs called Simplicial DualRank is introduced, in analogy to the classical principal eigenvector centrality notion from graph theory. The authors start by considering a given hypergraph as a simplicial complex, by adding in all the subsets of hyperedges. The structure of the hypergraph in terms of simplices is preserved in the (co)boundary matrix, which roughly plays the role of the graph-edge incidence matrix in the usual graph case. From this boundary matrix, a matrix with positive entries indexed by the simplices is defined and an application of the Perron-Frobenius theorem leads directly to the desired centrality measure.\N\NThe main difference with graph centrality notions is that in this view of hypergraphs as simplicial complexes, one can look both inward and outward from a simplex, which leads to the authors' notions of inner and outer centrality. The authors conclude with a small worked example and an investigation of hypergraphs coming from real-world scientific collaborations in physics.
- Three hypergraph eigenvector centralities
- Centrality measures in simplicial complexes: applications of topological data analysis to network science
- Centralities in simplicial complexes. Applications to protein interaction networks
- Eigenvector centrality of nodes in multiplex networks
- Some generalized centralities in higher-order networks represented by simplicial complexes
- A new status index derived from sociometric analysis
- A topological measurement of protein compressibility
- Centralities in simplicial complexes. Applications to protein interaction networks
- Centrality measures in simplicial complexes: applications of topological data analysis to network science
- Higher-order networks. An introduction to simplicial complexes
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3262216 (Why is no real title available?)
- Networks beyond pairwise interactions: structure and dynamics
- Networks. An introduction.
- Simplicial degree in complex networks. Applications of topological data analysis to network science
This page was built for publication: Eigenvector centrality in simplicial complexes of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552157)
