Traffic flow densities in large transport networks

DOI10.1017/APR.2017.35zbMATH Open1425.60080arXiv1602.01009OpenAlexW2962756396MaRDI QIDQ5233202FDOQ5233202

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

Publication date: 16 September 2019

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

Abstract: We consider transport networks with nodes scattered at random in a large domain. At certain local rates, the nodes generate traffic flowing according to some navigation scheme in a given direction. In the thermodynamic limit of a growing domain, we present an asymptotic formula expressing the local traffic flow density at any given location in the domain in terms of three fundamental characteristics of the underlying network: the spatial intensity of the nodes together with their traffic generation rates, and of the links induced by the navigation. This formula holds for a general class of navigations satisfying a link-density and a sub-ballisticity condition. As a specific example, we verify these conditions for navigations arising from a directed spanning tree on a Poisson point process with inhomogeneous intensity function.

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

Recommendations

• Models for transportation networks
• TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
• Source-destination flow on a road network
• A diffusion-based analysis of a multiclass road traffic network

zbMATH Keywords

navigationtransport networktraffic densitysub-ballisticityrouteing

Mathematics Subject Classification ID

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

Cites Work

• Stochastic geometry and its applications
• Random Geometric Graphs
• Weak laws of large numbers in geometric probability
• Stochastic and Integral Geometry
• Title not available (Why is that?)
• Geodesics and spanning trees for Euclidean first-passage percolation.
• Domination by product measures
• Limit theorems for random spatial drainage networks
• Limit theory for random sequential packing and deposition
• Divergence of shape fluctuations in two dimensions
• Poisson trees, succession lines and coalescing random walks
• On a random directed spanning tree
• Euclidean models of first-passage percolation
• Geodesics in two-dimensional first-passage percolation
• 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
• Perplexing problems in probability. Festschrift in honor of Harry Kesten
• The radial spanning tree of a Poisson point process
• Asymptotics of geometrical navigation on a random set of points in the plane
• Navigation on a Poisson point process
• Random transmission radii in greedy routing models for ad hoc sensor networks

Cited In (11)

• Traffic velocity distributions for different spacings
• Traffic flow on percolation-backbone fractal
• Transport between multiple users in complex networks
• Gibbsian representation for point processes via hyperedge potentials
• The spatial variability of vehicle densities as determinant of urban network capacity
• Improper Poisson line process as SIRSN in any dimension
• Density classification quality of the traffic-majority rules
• Nonuniform traffic in the Manhattan street network
• Nonlinear diffusion through large complex networks containing regular subgraphs
• Transport of measures on networks
• The Widom -- Rowlinson model under spin flip: immediate loss and sharp recovery of quasilocality

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

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