Exact Simulation of the Extrema of Stable Processes

We exhibit an exact simulation algorithm for the supremum of a stable process over a finite time interval using dominated coupling from the past (DCFTP). We establish a novel perpetuity equation for the supremum (via the representation of the concave majorants of Lévy processes) and apply it to construct a Markov chain in the DCFTP algorithm. We prove that the number of steps taken backwards in time before the coalescence is detected is finite.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2019

ε-strong simulation of the convex minorants of stable processes and meanders

Using marked Dirichlet processes we characterise the law of the convex m...
research
10/02/2017

A note on perfect simulation for exponential random graph models

In this paper we propose a perfect simulation algorithm for the Exponent...
research
11/13/2017

Circularly-Coupled Markov Chain Sampling

I show how to run an N-time-step Markov chain simulation in a circular f...
research
09/22/2020

Entropic Compressibility of Lévy Processes

In contrast to their seemingly simple and shared structure of independen...
research
03/03/2023

Lag selection and estimation of stable parameters for multiple autoregressive processes through convex programming

Motivated by a variety of applications, high-dimensional time series hav...
research
07/09/2021

Exact simulation of continuous max-id processes

We provide two algorithms for the exact simulation of exchangeable max-(...
research
12/22/2020

An algorithm for simulating Brownian increments on a sphere

This paper presents a novel formula for the transition density of the Br...

Please sign up or login with your details

Forgot password? Click here to reset