Extreme values and the law of the iterated logarithm

1987 ◽  
Vol 74 (3) ◽  
pp. 319-340 ◽  
Author(s):  
J. Kuelbs ◽  
M. Ledoux
Keyword(s):  
Extreme Values ◽  
Iterated Logarithm ◽  
The Law

On the extreme values of M/M/m queueing systems

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Ivan K. Matsak
Keyword(s):  
Asymptotic Behavior ◽  
Weak Convergence ◽  
Waiting Time ◽  
Extreme Values ◽  
Queueing Systems ◽  
Iterated Logarithm ◽  
The Law

Abstract The asymptotic behavior of extreme values of queueing systems is studied. For a system M / M / m {{M/M/m}} , 1 ≤ m < ∞ {1\leq m<\infty} , the weak convergence of extreme values of an actual waiting time and a statement of the type of the law of the iterated logarithm are established.

scholarly journals The Law of the Iterated Logarithm for a Markov Process

1970 ◽  
Vol 41 (3) ◽  
pp. 945-955 ◽  
Author(s):  
R. P. Pakshirajan ◽  
M. Sreehari
Keyword(s):  
Markov Process ◽  
Iterated Logarithm ◽  
The Law

The law of the Iterated Logarithm for random interval homeomorphisms

2021 ◽  
Author(s):  
Klaudiusz Czudek ◽  
Tomasz Szarek ◽  
Hanna Wojewódka-Ściążko
Keyword(s):  
Random Interval ◽  
Iterated Logarithm ◽  
The Law

On the Limit Set in the Law of the Iterated Logarithm for U-statistics of Order Two

2004 ◽  
pp. 111-126
Author(s):  
Stanislaw Kwapień ◽  
Rafał Latała ◽  
Krzysztof Oleszkiewicz ◽  
Joel Zinn
Keyword(s):  
Limit Set ◽  
U Statistics ◽  
Iterated Logarithm ◽  
The Law

scholarly journals On the law of the iterated logarithm in the infinite variance case

1980 ◽  
Vol 30 (1) ◽  
pp. 5-14 ◽  
Author(s):  
R. A. Maller
Keyword(s):  
Sufficient Conditions ◽  
Random Variables ◽  
Necessary And Sufficient Conditions ◽  
Infinite Variance ◽  
Iterated Logarithm ◽  
The Law ◽  
Necessary And Sufficient ◽  
Independent And Identically Distributed

AbstractThe main purpose of the paper is to give necessary and sufficient conditions for the almost sure boundedness of (Sn – αn)/B(n), where Sn = X1 + X2 + … + XmXi being independent and identically distributed random variables, and αnand B(n) being centering and norming constants. The conditions take the form of the convergence or divergence of a series of a geometric subsequence of the sequence P(Sn − αn > a B(n)), where a is a constant. The theorem is distinguished from previous similar results by the comparative weakness of the subsidiary conditions and the simplicity of the calculations. As an application, a law of the iterated logarithm general enough to include a result of Feller is derived.

scholarly journals On the law of the iterated logarithm for permuted lacunary sequences

2012 ◽  
Vol 276 (1) ◽  
pp. 3-20 ◽  
Author(s):  
C. Aistleitner ◽  
I. Berkes ◽  
R. Tichy
Keyword(s):  
Lacunary Sequences ◽  
Iterated Logarithm ◽  
The Law
Sign in / Sign up

Export Citation Format

Share Document