IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i8d10.1007_s00180-025-01621-6.html
   My bibliography  Save this article

Robust Bayesian structure learning for graphical models with T-distributions using G-Wishart prior

Author

Listed:
  • Nastaran Marzban Vaselabadi

    (Persian Gulf University)

  • Saeid Tahmasebi

    (Persian Gulf University)

  • Reza Mohammadi

    (Amsterdam Business School)

  • Hamid Karamikabir

    (Persian Gulf University)

Abstract

Accurately interpreting complex relationships among many variables is of significant importance in science. One appealing approach to this task is Bayesian Gaussian graphical modeling, which has recently undergone numerous improvements. However, this model may struggle with datasets containing outliers; replacing Gaussian distributions with t-distributions enhances inferences and handles datasets with outliers. In this paper, we aim to address the challenges of Gaussian graphical models through t-distributions graphical models. To this end, we draw inspiration from the Birth–Death Monte Carlo Markov Chain (BDMCMC) algorithm and introduce a Bayesian method for structure learning in both classical and alternative t-distributions graphical models. We also demonstrate that the more flexible model outperforms the other when applied to more complex generated data. This is illustrated using a wide range of simulated datasets as well as a real-world dataset.

Suggested Citation

  • Nastaran Marzban Vaselabadi & Saeid Tahmasebi & Reza Mohammadi & Hamid Karamikabir, 2025. "Robust Bayesian structure learning for graphical models with T-distributions using G-Wishart prior," Computational Statistics, Springer, vol. 40(8), pages 4277-4305, November.
  • Handle: RePEc:spr:compst:v:40:y:2025:i:8:d:10.1007_s00180-025-01621-6
    DOI: 10.1007/s00180-025-01621-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-025-01621-6
    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/s00180-025-01621-6?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:spr:compst:v:40:y:2025:i:8:d:10.1007_s00180-025-01621-6. 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.