Simulation of infinitely divisible random fields
Wolfgang Karcher, Hans-Peter Scheffler, Evgeny Spodarev

TL;DR
This paper introduces two new methods for approximating and simulating infinitely divisible random fields by approximating their kernel functions, providing error bounds and practical simulation techniques.
Contribution
It presents novel approximation methods based on spectral kernel approximation for infinitely divisible random fields, with derived error bounds and simulation applications.
Findings
Methods effectively approximate the kernel functions
Error bounds are established for the approximations
Simulations demonstrate practical applicability
Abstract
Two methods to approximate infinitely divisible random fields are presented. The methods are based on approximating the kernel function in the spectral representation of such fields, leading to numerical integration of the respective integrals. Error bounds for the approximation error are derived and the approximations are used to simulate certain classes of infinitely divisible random fields.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage Processing and 3D Reconstruction · Soil Geostatistics and Mapping · Computational Geometry and Mesh Generation
