Skip to main content

Abstract

The Fourier methodology developed in [91] to study the Stein’s equation in the Gaussian setting, often nowadays referred to as the Stein–Tikhomirov method, has been extended in [4] to provide rates of convergence in Kolmogorov or in smooth Wasserstein distance for sequences \((X_n)_{n\ge 1}\) converging toward \(X_\infty \). This approach leads to quantitative estimates when \(X_\infty \) is a second-order Wiener chaos, or the generalized Dickman distribution or even the symmetric \(\alpha \)-stable one. Corollary 3.5, or Proposition 3.8, or even the stable characterizing identities of the previous chapter allow extensions of the aforementioned estimates to classes of infinitely divisible sequences. The forthcoming results are general and have a non-empty intersection with those on the Dickman distribution presented in [4].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Benjamin Arras .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Arras, B., Houdré, C. (2019). General Upper Bounds by Fourier Methods. In: On Stein's Method for Infinitely Divisible Laws with Finite First Moment. SpringerBriefs in Probability and Mathematical Statistics. Springer, Cham. https://doi.org/10.1007/978-3-030-15017-4_4

Download citation

Publish with us

Policies and ethics