The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On extremal dependence of block vectors”

On the extremal behavior of a Pareto process: an alternative for ARMAX modeling

Marta Ferreira (2012)

Kybernetika

Similarity:

In what concerns extreme values modeling, heavy tailed autoregressive processes defined with the minimum or maximum operator have proved to be good alternatives to classical linear ARMA with heavy tailed marginals (Davis and Resnick [8], Ferreira and Canto e Castro [13]). In this paper we present a complete characterization of the tail behavior of the autoregressive Pareto process known as Yeh-Arnold-Robertson Pareto(III) (Yeh et al. [32]). We shall see that it is quite similar to the...

Several applications of divergence criteria in continuous families

Michel Broniatowski, Igor Vajda (2012)

Kybernetika

Similarity:

This paper deals with four types of point estimators based on minimization of information-theoretic divergences between hypothetical and empirical distributions. These were introduced (i) by Liese and Vajda [9] and independently Broniatowski and Keziou [3], called here power superdivergence estimators, (ii) by Broniatowski and Keziou [4], called here power subdivergence estimators, (iii) by Basu et al. [2], called here power pseudodistance estimators, and (iv) by Vajda [18] called here...

Chance constrained problems: penalty reformulation and performance of sample approximation technique

Martin Branda (2012)

Kybernetika

Similarity:

We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6,11]. The obtained problems with penalties and with a fixed set of feasible solutions are simpler to solve and analyze then the chance constrained programs. We discuss solving...