Li Yuanbiao, Wang Tingyu, Zhao Yu, Yang Bo
Data Science Research Center, Kunming University of Science and Technology, Kunming 650500, China.
Faculty of Science, Kunming University of Science and Technology, Kunming 650500, China.
Entropy (Basel). 2025 Jun 11;27(6):618. doi: 10.3390/e27060618.
A graph's minimum cycle basis is defined as the smallest collection of cycles that exhibit linear independence in the cycle space, serving as fundamental building blocks for constructing any cyclic structure within the graph. These bases are useful in various contexts, including the intricate analysis of electrical networks, structural engineering endeavors, chemical processes, and surface reconstruction techniques, etc. This study investigates the urban road networks of six Chinese cities to analyze their topological features, node centrality, and robustness (resilience to traffic disruptions) using motif analysis and minimum cycle bases methodologies. Some interesting conclusions are obtained: the frequency of motifs containing cycles exceeds that of random networks with equivalent degree sequences; the frequency distribution of minimum cycle lengths and surface areas obeys the power-law distribution. The cycle contribution rate is introduced to investigate the centrality of nodes within road networks, and has a significant impact on the total number of cycles in the robustness analysis. Finally, we construct two types of cycle-based dual networks for urban road networks by representing cycles as nodes and establishing edges between two cycles sharing a common node and edge, respectively. The results show that cycle-based dual networks exhibit small-world and scale-free properties. The research facilitates a comprehensive understanding of the cycle structure characteristics in urban road networks, thereby providing a theoretical foundation for both subsequent modeling endeavors of transportation networks and optimization strategies for existing road infrastructure.
图的最小圈基被定义为在圈空间中呈现线性独立的最小圈集合,它是构建图中任何循环结构的基本组成部分。这些基在各种情况下都很有用,包括对电气网络的精细分析、结构工程实践、化学过程以及曲面重建技术等。本研究调查了中国六个城市的城市道路网络,使用基序分析和最小圈基方法来分析它们的拓扑特征、节点中心性和鲁棒性(对交通中断的恢复能力)。得到了一些有趣的结论:包含圈的基序的频率超过了具有等效度序列的随机网络;最小圈长度和表面积的频率分布服从幂律分布。引入圈贡献率来研究道路网络中节点的中心性,并且在鲁棒性分析中对圈的总数有显著影响。最后,通过将圈表示为节点,并分别在共享公共节点和边的两个圈之间建立边,为城市道路网络构建了两种基于圈的对偶网络。结果表明,基于圈的对偶网络具有小世界和无标度特性。该研究有助于全面理解城市道路网络中的圈结构特征,从而为后续交通网络建模工作和现有道路基础设施的优化策略提供理论基础。