arXiv:2611.06534 · v1

Vertex-subgraph eigenvector centrality for connected induced subgraphs

首次提交 2026-11-04 22:03

版本更新 2026-11-04 22:03

雷达观测 2026-11-05 12:13

摘要

Eigenvector centrality evaluates the importance of vertices through adjacency relations, while higher-order subgraph structures provide additional information for centrality analysis. This motivates the simultaneous evaluation of vertices and subgraphs within a unified spectral framework. In this paper, we propose vertex-subgraph eigenvector centrality (VSC), which jointly determines the centralities of vertices and connected induced subgraphs of order three. The vertex centrality depends on the centralities of the subgraphs containing it and those of the other vertices in these subgraphs, whereas the subgraph centrality depends on the centralities of its constituent vertices. To distinguish induced paths P3 from triangles K3, the capacity of each subgraph is defined as its number of edges. The resulting coupled nonlinear eigenvalue equations are represented by a fourth-order symmetric nonnegative tensor. We prove that this tensor is weakly irreducible for every connected graph with at least three vertices, which guarantees the existence and uniqueness, up to scaling, of a positive Perron eigenvector. Numerical experiments on four real-world networks compare VSC with classical centrality measures and show that capacity weighting has a greater effect on subgraph rankings than on vertex rankings.

作者备注：24 pages, 5 figures