{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:36:15Z","timestamp":1772120175177,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NExTWORKx, a collaboration between TU Delft and KPN on future telecommunication networks"},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP 21H04595"],"award-info":[{"award-number":["JP 21H04595"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["KICH1.VE03.21.008"],"award-info":[{"award-number":["KICH1.VE03.21.008"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"Abstract<\/jats:title>\n \n Temporal networks, whose network topology changes over time, are used to represent, e.g., opportunistic mobile networks, vehicle networks, and social contact networks, where two mobile devices (autos or individuals) are connected only when they are close to (interact with) each other. Such networks facilitate the transfer of information. In this paper, we address the problem of navigation on temporal networks: how to route a traffic demand from a source\n s<\/jats:italic>\n to a destination\n d<\/jats:italic>\n at time\n \n \n $$t_s$$<\/jats:tex-math>\n \n \n t<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , based on the network observed before\n \n \n $$t_s$$<\/jats:tex-math>\n \n \n t<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ? Whenever the node hosting the information has a contact or interacts with another node, the routing method has to decide whether the information should be forwarded to the contacted node or not. Once the information is forwarded, the contacted node becomes the only node hosting the information. Firstly, we introduce a framework of designing navigation algorithms, in which a distance metric is defined and computed between any node to the target\n d<\/jats:italic>\n based on the network observed before\n \n \n $$t_s$$<\/jats:tex-math>\n \n \n t<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Whenever a hosting node has a contact, it forwards the information to the contacted node if the contacted node is closer to the target than the hosting node according to the distance metric. Secondly, we propose systematically distance metrics of a node pair in the temporal network observed, that capture different network properties of a node pair. Thirdly, these metrics or routing strategies are evaluated in empirical contact networks, from the perspective of the time duration of the routing and the probability that the destination can be reached. Their performance is further explained via the correlation between distance metrics and the stability of each metric in ranking nodes\u2019 distance to a target node. This work may serve as inspiration for evaluating and redesigning these strategies in other types of networks beyond physical contact networks.\n <\/jats:p>","DOI":"10.1007\/s41109-025-00697-9","type":"journal-article","created":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T18:13:47Z","timestamp":1742494427000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Navigation on temporal networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Omar F.","family":"Robledo","sequence":"first","affiliation":[]},{"given":"Petter","family":"Holme","sequence":"additional","affiliation":[]},{"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,20]]},"reference":[{"issue":"1","key":"697_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1038\/nphys1130","volume":"5","author":"M Bogu\u00f1\u00e1","year":"2009","unstructured":"Bogu\u00f1\u00e1 M, Krioukov D, Claffy KC (2009) Navigability of complex networks. Nat Phys 5(1):74\u201380. https:\/\/doi.org\/10.1038\/nphys1130","journal-title":"Nat Phys"},{"key":"697_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.anbehav.2019.09.011","volume":"157","author":"V Gelardi","year":"2019","unstructured":"Gelardi V, Fagot J, Barrat A, Claidi\u00e8re N (2019) Detecting social (in)stability in primates from their temporal co-presence network. Anim Behav 157:239\u2013254. https:\/\/doi.org\/10.1016\/j.anbehav.2019.09.011","journal-title":"Anim Behav"},{"issue":"1","key":"697_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois M, Barrat A (2018) Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci 7(1):11. https:\/\/doi.org\/10.1140\/epjds\/s13688-018-0140-1","journal-title":"EPJ Data Sci"},{"issue":"3","key":"697_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125. https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001","journal-title":"Phys Rep"},{"issue":"1","key":"697_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella L, Stehl\u00e9 J, Barrat A, Cattuto C, Pinton J, Van den Broeck W (2011) What\u2019s in a crowd? analysis of face-to-face behavioral networks. J Theor Biol 271(1):166\u2013180. https:\/\/doi.org\/10.1016\/j.jtbi.2010.11.033","journal-title":"J Theor Biol"},{"issue":"1\u20132","key":"697_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\u20132):81\u201393. https:\/\/doi.org\/10.1093\/biomet\/30.1-2.81","journal-title":"Biometrika"},{"issue":"6798","key":"697_CR7","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg JM (2000) Navigation in a small world. Nature 406(6798):845\u2013845. https:\/\/doi.org\/10.1038\/35022643","journal-title":"Nature"},{"issue":"1","key":"697_CR8","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1038\/s41598-017-02910-x","volume":"7","author":"K-K Kleineberg","year":"2017","unstructured":"Kleineberg K-K, Helbing D (2017) Collective navigation of complex networks: participatory greedy routing. Sci Rep 7(1):2897. https:\/\/doi.org\/10.1038\/s41598-017-02910-x","journal-title":"Sci Rep"},{"key":"697_CR9","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11841036_44","volume-title":"Algorithms\u2013ESA 2006","author":"R Kumar","year":"2006","unstructured":"Kumar R, Liben-Nowell D, Tomkins A (2006) Navigating low-dimensional and hierarchical population networks. In: Azar Y, Erlebach T (eds) Algorithms\u2013ESA 2006. Springer, Berlin, pp 480\u2013491. https:\/\/doi.org\/10.1007\/11841036_44"},{"key":"697_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.physa.2018.09.036","volume":"513","author":"SH Lee","year":"2019","unstructured":"Lee SH, Holme P (2019) Navigating temporal networks. Phys A Stat Mech Appl 513:288\u2013296. https:\/\/doi.org\/10.1016\/j.physa.2018.09.036","journal-title":"Phys A Stat Mech Appl"},{"issue":"9","key":"697_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea R, Fournet J, Barrat A (2015) Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLOS ONE 10(9):1\u201326. https:\/\/doi.org\/10.1371\/journal.pone.0136497","journal-title":"PLOS ONE"},{"issue":"6136","key":"697_CR12","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1126\/science.1234316","volume":"340","author":"DP Mersch","year":"2013","unstructured":"Mersch DP, Crespi A, Keller L (2013) Tracking individuals shows spatial fidelity is a key regulator of ant social organization. Science 340(6136):1090\u20131093. https:\/\/doi.org\/10.1126\/science.1234316","journal-title":"Science"},{"key":"697_CR13","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2012.744247","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: An Introduction. Oxford University Press, Oxford. https:\/\/doi.org\/10.1080\/0022250X.2012.744247"},{"issue":"1","key":"697_CR14","doi-asserted-by":"publisher","first-page":"15054","DOI":"10.1038\/s41598-017-15041-0","volume":"7","author":"E Ortiz","year":"2017","unstructured":"Ortiz E, Starnini M, Serrano M\u00c1 (2017) Navigability of temporal networks in hyperbolic space. Sci Rep 7(1):15054. https:\/\/doi.org\/10.1038\/s41598-017-15041-0","journal-title":"Sci Rep"},{"key":"697_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.016105","volume":"84","author":"RK Pan","year":"2011","unstructured":"Pan RK, Saram\u00e4ki J (2011) Path lengths, correlations, and centrality in temporal networks. Phys Rev E 84:016105. https:\/\/doi.org\/10.1103\/PhysRevE.84.016105","journal-title":"Phys Rev E"},{"issue":"35","key":"697_CR16","doi-asserted-by":"publisher","first-page":"12758","DOI":"10.1073\/pnas.0800497105","volume":"105","author":"\u00d6 \u015eim\u015fek","year":"2008","unstructured":"\u015eim\u015fek \u00d6, Jensen D (2008) Navigating networks by using homophily and degree. Proc Natl Acad Sci 105(35):12758\u201312762. https:\/\/doi.org\/10.1073\/pnas.0800497105","journal-title":"Proc Natl Acad Sci"},{"issue":"9","key":"697_CR17","doi-asserted-by":"publisher","first-page":"73970","DOI":"10.1371\/journal.pone.0073970","volume":"8","author":"P Vanhems","year":"2013","unstructured":"Vanhems P, Barrat A, Cattuto C, Pinton J-F, Khanafer N, R\u00e9gis C, Kim B-A, Comte B, Voirin N (2013) Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PLoS ONE 8(9):73970. https:\/\/doi.org\/10.1371\/journal.pone.0073970","journal-title":"PLoS ONE"},{"key":"697_CR18","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-031-21131-7_51","volume-title":"Complex Networks and Their Applications XI","author":"L Zou","year":"2023","unstructured":"Zou L, Wang A, Wang H (2023) Memory based temporal network prediction. In: Cherifi H, Mantegna RN, Rocha LM, Cherifi C, Micciche S (eds) Complex Networks and Their Applications XI. Springer, Cham, pp 661\u2013673. https:\/\/doi.org\/10.1007\/978-3-031-21131-7_51"},{"key":"697_CR19","doi-asserted-by":"publisher","unstructured":"Fall K (2003) A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications. SIGCOMM\u201903, pp. 27\u201334. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/863955.863960","DOI":"10.1145\/863955.863960"},{"key":"697_CR20","doi-asserted-by":"publisher","unstructured":"Papadopoulos F, Krioukov D, Boguna M, Vahdat A (2010) Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: 2010 Proceedings IEEE INFOCOM, pp 1\u20139. https:\/\/doi.org\/10.1109\/INFCOM.2010.5462131","DOI":"10.1109\/INFCOM.2010.5462131"},{"key":"697_CR21","doi-asserted-by":"publisher","unstructured":"Yan X, Sporns O, Avena-Koenigsberger A (2020) Efficient network navigation with partial information. In: 2020 IEEE international conference on networking, sensing and control (ICNSC), pp 1\u20136. https:\/\/doi.org\/10.1109\/ICNSC48988.2020.9238119","DOI":"10.1109\/ICNSC48988.2020.9238119"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00697-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00697-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00697-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T18:13:51Z","timestamp":1742494431000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00697-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,20]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["697"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00697-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-5179404\/v1","asserted-by":"object"}]},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,20]]},"assertion":[{"value":"30 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"7"}}