Papers › Network analysis using Forman curvature and Shapley values on hypergraphs
Network analysis using Forman curvature and Shapley values on hypergraphs
Taiki Yamada
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In recent years, network models have become more complex with the development of big data. Therefore, more advanced network analysis is required. In this paper, we introduce a new quantitative measure named combinatorial evaluation, which combines the discrete geometry concept of Forman Ricci curvature and the game theory concept of the Shapley value. We elucidated the characteristics of combinatorial evaluation by proving several properties of this indicator. Furthermore, we demonstrated the usefulness of the concept by calculating and comparing the conventional centrality and combinatorial evaluation for a concrete graph. The code is available at https://github.com/Taiki-Yamada-Math/CombinatorialEvaluation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections