Normal Approximation of Kabanov–Skorohod Integrals on Poisson Spaces
G. Last (),
I. Molchanov () and
M. Schulte ()
Additional contact information
G. Last: Institute for Stochastics, Karlsruhe Institute of Technology
I. Molchanov: University of Bern
M. Schulte: Hamburg University of Technology
Journal of Theoretical Probability, 2024, vol. 37, issue 2, 1124-1167
Abstract:
Abstract We consider the normal approximation of Kabanov–Skorohod integrals on a general Poisson space. Our bounds are for the Wasserstein and the Kolmogorov distance and involve only difference operators of the integrand of the Kabanov–Skorohod integral. The proofs rely on the Malliavin–Stein method and, in particular, on multiple applications of integration by parts formulae. As examples, we study some linear statistics of point processes that can be constructed by Poisson embeddings and functionals related to Pareto optimal points of a Poisson process.
Keywords: Kabanov–Skorohod integral; Poisson process; Normal approximation; Stein’s method; Malliavin calculus; Primary: 60F05; Secondary: 60G55; 60H05; 60H07 (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10959-023-01287-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:37:y:2024:i:2:d:10.1007_s10959-023-01287-0
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959
DOI: 10.1007/s10959-023-01287-0
Access Statistics for this article
Journal of Theoretical Probability is currently edited by Andrea Monica
More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().