A new betweenness centrality measure based on an algorithm for ranking the nodes of a network

DOI10.1016/J.AMC.2014.07.026zbMath1335.05166OpenAlexW2018003970WikidataQ125552387 ScholiaQ125552387MaRDI QIDQ278378

Taras Agryzkov, Jose L. Oliver, Leandro Tortosa, José-Francisco Vicent

Publication date: 2 May 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.07.026

zbMATH Keywords

betweennesscentrality measureseigenvector centralityPageRank algorithmsrandom-walk betweennessstreet network algorithms

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (3)

A novel method of evaluating key nodes in complex networks ⋮ Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks ⋮ Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks

Cites Work

• An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector
• A new status index derived from sociometric analysis
• A faster algorithm for betweenness centrality*
• Deeper Inside PageRank
• A Survey on PageRank Computing
• Unnamed Item

This page was built for publication: A new betweenness centrality measure based on an algorithm for ranking the nodes of a network