Related papers: On large queue lengths in generalised Jackson netw…
We prove large deviation principles (LDPs) for full chordal, radial, and multichordal SLE(0+) curves parameterized by capacity. The rate function is given by the appropriate variant of the Loewner energy. There are two key novelties in the…
The Large Deviation Principle (LDP) and the Central Limit Theorem (CLT) are central pillars of probability theory. While their formulations are established under the i.i.d. assumption, the probabilistic foundation for power-law…
For an arbitrary negative Schwarzian unimodal map with non-flat critical point, we establish the level-2 Large Deviation Principle (LDP) for empirical distributions. We also give an example of a multimodal map for which the level-2 LDP does…
One of the main differences between the central limit theorem and the Poisson law of small numbers is that the former possesses the large sample property (LSP), i.e., the error of normal approximation to the sum of $n$ independent…
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,…
We study a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays $\xi_{i}$. The standard deviation $\sigma$ of the delay is finite, but its value is much larger than the deterministic unit service time.…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
The Large Deviation Principle is established for stochastic models defined by past-dependent non linear recursions with small noise. In the Markov case we use the result to obtain an explicit expression for the asymptotics of exit time.
We prove that bridges of subelliptic diffusions on a compact manifold, with distinct ends, satisfy a large deviation principle in a space of Holder continuous functions, with a good rate function, when the travel time tends to 0. This leads…
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a job at server i may result in the creation of a new job for…
Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete stochastic…
We prove the analogue for continuous space-time of the quenched LDP derived in Birkner, Greven and den Hollander (2010) for discrete space-time. In particular, we consider a random environment given by Brownian increments, cut into pieces…
We consider Jackson Networks on general countable graphs and with arbitrary service times. We find natural sufficient conditions for existence and uniqueness of stationary distributions. They generalise these obtained earlier by Kelbert,…
Large deviation theory is a branch of probability theory that is devoted to a study of the "rate" at which empirical estimates of various quantities converge to their true values. The object of study in this paper is the rate at which…
We consider a Jackson network with regenerative input flows in which every server is subject to a random environment influence generating breakdowns and repairs. They occur in accordance with two independent sequences of i.i.d. random…
This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (two-node) tandem queue, fed by a large number of Gaussian…
We investigate systems of interacting stochastic differential equations with two kinds of heterogeneity: one originating from different weights of the linkages, and one concerning their asymptotic relevance when the system becomes large. To…
Consider a countably infinite collection of interacting queues, with a queue located at each point of the $d$-dimensional integer grid, having independent Poisson arrivals, but dependent service rates. The service discipline is of the…
This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in…
We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…