Related papers: Tail asymptotics for monotone-separable networks
In this paper, we study a class of self-exciting point processes. The intensity of the point process has a nonlinear dependence on the past history and time. When a new jump occurs, the intensity increases and we expect more jumps to come.…
We analyze an interacting queueing network on $\mathbb{Z}^d$ that was introduced in Sankararaman-Baccelli-Foss (2019) as a model for wireless networks. We show that the marginals of the minimal stationary distribution have exponential…
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and…
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal.…
In this paper we illustrate how non-stochastic (max,+) techniques can be used to describe partial synchronization in a Discrete Event Dynamical System. Our work uses results from the spectral theory of dioids and analyses (max,+) equations…
Exact analytic calculations in spin-1/2 XY chains, show the presence of long-time tails in the asymptotic dynamics of spatially inhomogeneous excitations. The decay of inhomogeneities, for $t\to \infty $, is given in the form of a power law…
We present upper and lower bounds for the tail distribution of the stationary waiting time $D$ in the stable $GI/GI/s$ FCFS queue. These bounds depend on the value of the traffic load $\rho$ which is the ratio of mean service and mean…
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…
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.…
In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…
In this paper we study the distribution tails and the moments of a condition number which arises in the study of homogeneous systems of linear inequalities. We consider the case where this system is defined by a Gaussian random matrix and…
The main contribution of this paper is to present a new sufficient condition for the subexponential asymptotics of the stationary distribution of a GI/GI/1-type Markov chain without jumps from level "infinity" to level zero. For simplicity,…
In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
We consider a stationary regularly varying time series which can be expressedas a function of a geometrically ergodic Markov chain. We obtain practical conditionsfor the weak convergence of the tail array sums and feasible estimators…
Recent theoretical studies have shown that heavy-tails can emerge in stochastic optimization due to `multiplicative noise', even under surprisingly simple settings, such as linear regression with Gaussian data. While these studies have…
In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…
Motivated by applications in computing and telecommunication systems, we investigate the problem of estimating p-quantile of steady-state sojourn times in a single-server multi-class queueing system with non-preemptive priorities for p…
In the paper we consider the asymptotics of logarithmic tails of a perpetuity $$R \stackrel{d}{=}\sum_{j=1}^\infty Q_j \prod_{k=1}^{j-1}M_k,\qquad(M_n,Q_n)_{n=1}^\infty \mbox{ are i.i.d. copies of }(M,Q),$$ in the case when…
We propose a general framework for modelling network data that is designed to describe aspects of non-exchangeable networks. Conditional on latent (unobserved) variables, the edges of the network are generated by their finite growth history…