REVIEW 1 cited by
Fast exact simulation of the first passage of a tempered stable subordinator across a non-increasing function
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We construct a fast exact algorithm for the simulation of the first-passage time, jointly with the undershoot and overshoot, of a tempered stable subordinator over an arbitrary non-increasing absolutely continuous function. We prove that the running time of our algorithm has finite exponential moments and provide bounds on its expected running time with explicit dependence on the characteristics of the process and the initial value of the function. The expected running time grows at most cubically in the stability parameter (as it approaches either $0$ or $1$) and is linear in the tempering parameter and the initial value of the function. Numerical performance, based on the implementation in the dedicated GitHub repository, exhibits a good agreement with our theoretical bounds. We provide numerical examples to illustrate the performance of our algorithm in Monte Carlo estimation.
Forward citations
Cited by 1 Pith paper
-
Complexity of exact sampling of the first passage of a stable subordinator
Exact sampling of the first passage of a stable subordinator can be done with expected complexity O(1+|ln(1-α)|) using acceptance-rejection envelopes, without numerical inversions or integrations.
Discussion (0). Continue with ORCID to comment.