Papers › A comparative tour through the simulation algorithms for max-stable processes
A comparative tour through the simulation algorithms for max-stable processes
Marco Oesting, Kirstin Strokorb
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Being the max-analogue of α-stable stochastic processes, max-stable processes form one of the fundamental classes of stochastic processes. With the arrival of sufficient computational capabilities, they have become a benchmark in the analysis of spatio-temporal extreme events. Simulation is often a necessary part of inference of certain characteristics, in particular for future spatial risk assessment. In this article we give an overview over existing procedures for this task, put them into perspective of one another and use some new theoretical results to make comparisons with respect to their properties.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections