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

Thomas, A; Green, PJ

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

Thomas, A Green, PJ

Permalink

Publication Type:: Journal Article
Citation:: Computational Statistics and Data Analysis, 2009, 53 (4), pp. 1232 - 1238
Issue Date:: 2009-02-15

Closed Access

	Filename	Description	Size
	2010002253OK.pdf		690.89 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-02-15	en_US
dc.identifier.citation	Computational Statistics and Data Analysis, 2009, 53 (4), pp. 1232 - 1238	en_US
dc.identifier.issn	0167-9473	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14539
dc.description.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. © 2008 Elsevier B.V. All rights reserved.	en_US
dc.relation.ispartof	Computational Statistics and Data Analysis	en_US
dc.relation.isbasedon	10.1016/j.csda.2008.10.029	en_US
dc.subject.classification	Statistics & Probability	en_US
dc.title	Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	53	en_US
utslib.for	0104 Statistics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	1403 Econometrics	en_US
dc.location.activity	ISI:000263626700038	en_US
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	53	en_US

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. © 2008 Elsevier B.V. All rights reserved.

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

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