On the speed of convergence of Piterbarg constants
Abstract
In this paper we derive an upper bound for the difference between the continuous and discrete Piterbarg constants. Our result allows us to approximate the classical Piterbarg constants by their discrete counterparts using Monte Carlo simulations with an explicit error rate
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.