CoChat
Sign Up
Cited by 2,469Complex Network Analysis TechniquesUrban Design and Spatial AnalysisTheoretical and Computational Physics

Spatial networks

Open access
Barthélemy, Marc·2011·Physics Reports
DOI 10.1016/j.physrep.2010.11.002
Open this paper in CoChat — free accountOpen PDF

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.physrep.2010.11.002

Cites

10 of 10 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?

  • Relationships between spatial components (street network, urban locations, visual information) are systematized by use of mathematical graphs.

    “In urban studies, relationships between these spatial components are systematized by use of mathematical graphs (Ducruet and Beauguitte 2014;Barthelemy 2011).”

    From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Barthelemy 2011

    The road and street networks section (p. 18) describes a street network as a graph of roads and intersections. The urban commuters section (p. 15) also describes a network whose nodes are urban locations and whose edges represent movement between them. The passages found do not show visual information being represented this way, so that component is unsupported. (LLM, conf=0.83)

    Experimental — accuracy not yet measured

  • Small-world and scale-free properties allow classifying different networks in terms of their robustness, efficiency and heterogeneity.

    “Small-world and scale-free properties allow classifying different networks in terms of their robustness, efficiency and heterogeneity (Barthelemy 2011;Newman 2010).”

    From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Barthelemy 2011

  • The primary graph method represents junctions in street networks as nodes, and the street segments that connect junctions as edges.

    “This method represents junctions in street networks as nodes, and the street segments that connect junctions as edges (Eichler et al. 2013;Strano et al. 2012 andBarthelemy 2011).”

    From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Barthelemy 2011

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: 90

  1. [4][4] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows . Prentice Hall, New Jersey, 1993. -
  2. [6][6] I.F. Akyildiz, S. Weilian, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. Communications Magazine, IEEE , 40:102 - 114, 2002. -
  3. [11][11] D.J. Aldous. Spatial transportation networks with transfer costs: asymptotic optimality of hub and spoke models. In Mathematical Proceedings of the Cambridge Philosophical Society , pages 471 - 487. Cambridge University Press, 2008. -
  4. [12][12] D.J. Aldous and J. Shunn. Connected spatial networks over random points and a route-length statistic. arXiv , page 1003.3700, 2010. -
  5. [14][14] L. A. N. Amaral, A. Scala, M. Barth´ elemy, and H. E. Stanley. Classes of small-world networks. Proc. Natl. Acad. Sci. USA , 97:11149-11152, 2000. -
  6. [15][15] J. Ambjorn, B. Durhuss, and T. Jonsson. Quantum geometry. A statistical field theory approach . Cambridge University Press, Cambridge, UK, 1997. -
  7. [16][16] J.E. Anderson. Theoretical foundation for the gravity equation. American Economic Review , 69:106 - 116, 1979. -
  8. [17][17] R. M. Anderson and R. M. May. Infectious Diseases of Humans: Dynamics and Control . Oxford University Press, Oxford, 1992. -
  9. [21][21] L. Backstrom, E. Sun, and C. Marlow. Find me if you can: Improving geographical prediction with social and spatial proximity. In Proceedings of the 19th international conference on World Wide Web, Raleigh, North Carolina, USA , pages 61 - 70. ACM, New York, NY, USA, 2010. -
  10. [25][25] D. Balcan, V. Colizza, B. Goncalves, H. Hu, J.R. Ramasco, and A. Vespignani. Mutiscale mobility networks and the large spreading of infectious diseases. Proc. Natl Acad. Sci. (USA) , 106:21484, 2009. -
  11. [29][29] A. Barrat, M. Barth´ elemy, R. Pastor-Satorras, and A. Vespignani. The architecture of complex weighted networks. Proc. Natl. Acad. Sci. , 101:3747-3752, 2004. -
  12. [42][42] M. Batty. Cities and Complexity . MIT Press, Cambridge, 2005. -
  13. [49][49] J.H. Bergstrand. The gravity equation in international trade: some microeconomic foundations and empirical evidence. The review of economics and statistics , 67:474 - 481, 1985. -
  14. [51][51] G. Bianconi, P. Pin, and M. Marsili. Assessing the relevance of node features for network structure. Proc. Natl Acad. Sci. (USA) , 106:11433, 2009. -
  15. [63][63] M. Brede. Small worlds in space: synchronization, spatial and relational modularity. Europhysics Letters , 90: 60005, 2010. -
  16. [65][65] D.L. Bryan and M.E. O'Kelly. Hub-and-spoke networks in air transportation: an analytical review. Journal of regional science , 39:275 - 295, 1999. -
  17. [69][69] A. Bunde and S. Havlin. Percolation. In A. Bunde and S. Havlin, editors, Fractals and Disordered Systems , pages 51-95. Springer Verlag, Heidelberg, 1991. -
  18. [70][70] G. Caldarelli. Scale-free networks . Oxford University Press, Oxford, 2007. -
  19. [74][74] C.C. Cartozo and P. De Los Rios. Extended navigability of small world networks: exact results and new insights. arXiv , page 0901.4710, 2009. -
  20. [75][75] S. Caschili, A. De Montis, A. Chessa, and G. Deplano. Weighted networks and community detection: planning productive districts in sardinia. In G. Rabino and M. Caglioni, editors, Planning, complexity and new ICT , pages 27 - 36. Alinea Editrice s.r.l., 2009. -
  21. [83][83] F.R.K. Chung. Spectral graph theory . AMS Press, Providence, RI, 1997. -
  22. [85][85] J. Clark and D. A. Holton. A first look at graph theory . World Scientific, 1991. -
  23. [87][87] R. Cohen and S. Havlin. Complex Networks: Structure, Robustness and Function . Cambridge University Press, Cambridge, 2010. -
  24. [91][91] V. Colizza, A. Barrat, M. Barth´ elemy, and A. Vespignani. Prediction and predictability of global epidemics: the role of the airline transportation network. Proc. Natl Acad. Sci. (USA) , 103:2015, 2006. -
  25. [99][99] L. Da F. Costa, B.A.N. Travencolo, M.P. Viana, and E. Strano. On the efficiency of transportation systems in large cities. Europhysics Letters , 91:18003, 2010. -
  26. [109][109] D.Levinson and K.J. Krizek, editors. Planning for place and plexus: metropolitan land use and transport . Routledge, New York, NY, 2008. -
  27. [115][115] P.G. Doyle and J.L. Snell. Random walks and electric networks. The Mathematical Association of America, USA , pages 83 - 149, 1984. -
  28. [117][117] A. Dvoretzky and P. Erdos. Some problems on random walks in space. In Proceedings of the 2nd Berkeley Symposium on mathematical statistics and probability , pages 353 - 367. University of California Press, Berkeley, California, 1950. -
  29. [119][119] E.N. Economou. Green's functions in quantum physics . Springer, 2006. -
  30. [126][126] A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou. Heuristically optimized trade-offs: A new paradigm for power laws in the Internet. In Proceeding of the 29 th International Colloquium on Automata, Languages, and Programming (ICALP) , volume 2380 of Lecture Notes in Computer Science , pages 110-122. Springer, 2002. -
  31. [127][127] R. Farmani, D.A. Savic, and G.A. Walters. Exnet benchmark problem for multi-objective optimization of large water systems. In Modelling and control for participatory planning and managing water systems, IFAC Workshop, Venice, Italy , 2004. -
  32. [139][139] K.I. Goh, E. Oh, H. Jeong, B. Kahng, and D. Kim. Classification of scale-free networks. Proc. Natl Acad. Sci. USA , 99:12583, 2002. -
  33. [140][140] J. Goldenberg and M. Levy. Distance is not dead: Social interaction and geographical distance in the internet era. arXiv , page 0906.3202, 2009. -
  34. [149][149] R. Guimer` a, S. Mossa, A. Turtschi, and L.A.N. Amaral. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. Proc. Natl. Acad. Sci. USA , 102:7794-7799, 2005. -
  35. [153][153] C. Hauert and G. Szabo. Game theory and physics. American Journal of Physics , 73:405 - 414, 2005. -
  36. [154][154] Y. Hayashi. A review of recent studies of geographical scale-free networks. IPSJ Trans. Special Issue on Network Ecology , 47:776 - 785, 2006. -
  37. [157][157] C.C. Hilgetag, G.A.P.C. Burns, M.A. O'Neill, J.W. Scannell, and M.P. Young. Theoretical neuroanatomy: relating anatomical and functional connectivity in graphs and cortical connection matrices. Phil. Trans. R. Soc. Lond. B , 355:91, 2000. -
  38. [161][161] B. Hillier and J. Hanson. The social logic of space . Cambridge University Press, Cambridge, 1984. -
  39. [162][162] C.J. Honey, O. Sporns, L. Cammoun, X. Gigandet, J.P. Thiran, R. Meuli, and P. Hagmann. Predicting human resting-state functional connectivity from structural connectivity. Proc. Natl Acad. Sci. (USA) , 106: 2035 - 2040, 2010. -
  40. [164][164] H. Hu, S. Myers, V. Colizza, and A. Vespignani. Wifi epidemiology: can your neighbors' router make yours sick ? Proc. Natl Acad. Sci. (USA) , 106:1318 - 1323, 2009. -
  41. [166][166] Y. Hu, Y. Wang, D. Li, S. Havlin, and Z. Di. Maximizing entropy yields spatial scaling in social networks. arXiv , page 1002.1802, 2010. -
  42. [167][167] J.-P. Hubert and P.L. Toint. From average travel time budgets to daily travel time distributions: appraisal of two conjectures by koelbl and helbing and some consequences. Journal of the Transportation research board , 1985:135 - 143, 2007. -
  43. [168][168] M.L. Huson and A. Sen. Broadcast scheduling algorithms for radio networks. Militart Communications Conference, IEEE MILCOM '95 , 2:647 - 651, 1995. -
  44. [169][169] R. Ferrer i Cancho and R.V. Sol´ e. Optimization in complex networks. In Statistical Mechanics of Complex Networks , volume 625 of Lecture Notes in Physics , pages 114 - 125. Springer, 2003. -
  45. [179][179] W.-S. Jung, F. Wang, and H.E. Stanley. Gravity model in the korean highway. Europhysics Letters , 81:48005, 2008. -
  46. [180][180] D. Jungnickel. Graphs, networks, and algorithms. In Algorithm and computation in mathematics, vol. 5 . Springer Verlag, Heidelberg, 1999. -
  47. [186][186] K. Kansky. Structure of transportation networks: relationships between network geometry and regional characteristics . University of Chicago Press, Chicago, 1969. -
  48. [196][196] R. Koelbl and D. Helbing. Energy and scaling laws in human travel behaviour. New Journal of Physics , 5:48, 2003. -
  49. [197][197] K. Kosmidis, S. Havlin, and A. Bunde. Structural properties of spatially embedded networks. Europhysics Letters , 82:48005, 2008. -
  50. [217][217] D. Liben-Nowell, J. Nowak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic routing in social networks. Proc. Natl Acad. Sci. (USA) , 102:11623 - 11628, 2005. -
  51. [227][227] C. McDiarmid, A. Steger, and D.J.A. Welsh. Random planar graphs. Journal of Combinatorial Theory , 93:187 - 205, 2005. -
  52. [229][229] M. M´ ezard, G. Parisi, and M.-A. Virasoro. Spin glass and beyond . World Scientific, 1987. -
  53. [232][232] D.S. Modha and R. Singh. Network architecture of the long-distance pathways in the macaque brain. Proc. Natl Acad. Sci. (USA) , 107:13485 - 13490, 2009. -
  54. [233][233] P.L. Mokhtarian and C. Chen. Ttb or not ttb, that is the question: a review and analysis of the empirical literature on travel time (and money) budgets. Transportation Research Part A: Policy and Practice , 38:643 - 675, 2004. -
  55. [237][237] A.A. Moreira, J.S. Andrade Jr, H.J. Herrmann, and J.O. Indekeu. How to make a fragile network robust and vice-versa. Physical Review Lett. , 102:018701, 2009. -
  56. [240][240] D. Mukamel. Statistical mechanics of systems with long range interactions. In A. Campa, A. Giansanti, G. Morigi, and F. Sylos Labini, editors, AIP Conference proceedings: Dynamics and Thermodynamics of Systems with Long-Range Interations: Theory and Experiments , volume 22, page 970. 2008. -
  57. [241][241] J. D. Murray. Mathematical Biology . Springer, NewYork, 1993, 2nd edition. -
  58. [244][244] M.E.J. Newman. The structure and function of complex networks. SIAM Review , 45:167-256, 2003. -
  59. [245][245] M.E.J. Newman. Networks: an introduction . Oxford University Press, Oxford, UK, 2010. -
  60. [251][251] M.A. Nowak, S. Bonhoeffer, and R.M. May. Spatial games and the maintenance of cooperation. Proc. Natl Acad. Sci. (USA) , 91:4877 - 4881, 1994. -
  61. [252][252] M.E. O'Kelly. A quadratic integer program for the location of interaction hub facilities. Journal of Operational Research , 32:393 - 404, 1987. -
  62. [255][255] R. Pastor-Satorras and A. Vespignani. Evolution and structure of the Internet: A statistical physics approach . Cambridge University Press, Cambridge, 2003. -
  63. [258][258] M.D. Penrose. The longest edge of the random minimal spanning tree. Annals of Applied Probability , 7:340 361, 1997. -
  64. [259][259] T. Petermann and P. De Los Rios. Spatial small-worlds networks: a wiring-cost perspective. ArXiv , pages condmat/0501420, 2005. -
  65. [262][262] S. Rambaldi, A. Bazzani, B. Giorgini, and L. Giovannini. Mobility in modern cities: looking for physical laws. Proceedings of the ECCS'07 , 132, 2007. -
  66. [263][263] E. Ravasz and A.-L. Barab´ asi. Hierarchical organization in complex networks. Physical Review E , 67:026112, 2003. -
  67. [264][264] N. Read. Minimum spanning trees and random resistor networks in d dimensions. Physical Review E , 72:036114, 2005. -
  68. [266][266] M.R. Roberson and D. ben Avraham. Kleinberg navigation in fractal small world networks. Physical Review E , 74:017101, 2006. -
  69. [268][268] J.-P. Rodrigue, C. Comtois, and B. Slack. The geography of transport systems . Routledge, New York, NY, 2006. -
  70. [269][269] I. Rodriguez-Iturbe and A. Rinaldo. Fractal river basins: chance and self-organization . Cambridge University Press, Cambridge, 1997. -
  71. [270][270] C. Roth, S. Kang, M. Batty, and M.Barth´ elemy. Commuting in polycentric cities. arXiv , page 1001.4915, 2010. -
  72. [273][273] A. Runions, A. M. Fuhrer, P. Federl B. Lane, A.-G. Rolland-Lagan, and P. Prusinkiewicz. Modeling and visualization of leaf venation patterns. ACM Transactions on Graphics , 24:702 - 711, 2005. -
  73. [274][274] H. Samaniego and M.E. Moses. Cities as organisms: allometric scaling of urban road networks. Journal of Transport and Land use , 1:21 - 39, 2008. -
  74. [276][276] S. Scellato, C. Mascolo, M. Musolesi, and V. Latora. Distance matters: Geo-social metrics for online social networks. In Proceedings of the 3rd Workshop on Online Social Networks, WOSN 2010, Boston, USA , 2010. -
  75. [277][277] M. Schreckenberg and R. Selten. Human behaviour and traffic networks . Springer Verlag, Berlin, 2004. -
  76. [278][278] M. Schwartz. Telecommunication networks: protocols, modelling and analysis . Addison-Wesley Longman Publishing, Boston, 1986. -
  77. [285][285] A. Sevtsuk and C. Ratti. Does urban mobility have a daily routine ? learning from the aggregate data of mobile networks. Journal of Urban Technology , 17:41 60, 2010. -
  78. [292][292] J.M. Steele. Growth rates of euclidean minimal spanning trees with power weighted edges. The Annals of Probability , 16:1767 - 1787, 1988. -
  79. [299][299] H.P. Thadakamalia, R. Albert, and S.R.T. Kumara. Search in spatial scale-free networks. New Journal of Physics , 9:190, 2007. -
  80. [300][300] C. Thiemann, F. Theis, D. Grady, R. Brune, and D. Brockmann. The structure of borders in a small world. ArXiv , page 1001.0943, 2010. -
  81. [309][309] J.G. Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers , 1:325 - 378, 1952. -
  82. [311][311] C. P. Warren, L. M. Sander, and I. M. Sokolov. Firewalls, disorder, and percolation in epidemics. arXiv , page 0106450, 2002. -
  83. [314][314] B.M. Waxman. Routing of multipoint connections. IEEE J. Select. Areas. Commun. , 6:1617, 1988. -
  84. [316][316] G.B. West and J.H. Brown. The origin of allometric scaling laws in biology from genomes to ecosystems: Towards a quantitative unifying theory of biological structure and organization. Journal of Experimental Biology , 208:1575 - 1592, 2003. -
  85. [321][321] D.R. Wuellner, S. Roy, and R.M. D'Souza. Structure and resilience of networks: Airlines in usa. arXiv , page 0901.0774, 2009. -
  86. [326][326] A. Yazdani and P. Jeffrey. A complex network approach to robustness and vulnerability of spatially organized water distribution networks. In submitted to Water Distribution System Analysis Conference, WDSA2010, AZ, USA , 2010. -
  87. [329][329] S.-H. Yook, H. Jeong, and A.-L. Barabasi. Modeling the internet's large-scale topology. Proc. Natl. Acad. Sci. (USA) , 99:13382, 2002. -
  88. [332][332] E.W. Zegura, K.L. Calvert, and S. Bhattacharjee. How to model an internetwork. Proceedings of IEEE Infocom , pages 594 - 602, 1996. -
  89. [337][337] G.K. Zipf. The p 1 p 2 /d hypothesis: on the intercity movement of persons. American Sociological Review , 11:677 - 686, 1946. -
  90. [338][338] G.K. Zipf. Human behaviour and the principle of least effort . Addison-Wesley, Cambridge,MA, 1949.

Cited by

Sorted by citations

Authors
Barthélemy, M.
Affiliations
Centre National de la Recherche Scientifique (FR)
Corresponding author
Barthélemy, Marc
ORCID
Barthélemy, Marc
Venue
Physics Reports
Publisher
Elsevier BV
Published
2011-02
Volume
499
Issue
1-3
Pages
1-101
ISSN
0370-1573 (ISSN-L)
DOI
10.1016/j.physrep.2010.11.002
OpenAlex
W3037085755
Cited by
2,469
References
10
Citations by year
2026: 126 · 2025: 137 · 2024: 151 · 2023: 156 · 2022: 166 · 2021: 199 · 2020: 180 · 2019: 199 · 2018: 216 · 2017: 207 · 2016: 165 · 2015: 148 · 2014: 174 · 2013: 127 · 2012: 87
FWCI
55.54
Type
journal article
Language
en
Open access
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Locations
  • Physics Reports (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Engineering › Building and Construction › Urban Design and Spatial Analysis
  • Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
Keywords
spatial networks, network topology, edge length constraints, transportation networks, mobility networks, social networks, power grid, artificial neural networks, network models, phase transitions, random walks, synchronization, navigation, network resilience, disease spread

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