相关论文: Traffic lights, clumping and QBDs
We investigate traffic flows using the kinetic Boltzmann equations with a Maxwell collision integral. This approach allows analytical determination of the transient behavior and the size distributions. The relaxation of the car and cluster…
We propose a generalized car parking problem where either a car of size $\sigma$ or of size $m\sigma$ ($m>1$) is sequentially parked on a line with probability $q$ and $(1-q)$, respectively. The free parameter $q$ interpolates between the…
We study several deterministic one-dimensional traffic models. For integer positions and velocities we find the typical high and low density phases separated by a simple transition. If positions and velocities are continuous variables the…
For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…
We examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a complete interference graph, which turns out to be highly…
The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…
In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…
We investigate the probability for the largest segment in with total displacement $Q$ in an $N$-step random walk to have length $L$. Using analytical, exact enumeration, and Monte Carlo methods, we reveal the complex structure of the…
In this paper we present a mathematical model of the train dynamics in a linear metro line system with demand-dependent run and dwell times. On every segment of the line, we consider two main constraints. The first constraint is on the…
We provide a complete asymptotic distribution theory for clustered data with a large number of independent groups, generalizing the classic laws of large numbers, uniform laws, central limit theory, and clustered covariance matrix…
We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…
In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different…
We study the Traffic Light Control (TLC) problem for a single intersection, considering both straight driving vehicle flows and corresponding crossing pedestrian flows with the goal of achieving a fair jointly optimal sharing policy in…
We investigate the behavior of the periods and border lengths of random words over a fixed alphabet. We show that the asymptotic probability that a random word has a given maximal border length $k$ is a constant, depending only on $k$ and…
We investigate a microscopical structure in a chain of cars waiting at a red signal on signal-controlled crossroads. Presented is an one-dimensional space-continuous thermodynamical model leading to an excellent agreement with the data…
We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…
$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
The present paper proposes a stochastic model of the traffic flow. This model has a discrete set of states and the continuous time. The model is a generalization of the discrete stochastis model that has been considered in a previous paper…
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…