An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector
From MaRDI portal
Publication:2250244
DOI10.1016/j.amc.2012.08.064zbMath1291.68032MaRDI 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
Related Items
A new betweenness centrality measure based on an algorithm for ranking the nodes of a network, New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks, A variant of the current flow betweenness centrality and its application in urban networks, Identifying mobility patterns by means of centrality algorithms in multiplex networks, 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
Cites Work