The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Topological Analysis of Urban Street Networks
Abstract
The authors propose a topological analysis of large urban street networks based on a computational and functional graph representation. This representation gives a functional view in which vertices represent named streets and edges represent street intersections. A range of graph measures, including street connectivity, average path length, and clustering coefficient, are computed for structural analysis. In order to characterise different clustering degrees of streets in a street network they generalise the clustering coefficient to a k-clustering coefficient that takes into account k neighbours. Based on validations applied to three cities, the authors show that large urban street networks form small-world networks but exhibit no scale-free property.
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.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Hillier, B., & Hanson, J. (1984) · doi:10.1017/cbo9780511597237 · Cited by 4,322
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Cited by
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
The network analysis of urban streets: A dual approach
Porta, S., Crucitti, P., & Latora, V. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.12.063 · Cited by 749
Structural properties of planar graphs of urban street patterns
Cardillo, A., Scellato, S., Latora, V., & Porta, S. (2006) · Physical Review E · doi:10.1103/physreve.73.066107 · Cited by 370
Centrality in networks of urban streets
Crucitti, P., Latora, V., & Porta, S. (2006) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.2150162 · Cited by 347
Topological patterns in street networks of self-organized urban settlements
Buhl, C., Gautrais, J., Reeves, N., Solé, R. V., Valverde, S., Kuntz, P., & Theraulaz, G. (2006) · The European Physical Journal B - Condensed Matter and Complex Systems · doi:10.1140/epjb/e2006-00085-1 · Cited by 300
Metadata
- Authors
- Jiang, B., & Claramunt, C.
- Venue
- Environment and Planning B: Planning and Design
- Publisher
- SAGE Publications
- Published
- 2004-02
- Volume
- 31
- Issue
- 1
- Pages
- 151-162
- ISSN
- 0265-8135 (ISSN-L)
- 1472-3417
- DOI
- 10.1068/b306
- OpenAlex
- W2004309119
- Cited by
- 586
- References
- 24
- FWCI
- 80.99
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Topological Analysis of Urban Street Networks. https://app.cochat.ai/papers/10.1068/b306
- The paper
- Jiang, B., & Claramunt, C. (2004). Topological Analysis of Urban Street Networks. Environment and Planning B: Planning and Design. https://doi.org/10.1068/b306
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.