Discrete sticky couplings of functional autoregressive processes
In this paper, we provide bounds in Wasserstein and total variation distances between the distributions of the successive iterates of two functional autoregressive processes with isotropic Gaussian noise of the form ... More precisely, we give nonasymptotic bounds on ρ (L(Yk), L(Yk)), where ρ is an...
Gespeichert in:
Veröffentlicht in: | The Annals of applied probability 2024-12, Vol.34 (6), p.5032 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we provide bounds in Wasserstein and total variation distances between the distributions of the successive iterates of two functional autoregressive processes with isotropic Gaussian noise of the form ... More precisely, we give nonasymptotic bounds on ρ (L(Yk), L(Yk)), where ρ is an appropriate weighted Wasserstein distance or a V-distance, uniformly in the parameter γ, and on ρ (πγ, πγ), where π γ and ˜π γ are the respective stationary measures of the two processes. The class of considered processes encompasses the Euler–Maruyama discretization of Langevin diffusions and its variants. The bounds we derive are of order γ as γ → 0 . To obtain our results, we rely on the construction of a discrete sticky Markov chain ... which bounds the distance between an appropriate coupling of the two processes. We then establish stability and quantitative convergence results for this process uniformly on γ. In addition, we show that it converges in distribution to the continuous sticky process studied in Howitt (Ph.D. thesis (2007)) and Eberle and Zimmer (Ann. Inst. Henri Poincaré Probab. Stat. 55 (2019) 2370–2394). Finally, we apply our result to Bayesian inference of ODE parameters and numerically illustrate them on two particular problems. (ProQuest: ... denotes formulae omitted.) |
---|---|
ISSN: | 1050-5164 2168-8737 |
DOI: | 10.1214/24-AAP2053 |