New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks

DOI10.1016/J.AMC.2016.06.036zbMath1410.68034OpenAlexW2470404922MaRDI QIDQ1733726

Leandro Tortosa, Taras Agryzkov, José-Francisco Vicent

Publication date: 21 March 2019

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

Full work available at URL: http://hdl.handle.net/10045/61930

zbMATH Keywords

eigenvector centralityadapted PageRank algorithmnetworks centralityPageRank vectorurban networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Internet topics (68M11)

Related Items (6)

An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept ⋮ Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks ⋮ Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ A new centrality measure of nodes in multilayer networks under the framework of tensor computation ⋮ Spatial correlation analysis of urban traffic state under a perspective of community detection

Cites Work

• Evolution of cooperation in the traveler's dilemma game on two coupled lattices
• Extremality of degree-based graph entropies
• Bounds for degree-based network entropies
• Fifty years of graph matching, network alignment and network comparison
• 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
• Unnamed Item

This page was built for publication: New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks