Related papers: Tail asymptotics for busy periods
We study the distribution of the maximum $M$ of a random walk whose increments have a distribution with negative mean and belonging, for some $\gamma>0$, to a subclass of the class $\mathcal{S}_\gamma$--see, for example, Chover, Ney, and…
This paper is concerned with the asymptotic analysis of sojourn times of random fields with continuous sample paths. Under a very general framework we show that there is an interesting relationship between tail asymptotics of sojourn times…
We consider a transient random walk on $Z^d$ which is asymptotically stable, without centering, in a sense which allows different norming for each component. The paper is devoted to the asymptotics of the probability of the first return to…
This paper addresses heavy-tailed large deviation estimates for the distribution tail of functionals of a class of spectrally one-sided L\'evy process. Our contribution is to show that these estimates remain valid in a near-critical regime.…
A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework contains several classical queueing network models, including generalized…
Let F be a distribution function with negative mean and regularly varying right tail. Under a mild smoothness condition we derive higher order asymptotic expansions for the tail distribution of the maxima of the random walk generated by F.…
We consider reflecting random walks on the nonnegative integers with drift of order 1/x at height x. We establish explicit asymptotics for various probabilities associated to such walks, including the distribution of the hitting time of 0…
We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a…
Let $X_{1},\ldots ,X_{n}$ be $n$ real-valued dependent random variables. With motivation from Mitra and Resnick (2009), we derive the tail asymptotic expansion for the weighted sum of order statistics $X_{1:n}\leq \cdots \leq X_{n:n}$ of…
In this paper, the area swept under the workload graph is analyzed: with $\{Q(t) : t\ge0\}$ denoting the stationary workload process, the asymptotic behavior of \[\pi_{T(u)}(u):={\mathbb{P}}\biggl(\int_0^ {T(u)}Q(r)\,\mathrm{d}r>u\biggr)\]…
We consider a discrete-time random walk on a one-dimensional lattice with space and time-dependent random jump probabilities, known as the Beta random walk. We are interested in the probability that, for a given realization of the jump…
For families of random walks $\{S_k^{(a)}\}$ with $\mathbf E S_k^{(a)} = -ka < 0$ we consider their maxima $M^{(a)} = \sup_{k \ge 0} S_k^{(a)}$. We investigate the asymptotic behaviour of $M^{(a)}$ as $a \to 0$ for asymptotically stable…
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…
When an explicit expression for a probability distribution function $F(x)$ can not be found, asymptotic properties of the tail probability function $\bar{F}(x)=1-F(x)$ are very valuable, since they provide approximations or bounds for…
We consider importance sampling for estimating the probability that a light-tailed $d$-dimensional random walk exits through one of many disjoint rare-event regions before reaching an anticipated target. This problem arises in sequential…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
Let $(X_n:n\geq 0)$ be a sequence of i.i.d. r.v.'s with negative mean. Set $S_0=0$ and define $S_n=X_1+... +X_n$. We propose an importance sampling algorithm to estimate the tail of $M=\max \{S_n:n\geq 0\}$ that is strongly efficient for…
This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…
This paper gives various asymptotic formulae for the transition probability associated with discrete time quantum walks on the real line. The formulae depend heavily on the `normalized' position of the walk. When the position is in the…
We study the asymptotics of the stationary sojourn time Z of a "typical customer" in a tandem of single-server queues. It is shown that, in a certain "intermediate" region of light-tailed service time distributions, Z may take a large value…