Spectral Modelling for Spatial Network Analysis

P. Nourian*, S. Rezvani, Sevil Sariyildiz, Frank van der Hoeven

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

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 moms, 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-of-the-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.
Original languageEnglish
Title of host publication2016 Proceedings of the symposium on simulation for architecture and urband design (SIMAUD 2016)
Pages103-110
Publication statusPublished - 2016
Externally publishedYes
Event7th annual symposium on simulation for Architecture and Urban Design, SimAUD 2016 - University College London, London, United Kingdom
Duration: 16 May 201618 May 2016
Conference number: 7

Conference

Conference7th annual symposium on simulation for Architecture and Urban Design, SimAUD 2016
Abbreviated titleSimAUD 2016
Country/TerritoryUnited Kingdom
CityLondon
Period16/05/1618/05/16

Fingerprint

Dive into the research topics of 'Spectral Modelling for Spatial Network Analysis'. Together they form a unique fingerprint.

Cite this