Consistency of Sample Estimates of Risk Averse Stochastic Programs

2013 ◽  
Vol 50 (02) ◽  
pp. 533-541 ◽  
Author(s):  
Alexander Shapiro
Keyword(s):  
Stochastic Programming ◽  
Law Of Large Numbers ◽  
Risk Measures ◽  
Regularity Conditions ◽  
Distributed Data ◽  
Risk Averse ◽  
Asymptotic Consistency ◽  
Stochastic Programs ◽  
Large Numbers ◽  
Independent Identically Distributed

In this paper we study asymptotic consistency of law invariant convex risk measures and the corresponding risk averse stochastic programming problems for independent, identically distributed data. Under mild regularity conditions, we prove a law of large numbers and epiconvergence of the corresponding statistical estimators. This can be applied in a straightforward way to establish convergence with probability 1 of sample-based estimators of risk averse stochastic programming problems.

scholarly journals Consistency of Sample Estimates of Risk Averse Stochastic Programs

2013 ◽  
Vol 50 (2) ◽  
pp. 533-541 ◽  
Author(s):  
Alexander Shapiro
Keyword(s):  
Stochastic Programming ◽  
Law Of Large Numbers ◽  
Risk Measures ◽  
Regularity Conditions ◽  
Distributed Data ◽  
Risk Averse ◽  
Asymptotic Consistency ◽  
Stochastic Programs ◽  
Large Numbers ◽  
Independent Identically Distributed

In this paper we study asymptotic consistency of law invariant convex risk measures and the corresponding risk averse stochastic programming problems for independent, identically distributed data. Under mild regularity conditions, we prove a law of large numbers and epiconvergence of the corresponding statistical estimators. This can be applied in a straightforward way to establish convergence with probability 1 of sample-based estimators of risk averse stochastic programming problems.

A clustering law for some discrete order statistics

2003 ◽  
Vol 40 (01) ◽  
pp. 226-241 ◽  
Author(s):  
Sunder Sethuraman
Keyword(s):  
Distribution Function ◽  
Positive Integer ◽  
Order Statistics ◽  
Law Of Large Numbers ◽  
Asymptotic Properties ◽  
Random Variables ◽  
Large Numbers ◽  
The Law ◽  
Sample Maximum ◽  
Independent Identically Distributed

Let X 1, X 2, …, X n be a sequence of independent, identically distributed positive integer random variables with distribution function F. Anderson (1970) proved a variant of the law of large numbers by showing that the sample maximum moves asymptotically on two values if and only if F satisfies a ‘clustering’ condition, In this article, we generalize Anderson's result and show that it is robust by proving that, for any r ≥ 0, the sample maximum and other extremes asymptotically cluster on r + 2 values if and only if Together with previous work which considered other asymptotic properties of these sample extremes, a more detailed asymptotic clustering structure for discrete order statistics is presented.

scholarly journals A Strong Law of Large Numbers for Weighted Sums of i.i.d. Random Variables under Capacities

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Defei Zhang ◽  
Ping He
Keyword(s):  
Law Of Large Numbers ◽  
Random Variables ◽  
Weighted Sums ◽  
Strong Law ◽  
Large Numbers ◽  
Independent Identically Distributed

With the notion of independent identically distributed (i.i.d.) random variables under sublinear expectations initiated by Peng, a strong law of large numbers for weighted sums of i.i.d. random variables under capacities induced by sublinear expectations is obtained.

Waitingtimes between record observations

1967 ◽  
Vol 4 (01) ◽  
pp. 206-208 ◽  
Author(s):  
Marcel F. Neuts
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Asymptotic Normality ◽  
Central Limit ◽  
Law Of Large Numbers ◽  
Continuous Distribution ◽  
Random Variables ◽  
Large Numbers ◽  
Upper Record ◽  
Independent Identically Distributed

If Δ r denotes the waitingtime between the (r − 1)st and the rth upper record in a sequence of independent, identically distributed random variables with a continuous distribution, then it is shown that Δ r satisfies the weak law of large numbers and a central limit theorem. This theorem supplements those of Foster and Stuart and Rényi, who investigated the index Vr of the rth upper record. Qualitatively the theorems establish the intuitive fact that for higher records, the waitingtime between the last two records outweighs even the total waitingtime for previous records. This explains also why the asymptotic normality of logVr is very inadequate for approximation purposes—Barton and Mallows.

A clustering law for some discrete order statistics

2003 ◽  
Vol 40 (1) ◽  
pp. 226-241 ◽  
Author(s):  
Sunder Sethuraman
Keyword(s):  
Distribution Function ◽  
Positive Integer ◽  
Order Statistics ◽  
Law Of Large Numbers ◽  
Asymptotic Properties ◽  
Random Variables ◽  
Large Numbers ◽  
The Law ◽  
Sample Maximum ◽  
Independent Identically Distributed

Let X1, X2, …, Xn be a sequence of independent, identically distributed positive integer random variables with distribution function F. Anderson (1970) proved a variant of the law of large numbers by showing that the sample maximum moves asymptotically on two values if and only if F satisfies a ‘clustering’ condition, In this article, we generalize Anderson's result and show that it is robust by proving that, for any r ≥ 0, the sample maximum and other extremes asymptotically cluster on r + 2 values if and only if Together with previous work which considered other asymptotic properties of these sample extremes, a more detailed asymptotic clustering structure for discrete order statistics is presented.

Waitingtimes between record observations

1967 ◽  
Vol 4 (1) ◽  
pp. 206-208 ◽  
Author(s):  
Marcel F. Neuts
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Asymptotic Normality ◽  
Central Limit ◽  
Law Of Large Numbers ◽  
Continuous Distribution ◽  
Random Variables ◽  
Large Numbers ◽  
Upper Record ◽  
Independent Identically Distributed

If Δr denotes the waitingtime between the (r − 1)st and the rth upper record in a sequence of independent, identically distributed random variables with a continuous distribution, then it is shown that Δr satisfies the weak law of large numbers and a central limit theorem.This theorem supplements those of Foster and Stuart and Rényi, who investigated the index Vr of the rth upper record.Qualitatively the theorems establish the intuitive fact that for higher records, the waitingtime between the last two records outweighs even the total waitingtime for previous records. This explains also why the asymptotic normality of logVr is very inadequate for approximation purposes—Barton and Mallows.

Sign in / Sign up

Export Citation Format

Share Document