2017
DOI: 10.1007/s10959-017-0744-6
|View full text |Cite
|
Sign up to set email alerts
|

Approximate Central Limit Theorems

Abstract: Abstract. We refine the classical Lindeberg-Feller central limit theorem by obtaining asymptotic bounds on the Kolmogorov distance, the Wasserstein distance, and the parametrized Prokhorov distances in terms of a Lindeberg index. We thus obtain more general approximate central limit theorems, which roughly state that the row-wise sums of a triangular array are approximately asymptotically normal if the array approximately satisfies Lindeberg's condition. This allows us to continue to provide information in non… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…The main constraints include the power balance constraint, unit climbing constraint, and minimum start-stop time constraint. The mathematical model is shown in (18).…”
Section: Construction and Solution Of The Coo Rough Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…The main constraints include the power balance constraint, unit climbing constraint, and minimum start-stop time constraint. The mathematical model is shown in (18).…”
Section: Construction and Solution Of The Coo Rough Modelmentioning
confidence: 99%
“…where ∆P Dt represents the active power reserved by the system at time t. First, the data-driven SCUC discrete variable identification strategy is utilized to determine constant units. Then, equation (18) is used to screen the solution space, and the feasible region Θ N of unit start-stop variable U Git can be obtained. The N feasible solutions are selected randomly and uniformly in the feasible region Θ N , and the cost F 1 for all start-stop units is taken as the objective function.…”
Section: Construction and Solution Of The Coo Rough Modelmentioning
confidence: 99%
“…According to the Lindeberg-Feller Central Limit Theorem [25], suppose that x i are the random series that the mean is E(x i ) = ξ i and the variance is Var(x i ) = δ 2 i , and the partial sum of the series is defined as:…”
Section: The Weakness Of the Complexica Algorithm For Separating Weakmentioning
confidence: 99%