A Computational Study on Sobol’ Sequences
Şu kitabın bölümü: Tahtalı, Y. & Demir, İ. & Bayyurt, L. (eds.) 2025. Current Approaches in Applied Statistics I.

Bahri Tokmak
Middle East Technical University
Ömer Ugur
Middle East Technical University

Özet

This study presents a computational comparison between Quasi-Monte Carlo (QMC) methods based on Sobol’ sequences and traditional Monte Carlo (MC) methods using the Mersenne Twister (MT) generator. While Sobol’ sequences are widely recognized for outperforming MT in terms of convergence, our results reveal notable deficiencies when applied to high-dimensional Geometric Asian option pricing. To investigate this behavior, we conduct moment and correlation analyses, identifying a bias in the incremental construction of Sobol’ paths—a bias that is absent in MT and can be alleviated through skipping initial points, scrambling, or Brownian Bridge (BB) techniques. All simulations are implemented in Python, with additional acceleration achieved through Graphics Processing Unit (GPU)-based parallel computing environments.

Kaynakça Gösterimi

Tokmak, B. & Ugur, Ö. (2025). A Computational Study on Sobol’ Sequences. In: Tahtalı, Y. & Demir, İ. & Bayyurt, L. (eds.), Current Approaches in Applied Statistics I. Özgür Yayınları. DOI: https://doi.org/10.58830/ozgur.pub862.c3485

Lisans

Yayın Tarihi

11 October 2025

DOI