乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:51:40Z","timestamp":1740171100013,"version":"3.37.3"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:00:00Z","timestamp":1687478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,23]]},"abstract":"Abstract<\/jats:title>\n PageRank is a popular measure of centrality that is often applied to rank nodes in real-world networks. However, in many cases, the notion of teleportation is counterintuitive because it implies that whatever is moving around the network will jump or \u2018teleport\u2019 directly from one node to any other, without considering how far apart the nodes are. To overcome this issue, we propose here a general measure of PageRank centrality whereby the teleportation probabilities depend, in some way, on the distance separating the nodes. We accomplish this by drawing upon recent advances in non-local random walks, which allow the proposed measure to be tailored for various real-world networks and applications. To illustrate the flexibility of the proposed measure and to demonstrate how it differs from PageRank centrality, we present and discuss experimental results for a selection of real-world spatial and social networks, including an air transportation network, a collaboration network and an urban street network.<\/jats:p>","DOI":"10.1093\/comnet\/cnad024","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T13:15:54Z","timestamp":1688476554000},"source":"Crossref","is-referenced-by-count":2,"title":["PageRank centrality with non-local random walk-based teleportation"],"prefix":"10.1093","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3950-8153","authenticated-orcid":false,"given":"David","family":"Bowater","sequence":"first","affiliation":[{"name":"Department of Geomatics Engineering, University of Calgary , 2500 University Drive NW , Calgary, Alberta T2N 1N4, Canada"}]},{"given":"Emmanuel","family":"Stefanakis","sequence":"additional","affiliation":[{"name":"Department of Geomatics Engineering, University of Calgary , 2500 University Drive NW , Calgary, Alberta T2N 1N4, Canada"}]}],"member":"286","published-online":{"date-parts":[[2023,7,4]]},"reference":[{"key":"2023070410535874100_cnad024-B1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"Newman","year":"2018"},{"volume-title":"The Structure of Complex Networks: Theory and Applications","year":"2016","author":"Estrada","key":"2023070410535874100_cnad024-B2"},{"key":"2023070410535874100_cnad024-B3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual Web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst"},{"volume-title":"Technical Report","year":"1999","author":"Page","key":"2023070410535874100_cnad024-B4"},{"key":"2023070410535874100_cnad024-B5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"Langville","year":"2006"},{"key":"2023070410535874100_cnad024-B6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/140976649","article-title":"PageRank beyond the web","volume":"57","author":"Gleich","year":"2015","journal-title":"SIAM Rev"},{"key":"2023070410535874100_cnad024-B7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2010.11.002","article-title":"Spatial networks","volume":"499","author":"Barth\u00e9lemy","year":"2011","journal-title":"Phys. Rep"},{"key":"2023070410535874100_cnad024-B8","first-page":"1679","article-title":"AttractRank: district attraction ranking analysis based on taxi big data","volume":"17","author":"Xie","year":"2020","journal-title":"IEEE Trans. Ind. Informatics"},{"key":"2023070410535874100_cnad024-B9","first-page":"127888","article-title":"Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks","volume":"446","author":"Bowater","year":"2023","journal-title":"Appl. Math. Comput"},{"key":"2023070410535874100_cnad024-B10","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1093\/comnet\/cnx043","article-title":"Random multi-hopper model: super-fast random walks on graphs","volume":"6","author":"Estrada","year":"2018","journal-title":"J. Complex Netw"},{"key":"2023070410535874100_cnad024-B11","doi-asserted-by":"crossref","first-page":"056110","DOI":"10.1103\/PhysRevE.86.056110","article-title":"Long-range navigation on complex networks using L\u00e9vy random walks","volume":"86","author":"Riascos","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2023070410535874100_cnad024-B12","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1016\/j.laa.2011.11.032","article-title":"Path Laplacian matrices: introduction and application to the analysis of consensus in networks","volume":"436","author":"Estrada","year":"2012","journal-title":"Linear Algebra Appl"},{"key":"2023070410535874100_cnad024-B13","first-page":"1","article-title":"Random walks on weighted networks: a survey of local and non-local dynamics","volume":"9","author":"Riascos","year":"2021","journal-title":"J. Complex Netw"},{"key":"2023070410535874100_cnad024-B14","doi-asserted-by":"crossref","first-page":"073049","DOI":"10.1088\/1367-2630\/ac14ac","article-title":"Path Laplacians versus fractional Laplacians as nonlocal operators on networks","volume":"23","author":"Estrada","year":"2021","journal-title":"New J. Phys"},{"key":"2023070410535874100_cnad024-B15","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behav. Ecol. Sociobiol"},{"key":"2023070410535874100_cnad024-B16","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Phys. Rev. E"},{"year":"2006","author":"Batagelj","key":"2023070410535874100_cnad024-B17"},{"key":"2023070410535874100_cnad024-B18","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","article-title":"OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks","volume":"65","author":"Boeing","year":"2017","journal-title":"Comput. Environ. Urban Syst"},{"key":"2023070410535874100_cnad024-B19","doi-asserted-by":"crossref","first-page":"030103","DOI":"10.1103\/PhysRevE.83.030103","article-title":"Maximal-entropy random walks in complex networks with limited information","volume":"83","author":"Sinatra","year":"2011","journal-title":"Phys. Rev. E"},{"key":"2023070410535874100_cnad024-B20","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.physa.2013.11.004","article-title":"L\u00e9vy walk in complex networks: an efficient way of mobility","volume":"396","author":"Zhao","year":"2014","journal-title":"Phys. A Stat. Mech. Its Appl"},{"key":"2023070410535874100_cnad024-B21","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1068\/b32045","article-title":"The network analysis of urban streets: a primal approach","volume":"33","author":"Porta","year":"2006","journal-title":"Environ. Plan. B Plan. Des"},{"key":"2023070410535874100_cnad024-B22","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1068\/b34098","article-title":"Street centrality and densities of retail and services in Bologna, Italy","volume":"36","author":"Porta","year":"2009","journal-title":"Environ. Plan. B Plan. Des"},{"key":"2023070410535874100_cnad024-B23","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1140\/epjb\/e2006-00046-8","article-title":"The spatial structure of networks","volume":"49","author":"Gastner","year":"2006","journal-title":"Eur. Phys. J. B"},{"key":"2023070410535874100_cnad024-B24","doi-asserted-by":"crossref","first-page":"e0184532","DOI":"10.1371\/journal.pone.0184532","article-title":"Emergence of encounter networks due to human mobility","volume":"12","author":"Riascos","year":"2017","journal-title":"PLoS One"},{"key":"2023070410535874100_cnad024-B25","doi-asserted-by":"crossref","first-page":"4022","DOI":"10.1038\/s41598-020-60875-w","article-title":"Networks and long-range mobility in cities: a study of more than one billion taxi trips in New York City","volume":"10","author":"Riascos","year":"2020","journal-title":"Sci. Rep"},{"key":"2023070410535874100_cnad024-B26","doi-asserted-by":"crossref","first-page":"e0213106","DOI":"10.1371\/journal.pone.0213106","article-title":"Human mobility in bike-sharing systems: structure of local and non-local dynamics","volume":"14","author":"Loaiza-Monsalve","year":"2019","journal-title":"PLoS One"},{"key":"2023070410535874100_cnad024-B27","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1080\/15427951.2013.865686","article-title":"Axioms for centrality","volume":"10","author":"Boldi","year":"2014","journal-title":"Internet Math"},{"key":"2023070410535874100_cnad024-B28","first-page":"2186","article-title":"An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector","volume":"219","author":"Agryzkov","year":"2012","journal-title":"Appl. Math. Comput"},{"key":"2023070410535874100_cnad024-B29","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1140\/epjst\/e2016-60274-8","article-title":"The new challenges of multiplex networks: measures and models","volume":"226","author":"Battiston","year":"2017","journal-title":"Eur. Phys. J. Spec. Top"},{"key":"2023070410535874100_cnad024-B30","doi-asserted-by":"crossref","first-page":"e78293","DOI":"10.1371\/journal.pone.0078293","article-title":"Multiplex PageRank","volume":"8","author":"Halu","year":"2013","journal-title":"PLoS One"},{"key":"2023070410535874100_cnad024-B31","doi-asserted-by":"crossref","first-page":"065301","DOI":"10.1063\/1.4952955","article-title":"A biplex approach to PageRank centrality: from classic to multiplex networks","volume":"26","author":"Pedroche","year":"2016","journal-title":"Chaos"},{"key":"2023070410535874100_cnad024-B32","doi-asserted-by":"crossref","first-page":"12530","DOI":"10.1109\/ACCESS.2018.2807778","article-title":"Novel multiplex PageRank in multilayer networks","volume":"6","author":"Tu","year":"2018","journal-title":"IEEE Access"},{"key":"2023070410535874100_cnad024-B33","doi-asserted-by":"crossref","first-page":"284","DOI":"10.3390\/sym11020284","article-title":"Extending the adapted PageRank algorithm centrality to multiplex networks with data using the PageRank two-layer approach","volume":"11","author":"Agryzkov","year":"2019","journal-title":"Symmetry (Basel"},{"key":"2023070410535874100_cnad024-B34","doi-asserted-by":"crossref","first-page":"062147","DOI":"10.1103\/PhysRevE.101.062147","article-title":"Random walks on networks with stochastic resetting","volume":"101","author":"Riascos","year":"2020","journal-title":"Phys. Rev. E"},{"key":"2023070410535874100_cnad024-B35","doi-asserted-by":"crossref","first-page":"062126","DOI":"10.1103\/PhysRevE.103.062126","article-title":"Diffusive transport on networks with stochastic resetting to multiple nodes","volume":"103","author":"Gonz\u00e1lez","year":"2021","journal-title":"Phys. Rev. E"},{"key":"2023070410535874100_cnad024-B36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3390\/e25020293","article-title":"Random walks on networks with centrality-based stochastic resetting","volume":"25","author":"Zelenkovski","year":"2023","journal-title":"Entropy"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/4\/cnad024\/50794896\/cnad024.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/4\/cnad024\/50794896\/cnad024.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T13:16:24Z","timestamp":1688476584000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnad024\/7218770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,23]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,6,23]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnad024","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2023,8,1]]},"published":{"date-parts":[[2023,6,23]]}}}