Related papers: Heavy-traffic asymptotic formulas for the multicla…
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…
We prove that under a multi-scale heavy traffic condition, the stationary distribution of the scaled queue length vector process in any generalized Jackson network has a product-form limit. Each component in the product form follows an…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
A multiclass queueing system is considered, with heterogeneous service stations, each consisting of many servers with identical capabilities. An optimal control problem is formulated, where the control corresponds to scheduling and routing,…
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process $X\equiv\{X(t):t\in\mathbb R\}$ with stationary increments and variance…
We give a recursive construction of the stationary distribution of multi-type asymmetric simple exclusion processes on a finite ring or on the infinite line $Z$. The construction can be interpreted in terms of "multi-line diagrams" or…
This paper studies a single server queue in heavy traffic, with general inter-arrival and service time distributions, where arrival and service rates vary discontinuously as a function of the (diffusively scaled) queue length. It is proved…
We study the questions of determining the asymptotics of the probabilistic characteristics of additive arithmetic functions in the paper, regardless of whether they have a limit distribution or not. Several assertions are proved about the…
In this paper we characterize possible asymptotics for hitting times in aperiodic ergodic dynamical systems: asymptotics are proved to be the distribution functions of subprobability measures on the line belonging to the functional class…
Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…
Solving a Riccati equation, induced by the study of the transient behaviour of the MGInf queue system, a collection of service times distributions is determined. For the MGInf queue, which service time distribution is a member of that…
We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M^X/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer…
Based on the statistical evaluation of experimental single-vehicle data, we propose a quantitative interpretation of the erratic scattering of flow-density data in synchronized traffic flows. A correlation analysis suggests that the…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…
Randomly sampling an acyclic orientation on the complete bipartite graph $K_{n,k}$ with parts of size $n$ and $k$, we investigate the length of the longest path. We provide a probability generating function for the distribution of the…
We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…
We discuss the modelling of traffic count data that show the variation of traffic volume within a day. For the modelling, we apply mixtures of Kato-Jones distributions in which each component is unimodal and affords a wide range of skewness…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…
In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. We seek the distribution of maximum line length of idle cars, and justify conjectured probabilistic asymptotics for $2 \leq…