Related papers: Ants on the highway
We prove the well-posedness of a system of balance laws inspired by [8], describing macro-scopically the traffic flow on a multi-lane road network. Motivated by real applications, we allow for the the presence of space discontinuities both…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
The quantitative measurement of how and when we experience surprise has mostly remained limited to laboratory studies, and its extension to naturalistic settings has been challenging. Here we demonstrate, for the first time, how…
This article analyzes the complex geometry of urban transportation networks as a gateway to understanding their encompassing urban systems. Using a proposed ring-buffer approach and applying it to 50 urban areas in the United States, we…
Graph association rule mining is a data mining technique used for discovering regularities in graph data. In this study, we propose a novel concept, {\it path association rule mining}, to discover the correlations of path patterns that…
Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…
We study a model for freeway traffic which includes strong noise taking into account the fluctuations of individual driving behavior. The model shows emergent traffic jams with a self-similar appearance near the throughput maximum of the…
Given two varieties V,W in the n-fold product of modular curves, we answer affirmatively a question (formulated by Shou-Wu Zhang's AIM group) on whether the set of points in V that are Hecke translations of some point on W is dense in V. We…
Given an $n$-vertex graph $G$ with minimum degree at least $d n$ for some fixed $d > 0$, the distribution $G \cup \mathbb{G}(n,p)$ over the supergraphs of $G$ is referred to as a (random) {\sl perturbation} of $G$. We consider the…
The structure of Gaussian random fields over high levels is a well researched and well understood area, particularly if the field is smooth. However, the question as to whether or not two or more points which lie in an excursion set belong…
We consider $d$ independent walkers in the same random environment in $\mathbb{Z}$. Our assumption on the law of the environment is such that a single walker is transient to the right but subballistic. We show that - no matter what $d$ is -…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…
We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…
Tracking the time evolution of a quantum state allows one to verify the thermalization rate or the propagation speed of correlations in generic quantum systems. Inspired by the energy-time uncertainty principle, bounds have been…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
We analyze the patterns of traffic jams in urban networks of five large cities and an urban agglomeration region in China using real data based on a recently developed jam tree model. This model focuses on the way traffic jams spread…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. How large does $\alpha$ need to be to guarantee that $G$ contains a connected transversal, that is, a tree on $r$ vertices meeting each…
We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…
We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…