Tail asymptotics for the maximum of perturbed random walk (Q862212): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q495566
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Peter W. Glynn / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100822211 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0610271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffusion approximations for the maximum of a perturbed random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied Probability and Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5637709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Asymptotics for Planning Critical Safety Stocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrected Diffusion Approximations for a Multistage Production-Inventory System / rank
 
Normal rank
Property / cites work
 
Property / cites work: First passage times for perturbed random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Inventory Model with Stochastic Lead Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear renewal theory with applications to sequential analysis. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear renewal theory with applications to sequential analysis II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of the coupling method in renewal theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous-review (<i>s, S</i>) inventory model under compound renewal demand and random lead times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruin probabilities in perturbed risk models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cramér-Lundberg approximations for ruin probabilities of risk processes perturbed by diffusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic leadtimes in continuous-time inventory models / rank
 
Normal rank

Latest revision as of 13:43, 25 June 2024

scientific article
Language Label Description Also known as
English
Tail asymptotics for the maximum of perturbed random walk
scientific article

    Statements

    Tail asymptotics for the maximum of perturbed random walk (English)
    0 references
    0 references
    0 references
    5 February 2007
    0 references
    A perturbed random walk with a negative drift is considered. The main goal of the given approach is to compute the distribution of the all-time maximum \(M_{\infty} = \max\{S_{k} + \xi_{k}: k \geq 0\}\) of a perturbed random walk with a negative drift. The quantity \(M_{\infty}\) describes the steady-state of end-to-end delay time in a computer network modeling, as well as order-to-delivery time in a make-to-order production system, insurance risk evaluation, etc. As main results, the asymptotics for \(\mathbb{P}(M_{\infty} > x)\) as \(x \rightarrow \infty\) is obtained. It is derived that the tail asymptotics depend on whether the \(\xi_{n}\)'s are light- or heavy-tailed. Additionally, in the light-tailed setting, the tail asymptotic is closely related to the Cramér-Lundberg asymptotic for standard random walk.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    queueing theory
    0 references
    functional limit theorems
    0 references
    performance evaluation
    0 references
    queues and service
    0 references
    random walks
    0 references
    traffic problems
    0 references
    0 references
    0 references