Sampling inverse subordinators and subdiffusions

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Biočić, Ivan, Cedeño-Girón, Daniel E., Toaldo, Bruno
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911248305618944
author Biočić, Ivan
Cedeño-Girón, Daniel E.
Toaldo, Bruno
author_facet Biočić, Ivan
Cedeño-Girón, Daniel E.
Toaldo, Bruno
contents In this paper, a method to exactly sample the trajectories of inverse subordinators (in the sense of the finite-dimensional distributions), jointly with the undershooting or overshooting process, is provided. The method applies to general strictly increasing subordinators. The (random) running times of these algorithms have finite moments and explicit bounds for the expectations are provided. Additionally, the Monte Carlo approximation of functionals of subdiffusive processes (in the form of time-changed Feller processes) is considered where a central limit theorem and the Berry-Esseen bounds are proved. The approximation of time-changed Itô diffusions is also studied. The strong error, as a function of the time step, is explicitly evaluated demonstrating the strong convergence, and the algorithm's complexity is provided. The Monte Carlo approximation of functionals and its properties for the approximate method is studied as well. An application of our algorithms in the context of weak ergodicity breaking of subdiffusion is also discussed.
format Preprint
id arxiv_https___arxiv_org_abs_2412_15815
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sampling inverse subordinators and subdiffusions
Biočić, Ivan
Cedeño-Girón, Daniel E.
Toaldo, Bruno
Probability
60K50, 65C05
In this paper, a method to exactly sample the trajectories of inverse subordinators (in the sense of the finite-dimensional distributions), jointly with the undershooting or overshooting process, is provided. The method applies to general strictly increasing subordinators. The (random) running times of these algorithms have finite moments and explicit bounds for the expectations are provided. Additionally, the Monte Carlo approximation of functionals of subdiffusive processes (in the form of time-changed Feller processes) is considered where a central limit theorem and the Berry-Esseen bounds are proved. The approximation of time-changed Itô diffusions is also studied. The strong error, as a function of the time step, is explicitly evaluated demonstrating the strong convergence, and the algorithm's complexity is provided. The Monte Carlo approximation of functionals and its properties for the approximate method is studied as well. An application of our algorithms in the context of weak ergodicity breaking of subdiffusion is also discussed.
title Sampling inverse subordinators and subdiffusions
topic Probability
60K50, 65C05
url https://arxiv.org/abs/2412.15815