Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Homothetic behavior of betweenness centralities: A multiscale alternative approach to relate cities and large regional structures

Altafini, Diego ORCID: https://orcid.org/0000-0002-6559-2372 and Cutini, Valerio 2020. Homothetic behavior of betweenness centralities: A multiscale alternative approach to relate cities and large regional structures. Sustainability 12 (19) , 7925. 10.3390/SU12197925

[thumbnail of sustainability-12-07925-v3.pdf]
Preview
PDF - Published Version
Available under License Creative Commons Attribution.

Download (8MB) | Preview

Abstract

Regional configuration can reveal important aspects about city sustainability, as local-regional interactions shape the evolution and inner geography of urban settlements. However, modelling these large-scale structures remains a challenge, due to their sheer size as physical objects. Despite recent improvements in processing power and computing methods, extensive time periods are still required for ordinary microprocessors to model network centralities in road-graphs with high element counts, connectivity and topological depth. Generalization is often the chosen option to mitigate time-constraints of regional network complexity. Nevertheless, this can impact visual representation and model precision, especially when multiscale comparisons are desired. Tests using Normalized Angular Choice (NACH), a Space Syntax mathematical derivative of Betweenness Centrality, found recursive visual similitudes in centrality spatial distribution when modelling distinct scaled map sections of the same large regional network structure. Therefore, a sort of homothetic behavior is identified, since statistical analyses demonstrate that centrality values and distributions remain rather consistent throughout scales, even when considering edge effects. This paper summarizes these results and considers homotheties as an alternative to extensive network generalization. Hence, data maps can be constructed sooner and more accurately as “pieces of a puzzle”, since each individual lesser scale graph possesses a faster processing time.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Architecture
Publisher: MDPI
ISSN: 2071-1050
Date of First Compliant Deposit: 30 April 2024
Date of Acceptance: 18 September 2020
Last Modified: 30 Apr 2024 14:48
URI: https://orca.cardiff.ac.uk/id/eprint/168514

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics