A Law of the Iterated Logarithm for Extreme Queue Length in Multiphase Queues

The object of this research in queueing theory is the Law of the Iterated Logarithm (LIL) under the conditions of heavy traffic in Multiphase Queueing Systems (MQS). In this paper, the LIL is proved for extreme values of important probabilistic characteristics of the MQS investigated as well as maxima and minima of the summary queue length of customers and maxima and minima of the queue length of customers. Also, the paper presents a survey on the works for extreme values in queues and the queues in heavy traffic.      

On the Full Idle Time in Multiphase Queueing Systems

The modern queueing theory is a powerful tool for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. The paper is designated to the analysis of queueing systems arising in the network theory and communications theory (such as the so-called multiphase queueing systems, tandem queues, or series of queueing systems). We present heavy traffic limit theorems for the full idle time in multiphase queueing systems. We prove functional limit theorems for values of the full idle time of a queueing system, which is its important probability characteristic. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 367–386, July–September, 2005.     

Extreme Values and the Multivariate Compact Law of the Iterated Logarithm

For a sequence of independent identically distributed Euclidean random vectors, we prove a compact Law of the iterated logarithm when finitely many maximal terms are omitted from the partial sum. With probability one, the limiting cluster set of the appropriately operator normed partial sums is the closed unit Euclidean ball. The result is proved under the hypotheses that the random vectors belong to the Generalized Domain of Attraction of the multivariate Gaussian law and satisfy a mild integrability condition. The integrability condition characterizes how many maximal terms must be omitted from the partial sum sequence.     

About the Sojourn Time Process in Multiphase Queueing Systems

Multiphase queueing systems (MQS) (tandem queues, queues in series) are of special interest both in theory and in practical applications (packet switch structures, cellular mobile networks, message switching systems, retransmission of video images, asembly lines, etc.). In this paper, we deal with approximations of MQS and present a heavy traffic limit theorems for the sojourn time of a customer in MQS. Functional limit theorems are proved for the customer sojourn time – an important probability characteristic of the queueing system under conditions of heavy traffic.      

线性过程的强逼近和重对数律

本文讨论由独立同分布随机变量列产生的线性过程的泛函型重对数律和强逼近, 同时又给出由NA随机变量列产生的线性过程的重对数律.     

迭代Brown运动的一个Chung型重对数律

X及Y分别为Rd1及Rd2中的相互独立的标准Brown运动,满足X（0）=Y（0）=0．定义,称为一个迭代Brown运动．本文给出了关于Zd1,d2的一个Chung型重对数律．     

NA序列重对数律的几个极限定理

设{X_n;n≥1}均值为零、方差有限的NA平稳序列。记S_n=∑_(k=1)~n X_k,M_n=maxk≤n|S_k|,n≥1.假设σ~2=EX_1~2+2∑_(k=2)~∞EX_1X_k>0。本文讨论了:当ε 0时,P{M_n≥εσ(2nloglogn)~(1/2)的一类加权级数的精确渐近性质,以及当ε∞时,P{M_n≤εσ(π~2n/(8loglogn))~(1/2)}的一类加权级数的精确渐近性质。这些性质与重对数律和Chung重对数律的速度有关。     

On the Analysis of the Virtual Waiting Time in Open Queueing Networks

The model of an open queueing network in heavy traffic has been developed. These models are mathematical models of computer networks in heavy traffic. A limit theorem has been presented for the virtual waiting time of a customer in heavy traffic in open queueing networks. Finally, we present an application of the theorem—a reliability model from computer network practice.     

加权U—统计量的一个重对数律

证明了关于独立同分布随机变量序列的加权Ｕ－统计量的一个重对数律,类似于献「３」证明了一个加权Ｕ－统计量的解耦不等式。     

两参数OU过程的钟重对数律（英）

在本文中，我们证明了两参数OU过程的钟重对数律。     

关于可交换随机变量序列的重对数律

本文讨论了可交换随机变量序列{Xn:n≥1}的重对数律。     

On the Law of The Iterated Logarithm for Rapidly Increasing Subsequences

The usual law of the iterated logarithm states that the partial sums S_n of independent and identically distributed random variables can be normalized by the sequence a_n = √nlog log n, such that limsup_n→∞ S_n/a_n = √2 a.s. As has been pointed out by Gut (1986) the law fails if one considers the limsup along subsequences which increase faster than exponentially. In particular, for very rapidly increasing subsequences {n_k≥1} one has limsup_k→∞ S_nk/a_nk = 0 a.s. In these cases the normalizing constants a_nk have to be replaced by √nk log k to obtain a non-trivial limiting behaviour: limsup_k→∞ S_nk/ √nk log k = √2 a.s. We will present an intelligible argument for this structural change and apply it to related results.     

自正则Chung型重对数律的精确渐近性

设X,X_1,X_2,…为零均值、非退化、吸引域为正态吸引场的独立同分布随机变量序列,记S_n=■X_j,M_n=■|S_k|,V_n~2=■X_j~2,n≥1.证明了当b>-1时,■δ~(-2(b 1))■(log log n)~P/(n log n)P(Mn/V_n≤ε~(π~2)/(8lgo log n)~(1/2)) =4/πГ(b 1)■~(-1)~k/(2k 1)~(2b 3).     

Compound Transient Phenomena in Multiphase Queuing Systems. III

The author continues the work on functional limit theorems in multiphase queuing systems (QS) under heavy traffic. In this paper there are proved theorems for the waiting time of a job when at phases of a system various conditions of heavy traffic are satisfied (compound transient phenomena).     

The Compact Law of the Iterated Logarithm for Multivariate Stochastic Approximation Algorithms

Abstract

We consider a sequence (Z _n ) _n≥1 defined by a general multivariate stochastic approximation algorithm and assume that (Z _n ) converges to a solution z* almost surely. We establish the compact law of the iterated logarithm for Z _n by proving that, with probability one, the limit set of the sequence (Z _n  ? z*) suitably normalized is an ellipsoid. We also give the law of the iterated logarithm for the l ^p norms, p ∈ [1, ∞], of (Z _n  ? z*).     

The Law of the Iterated Logarithm for Weakly Dependent Hilbert Space Valued Random Variables

We consider the bounded and compact laws of the iterated logarithm for weakly dependent Hilbert space valued random variables. Under optimal moment conditions, we prove the bounded and compact laws of the iterated logarithm for sequences of identically distributed Hilbert space valued random variables satisfying the uniform strong mixing condition.     

Wittmann's Law of Iterated Logarithm for Tail Sums of B-Valued Random Variables

We present an analogue of Wittmann's law of iterated logarithm (LIL) for tail sums of independent B-valued random variables by using the isoperimetric method and give the precise value of the upper limit for the LIL for tail sums.     

扩散过程在Holder范数下的局部 Strassen重对数律

在该文中,作者应用扩散过程在Holder范数下的大偏差得到了扩散过程在Holder范数下的局部Strassen重对数律. 并且还得到了重Ito积分的泛函重对数律.     

The Law of the Iterated Logarithm and Central Limit Theorem for L-Statistics

The Chung–Smirnov law of the iterated logarithm and the Finkelstein functional law of the iterated logarithm for empirical processes are used to establish new results on the central limit theorem, the law of the iterated logarithm, and the strong law of large numbers for L-statistics with certain bounded and smooth weight functions. These results are used to obtain necessary and sufficient conditions for almost sure convergence and for convergence in distribution of some well-known L-statistics and U-statistics, including Gini's mean difference statistic. A law of the logarithm for weighted sums of order statistics is also presented.     

The Law of the Iterated Logarithm over a Stationary Gaussian Sequence of Random Vectors

Let {X _j } _{j = 1} be a stationary Gaussian sequence of random vectors with mean zero. We give sufficient conditions for the compact law of the iterate logarithm of