Urban Landscape from the Structure of Road Network: A Complexity Perspective

• URL: http://arxiv.org/abs/2201.10949v1
• Date: Wed, 26 Jan 2022 14:03:12 GMT
• Title: Urban Landscape from the Structure of Road Network: A Complexity Perspective
• Authors: Hoai Nguyen Huynh and Muhamad Azfar Bin Ramli
• Abstract summary: We investigate the relationship between the spatial scale of the modelled network entities against the amount of useful information contained within it. We employ an entropy measure from complexity science and information theory to quantify the amount of information residing in each presentation of the network. We find the critical spatial scale to be 85 m, at which the network obtained corresponds very well to the planning boundaries used by the local urban planners.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Spatial road networks have been widely employed to model the structure and connectivity of cities. In such representation, the question of spatial scale of the entities in the network, i.e. what its nodes and edges actually embody in reality, is of particular importance so that redundant information can be identified and eliminated to provide an improved understanding of city structure. To address this, we investigate in this work the relationship between the spatial scale of the modelled network entities against the amount of useful information contained within it. We employ an entropy measure from complexity science and information theory to quantify the amount of information residing in each presentation of the network subject to the spatial scale and show that it peaks at some intermediate scale. The resulting network presentation would allow us to have direct intuition over the hierarchical structure of the urban organisation, which is otherwise not immediately available from the traditional simple road network presentation. We demonstrate our methodology on the Singapore road network and find the critical spatial scale to be 85 m, at which the network obtained corresponds very well to the planning boundaries used by the local urban planners, revealing the essential urban connectivity structure of the city. Furthermore, the complexity measure is also capable of informing the secondary transitions that correspond well to higher-level hierarchical structures associated with larger-scale urban planning boundaries in Singapore.

Related papers

• Learning to Model Graph Structural Information on MLPs via Graph Structure Self-Contrasting [50.181824673039436]
  We propose a Graph Structure Self-Contrasting (GSSC) framework that learns graph structural information without message passing. The proposed framework is based purely on Multi-Layer Perceptrons (MLPs), where the structural information is only implicitly incorporated as prior knowledge. It first applies structural sparsification to remove potentially uninformative or noisy edges in the neighborhood, and then performs structural self-contrasting in the sparsified neighborhood to learn robust node representations.
  arXiv  Detail & Related papers  (2024-09-09T12:56:02Z)
• Defining Neural Network Architecture through Polytope Structures of Dataset [53.512432492636236]
  This paper defines upper and lower bounds for neural network widths, which are informed by the polytope structure of the dataset in question. We develop an algorithm to investigate a converse situation where the polytope structure of a dataset can be inferred from its corresponding trained neural networks. It is established that popular datasets such as MNIST, Fashion-MNIST, and CIFAR10 can be efficiently encapsulated using no more than two polytopes with a small number of faces.
  arXiv  Detail & Related papers  (2024-02-04T08:57:42Z)
• Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
  We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting. AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations. Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
  arXiv  Detail & Related papers  (2023-06-15T14:50:27Z)
• Complexity-aware Large Scale Origin-Destination Network Generation via Diffusion Model [24.582615553841396]
  Origin-Destination(OD) networks provide an estimation of the flow of people from every region to others in the city. We propose to generate the OD network, and design a graph denoising diffusion method to learn the conditional joint probability distribution of the nodes and edges.
  arXiv  Detail & Related papers  (2023-06-08T02:02:55Z)
• Extracting Spatial Interaction Patterns between Urban Road Networks and Mixed Functions [4.198538504785438]
  The more mixed the functions of an area has, the more possible its vitality may be. Our study shows that the higher the degree of the road network structure has, the more likely it will attract functions' aggregation. It also reveals that diversified local degree will help gather urban functions.
  arXiv  Detail & Related papers  (2022-11-03T01:41:46Z)
• Neural Embeddings of Urban Big Data Reveal Emergent Structures in Cities [7.148078723492643]
  We propose using a neural embedding model-graph neural network (GNN)- that leverages the heterogeneous features of urban areas. Using large-scale high-resolution mobility data sets from millions of aggregated and anonymized mobile phone users in 16 metropolitan counties in the United States, we demonstrate that our embeddings encode complex relationships among features related to urban components. We show that embeddings generated by a model trained on a different county can capture 50% to 60% of the emergent spatial structure in another county.
  arXiv  Detail & Related papers  (2021-10-24T07:13:14Z)
• Methodological Foundation of a Numerical Taxonomy of Urban Form [62.997667081978825]
  We present a method for numerical taxonomy of urban form derived from biological systematics. We derive homogeneous urban tissue types and, by determining overall morphological similarity between them, generate a hierarchical classification of urban form. After framing and presenting the method, we test it on two cities - Prague and Amsterdam.
  arXiv  Detail & Related papers  (2021-04-30T12:47:52Z)
• Exploiting latent representation of sparse semantic layers for improved short-term motion prediction with Capsule Networks [0.12183405753834559]
  This paper explores use of Capsule Networks (CapsNets) in the context of learning a hierarchical representation of sparse semantic layers corresponding to small regions of the High-Definition (HD) map. By using an architecture based on CapsNets the model is able to retain hierarchical relationships between detected features within images whilst also preventing loss of spatial data often caused by the pooling operation. We show that our model achieves significant improvement over recently published works on prediction, whilst drastically reducing the overall size of the network.
  arXiv  Detail & Related papers  (2021-03-02T11:13:43Z)
• Quantifying spatial homogeneity of urban road networks via graph neural networks [12.875369866362327]
  The spatial homogeneity of an urban road network (URN) measures whether each distinct component is analogous to the whole network. We use Graph Neural Networks to model the 11,790 URN samples across 30 cities worldwide and use its predictability to define the spatial homogeneity.
  arXiv  Detail & Related papers  (2021-01-01T19:45:04Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.