Logarithmic Asymptotics for the Supremum of a Stochastic Process1 by Ken Duffy,2
نویسندگان
چکیده
Logarithmic asymptotics are proved for the tail of the supremum of a stochastic process, under the assumption that the process satisfies a restricted large deviation principle on regularly varying scales. The formula for the rate of decay of the tail of the supremum, in terms of the underlying rate function, agrees with that stated by Duffield and O’Connell [Math. Proc. Cambridge Philos. Soc. (1995) 118 363–374]. The rate function of the process is not assumed to be convex. A number of queueing examples are presented which include applications to Gaussian processes and Weibull sojourn sources.
منابع مشابه
Logarithmic asymptotics for unserved messages at a FIFO
We consider an infinite–buffered single server First In, First Out (FIFO) queue. Messages arrives at stochastic intervals and take random amounts of time to process. Logarithmic asymptotics are proved for the tail of the distribution of the number of messages awaiting service, under general large deviation and stability assumptions, and formulae presented for the asymptotic decay rate.
متن کاملLogarithmic asymptotics for a single-server processing distinguishable sources
We consider a single-server first-in-first-out queue fed by a finite number of distinct sources of jobs. For a large class of short-range dependent and light-tailed distributed job processes, using functional large deviation techniques we prove a large deviation principle and logarithmic asymptotics for the joint waiting time and queue lengths distribution. We identify the paths that are most l...
متن کاملTail Asymptotics for the Supremum of an Independent Subadditive Process, with Applications to Monotone-separable Networks
Tail asymptotics for the supremum of an independent subadditive process are obtained as a function of the logarithmic moment generating function. We use this analysis to obtain large deviations results for queueing networks in their stationary regime. In the particular case of (max,plus)-linear recursions, the rate of exponential decay of the stationary solution can be explicitly computed.
متن کاملStochastic processes in random graphs
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint distribution of the number of connected components, of the sizes of the giant components, and of the numbers of the excess edges of the giant components. For the sup...
متن کاملSubexponential Asymptotics of a Markov-Modulated Random Walk with Queueing Applications
and approximations for atm multiplexers with applications to video teleconferencing," \Logarithmic asymptotics for steady-state tail probabilities in a single-server queue," Studies in Appl. KAR30] J. Karamata, \Sur un mode de croissance r eguili ere des fonctions," Mathematica (Cluj), 1930. ARN80] K. Arndt, \Asymptotic properties of the distributions of the supremum of random walk on a markov ...
متن کامل