Loading…

Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks

•A centrality model for urban street networks is proposed.•Non-local random walks are used to extend the Adapted PageRank Algorithm model.•The non-local movement of the random walker is more intuitive. In the urban street network domain, there is growing interest in extending conventional centrality...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation 2023-06, Vol.446, p.127888, Article 127888
Main Authors: Bowater, David, Stefanakis, Emmanuel
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23
cites cdi_FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23
container_end_page
container_issue
container_start_page 127888
container_title Applied mathematics and computation
container_volume 446
creator Bowater, David
Stefanakis, Emmanuel
description •A centrality model for urban street networks is proposed.•Non-local random walks are used to extend the Adapted PageRank Algorithm model.•The non-local movement of the random walker is more intuitive. In the urban street network domain, there is growing interest in extending conventional centrality measures to incorporate node-specific information (such as georeferenced socioeconomic data) in order to help identify important locations in an urban environment. One such centrality measure that is gaining attention is the Adapted PageRank Algorithm (APA) model. However, a fundamental concern with the APA model is the notion of teleportation because it means the random walker is equally likely to jump or ‘teleport’ to any intersection (node) in the street network, regardless of how far away it is. In this paper, we propose a centrality model that overcomes this counterintuitive idea. More specifically, we extend the APA model by modifying the jumping probabilities so that the random walker is more inclined to jump to a nearby intersection than a distant intersection. We accomplish this using non-local random walks which allow a random walker to jump to any node in the network with probabilities that depend on the distance separating the nodes. To demonstrate the differences between the two models, we present and discuss experimental results for a small ten node graph and a real-world urban street network.
doi_str_mv 10.1016/j.amc.2023.127888
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_amc_2023_127888</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0096300323000577</els_id><sourcerecordid>S0096300323000577</sourcerecordid><originalsourceid>FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23</originalsourceid><addsrcrecordid>eNp9kM1KAzEURoMoWKsP4C4vMGMymclkcFVK_YGCIroOt8mddtqZpCSptW9vS127-lbn8HEIuecs54zLh3UOg8kLVoicF7VS6oKMuKpFVsmyuSQjxhqZCcbENbmJcc0YqyUvR2Q7-0nobOeWNK2QTixsE1r6Dkv8ALehk37pQ5dWAzXoUoC-Swc6eIs9bX2gu7AAR2MKiIk6THsfNpHu4snnvMt6b6CnAZz1A91Dv4m35KqFPuLd347J19Psc_qSzd-eX6eTeWaKpk6ZrKVQbV1hswBbNqYpUGELojKysapSpZXAwZTAGxRS1IKVoFhlaoaVFVCIMeFnrwk-xoCt3oZugHDQnOlTMr3Wx2T6lEyfkx2ZxzODx2PfHQYdTYfOoO0CmqSt7_6hfwElmnYN</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks</title><source>Elsevier</source><source>Backfile Package - Computer Science (Legacy) [YCS]</source><source>Backfile Package - Mathematics (Legacy) [YMT]</source><creator>Bowater, David ; Stefanakis, Emmanuel</creator><creatorcontrib>Bowater, David ; Stefanakis, Emmanuel</creatorcontrib><description>•A centrality model for urban street networks is proposed.•Non-local random walks are used to extend the Adapted PageRank Algorithm model.•The non-local movement of the random walker is more intuitive. In the urban street network domain, there is growing interest in extending conventional centrality measures to incorporate node-specific information (such as georeferenced socioeconomic data) in order to help identify important locations in an urban environment. One such centrality measure that is gaining attention is the Adapted PageRank Algorithm (APA) model. However, a fundamental concern with the APA model is the notion of teleportation because it means the random walker is equally likely to jump or ‘teleport’ to any intersection (node) in the street network, regardless of how far away it is. In this paper, we propose a centrality model that overcomes this counterintuitive idea. More specifically, we extend the APA model by modifying the jumping probabilities so that the random walker is more inclined to jump to a nearby intersection than a distant intersection. We accomplish this using non-local random walks which allow a random walker to jump to any node in the network with probabilities that depend on the distance separating the nodes. To demonstrate the differences between the two models, we present and discuss experimental results for a small ten node graph and a real-world urban street network.</description><identifier>ISSN: 0096-3003</identifier><identifier>EISSN: 1873-5649</identifier><identifier>DOI: 10.1016/j.amc.2023.127888</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Adapted PageRank Algorithm ; Centrality measures ; Non-local random walks ; PageRank ; Urban street networks</subject><ispartof>Applied mathematics and computation, 2023-06, Vol.446, p.127888, Article 127888</ispartof><rights>2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23</citedby><cites>FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0096300323000577$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3428,3563,27923,27924,45971,46002</link.rule.ids></links><search><creatorcontrib>Bowater, David</creatorcontrib><creatorcontrib>Stefanakis, Emmanuel</creatorcontrib><title>Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks</title><title>Applied mathematics and computation</title><description>•A centrality model for urban street networks is proposed.•Non-local random walks are used to extend the Adapted PageRank Algorithm model.•The non-local movement of the random walker is more intuitive. In the urban street network domain, there is growing interest in extending conventional centrality measures to incorporate node-specific information (such as georeferenced socioeconomic data) in order to help identify important locations in an urban environment. One such centrality measure that is gaining attention is the Adapted PageRank Algorithm (APA) model. However, a fundamental concern with the APA model is the notion of teleportation because it means the random walker is equally likely to jump or ‘teleport’ to any intersection (node) in the street network, regardless of how far away it is. In this paper, we propose a centrality model that overcomes this counterintuitive idea. More specifically, we extend the APA model by modifying the jumping probabilities so that the random walker is more inclined to jump to a nearby intersection than a distant intersection. We accomplish this using non-local random walks which allow a random walker to jump to any node in the network with probabilities that depend on the distance separating the nodes. To demonstrate the differences between the two models, we present and discuss experimental results for a small ten node graph and a real-world urban street network.</description><subject>Adapted PageRank Algorithm</subject><subject>Centrality measures</subject><subject>Non-local random walks</subject><subject>PageRank</subject><subject>Urban street networks</subject><issn>0096-3003</issn><issn>1873-5649</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9kM1KAzEURoMoWKsP4C4vMGMymclkcFVK_YGCIroOt8mddtqZpCSptW9vS127-lbn8HEIuecs54zLh3UOg8kLVoicF7VS6oKMuKpFVsmyuSQjxhqZCcbENbmJcc0YqyUvR2Q7-0nobOeWNK2QTixsE1r6Dkv8ALehk37pQ5dWAzXoUoC-Swc6eIs9bX2gu7AAR2MKiIk6THsfNpHu4snnvMt6b6CnAZz1A91Dv4m35KqFPuLd347J19Psc_qSzd-eX6eTeWaKpk6ZrKVQbV1hswBbNqYpUGELojKysapSpZXAwZTAGxRS1IKVoFhlaoaVFVCIMeFnrwk-xoCt3oZugHDQnOlTMr3Wx2T6lEyfkx2ZxzODx2PfHQYdTYfOoO0CmqSt7_6hfwElmnYN</recordid><startdate>20230601</startdate><enddate>20230601</enddate><creator>Bowater, David</creator><creator>Stefanakis, Emmanuel</creator><general>Elsevier Inc</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230601</creationdate><title>Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks</title><author>Bowater, David ; Stefanakis, Emmanuel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Adapted PageRank Algorithm</topic><topic>Centrality measures</topic><topic>Non-local random walks</topic><topic>PageRank</topic><topic>Urban street networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bowater, David</creatorcontrib><creatorcontrib>Stefanakis, Emmanuel</creatorcontrib><collection>CrossRef</collection><jtitle>Applied mathematics and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bowater, David</au><au>Stefanakis, Emmanuel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks</atitle><jtitle>Applied mathematics and computation</jtitle><date>2023-06-01</date><risdate>2023</risdate><volume>446</volume><spage>127888</spage><pages>127888-</pages><artnum>127888</artnum><issn>0096-3003</issn><eissn>1873-5649</eissn><abstract>•A centrality model for urban street networks is proposed.•Non-local random walks are used to extend the Adapted PageRank Algorithm model.•The non-local movement of the random walker is more intuitive. In the urban street network domain, there is growing interest in extending conventional centrality measures to incorporate node-specific information (such as georeferenced socioeconomic data) in order to help identify important locations in an urban environment. One such centrality measure that is gaining attention is the Adapted PageRank Algorithm (APA) model. However, a fundamental concern with the APA model is the notion of teleportation because it means the random walker is equally likely to jump or ‘teleport’ to any intersection (node) in the street network, regardless of how far away it is. In this paper, we propose a centrality model that overcomes this counterintuitive idea. More specifically, we extend the APA model by modifying the jumping probabilities so that the random walker is more inclined to jump to a nearby intersection than a distant intersection. We accomplish this using non-local random walks which allow a random walker to jump to any node in the network with probabilities that depend on the distance separating the nodes. To demonstrate the differences between the two models, we present and discuss experimental results for a small ten node graph and a real-world urban street network.</abstract><pub>Elsevier Inc</pub><doi>10.1016/j.amc.2023.127888</doi></addata></record>
fulltext fulltext
identifier ISSN: 0096-3003
ispartof Applied mathematics and computation, 2023-06, Vol.446, p.127888, Article 127888
issn 0096-3003
1873-5649
language eng
recordid cdi_crossref_primary_10_1016_j_amc_2023_127888
source Elsevier; Backfile Package - Computer Science (Legacy) [YCS]; Backfile Package - Mathematics (Legacy) [YMT]
subjects Adapted PageRank Algorithm
Centrality measures
Non-local random walks
PageRank
Urban street networks
title Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T15%3A53%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Extending%20the%20Adapted%20PageRank%20Algorithm%20centrality%20model%20for%20urban%20street%20networks%20using%20non-local%20random%20walks&rft.jtitle=Applied%20mathematics%20and%20computation&rft.au=Bowater,%20David&rft.date=2023-06-01&rft.volume=446&rft.spage=127888&rft.pages=127888-&rft.artnum=127888&rft.issn=0096-3003&rft.eissn=1873-5649&rft_id=info:doi/10.1016/j.amc.2023.127888&rft_dat=%3Celsevier_cross%3ES0096300323000577%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c297t-67638f75e9bad49c92e8efa35c69d8584d6a1ac4a19e3637304a805c70e5d3a23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true