An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector

DOI10.1016/j.amc.2012.08.064zbMath1291.68032OpenAlexW2018056172MaRDI QIDQ2250244

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

Publication date: 4 July 2014

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

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

zbMATH Keywords

networksmatricesgraphsconnectivityPageRank

Mathematics Subject Classification ID

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

Related Items (7)

A new betweenness centrality measure based on an algorithm for ranking the nodes of a network ⋮ An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept ⋮ Identifying critical factors in systems with interrelated components: a method considering heterogeneous influence and strength attenuation ⋮ Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks ⋮ New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks ⋮ Identifying mobility patterns by means of centrality algorithms in multiplex networks ⋮ A variant of the current flow betweenness centrality and its application in urban networks

Cites Work

• Unnamed Item
• Google PageRank as mean playing time for pinball on the reverse web
• Statistical mechanics of complex networks
• Centrality in networks of urban streets
• Deeper Inside PageRank
• A Survey of Eigenvector Methods for Web Information Retrieval
• A Survey on PageRank Computing

This page was built for publication: An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector