【24h】

Searching for 2D Spatial Network Holes

机译:搜索二维空间网络孔

获取原文
获取原文并翻译 | 示例

摘要

Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this work, a variety of different scaling laws have been discovered. However, these aspatial laws, stemming from graph theory, often do not apply to spatial networks. When searching for network holes, results from graph theory frequently do not correlate with 2D spatial holes that enforce planarity. We present a general approach for finding holes in a 2D spatial network, and in particular for a network representing street centrelines of an area in Washington, D.C. This methodology involves finding graph holes that can be restricted to 2D spatial holes by examining topological relationships between network features. These spatial network holes gain significance as the number of edges encompassing the hole, and the length of these edges increase. For this reason, our approach is designed to classify these holes into different sets based on the number of edges found and the length of those edges. The results of this application provide valuable insights in the nature of the network, highlighting areas that we know from experience are poorly connected and thus suffer from low accessibility.
机译:涉及不同形式的网络(例如Internet网络,社交网络和蜂窝网络)的研究已日益成为重要的研究领域。通过这项工作,发现了各种不同的缩放定律。但是,这些源自图论的空间定律通常不适用于空间网络。搜索网络孔时,图论的结果通常与强制执行平面性的2D空间孔不相关。我们提出了一种在2D空间网络中查找孔的通用方法,尤其是对于表示华盛顿特区某个区域的街道中心线的网络而言。此方法包括通过检查网络之间的拓扑关系来查找可以限制为2D空间孔的图孔特征。这些空间网络孔随着包围孔的边的数量而变得越来越重要,并且这些边的长度增加。因此,我们的方法旨在根据找到的边的数量和这些边的长度将这些孔分为不同的组。该应用程序的结果提供了有关网络性质的有价值的见解,突出了我们从经验中知道的领域之间的联系不畅,因此可访问性较低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号