Cited by 749Urban Design and Spatial AnalysisComplex Network Analysis TechniquesGlobal Urban Networks and Dynamics

The network analysis of urban streets: A dual approach

Open access
Porta, Sergio, Crucitti, Paolo, Latora, Vito·2006·Physica A: Statistical Mechanics and its Applications

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.physa.2005.12.063

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Traditional, geometric, road-based models fail to observe small-world properties, while a new street-based modelling approach has obtained opposite results, by observing small-world properties for diverse methods of graph representations.

    “While traditional, geometric, road-based models fail to observe small-world properties, a new street-based modelling approach has obtained opposite results, by observing small-world properties for the diverse methods of graph representations, e.g., (Jiang et al. 2014;Jiang 2007;Porta et al. 2006;Jiang and Claramunt 2004).”

    From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Porta et al. 2006

    The Results (p. 19) find small-world properties in four of six street-based dual graphs, while the Conclusions (p. 22) describe exceptions and caution that small-world scaling needs further investigation. The paper does not establish that traditional road-based models fail to show small-world properties, or demonstrate the result across diverse graph-representation methods. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • The comparative investigations in Cardillo et al. 2006 and Porta et al. 2006 reveal scale-free degree distributions for the vertices of spatial graphs if the ICN principle is implemented.

    “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 Porta et al. 2006

    The Conclusions (p. 22) describe ICN as the method for constructing dual urban-street graphs and report power-law degree distributions, especially for networks of significant size. The degree-distribution analysis (pp. 14–16) finds clear scale-free behavior in the larger graphs but says the smaller graphs do not permit a precise conclusion. The claim overgeneralizes this finding to spatial graphs whenever ICN is implemented. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • When streets are represented as nodes and edges corresponding to individual streets and street intersections, or by named-based and angularity-based methods, small-world properties are observed.

    “But when streets are represented as nodes and edges corresponding to individual streets and street intersections, or by named-based and angularity-based methods, the small-world properties are observed (Jiang et al. 2014;Porta et al. 2006;Jiang and Claramunt 2004).”

    From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Porta et al. 2006

    The Conclusions (p. 22) describe a dual representation with streets as nodes and intersections as edges, and report small-world properties generally, with exceptions for networks with few triangular loops. The Results (p. 19) identify four of six networks as small-worlds. Section 2 (pp. 4–5) describes the named-street approach as another method, but this paper does not show that its named-street representation exhibits small-world properties. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • Several studies found scale-free degree distributions in street networks using other graph representations.

    “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 Porta et al. 2006

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 10

  1. Albert R, Barabási A L, 2002, 'Statistical Mechanics of Complex networks', Review of Modern Physics 74 47 - 97.
  2. Csanyi G, Szendroi B, 2004, 'The fractal small-world dichotomy in real-world networks', preprint cond-mat/0406070 . · arXiv
  3. Hillier B, Hanson J, 1984, The social logic of space (Cambridge University Press, Cambridge, UK).
  4. Hillier B, 1996, Space is the machine: a configurational theory of architecture (Cambridge University Press, Cambridge, UK).
  5. Jacobs A, 1993, Great streets (MIT Press, Boston, MA).
  6. Jiang B, Claramunt C, 2002, 'Integration of space syntax into GIS: new perspectives for urban morphology', Transactions in GIS 6 151 - 162.
  7. Latora V, Marchiori M, 2001, 'Efficient behavior of small-world networks', Physical Review Letters 87 198701.
  8. Latora V, Marchiori M, 2003, 'Economic small-world behavior in weighted networks', The European Physical Journal B 87 198701.
  9. Pastor-Satorras R, Vazquez R, Vespignani A, 2001, 'Dynamical and correlation properties of the Internet', Physical Review Letters 87 250781.
  10. Pastor-Satorras R, Vespignani A, 2004, Evolution and structure of the Internet (Cambridge University Press, Cambridge, UK). Porta S, Crucitti P, Latora V, 2004, 'The network analysis of urban streets: a primal approach', in preparation. Ratti C, 2004, 'Space Syntax: some inconsistencies', Environment and Planning B 31 513 - 516. Rosvall M, Trusina A, Minnhagen P, Sneppen K, 2004, 'Networks and cities: an information perspective', preprint cond-mat/0407054 . Wasserman S, Faust K, 1994, Social Networks analysis (Cambridge University Press, Cambridge, UK). Watts D J, Strogatz S H, 1998, 'Collective dynamics of small-world networks', Nature 393 440 - · arXiv

Cited by

Sorted by citations

Authors
Porta, S., Crucitti, P., & Latora, V.
Affiliations
  • Politecnico di Milano (IT)
  • University of Catania (IT)
Corresponding author
Latora, Vito
Venue
Physica A: Statistical Mechanics and its Applications
Publisher
Elsevier BV
Published
2006-09
Volume
369
Issue
2
Pages
853-866
ISSN
0378-4371 (ISSN-L)
OpenAlex
W2962983474
Cited by
749
References
2
Citations by year
2026: 40 · 2025: 54 · 2024: 35 · 2023: 33 · 2022: 49 · 2021: 45 · 2020: 49 · 2019: 47 · 2018: 51 · 2017: 49 · 2016: 44 · 2015: 60 · 2014: 45 · 2013: 31 · 2012: 18
FWCI
65.69
Type
journal article
Language
en
Open access
Locations
  • Physica A Statistical Mechanics and its Applications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • Virtual Community of Pathological Anatomy (University of Castilla La Mancha) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Engineering › Building and Construction › 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
urban road networks, network analysis, dual graph, graph representation, scale-free networks, small-world property, degree distribution, assortativity, network structural properties

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