Related papers: Traffic lights, clumping and QBDs
We study the problem of planning routes in road networks when certain streets or areas are closed at certain times. For heavy vehicles, such areas may be very large since many European countries impose temporary driving bans during the…
We extend the Multi-lane Spatial Logic MLSL, introduced in previous work for proving the safety (collision freedom) of traffic maneuvers on a multi-lane highway, by length measurement and dynamic modalities. We investigate the proof theory…
In this work we extend a recent kinetic traffic model to the case of more than one class of vehicles, each of which is characterized by few different microscopic features. We consider a Boltzmann-like framework with only binary…
We investigate a model for driven exclusion processes where internal states are assigned to the particles. The latter account for diverse situations, ranging from spin states in spintronics to parallel lanes in intracellular or vehicular…
A discrete model of traffic on a multilane road is considered. The traffic is presented as particles movement with a deterministic component and a stochastic one. Formulas for the traffic characteristics have been found. The model can…
Discrete-time discrete-state finite Markov chains are versatile mathematical models for a wide range of real-life stochastic processes. One of most common tasks in studies of Markov chains is computation of the stationary distribution.…
Based on fluid-dynamic and many-particle (car-following) simulations of traffic flows in (urban) networks, we study the problem of coordinating incompatible traffic flows at intersections. Inspired by the observation of self-organized…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
Let $M_n$ denote the largest interpoint distance among independent random points $X_1,\dots,X_n$ uniformly distributed in a compact set in $\mathbb{R}^d$. Weak limit laws for $M_n$ are known in several geometric settings, in particular for…
We show that the capacity of a complex network that models a city street grid to support congested traffic can be optimized by using routes that collectively minimize the maximum ratio of betweenness to capacity in any link. Networks with a…
A cyclic random motion at finite velocity with orthogonal directions is considered in the plane and in $\mathbb{R}^3$. We obtain in both cases the explicit conditional distributions of the position of the moving particle when the number of…
This paper focuses on analytical studies of the primary user (PU) traffic classification problem. Observing that the gamma distribution can represent positively skewed data and exponential distribution (popular in communication networks…
Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic…
We prove the law of large numbers for the drift of random walks on the two-dimensional lamplighter group, under the assumption that the random walk has finite $(2+\epsilon)$-moment. This result is in contrast with classical examples of…
Heavy traffic congestion daily occurs at merging sections on highway. For releasing this congestion, possibility of alternative configuration of vehicles on multiple-lane road is discussed in this paper. This is the configuration where no…
A length dependence of the effective mobility in the form of a power law, B ~ L^(1-1/alpha) is observed in dispersive transport in amorphous substances, with 0 < \alpha < 1. We deduce this behavior as a simple consequence of the statistical…
In this paper we study two natural models of \textit{random temporal} graphs. In the first, the \textit{continuous} model, each edge $e$ is assigned $l_e$ labels, each drawn uniformly at random from $(0,1]$, where the numbers $l_e$ are…
In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…
We study the dynamics of three elastic particles in a finite interval where two light particles are separated by a heavy ``piston''. The piston undergoes surprisingly complex motion that is oscillatory at short time scales but seemingly…
We examine the mixing time for random walks on graphs. In particular we are interested on investigating graphs with bottlenecks. Furthermore, the cutoff phenomenon is examined.