Identification of city motifs: a method based on modularity and similarity between hierarchical features of urban networks

IF 2.6 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
G. Domingues, Eric K. Tokuda, L. da F Costa
{"title":"Identification of city motifs: a method based on modularity and similarity between hierarchical features of urban networks","authors":"G. Domingues, Eric K. Tokuda, L. da F Costa","doi":"10.1088/2632-072X/ac9446","DOIUrl":null,"url":null,"abstract":"Several natural and theoretical networks can be broken down into smaller portions, henceforth called neighborhoods. The more frequent of these can then be understood as motifs of the network, being therefore important for better characterizing and understanding of its overall structure. Several developments in network science have relied on this interesting concept, with ample applications in areas including systems biology, computational neuroscience, economy and ecology. The present work aims at reporting a methodology capable of automatically identifying motifs respective to streets networks, i.e. graphs obtained from city plans by considering street junctions and terminations as nodes while the links are defined by the streets. Interesting results are described, including the identification of nine characteristic motifs, which have been obtained by three important considerations: (i) adoption of five hierarchical measurements to locally characterize the neighborhoods of nodes in the streets networks; (ii) adoption of an effective coincidence similarity methodology for translating datasets into networks; and (iii) definition of the motifs in statistical terms by using community finding methodology. The nine identified motifs are characterized and discussed from several perspectives, including their mutual similarity, visualization, histograms of measurements, and geographical adjacency in the original cities. Also presented is the analysis of the effect of the adopted features on the obtained networks as well as a simple supervised learning method capable of assigning reference motifs to cities.","PeriodicalId":53211,"journal":{"name":"Journal of Physics Complexity","volume":" ","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2632-072X/ac9446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 2

Abstract

Several natural and theoretical networks can be broken down into smaller portions, henceforth called neighborhoods. The more frequent of these can then be understood as motifs of the network, being therefore important for better characterizing and understanding of its overall structure. Several developments in network science have relied on this interesting concept, with ample applications in areas including systems biology, computational neuroscience, economy and ecology. The present work aims at reporting a methodology capable of automatically identifying motifs respective to streets networks, i.e. graphs obtained from city plans by considering street junctions and terminations as nodes while the links are defined by the streets. Interesting results are described, including the identification of nine characteristic motifs, which have been obtained by three important considerations: (i) adoption of five hierarchical measurements to locally characterize the neighborhoods of nodes in the streets networks; (ii) adoption of an effective coincidence similarity methodology for translating datasets into networks; and (iii) definition of the motifs in statistical terms by using community finding methodology. The nine identified motifs are characterized and discussed from several perspectives, including their mutual similarity, visualization, histograms of measurements, and geographical adjacency in the original cities. Also presented is the analysis of the effect of the adopted features on the obtained networks as well as a simple supervised learning method capable of assigning reference motifs to cities.
城市主题识别:一种基于模块化和城市网络层次特征相似性的方法
一些自然的和理论上的网络可以被分解成更小的部分,因此被称为邻域。更频繁的这些可以被理解为网络的主题,因此对更好地表征和理解其整体结构很重要。网络科学的一些发展都依赖于这个有趣的概念,在系统生物学、计算神经科学、经济学和生态学等领域都有广泛的应用。目前的工作旨在报告一种能够自动识别与街道网络相关的主题的方法,即从城市规划中获得的图形,通过将街道交叉点和终点视为节点,而链接由街道定义。本文描述了一些有趣的结果,包括九个特征基元的识别,这些特征基元是通过三个重要的考虑因素获得的:(i)采用五种分层测量来局部表征街道网络中节点的邻域;(ii)采用有效的巧合相似度方法将数据集转换为网络;(3)利用群落调查方法从统计学角度定义母题。本文从相互相似性、可视化、直方图测量和原始城市的地理邻接性等几个方面对这九个已确定的图案进行了特征化和讨论。本文还分析了所采用的特征对所获得的网络的影响,以及一种能够为城市分配参考主题的简单监督学习方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Physics Complexity
Journal of Physics Complexity Computer Science-Information Systems
CiteScore
4.30
自引率
11.10%
发文量
45
审稿时长
14 weeks
×
引用
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学术官方微信