Vertex evaluation of multiplex graphs using Forman Curvature

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Yamada, Taiki
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918273555103744
author Yamada, Taiki
author_facet Yamada, Taiki
contents The identification of vertices that play a central role in network analysis is a fundamental challenge. Although traditional centrality measures have been extensively employed for this purpose, the increasing complexity of modern networks necessitates the use of sophisticated metrics. The concept of Forman curvature has recently garnered significant attention as a promising approach. We define the Forman curvature for multiplex graphs, which are a category of complex networks characterized by multiple layers of connections between nodes. We then prove the key properties of the Forman curvature in the context of multiplex graphs and show its usefulness in identifying vertices occupying central positions within these networks. Moreover, through a series of comparative experiments with traditional graph features and graph kernels, we demonstrate that the Forman curvature can function as an effective metric for classifying the overall structure of networks.
format Preprint
id arxiv_https___arxiv_org_abs_2504_17286
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Vertex evaluation of multiplex graphs using Forman Curvature
Yamada, Taiki
Combinatorics
Discrete Mathematics
05C50, 05C85
The identification of vertices that play a central role in network analysis is a fundamental challenge. Although traditional centrality measures have been extensively employed for this purpose, the increasing complexity of modern networks necessitates the use of sophisticated metrics. The concept of Forman curvature has recently garnered significant attention as a promising approach. We define the Forman curvature for multiplex graphs, which are a category of complex networks characterized by multiple layers of connections between nodes. We then prove the key properties of the Forman curvature in the context of multiplex graphs and show its usefulness in identifying vertices occupying central positions within these networks. Moreover, through a series of comparative experiments with traditional graph features and graph kernels, we demonstrate that the Forman curvature can function as an effective metric for classifying the overall structure of networks.
title Vertex evaluation of multiplex graphs using Forman Curvature
topic Combinatorics
Discrete Mathematics
05C50, 05C85
url https://arxiv.org/abs/2504.17286