Clique Based Centrality Measure in Hypergraphs
Abstract
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
Keywords:
hypergraph, cooperative game, Shapley value, centrality measure, clique, socio-philosophical analysis
Downloads
References
Benson, A. R. (2019). Three Hypergraph Eigenvector Centralities. SIAM J. Math. Data Sci., 1(2).
Bretto, A. (2013). Hypergraph Theory - An Introduction. pp. 119, Springer International Publishing: Switzerland.
Bykova, V. (2012). The Clique Minimal Separator Decomposition of a Hypergraph. Journal of Siberian Federal University. Mathematics and Physics, 5(1), 36–45.
Li, J., Tur, A., Zavrajnov, M. (2022). Importance of Agents in Networks: Clique Based Game-Theoretic Approach. Contributions to Game Theory and Management, 15, 189–199.
Faghani, M. R. (2013). A Study of XSS Worm Propagation and Detection Mechanismsin Online Social Networks. IEEE Transactions on Information Forensics and Security, 8(11), 1815–1826.
Mazalov, V. V., Avrachenkov, K. E., Trukhina, L. I., Tsynguev, B. T. (2016). Game-Theoretic Centrality Measures for Weighted Graphs. Fundamenta Informaticae, 145(3), 341–358.
Mazalov, V. V., Khitraya, V. A. (2021). A Modified Myerson Value for Determining the Centrality of Graph Vertices. Automation and Remote Control, 82(1), 145–159.
Shapley, L. S. (1953). A value for n-person games. In: Contributions to the Theory of Games II (Kuhn, H. and Tucker, A., eds), Vol. 2, Princeton University Press: Princeton.
Tantlevskij, I., Kuzyutin, D., Smirnova, N. (2024). A Signed Network Model of the Interaction Between Religious Movements and Authority in Judea. In: Modeling and Simulation of Social-Behavioral Phenomena in Creative Societies (Agarwal, N., Sakalauskas, L., Tukeyev, U., eds), Vol. 2211, Springer: Cham.
Tudisco, F., Higham, D. J. (2021). Node and edge nonlinear eigenvector centrality for hypergraphs. Commun Phys, 4, 201.
Tuǧal, İ., Zeydin, P. (2021). Centrality with Entropy in Hypergraphs. Rahva Tek. Ve Sos. Araştırmalar Derg., 1, 84–91.
Downloads
Published
How to Cite
Issue
Section
License
Articles of "Contributions to Game Theory and Management" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.
