A computational introduction to random functions
摘要
For readers working in applications, this paper serves as a basic primer for the numerical calculation of (pseudo-) random functions. Keeping probabilistic arguments at a minimum in favour of computation, random functions are studied by randomizing coefficients of expansions. This reveals a natural connection to Reproducing Kernel Hilbert spaces. Randomizing the coefficients of orthonormal Newton bases of Reproducing Kernel Hilbert spaces allows a comprehensive, constructive, and computational presentation, providing regularity results and error bounds in terms of variances. The approach is unexpectedly general, because paths of most random fields are shown to arise this way. A natural extension allows to use expansions in