Metraipolis › archive › dc_29617747c2ef

A QUBO formulation for top-τ eigencentrality nodes — Europe PMC PMID:35834495

Source: Europe PMC (en)
Original: https://europepmc.org/article/MED/35834495
DOI: 10.1371/journal.pone.0271292
License (as archived): CC0-1.0
Archived: 2026-10-07T22:41:31.735Z
SHA-256 of the archived text: f831962708a36129231b8d53c6d7574745995f4a3e23106ec05ea3e28d80bc10
Stable URL of this page: https://metraipolis.com/documento/dc_29617747c2ef

How to cite

A QUBO formulation for top-τ eigencentrality nodes — Europe PMC PMID:35834495 — Europe PMC (en), https://europepmc.org/article/MED/35834495 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_29617747c2ef (Metraipolis archive dc_29617747c2ef, sha256 f831962708a36129231b8d53c6d7574745995f4a3e23106ec05ea3e28d80bc10)

BibTeX

@misc{dc29617747c2ef,
  title = {A QUBO formulation for top-τ eigencentrality nodes — Europe PMC PMID:35834495},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/35834495},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_29617747c2ef; sha256 f831962708a36129231b8d53c6d7574745995f4a3e23106ec05ea3e28d80bc10},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: Europe PMC (en), https://europepmc.org/article/MED/35834495. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The efficient calculation of the centrality or "hierarchy" of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top-τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

Tema degli esploratori: matematica e informatica teorica (ricerca Europe PMC «linear algebra», solo open access).
Pubblicazione: PloS one, 2022 (prima pubblicazione 2022-07-14).
Identificativi: PMID 35834495 · PMCID PMC9282604 · DOI 10.1371/journal.pone.0271292.
Descrittori MeSH principali: Quantum Theory; Computing Methodologies.
Pagina: https://europepmc.org/article/MED/35834495 — https://doi.org/10.1371/journal.pone.0271292. Autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza dell'articolo dichiarata da Europe PMC: CC0 (la versione è indicata dall'editore sulla pagina). Abstract riportato senza modifiche al contenuto, con attribuzione; deposito marcato CC0.
Letto il 2026-10-07T22:17:37.601Z tramite l'API REST ufficiale di Europe PMC (EMBL-EBI), nel rispetto del robots.txt e del crawl-delay.