Network analysis using Forman curvature and Shapley values on hypergraphs

Taiki Yamada

Papers from arXiv.org

Abstract: 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.

Date: 2021-10, Revised 2025-06
New Economics Papers: this item is included in nep-gth and nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2110.06506 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2110.06506

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().