LIMITING BEHAVIOUR for ARRAYS of UPPER EXTENDED NEGATIVELY DEPENDENT RANDOM VARIABLES

João Lita Da Silva

doi:10.1017/S0004972715000374

LIMITING BEHAVIOUR for ARRAYS of UPPER EXTENDED NEGATIVELY DEPENDENT RANDOM VARIABLES

João Lita Da Silva

DM - Departamento de Matemática

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

For triangular arrays {X_n,k : 1 ≤ k ≤ n, n ≥ 1} of upper extended negatively dependent random variables weakly mean dominated by a random variable X and sequences {b_n} of positive constants, conditions are given to guarantee an almost sure finite upper bound to ∑_k=1ⁿ(X_n,k - EX_n,k)/√b_n Log n, where Log n := max{1, log n}, thus getting control over the limiting rate in terms of the prescribed sequence {b_n} and permitting us to weaken or strengthen the assumptions on the random variables.

Original language	English
Pages (from-to)	159-167
Number of pages	9
Journal	Bulletin Of The Australian Mathematical Society
Volume	92
Issue number	1
DOIs	https://doi.org/10.1017/S0004972715000374
Publication status	Published - 6 Jul 2015

Keywords

Bernstein inequality
law of the logarithm
upper extended negatively dependent arrays

Access to Document

10.1017/S0004972715000374

Cite this

@article{8010c84d11ef420493d3755ff495d672,

title = "LIMITING BEHAVIOUR for ARRAYS of UPPER EXTENDED NEGATIVELY DEPENDENT RANDOM VARIABLES",

abstract = "For triangular arrays {Xn,k : 1 ≤ k ≤ n, n ≥ 1} of upper extended negatively dependent random variables weakly mean dominated by a random variable X and sequences {bn} of positive constants, conditions are given to guarantee an almost sure finite upper bound to ∑k=1n(Xn,k - EXn,k)/√bn Log n, where Log n := max{1, log n}, thus getting control over the limiting rate in terms of the prescribed sequence {bn} and permitting us to weaken or strengthen the assumptions on the random variables.",

keywords = "Bernstein inequality, law of the logarithm, upper extended negatively dependent arrays",

author = "{Lita Da Silva}, Jo{\~a}o",

year = "2015",

month = jul,

day = "6",

doi = "10.1017/S0004972715000374",

language = "English",

volume = "92",

pages = "159--167",

journal = "Bulletin Of The Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

T1 - LIMITING BEHAVIOUR for ARRAYS of UPPER EXTENDED NEGATIVELY DEPENDENT RANDOM VARIABLES

AU - Lita Da Silva, João

PY - 2015/7/6

Y1 - 2015/7/6

N2 - For triangular arrays {Xn,k : 1 ≤ k ≤ n, n ≥ 1} of upper extended negatively dependent random variables weakly mean dominated by a random variable X and sequences {bn} of positive constants, conditions are given to guarantee an almost sure finite upper bound to ∑k=1n(Xn,k - EXn,k)/√bn Log n, where Log n := max{1, log n}, thus getting control over the limiting rate in terms of the prescribed sequence {bn} and permitting us to weaken or strengthen the assumptions on the random variables.

AB - For triangular arrays {Xn,k : 1 ≤ k ≤ n, n ≥ 1} of upper extended negatively dependent random variables weakly mean dominated by a random variable X and sequences {bn} of positive constants, conditions are given to guarantee an almost sure finite upper bound to ∑k=1n(Xn,k - EXn,k)/√bn Log n, where Log n := max{1, log n}, thus getting control over the limiting rate in terms of the prescribed sequence {bn} and permitting us to weaken or strengthen the assumptions on the random variables.

KW - Bernstein inequality

KW - law of the logarithm

KW - upper extended negatively dependent arrays

UR - http://www.scopus.com/inward/record.url?scp=84937525857&partnerID=8YFLogxK

U2 - 10.1017/S0004972715000374

DO - 10.1017/S0004972715000374

M3 - Article

AN - SCOPUS:84937525857

VL - 92

SP - 159

EP - 167

JO - Bulletin Of The Australian Mathematical Society

JF - Bulletin Of The Australian Mathematical Society

SN - 0004-9727

IS - 1

ER -

LIMITING BEHAVIOUR for ARRAYS of UPPER EXTENDED NEGATIVELY DEPENDENT RANDOM VARIABLES

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this