pith. sign in

arxiv: 1703.08665 · v2 · pith:HJ7CC2JJnew · submitted 2017-03-25 · 📊 stat.ME

Full likelihood inference for max-stable data

classification 📊 stat.ME
keywords computationallikelihoodfullinferencemax-stablealgorithmbrown--resnickburden
0
0 comments X
read the original abstract

We show how to perform full likelihood inference for max-stable multivariate distributions or processes based on a stochastic Expectation-Maximisation algorithm, which combines statistical and computational efficiency in high-dimensions. The good performance of this methodology is demonstrated by simulation based on the popular logistic and Brown--Resnick models, and it is shown to provide dramatic computational time improvements with respect to a direct computation of the likelihood. Strategies to further reduce the computational burden are also discussed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.