Malliavin-Mancino estimators implemented with non-uniform fast Fourier transforms

03/05/2020
by   Patrick Chang, et al.
0

We implement and test kernel averaging Non-Uniform Fast-Fourier Transform (NUFFT) methods to enhance the performance of correlation and covariance estimation on asynchronously sampled event-data using the Malliavin-Mancino Fourier estimator. The methods are benchmarked for Dirichlet and Fejér Fourier basis kernels. We consider test cases formed from Geometric Brownian motions to replicate synchronous and asynchronous data for benchmarking purposes. We consider three standard averaging kernels to convolve the event-data for synchronisation via over-sampling for use with the Fast Fourier Transform (FFT): the Gaussian kernel, the Kaiser-Bessel kernel, and the exponential of semi-circle kernel. First, this allows us to demonstrate the performance of the estimator with different combinations of basis kernels and averaging kernels. Second, we investigate and compare the impact of the averaging scales explicit in each averaging kernel and its relationship between the time-scale averaging implicit in the Malliavin-Mancino estimator. Third, we demonstrate the relationship between time-scale averaging based on the number of Fourier coefficients used in the estimator to a theoretical model of the Epps effect. We briefly demonstrate the methods on Trade-and-Quote (TAQ) data from the Johannesburg Stock Exchange to make an initial visualisation of the correlation dynamics for various time-scales under market microstructure.

READ FULL TEXT
research
10/24/2019

Thresholded Non-Uniform Fourier Frame-Based Reconstruction for Stripmap SAR

Fourier domain methods are fast algorithms for SAR imaging. They typical...
research
08/21/2018

A parallel non-uniform fast Fourier transform library based on an "exponential of semicircle" kernel

The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off...
research
02/10/2022

A Directional Equispaced interpolation-based Fast Multipole Method for oscillatory kernels

Fast Multipole Methods (FMMs) based on the oscillatory Helmholtz kernel ...
research
09/02/2022

Explicit calculation of singular integrals of tensorial polyadic kernels

The Riesz transform of u : 𝒮(ℝ^n) →𝒮'(ℝ^n) is defined as a convolution b...
research
01/26/2020

Aliasing error of the exp(β√(1-z^2)) kernel in the nonuniform fast Fourier transform

The most popular algorithm for the nonuniform fast Fourier transform (NU...
research
06/26/2017

Using Frame Theoretic Convolutional Gridding for Robust Synthetic Aperture Sonar Imaging

Recent progress in synthetic aperture sonar (SAS) technology and process...
research
05/12/2014

FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test

The maximum mean discrepancy (MMD) is a recently proposed test statistic...

Please sign up or login with your details

Forgot password? Click here to reset