Asymptotic behavior of the maximum of sums of I.I.D. random variables along monotone blocks

被引:0
作者
Martikainen A.I. [1 ]
机构
[1] St. Petersburg State University, St. Petersburg
基金
俄罗斯基础研究基金会;
关键词
Asymptotic Behavior; Random Vector; Indicator Function; Maximal Gain; Large Index;
D O I
10.1007/s10958-006-0040-y
中图分类号
学科分类号
摘要
Let {Xi, Yi}i=1,2,... be an i.i.d. sequence of bivariate random vectors with P(Y1 = y) = 0 for all y. Put Mn(j) = max0≤k≤n-j (Xk+1 + ... X k+j)Ik,j, where Ik,k+j = I{Yk+1 < ⋯ < Yk+j} denotes the indicator function for the event in brackets, 1 ≤ j ≤ n. Let Ln be the largest index l ≤ n for which Ik,k+l = 1 for some k = 0, 1, ..., n - l. The strong law of large numbers for "the maximal gain over the longest increasing runs," i.e., for Mn(Ln) has been recently derived for the case where X1 has a finite moment of order 3 + ε, ε > 0. Assuming that X1 has a finite mean, we prove for any a = 0, 1, ..., that the s.l.l.n. for M(Ln - a) is equivalent to EX 1 3+a I{X1 > 0} < ∞. We derive also some new results for the a.s. asymptotics of Ln. © 2006 Springer Science+Business Media, Inc.
引用
收藏
页码:1308 / 1313
页数:5
相关论文
共 5 条
  • [1] Frolov A.N., Martikainen A.I., Steinebach J., Strong laws for the maximal gain over increasing runs, Statist. Probab. Lett., 50, pp. 305-312, (2000)
  • [2] Martikainen A.I., On the strong law of large numbers for sums over increasing runs, J. Statist. Planning Inference, 132, pp. 75-92, (2005)
  • [3] Novak D.Y., Longest runs in a sequence of m-dependent random variables, Probab. Theory Relat. Fields, 91, pp. 269-281, (1992)
  • [4] Pittel D.G., Limiting behavior of a process of runs, Ann. Probab., 9, pp. 119-129, (1981)
  • [5] Rozovsky L.V., Some estimates for probabilities of one-sided large deviations, Teor. Veroyatn. Primen., 30, pp. 800-804, (1985)