The Annals of Applied Probability

Logarithmic asymptotics for the supremum of a stochastic process

Ken Duffy, John T. Lewis, and Wayne G. Sullivan

Full-text: Open access


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.

Article information

Ann. Appl. Probab., Volume 13, Number 2 (2003), 430-445.

First available in Project Euclid: 18 April 2003

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60F10: Large deviations
Secondary: 60K25: Queueing theory [See also 68M20, 90B22]

Extrema of stochastic process large deviation theory queueing theory


Duffy, Ken; Lewis, John T.; Sullivan, Wayne G. Logarithmic asymptotics for the supremum of a stochastic process. Ann. Appl. Probab. 13 (2003), no. 2, 430--445. doi:10.1214/aoap/1050689587.

Export citation


  • [1] ASMUSSEN, S. and COLLAMORE, J. F. (1999). Exact asy mptotics for a large deviations problem for the GI/G/1 queue. Markov Process. Related Fields 5 451-476.
  • [2] BINGHAM, N. H., GOLDIE, C. M. and TEUGELS, J. L. (1987). Regular Variation. Cambridge Univ. Press.
  • [3] DEMBO, A. and ZEITOUNI, O. (1998). Large Deviation Techniques and Applications. Springer, Berlin.
  • [4] DUFFIELD, N. G. and O'CONNELL, N. (1995). Large deviations and overflow probabilities for the general single server queue, with applications. Math. Proc. Cambridge Philos. Soc. 118 363-374.
  • [5] DUFFY, K. (2000). Logarithmic asy mptotics in queueing theory and risk theory. Ph.D. thesis, Trinity College, Dublin.
  • [6] ELLIS, R. (1984). Large deviations for a general class of random vectors. Ann. Probab. 12 1-12.
  • [7] GÄRTNER, J. (1977). On large deviations from the invariant measure. Theory Probab. Appl. 22 24-39.
  • [8] GLy NN, P. and WHITT, W. (1994). Logarithmic asy mptotics for steady-state tail probabilities in a single-server queue. J. Appl. Probab. 31A 413-430.
  • [9] HALMOS, P. R. (1956). Ergodic Theory. Chelesa, New York.
  • [10] LIU, Z., NAIN, P., TOWSLEY, D. and ZHANG, Z. L. (1999). Asy mptotic behavior of a multiplexer fed with a long-range dependent process. J. Appl. Probab. 36 105-118.
  • [11] LOy NES, R. M. (1962). The stability of a queue with non-independent inter-arrival and service times. Proc. Cambridge Philos. Soc. 58 497-520.
  • [12] MASSOULIE, L. and SIMONIAN, A. (1999). Large buffer asy mptotics for the queue fed with FBM input. J. Appl. Probab. 36 894-906.
  • [13] MIKOSCH, T. and NAGAEV, A. V. (1998). Large deviations of heavy-tailed sums with applications in insurance. Extremes 1 81-110.
  • [14] PARULEKAR, M. and MAKOWSKI, A. M. (1997). M/G/ input processes: A versatile class of models for network traffic. IEEE INFOCOM 2 419-426.
  • RATHMINES, DUBLIN 6 IRELAND E-MAIL: ken.duffy, john.lewis, way