Clique based centrality measure in hypergraphs

This paper presents a clique-based centrality measure for hypergraphs, using the Shapley value to evaluate node centrality in multi-way interactions. The proposed method identifies critical intersection nodes and provides insights into the roles of peripheral nodes in different hypergraph structures. Experimental results on various hypergraphs demonstrate the method's applicability and stability under different scaling factors