IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v66y2025i3d10.1007_s10614-024-10777-0.html
   My bibliography  Save this article

Fast Computation of Randomly Walking Volatility with Chained Gamma Distributions

Author

Listed:
  • Di Zhang

    (Xi’an Jiaotong-Liverpool University)

  • Youzhou Zhou

    (Xi’an Jiaotong-Liverpool University)

Abstract

Volatility clustering is a ubiquitous phenomenon in financial time series analysis. In this study, we propose a Dynamic Bayesian Network (DBN) that leverages the conjugate prior relationships of normal-gamma and gamma-gamma distributions, preserving local posterior invariance at each node within the network. By incorporating dummy gamma nodes, we ensure that the model’s volatility follows an independent incremental process. This proposed model offers two distinct advantages: (1) it exhibits heavier tails (manifesting as positive excess kurtosis) compared to Gaussian distributions, thereby contrasting sharply with conventional linear models; (2) it utilizes Variational Inference (VI) to expedite state estimation relative to Monte Carlo (MC) methods, ensuring deterministic convergence. In comparative experiments involving eight established methodologies and four variations of our approach across eight datasets, we observed the following: (1) When employing MC, our model achieves volatility forecasting performance comparable to leading methods; (2) when utilizing only VI, it attains acceptable accuracy, particularly for high-frequency data, albeit slightly lower than the state-of-the-art; (3) notably, VI reduces the runtime of our Gam-Chain model to generally less than 5% of that of MC-based methods.

Suggested Citation

  • Di Zhang & Youzhou Zhou, 2025. "Fast Computation of Randomly Walking Volatility with Chained Gamma Distributions," Computational Economics, Springer;Society for Computational Economics, vol. 66(3), pages 2199-2223, September.
  • Handle: RePEc:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10777-0
    DOI: 10.1007/s10614-024-10777-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-024-10777-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10614-024-10777-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10777-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.