Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 60 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 77 tok/s Pro
Kimi K2 159 tok/s Pro
GPT OSS 120B 456 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Tail asymptotics for cumulative processes sampled at heavy-tailed random times with applications to queueing models in Markovian environments (1203.6574v9)

Published 29 Mar 2012 in math.PR, math.ST, and stat.TH

Abstract: This paper considers the tail asymptotics for a cumulative process ${B(t); t \ge 0}$ sampled at a heavy-tailed random time $T$. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality ${\sf P}(B(T) > bx) \sim {\sf P}(M(T) > bx) \sim {\sf P}(T>x)$ as $x \to \infty$, where $M(t) = \sup_{0 \le u \le t}B(u)$ and $b$ is a certain positive constant. The main results of this paper can be used to obtain the subexponential asymptotics for various queueing models in Markovian environments. As an example, using the main results, we derive subexponential asymptotic formulas for the loss probability of a single-server finite-buffer queue with an on/off arrival process in a Markovian environment.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)