Shanshan Wang, Henrik M. Bette, Michael Schreckenberg, Thomas Guhr
{"title":"How much longer do you have to drive than the crow has to fly?","authors":"Shanshan Wang, Henrik M. Bette, Michael Schreckenberg, Thomas Guhr","doi":"10.1038/s44260-024-00023-x","DOIUrl":null,"url":null,"abstract":"When travelling by car from one location to another, our route is constrained by the road network. The network distance between the two locations is generally longer than the geodetic distance as the crow flies. We report a systematic relation between the statistical properties of these two distances. Empirically, we find a robust scaling between network and geodetic distance distributions for a variety of large motorway networks. A simple consequence is that we typically have to drive 1.3 ± 0.1 times longer than the crow flies. This scaling is not present in standard random networks; rather, it requires non-random adjacency. We develop a set of rules to build a realistic motorway network, also consistent with the above scaling. We hypothesise that the scaling reflects a compromise between two societal needs: high efficiency and accessibility on the one hand, and limitation of costs and other burdens on the other.","PeriodicalId":501707,"journal":{"name":"npj Complexity","volume":" ","pages":"1-9"},"PeriodicalIF":0.0000,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.nature.com/articles/s44260-024-00023-x.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"npj Complexity","FirstCategoryId":"1085","ListUrlMain":"https://www.nature.com/articles/s44260-024-00023-x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

开车从一个地点前往另一个地点时,我们的路线受到公路网的限制。两地之间的网络距离通常比乌鸦飞过的大地测量距离要长。我们报告了这两种距离的统计特性之间的系统关系。根据经验,我们发现在各种大型高速公路网络中,网络距离分布与大地测量距离分布之间存在稳健的比例关系。一个简单的结果是,我们通常要比乌鸦飞的距离长 1.3 ± 0.1 倍。标准的随机网络中不存在这种比例关系;相反,它需要非随机的邻接关系。我们制定了一套规则来构建一个现实的高速公路网络,该网络也符合上述缩放比例。我们假设,这种缩放反映了两种社会需求之间的折衷:一方面是高效率和可达性,另一方面是限制成本和其他负担。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

How much longer do you have to drive than the crow has to fly?

How much longer do you have to drive than the crow has to fly?
When travelling by car from one location to another, our route is constrained by the road network. The network distance between the two locations is generally longer than the geodetic distance as the crow flies. We report a systematic relation between the statistical properties of these two distances. Empirically, we find a robust scaling between network and geodetic distance distributions for a variety of large motorway networks. A simple consequence is that we typically have to drive 1.3 ± 0.1 times longer than the crow flies. This scaling is not present in standard random networks; rather, it requires non-random adjacency. We develop a set of rules to build a realistic motorway network, also consistent with the above scaling. We hypothesise that the scaling reflects a compromise between two societal needs: high efficiency and accessibility on the one hand, and limitation of costs and other burdens on the other.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信