Metraipolis › archive › dc_d72066a214dc

Vertex-subgraph eigenvector centrality for connected induced subgraphs — arXiv:2611.06534

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06534
License (as archived)
CC0-1.0
Archived
2026-11-05T18:20:54.027Z
SHA-256 of the archived text
08cfdc4b820baf63cc8371f18bd7f579373a4c28e593092358fe4a8397abc430
Stable URL of this page
https://metraipolis.com/documento/dc_d72066a214dc

How to cite

Vertex-subgraph eigenvector centrality for connected induced subgraphs — arXiv:2611.06534 — arXiv (en), https://arxiv.org/abs/2611.06534 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d72066a214dc (Metraipolis archive dc_d72066a214dc, sha256 08cfdc4b820baf63cc8371f18bd7f579373a4c28e593092358fe4a8397abc430)
BibTeX
@misc{dcd72066a214dc,
  title = {Vertex-subgraph eigenvector centrality for connected induced subgraphs — arXiv:2611.06534},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06534},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d72066a214dc; sha256 08cfdc4b820baf63cc8371f18bd7f579373a4c28e593092358fe4a8397abc430},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06534. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: governance digitale e beni comuni (elenco arXiv cs.SI, nuovi lavori del giorno).
Categorie arXiv: Social and Information Networks (cs.SI).
Pagina del lavoro: https://arxiv.org/abs/2611.06534 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:15:03.966Z dalla pagina https://arxiv.org/list/cs.SI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).