dorsal/arxiv
View SchemaStructural Properties of Planar Graphs of Urban Street Patterns
| Authors | Alessio Cardillo, Salvatore Scellato, Vito Latora, Sergio Porta |
|---|---|
| Categories | |
| ArXiv ID | physics/0510162 |
| URL | https://arxiv.org/abs/physics/0510162 |
| DOI | 10.1103/PhysRevE.73.066107 |
| Journal | Phys. Rev. E73 (2006) 066107. |
Abstract
Recent theoretical and empirical studies have focused on the structural properties of complex relational networks in social, biological and technological systems. Here we study the basic properties of twenty 1-square-mile samples of street patterns of different world cities. Samples are represented by spatial (planar) graphs, i.e. valued graphs defined by metric rather than topologic distance and where street intersections are turned into nodes and streets into edges. We study the distribution of nodes in the 2-dimensional plane. We then evaluate the local properties of the graphs by measuring the meshedness coefficient and counting short cycles (of three, four and five edges), and the global properties by measuring global efficiency and cost. As normalization graphs, we consider both minimal spanning trees (MST) and greedy triangulations (GT) induced by the same spatial distribution of nodes. The results indicate that most of the cities have evolved into networks as efficienct as GT, although their cost is closer to the one of a tree. An analysis based on relative efficiency and cost is able to characterize different classes of cities.
{
"annotation_id": "5c813c39-fc18-4e1d-86bd-e7ac14b0fcb7",
"date_created": "2026-03-02T18:01:03.479000Z",
"date_modified": "2026-03-02T18:01:03.479000Z",
"file_hash": "446d1c7460df6e5669f9398ca8f7253686bac46f8d065108ff957a11e80ee159",
"private": false,
"record": {
"abstract": "Recent theoretical and empirical studies have focused on the structural\nproperties of complex relational networks in social, biological and\ntechnological systems. Here we study the basic properties of twenty\n1-square-mile samples of street patterns of different world cities. Samples are\nrepresented by spatial (planar) graphs, i.e. valued graphs defined by metric\nrather than topologic distance and where street intersections are turned into\nnodes and streets into edges. We study the distribution of nodes in the\n2-dimensional plane. We then evaluate the local properties of the graphs by\nmeasuring the meshedness coefficient and counting short cycles (of three, four\nand five edges), and the global properties by measuring global efficiency and\ncost. As normalization graphs, we consider both minimal spanning trees (MST)\nand greedy triangulations (GT) induced by the same spatial distribution of\nnodes. The results indicate that most of the cities have evolved into networks\nas efficienct as GT, although their cost is closer to the one of a tree. An\nanalysis based on relative efficiency and cost is able to characterize\ndifferent classes of cities.",
"arxiv_id": "physics/0510162",
"authors": [
"Alessio Cardillo",
"Salvatore Scellato",
"Vito Latora",
"Sergio Porta"
],
"categories": [
"physics.soc-ph"
],
"doi": "10.1103/PhysRevE.73.066107",
"journal_ref": "Phys. Rev. E73 (2006) 066107.",
"title": "Structural Properties of Planar Graphs of Urban Street Patterns",
"url": "https://arxiv.org/abs/physics/0510162"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3f1103d3-0c57-4435-9b2d-662a4b725b56",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}