The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Structural properties of planar graphs of urban street patterns
Open accessAbstract
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 turned into spatial valued graphs. In such graphs, the nodes are embedded in the two-dimensional plane and represent street intersections, the edges represent streets, and the edge values are equal to the street lengths. We 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. We also consider, as extreme cases, minimal spanning trees (MST) and greedy triangulations (GT) induced by the same spatial distribution of nodes. The measures found in the real and the artificial networks are then compared. Surprisingly, cities of the same class, e.g., grid-iron or medieval, exhibit roughly similar properties. The correlation between a priori known classes and statistical properties is illustrated in a plot of relative efficiency vs cost.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“The comparative investigations in (Cardillo et al. 2006 andPorta et al. 2006) reveal scale-free degree distributions for the vertices of spatial graphs if the ICN (intersection continuity negotiation) principle is implemented.”
From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Cardillo et al. 2006
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe cited source doesn’t support the claim as written.
In the citing paper
“Several studies also found scale-free degree distributions in street networks, using other graph representations (Cardillo et al. 2006;Carvalho and Penn 2004;Porta et al. 2006).”
From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Cardillo et al. 2006
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-citationNetwork motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Wallis, W. D., & George, J. C. (2010) · Chapman & Hall/CRC eBooks · doi:10.1201/b12336-12 · Cited by 5,660
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,562
Research works printed but not linked: 1
- A. Jacobs, 1993, Great Streets
Cited by
Sorted by citations
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Newman, M. E. J. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,453
OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks
Boeing, G. (2017) · Computers Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2017.05.004 · Cited by 1,602
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas-Boas, P. R., Antiqueira, L., Viana, M. P., & Rocha, L. E. C. (2011) · Advances In Physics · doi:10.1080/00018732.2011.572452 · Cited by 839
Detecting the dynamics of urban structure through spatial network analysis
Zhong, C., Arisona, S. M., Huang, X., Batty, M., & Schmitt, G. (2014) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2014.914521 · Cited by 524
Metadata
- Authors
- Cardillo, A., Scellato, S., Latora, V., & Porta, S.
- Affiliations
- University of Catania (IT)
- Politecnico di Milano (IT)
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2006-06-07
- Volume
- 73
- Issue
- 6
- Pages
- 066107-066107
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1976668093
- Cited by
- 370
- References
- 38
- Citations by year
- 2026: 8 · 2025: 11 · 2024: 15 · 2023: 16 · 2022: 17 · 2021: 14 · 2020: 26 · 2019: 19 · 2018: 47 · 2017: 31 · 2016: 22 · 2015: 19 · 2014: 14 · 2013: 24 · 2012: 12
- FWCI
- 47.08
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review E (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Social Sciences › Urban Studies › Urban Design and Spatial Analysis
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Social Sciences › Urban Studies › Global Urban Networks and Dynamics
- Keywords
- planar graphs, complex networks, cycle counting, global efficiency, minimum spanning tree, greedy triangulation, medieval towns
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
