Strong laws for the maximal gain over increasing runs

Andrei Frolov, Alexander Martikainen and Josef Steinebach

Statistics & Probability Letters, 2000, vol. 50, issue 3, 305-312

Abstract: 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=Mn(Ln)=max0[less-than-or-equals, slant]k[less-than-or-equals, slant]n-Ln(Xk+1+...+Xk+Ln)Ik,Ln, where Ik,l=I{Yk+1[less-than-or-equals, slant]...[less-than-or-equals, slant]Yk+l} denotes the indicator function of the event in brackets, Ln is the largest l[less-than-or-equals, slant]n, for which Ik,l=1 for some k=0,1,...,n-l. If, for example, Xi=Yi, i[greater-or-equal, slanted]1, and Xi denotes the gain in the ith repetition of a game of chance, then Mn is the maximal gain over increasing runs of maximal length Ln. We derive a strong law of large numbers and a law of iterated logarithm type result for Mn.

Keywords: Strong; law; of; large; numbers; Law; of; iterated; logarithm; Increasing; run (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(00)00119-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:50:y:2000:i:3:p:305-312

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().