Search arXivSearch

arXiv · 1912.09275

A diffusion-based analysis of a multi-class road traffic network

Abstract

This paper studies a stochastic model that describes the evolution of vehicle densities in a road network. It is consistent with the class of (deterministic) kinematic wave models, which describe traffic flows on the basis of conservation laws that incorporate the macroscopic fundamental diagram (a functional relationship between vehicle density and flow). Our setup is capable of handling multiple types of vehicle densities, with general macroscopic fundamental diagrams, on a network with arbitrary topology. Interpreting our system as a spatial population process, we derive, under a natural scaling, fluid and diffusion limits. More specifically, the vehicle density process can be approximated with a suitable Gaussian process, which yield accurate normal approximations to the joint (in the spatial and temporal sense) vehicle density process. The corresponding means and variances can be computed efficiently. Along the same lines, we develop an approximation to the vehicles' travel-time distribution between any given origin and destination pair. Finally, we present a series of numerical experiments that demonstrate the accuracy of the approximations and illustrate the usefulness of the results.

Explore related subjects

Keep this discovery

BibTeXRIS

Michel Mandjes, Jaap Storm. 2019-12-19. A diffusion-based analysis of a multi-class road traffic network. https://arxiv.org/abs/1912.09275

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR