Measuring vertex centrality using the Holevo quantity

DOI10.1007/978-3-319-58961-9_14MaRDI QIDQ5082149zbMATH OpenOpenAlexWikidataFDO

Authors Luca Rossi, Andrea Torsello

Publication date 15 June 2022

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://publications.aston.ac.uk/id/eprint/30934/1/main.pdf

zbMATH Keywords

complex networksquantum informationvertex centrality

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• Determination of the importance of vertices in a graph
• Betweenness centrality in some classes of graphs
• A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
• Centrality measure in graphs
• Laplacian centrality: A new centrality measure for weighted networks

Cites work

• Attributed graph similarity from the quantum Jensen-Shannon divergence
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs
• Quantum computation and quantum information. 10th anniversary edition
• Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph

Cited in

(2)

• Quantum hub and authority centrality measures for directed networks based on continuous-time quantum walks
• Centrality measure in graphs

This page was built for publication: Measuring vertex centrality using the Holevo quantity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082149)