Random road networks: the quadtree model

DOI10.1137/1.9781611973013.9MaRDI QIDQ5194693zbMATH OpenOpenAlexFDO

Authors David Eisenstat

Publication date 16 September 2019

Published in 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)

Abstract: What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose emph{quadtree model} and analyze its shortest paths and maximum flow.

Recommendations

• Scale-invariant random spatial networks
• True scale-invariant random spatial networks
• Routed planar networks
• Random planar graphs and the London street network
• On Generating Random Network Structures: Trees

Cited in

(3)

• Application of complex networks theory in urban traffic network researches
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• Routed planar networks

This page was built for publication: Random road networks: the quadtree model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5194693)