IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i7p1079-d379729.html
   My bibliography  Save this article

The Study of the Theoretical Size and Node Probability of the Loop Cutset in Bayesian Networks

Author

Listed:
  • Jie Wei

    (School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an 710129, China)

  • Yufeng Nie

    (School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an 710129, China)

  • Wenxian Xie

    (School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an 710129, China)

Abstract

Pearl’s conditioning method is one of the basic algorithms of Bayesian inference, and the loop cutset is crucial for the implementation of conditioning. There are many numerical algorithms for solving the loop cutset, but theoretical research on the characteristics of the loop cutset is lacking. In this paper, theoretical insights into the size and node probability of the loop cutset are obtained based on graph theory and probability theory. It is proven that when the loop cutset in a p-complete graph has a size of p − 2 , the upper bound of the size can be determined by the number of nodes. Furthermore, the probability that a node belongs to the loop cutset is proven to be positively correlated with its degree. Numerical simulations show that the application of the theoretical results can facilitate the prediction and verification of the loop cutset problem. This work is helpful in evaluating the performance of Bayesian networks.

Suggested Citation

  • Jie Wei & Yufeng Nie & Wenxian Xie, 2020. "The Study of the Theoretical Size and Node Probability of the Loop Cutset in Bayesian Networks," Mathematics, MDPI, vol. 8(7), pages 1-9, July.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:7:p:1079-:d:379729
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/7/1079/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/7/1079/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:8:y:2020:i:7:p:1079-:d:379729. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.