Traffic flow densities in large transport networks

DOI10.1017/apr.2017.35zbMath1425.60080arXiv1602.01009OpenAlexW2962756396MaRDI QIDQ5233202

Paul Keeler, Christian Hirsch, Benedikt Jahnel, Robert I. A. Patterson

Publication date: 16 September 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

navigationtransport networktraffic densitysub-ballisticityrouteing

Mathematics Subject Classification ID

Strong limit theorems (60F15) Traffic problems in operations research (90B20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (2)

The Widom -- Rowlinson model under spin flip: immediate loss and sharp recovery of quasilocality ⋮ Gibbsian representation for point processes via hyperedge potentials

Cites Work

• Unnamed Item
• Unnamed Item
• Perplexing problems in probability. Festschrift in honor of Harry Kesten
• Domination by product measures
• Euclidean models of first-passage percolation
• Poisson trees, succession lines and coalescing random walks
• Geodesics and spanning trees for Euclidean first-passage percolation.
• Weak laws of large numbers in geometric probability
• Limit theory for random sequential packing and deposition
• Divergence of shape fluctuations in two dimensions
• Geodesics in two-dimensional first-passage percolation
• Navigation on a Poisson point process
• The radial spanning tree of a Poisson point process
• Random Transmission Radii in Greedy Routing Models for Ad Hoc Sensor Networks
• Limit theorems for random spatial drainage networks
• Asymptotics of geometrical navigation on a random set of points in the plane
• Stochastic and Integral Geometry
• Random Geometric Graphs
• On a random directed spanning tree
• Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
• A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks
• On the total length of the random minimal directed spanning tree

This page was built for publication: Traffic flow densities in large transport networks