True scale-invariant random spatial networks
From MaRDI portal
Abstract: Real-world road networks have an approximate scale-invariance property; can one devise mathematical models of random networks whose distributions are {em exactly} invariant under Euclidean scaling? This requires working in the continuum plane. We introduce an axiomatization of a class of processes we call {em scale-invariant random spatial networks}, whose primitives are routes between each pair of points in the plane. We prove that one concrete model, based on minimum-time routes in a binary hierarchy of roads with different speed limits, satisfies the axioms, and note informally that two other constructions (based on Poisson line processes and on dynamic proximity graphs) are expected also to satisfy the axioms. We initiate study of structure theory and summary statistics for general processes in this class.
Recommendations
Cites work
Cited in
(10)- Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions
- Rayleigh random flights on the Poisson line SIRSN
- Route lengths in invariant spatial tree networks
- A conversation with David J. Aldous
- Scale-invariant random spatial networks
- Markov chain scaffolding of real world data
- Improper Poisson line process as SIRSN in any dimension
- Routed planar networks
- Random road networks: the quadtree model
- Random planar graphs and the London street network
This page was built for publication: True scale-invariant random spatial networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170967)