IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v53y2009i4p1232-1238.html
   My bibliography  Save this article

Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme

Author

Listed:
  • Thomas, Alun
  • Green, Peter J.

Abstract

Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of these results to Markov chain Monte Carlo methods that sample or optimize over the space of decomposable graphical models according to probabilities determined by a posterior distribution given observed multivariate data.

Suggested Citation

  • Thomas, Alun & Green, Peter J., 2009. "Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme," Computational Statistics & Data Analysis, Elsevier, vol. 53(4), pages 1232-1238, February.
    • Handle: RePEc:eee:csdana:v:53:y:2009:i:4:p:1232-1238
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(08)00500-8
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hojsgaard, Soren & Thiesson, Bo, 1995. "BIFROST -- Block recursive models induced from relevant knowledge, observations, and statistical techniques," Computational Statistics & Data Analysis, Elsevier, vol. 19(2), pages 155-175, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hojsgaard, Soren, 2003. "Split models for contingency tables," Computational Statistics & Data Analysis, Elsevier, vol. 42(4), pages 621-645, April.
    2. Adele Marshall & Barry Shaw, 2014. "Computational learning of the conditional phase-type (C-Ph) distribution," Computational Management Science, Springer, vol. 11(1), pages 139-155, January.
    3. Thomas, Alun, 2009. "Estimation of graphical models whose conditional independence graphs are interval graphs and its application to modelling linkage disequilibrium," Computational Statistics & Data Analysis, Elsevier, vol. 53(5), pages 1818-1828, March.
    4. Højsgaard, Søren, 1996. "Learning structures from data and experts," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 42(2), pages 143-152.

    More about this item

    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:eee:csdana:v:53:y:2009:i:4:p:1232-1238. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.