1978
DOI: 10.1214/aop/1176995570
|View full text |Cite
|
Sign up to set email alerts
|

An $L_p$ Bound for the Remainder in a Combinatorial Central Limit Theorem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
65
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 98 publications
(72 citation statements)
references
References 0 publications
2
65
0
Order By: Relevance
“…We will use the following result, where we use the notation · for the infinity norm. [16], Lemma 1.1) given by…”
Section: 1mentioning
confidence: 99%
“…We will use the following result, where we use the notation · for the infinity norm. [16], Lemma 1.1) given by…”
Section: 1mentioning
confidence: 99%
“…From now, we use the following system giving by Ho and Chen (Ho, S.T., 1978) and Neammanee and Rattanawong (Neammanee, K. & Rattanawong, P., 2008). …”
Section: Auxiliary Resultsmentioning
confidence: 99%
“…In the case of d = 2, we observe that this is a special case of the combinatorial central limit theorem (For more detail see Von Bahr (Von Bahr, B., 1976), Ho and Chen (Ho, S.T., 1978)). Under the finiteness of absolute third moment, Neammanee and Suntornchost (Neammanee, K. & Suntornchost, J., 2005) gave the uniform rate of convergence and obtained the rate 198 √ n .…”
Section: Introductionmentioning
confidence: 82%
“…In some cases, the probability thatW actually belongs to this set can be directly estimated. This is the so called concentration inequality approach; see [8]- [10] and [18]. Since |f | is large only on a small set, | E f (Z)| can be controlled if Z has a bounded density, in particular if Z is normal.…”
Section: )mentioning
confidence: 99%