Random planar graphs and the London street network

DOI10.1140/epjb/e2009-00290-4zbMath1188.05140arXiv0903.5440OpenAlexW3106480620WikidataQ56773386 ScholiaQ56773386MaRDI QIDQ977790

J. Martínez

Publication date: 23 June 2010

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.5440

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (6)

Complex systems: features, similarity and connectivity ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ A parametric description of cities for the normative analysis of transport systems ⋮ A least-effort principle based model for heterogeneous pedestrian flow considering overtaking behavior ⋮ Application of complex networks theory in urban traffic network researches ⋮ Multiorder boundaries among discrete domains: Relative fractal dimension and others

Cites Work

• Unnamed Item
• Mathematical analysis of urban spatial networks
• On the Number of Edges in Random Planar Graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Random planar graphs and the London street network