English
Related papers

Related papers: Heavy-traffic analysis of the maximum of an asympt…

200 papers

Consider a family of random walks $S_n^{(a)}=X_1^{(a)}+\cdots+X_n^{(a)}$ with negative drift $\mathbf E X_1^{(a)}=-a<0$ and finite variance $\mbox{var}(X_1^{(a)})=\sigma^2<\infty$.Let $M^{(a)}=\max_{n\ge 0} S_n^{(a)}$ be the maximums of the…

Probability · Mathematics 2018-06-29 Denis Denisov , Johannes Kugler

Consider a family of $\Delta$-latticed aperiodic random walks $\{S^{(a)},0\le a\le a_0\}$ with increments $X_i^{(a)}$ and non-positive drift $-a$. Suppose that $\sup_{a\le a_0}\mathbf{E}[(X^{(a)})^2]<\infty$ and $\sup_{a\le…

Probability · Mathematics 2014-04-01 Johannes Kugler

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…

Probability · Mathematics 2017-11-29 Stan Zachary , Sergey Foss

In this paper we derive a technique of obtaining limit theorems for suprema of L\'evy processes from their random walk counterparts. For each $a>0$, let $\{Y^{(a)}_n:n\ge 1\}$ be a sequence of independent and identically distributed random…

Probability · Mathematics 2011-05-23 Kamil Marcin Kosinski , Onno Boxma , Bert Zwart

Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic…

Probability · Mathematics 2011-04-08 Mariana Olvera-Cravioto , Jose Blanchet , Peter Glynn

Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its…

Probability · Mathematics 2020-04-28 Hongyan Sun , Hua-Ming Wang

Consider a random walk $S_n=\sum_{i=0}^n X_i$ with negative drift. This paper deals with upper bounds for the maximum $M=\max_{n\ge 1}S_n$ of this random walk in different settings of power moment existences. As it is usual for deriving…

Probability · Mathematics 2011-07-28 Johannes Kugler , Vitali Wachtel

Consider a random walk $S=(S_n:n\geq 0)$ that is ``perturbed'' by a stationary sequence $(\xi_n:n\geq 0)$ to produce the process $(S_n+\xi_n:n\geq0)$. This paper is concerned with computing the distribution of the all-time maximum…

Probability · Mathematics 2007-05-23 Victor F. Araman , Peter W. Glynn

Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let $W$ denote the steady-state waiting time in the ${\rm GI}/{\rm G}/1$ queue. Kingman (1961) showed that $W$, when…

Probability · Mathematics 2022-06-22 M. A. A. Boon , A. J. E. M. Janssen , J. S. H. van Leeuwaarden

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…

Probability · Mathematics 2011-03-22 Mariana Olvera-Cravioto , Peter W. Glynn

We study the asymptotics for the maximum on a random time interval of a random walk with a long-tailed distribution of its increments and negative drift. We extend to a general stopping time a result by Asmussen (1998), simplify its proof,…

Probability · Mathematics 2017-11-29 Sergey Foss , Stan Zachary

We are interested in a large queue in a $GI/G/k$ queue with heterogeneous servers. For this, we consider tail asymptotics and weak limit approximations for the stationary distribution of its queue length process in continuous time under a…

Probability · Mathematics 2017-03-10 Masakiyo Miyazawa

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

Statistical Mechanics · Physics 2009-11-11 Alain Comtet , Satya N. Majumdar

The busy period for a queue is cast as the area swept under the random walk until it first returns to zero, $B$. Encompassing non-i.i.d. increments, the large-deviations asymptotics of $B$ is addressed, under the assumption that the…

Probability · Mathematics 2015-09-16 Ken R. Duffy , Sean P. Meyn

The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…

Probability · Mathematics 2015-02-13 Rahul Singh , Alexander Stolyar

Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$.…

Probability · Mathematics 2018-10-01 Bastien Mallein

We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…

Probability · Mathematics 2017-11-29 Sergey Foss , Zbigniew Palmowski , Stan Zachary

For a continuous-time random walk $X=\{X_t,t\ge 0\}$ (in general non-Markov), we study the asymptotic behavior, as $t\rightarrow \infty$, of the normalized additive functional $c_t\int_0^{t} f(X_s)ds$, $t\ge 0$. Similarly to the Markov…

Probability · Mathematics 2021-07-01 Yuri Kondratiev , Yuliya Mishura , Georgiy Shevchenko

We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…

Probability · Mathematics 2012-08-03 Ostap Hryniv , Iain M. MacPhee , Mikhail V. Menshikov , Andrew R. Wade

We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions…

Probability · Mathematics 2019-03-19 Asaf Cohen
‹ Prev 1 2 3 10 Next ›