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.
The cross-entropy loss function is widely used in machine learning to measure the performance of a classification model. Interestingly, our study find that this function has scaling behavior when deep neural networks are used to investigate percolation models. Specifically, we use convolutional neural networks with different pooling methods to study the site percolation on square lattices under two labeling methods (labeling based on spanning cluster and the exact solution of the critical point). Subsequently, graph convolutional neural networks (GCNs) with different pooling methods are utilized to do the same kind of experiment. Finally, the GCN with different pooling methods is used to study the percolation phase transitions on the Erdős-Rényi (ER) networks under labeling based on the critical point. The reliability of the classifiers is detected by the values of the critical point p_{c} and critical exponent ν which are obtained by the scaling behaviors of the percolation probability. The results demonstrate that the scaling exponent of cross-entropy ψ/ν depends on the labeling and pooling methods. Labeling based on critical points, which is equivalent to labeling based on spanning clusters in infinite systems, can be used to investigate the critical behaviors in finite systems. SAGPooling-Mean is an effective pooling method to study the scaling behavior of cross-entropy loss on two-dimensional square lattices and ER networks.
16 November 2024 in The European Physical Journal B