Abstract

Translation models are memoryless transformations of Gaussian processes specified by their marginal distribution F and covariance function ξ . Iteration schemes are commonly used to find probability laws of Gaussian images of translation models, although these schemes may not converge since translation models do not exist for arbitrary functions F and ξ . Pairs ( F , ξ ) for which translation models exist are said to be consistent. Optimization algorithms are developed for constructing translation models that, for consistent pairs ( F , ξ ) , match F and ξ , and, for inconsistent pairs ( F , ξ ) , match F or ξ and approximate ξ or F . The resulting translation models can be used in Monte Carlo simulation studies.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.