English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Trawl processes are continuous-time, stationary and infinitely divisibleprocesses which can describe a wide range of possible serial correlationpatterns in data. In this paper, we introduce new simulation algorithms fortrawl processes with monotonic trawl functions and establish their error boundsand convergence properties. We extensively analyse the computational complexityand practical implementation of these algorithms and discuss which one to usedepending on the type of L\'evy basis. We extend the above methodology to thesimulation of kernel-weighted, volatility modulated trawl processes and developa new simulation algorithm for ambit fields. Finally, we discuss how simulationschemes previously described in the literature can be combined with our methodsfor decreased computational cost.

Simulation methods and error analysis for trawl processes and ambit fields