Sensitivity to network perturbations in the Randomized Shortest Paths framework: theory and applications in ecological connectivity

Ilkka Kivimäki, B. van Moorter, M. Saerens
{"title":"Sensitivity to network perturbations in the Randomized Shortest Paths framework: theory and applications in ecological connectivity","authors":"Ilkka Kivimäki, B. van Moorter, M. Saerens","doi":"10.1088/2632-072x/ad4841","DOIUrl":null,"url":null,"abstract":"\n The Randomized Shortest Paths (RSP) framework, developed for network analysis, extends traditional proximity and distance measures between two nodes, such as shortest path distance and commute cost distance (related to resistance distance). Consequently, the RSP framework has gained popularity in studies on landscape connectivity within ecology and conservation, where the behavior of animals is neither random nor optimal. In this work, we study how local perturbations in a network affect proximity and distance measures derived from the RSP framework. For this sensitivity analysis, we develop computable expressions for derivatives with respect to weights on the edges or nodes of the network. Interestingly, the sensitivity of expected cost to edge or node features provides a new signed network centrality measure, the negative covariance between edge/node visits and path cost, that can be used for pinpointing strong and weak parts of a network. It is also shown that this quantity can be interpreted as minus the endured expected detour (in terms of cost) when constraining the walk to pass through the node or the edge. Our demonstration of this framework focuses on a migration corridor for wild reindeer (Rangifer rangifer) in Southern Norway. By examining the sensitivity of the expected cost of movement between winter and calving ranges to perturbations in local areas, we have identified priority areas crucial for the conservation of this migration corridor. This innovative approach not only holds great promise for conservation and restoration of migration corridors, but also more generally for connectivity corridors between important areas for biodiversity (e.g. protected areas) and climate adaptation. Furthermore, the derivations and computational methods introduced in this work present fundamental features of the RSP framework. These contributions are expected to be of interest to practitioners applying the framework across various disciplines, ranging from ecology, transport and communication networks to machine learning.","PeriodicalId":516285,"journal":{"name":"Journal of Physics: Complexity","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics: Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2632-072x/ad4841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Randomized Shortest Paths (RSP) framework, developed for network analysis, extends traditional proximity and distance measures between two nodes, such as shortest path distance and commute cost distance (related to resistance distance). Consequently, the RSP framework has gained popularity in studies on landscape connectivity within ecology and conservation, where the behavior of animals is neither random nor optimal. In this work, we study how local perturbations in a network affect proximity and distance measures derived from the RSP framework. For this sensitivity analysis, we develop computable expressions for derivatives with respect to weights on the edges or nodes of the network. Interestingly, the sensitivity of expected cost to edge or node features provides a new signed network centrality measure, the negative covariance between edge/node visits and path cost, that can be used for pinpointing strong and weak parts of a network. It is also shown that this quantity can be interpreted as minus the endured expected detour (in terms of cost) when constraining the walk to pass through the node or the edge. Our demonstration of this framework focuses on a migration corridor for wild reindeer (Rangifer rangifer) in Southern Norway. By examining the sensitivity of the expected cost of movement between winter and calving ranges to perturbations in local areas, we have identified priority areas crucial for the conservation of this migration corridor. This innovative approach not only holds great promise for conservation and restoration of migration corridors, but also more generally for connectivity corridors between important areas for biodiversity (e.g. protected areas) and climate adaptation. Furthermore, the derivations and computational methods introduced in this work present fundamental features of the RSP framework. These contributions are expected to be of interest to practitioners applying the framework across various disciplines, ranging from ecology, transport and communication networks to machine learning.
随机最短路径框架对网络扰动的敏感性:生态连通性的理论与应用
随机最短路径(RSP)框架是为网络分析而开发的,它扩展了两个节点之间的传统邻近度和距离度量,如最短路径距离和通勤成本距离(与阻力距离有关)。因此,RSP 框架在生态学和保护领域的景观连通性研究中越来越受欢迎,因为动物的行为既不是随机的,也不是最优的。在这项工作中,我们研究了网络中的局部扰动如何影响由 RSP 框架推导出的邻近性和距离度量。为了进行这种敏感性分析,我们开发了网络边缘或节点上权重导数的可计算表达式。有趣的是,预期成本对边缘或节点特征的敏感性提供了一种新的签名网络中心性度量,即边缘/节点访问与路径成本之间的负协方差,可用于精确定位网络的强弱部分。研究还表明,当限制步行通过节点或边缘时,这个量可以解释为减去所承受的预期迂回(以成本计)。我们对这一框架的演示侧重于挪威南部野生驯鹿(Rangifer rangifer)的迁徙走廊。通过研究冬季牧场和产仔牧场之间移动的预期成本对局部地区干扰的敏感性,我们确定了对保护这条迁徙走廊至关重要的优先区域。这种创新方法不仅为迁徙走廊的保护和恢复带来了巨大希望,而且还为生物多样性重要区域(如保护区)之间的连接走廊和气候适应带来了更广泛的希望。此外,这项工作中介绍的推导和计算方法呈现了 RSP 框架的基本特征。从生态学、运输和通信网络到机器学习,这些贡献有望引起应用该框架的各学科从业人员的兴趣。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信