Related papers: Road layout in the KPZ class
We consider the geodesic of the directed last passage percolation with iid exponential weights. We find the explicit one-point distribution of the geodesic location joint with the last passage times, and its limit as the parameters go to…
We consider last passage percolation on $\mathbb Z^2$ with general weight distributions, which is expected to be a member of the Kardar-Parisi-Zhang (KPZ) universality class. In this model, an oriented path between given endpoints which…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
We develop a new probabilistic method for deriving deviation estimates in directed planar polymer and percolation models. The key estimates are for exit points of geodesics as they cross transversal down-right boundaries. These bounds are…
With the progress of the urbanisation process, the urban transportation system is extremely critical to the development of cities and the quality of life of the citizens. Among them, it is one of the most important tasks to judge traffic…
We present in this article an algebraic approach to model and simulate road traffic networks. By defining a set of road traffic systems and adequate concatenating operators in that set, we show that large regular road networks can be easily…
In the present article we consider a natural generalization of Hammersley's Last Passage Percolation (LPP) called Entropy-controlled Last Passage Percolation (E-LPP), where points can be collected by paths with a global (entropy) constraint…
Modeling stochastic traffic behaviors at the microscopic level, such as car-following and lane-changing, is a crucial task to understand the interactions between individual vehicles in traffic streams. Leveraging a recently developed theory…
On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
To help mitigate road congestion caused by the unrelenting growth of traffic demand, many transit authorities have implemented managed lane policies. Managed lanes typically run parallel to a freeway's standard, general-purpose (GP) lanes,…
We study statistical properties of a family of maps acting in the space of integer valued sequences, which model dynamics of simple deterministic traffic flows. We obtain asymptotic (as time goes to infinity) properties of trajectories of…
We propose a new model of one-dimensional traffic flow using a coupled map lattice. In the model, each vehicle is assigned a map and changes its velocity according to it. A single map is designed so as to represent the motion of a vehicle…
What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose \emph{quadtree model} and analyze its shortest paths and maximum flow.
The directed last passage percolation (LPP) on the quarter-plane is a growing model. To come into the growing set, a cell needs that the cells on its bottom and on its left to be in the growing set, and then to wait a random time. We…
Optimizing paths on networks is crucial for many applications, from subway traffic to Internet communication. As global path optimization that takes account of all path-choices simultaneously is computationally hard, most existing routing…
Traffic congestion, a daily frustration for millions and a multi-billion dollar drain on economies, has long resisted deep physical understanding. While simple theoretical models of traffic flow have suggested connections to critical…
Most autonomous cars rely on the availability of high-definition (HD) maps. Current research aims to address this constraint by directly predicting HD map elements from onboard sensors and reasoning about the relationships between the…
We study an one-dimensional stochastic model of vehicular traffic on open segments of a single-lane road of finite size $L$. The vehicles obey a stochastic discrete-time dynamics which is a limiting case of the generalized Totally…
In first-passage percolation, one places nonnegative i.i.d. random variables (T(e)) on the edges of Z^d. A geodesic is an optimal path for the passage times T(e). Consider a local property of the time environment. We call it a pattern. We…