Spectral Modelling for Spatial Network Analysis

Spectral Modelling for Spatial Network Analysis

Nourian, Pirouz (TU Delft Design Informatics)
Rezvani, S. (123 DV BV Rotterdam)
Sariyildiz, I.S. (TU Delft Design Informatics)
van der Hoeven, F.D. (TU Delft OLD Urban Design; TU Delft 100% Research)

Attar, Ramtin (editor)
Chronis, Angelos (editor)
Hanna, Sean (editor)
Turrin, Michela (editor)

2016

Spatial Networks represent the connectivity structure between units of space as a weighted graph whose links are weighted as to the strength of connections. In case of urban spatial networks, the units of space correspond closely to streets and in architectural spatial networks the units correspond to rooms, convex spaces or star-convex spaces. Once represented as a graph, a spatial network can be analysed using graph theory and spectral graph theory. We present four steps of modelling a spectrum for an urban spatial network; present an implementation of a state-ofthe-art spectral graph-drawing algorithm and showcase a Spatial Eigenvector Centrality index, which is based on a novel definition of spatial networks based on Fuzzy Closeness indicators computed using Easiest Path distances.

Spatial Network Analysis
Spectral Graph Theory
Spatial Eigenvector Centrality
Spectral Graph Drawing
Dominant Eigenvectors
Generalized Power Iteration

http://resolver.tudelft.nl/uuid:81c02b9c-3ddc-4273-8c2b-7e84c6dc7604

simAUD

978-1-365-05872-1

Proceedings of the Symposium on Simulation for Architecture and Urban Design (simAUD 2016)

SimAUD EU 2016: 7th annual Symposium on Simulation for Architecture and Urban Design, 2016-05-16 → 2016-05-18, London, United Kingdom

Institutional Repository

conference paper

© 2016 Pirouz Nourian, S. Rezvani, I.S. Sariyildiz, F.D. van der Hoeven