The exponential rate of convergence of the distribution of the maximum of a random walk
Journal of Applied ProbabilityPublished 1 June 1975
Noël Veraverbeke, J. L. Teugels
Citations32
SJR quartileQ2
SJR score0.53
SNIP0.91
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Let G n ( x ) be the distribution function of the maximum of the successive partial sums of independent and identically distributed random variables and G ( x ) its limiting distribution function. Under conditions, typical for complete exponential convergence, the decay of G n ( x ) — G ( x ) is asymptotically equal to c.H(x)n −3/2 γ n as n → ∞ where c and γ are known constants and H ( x ) is a function solely depending on x .
Keywords
Computer ScienceDecision SciencesMathematics
Journal of the Franklin InstituteAn introduction to probability theory and its applications
29,966 Citations1958
Journal of the American Statistical AssociationAn Introduction to Probability Theory.
3,328 Citations1986Bert Fristedt, P. A. P. Moran
Birkhäuser Boston eBooksA Combinatorial Lemma and its Application to Probability Theory
533 Citations1991Frank Spitzer
Journal of the Royal Statistical Society Series A (General)The Single Server Queue.
375 Citations1983E. S. Page, J. W. Cohen
Journal of Applied ProbabilityRandom walks with negative drift conditioned to stay positive
55 Citations1974Donald L. Iglehart
Journal of Applied ProbabilityRandom walks with negative drift conditioned to stay positive
52 Citations1974Donald L. Iglehart
Journal of Applied ProbabilityComplete exponential convergence and some related topics
47 Citations1967C. R. Heathcote
Probability Theory and Related FieldsGeometric ergodicity in a class of denumerable Markov chains
32 Citations1966H. D. Miller
Operations ResearchAn Approximation for the Moments of Waiting Times
28 Citations1969C. R. Heathcote, P. Winer
An approximation procedure applicable to a wide class of single-server queues that considers the moments of the waiting time Wn of the nth arriving customer of the system GI/G/1 and given certain conditions uses an expansion related to the central limit theorem to derive approximations to these moments.
Journal of the Australian Mathematical SocietyOn the rate of convergence of waiting times
20 Citations1965C. K. Cheong, C. R. Heathcote
Journal of Applied ProbabilityLimiting behaviour of the distributions of the maxima of partial sums of certain random walks
17 Citations1972D. J. Emery
Journal of Applied ProbabilityLimiting behaviour of the distributions of the maxima of partial sums of certain random walks
4 Citations1972D. J. Emery
