Enumerating the junction trees of a decomposable graph

Thomas, A; Green, PJ

Enumerating the junction trees of a decomposable graph

Thomas, A Green, PJ

Permalink

Publication Type:: Journal Article
Citation:: Journal of Computational and Graphical Statistics, 2009, 18 (4), pp. 930 - 940
Issue Date:: 2009-12-28

Closed Access

	Filename	Description	Size
	2010002250OK.pdf		602.87 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Thomas, A	en_US
dc.contributor.author	Green, PJ https://orcid.org/0000-0002-4367-4756	en_US
dc.date.issued	2009-12-28	en_US
dc.identifier.citation	Journal of Computational and Graphical Statistics, 2009, 18 (4), pp. 930 - 940	en_US
dc.identifier.issn	1061-8600	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14537
dc.description.abstract	We derive methods for enumerating the distinct junction tree representations for any given decomposable graph. We discuss the relevance of the method to estimating conditional independence graphs of graphical models and give an algorithm that, given a junction tree, will generate uniformly at random a tree from the set of those that represent the same graph. Programs implementing these methods are included as supplemental material. © 2009 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.	en_US
dc.relation.ispartof	Journal of Computational and Graphical Statistics	en_US
dc.relation.isbasedon	10.1198/jcgs.2009.07129	en_US
dc.subject.classification	Statistics & Probability	en_US
dc.title	Enumerating the junction trees of a decomposable graph	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	18	en_US
utslib.for	0104 Statistics	en_US
utslib.for	1403 Econometrics	en_US
dc.location.activity	ISI:000273082500008	en_US
dc.location.activity	Time-Out London, billboards, bus advertisements, The Guardian
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	18	en_US

Abstract:

We derive methods for enumerating the distinct junction tree representations for any given decomposable graph. We discuss the relevance of the method to estimating conditional independence graphs of graphical models and give an algorithm that, given a junction tree, will generate uniformly at random a tree from the set of those that represent the same graph. Programs implementing these methods are included as supplemental material. © 2009 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/14537