Related papers: Martingale approach for tail asymptotic problems i…
This note is devoted to the study of the maximum of the excursion of a random walk with negative drift and light-tailed increments. More precisely, we determine the local asymptotics of the joint distribution of the length, maximum and the…
The question whether a time series behaves as a random walk or as a station- ary process is an important and delicate problem, particularly arising in financial statistics, econometrics, and engineering. This paper studies the problem to…
In this paper non-asymptotic exponential and moment estimates are derived for tail of distribution for discrete time martingale under norming sequence 1/n, as in the classical Law of Large Numbers (LLN), by means of martingale differences…
We suggest a method for constructing positive harmonic functions for a wide class of transition kernels on $Z^+$. We also find natural conditions under which these functions have positive finite limits at infinity. Further, we apply our…
We consider the problem of inference for non-stationary time series with heavy-tailed error distribution. Under a time-varying linear process framework we show that there exists a suitable local approximation by a stationary process with…
Computing the stationary distributions of a continuous-time Markov chain (CTMC) involves solving a set of linear equations. In most cases of interest, the number of equations is infinite or too large, and the equations cannot be solved…
We study the large-time asymptotic of renewal-reward processes with a heavy-tailed waiting time distribution. It is known that the heavy tail of the distribution produces an extremely slow dynamics, resulting in a singular large deviation…
We investigate a stationary random coefficient autoregressive process. Using renewal type arguments tailor-made for such processes, we show that the stationary distribution has a power-law tail. When the model is normal, we show that the…
A parallel server system with $n$ identical servers is considered. The service time distribution has a finite mean $1/\mu$, but otherwise is arbitrary. Arriving customers are be routed to one of the servers immediately upon arrival.…
We consider a tandem queue with coupled processors, which is subject to global breakdowns. When the network is in the operating mode and both queues are non empty, the total service capacity is shared among the stations according to fixed…
We study a general $k$ dimensional infinite server queues process with Markov switching, Poisson arrivals and where the service times are fat tailed with index $\alpha\in (0,1)$. When the arrival rate is sped up by a factor $n^\gamma$, the…
In this paper we propose a framework that enables the study of large deviations for point processes based on stationary sequences with regularly varying tails. This framework allows us to keep track not of the magnitude of the extreme…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…
Assume that claims in a portfolio of insurance contracts are described by independent and identically distributed random variables with regularly varying tails and occur according to a near mixed Poisson process. We provide a collection of…
This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of…
In this paper we are concerned with a sample of asymptotically independent risks. Tail asymptotic probabilities for linear combinations of randomly weighted order statistics are approximated under various assumptions, where the individual…
In this paper, we consider an $N$-queue overloaded polling network attended by a single cyclically roving server. Upon the completion of his service, a customer is either routed to another queue or leaves the system. All the switches are…
Consider a modified, stable, two node Jackson network where server 2 helps server 1 when server 2 is idle. The probability of a large deviation of the number of customers at node one can be calculated using the flat boundary theory of…
We compute the stationary in-degree probability, $P_{in}(k)$, for a growing network model with directed edges and arbitrary out-degree probability. In particular, under preferential linking, we find that if the nodes have a light tail…