The eigenvector centrality of hypergraphs

Changjiang Bu, Haotian Zeng, Qingying Zhang

A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-unif…