2009
DOI: 10.1007/978-3-540-87829-2
|View full text |Cite
|
Sign up to set email alerts
|

Mathematical Analysis of Urban Spatial Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
75
0
4

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 76 publications
(79 citation statements)
references
References 0 publications
0
75
0
4
Order By: Relevance
“…A measure allows seeing a city's map as a "continuous graph" or likewise as an object both relational and geometrical (II). While [3] considered a city as a pure graph and [11] took into account its spatiality, we have explored the geometrical aspect of the city, its topology being only the skeleton that holds it up. From this point of view we have shown that despite an evident diversity on their overall shapes (anisotropy firstorder topology), a few fundamental rules can explain cities' general morphogenesis (IV).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…A measure allows seeing a city's map as a "continuous graph" or likewise as an object both relational and geometrical (II). While [3] considered a city as a pure graph and [11] took into account its spatiality, we have explored the geometrical aspect of the city, its topology being only the skeleton that holds it up. From this point of view we have shown that despite an evident diversity on their overall shapes (anisotropy firstorder topology), a few fundamental rules can explain cities' general morphogenesis (IV).…”
Section: Discussionmentioning
confidence: 99%
“…Since the famous "Bridges of Konigsberg" problem by Euler, one is tempted to describe a city as a graph with streets as edges and their intersections as vertices. This provides a relational representation of the city [3]. One of the difficulties then is the particular embedding of these graphs that make random graphs unable to stick to a city's map representation.…”
Section: Introductionmentioning
confidence: 99%
“…E. g. Volchenkov and Blanchard analyze city structures through random walks to find accessible parts of the city and compare flow-based properties of the graphs to get an understanding on social behavior [18]. An excellent overview on city graphs gives the book by the same authors [19]. Random walks have been studied in many context, a great survey on random walks on graphs is given by Lovász in [14].…”
Section: Related Workmentioning
confidence: 99%
“…12 We require that the main diagonal of the random matrix is 1 and that it is symmetric. 13 Obviously, we have to prevent that the gold standard is ever part of the set of these randomizations. in vector space: the higher the number of indices for which two graphs resemble each other, the more similar the graphs.…”
Section: Module 5: Network Antificationmentioning
confidence: 99%