AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the concentration matrix of Gaussian data to be zero. The priors have the property that the marginal prior distribution of the number of nonzero off-diagonal elements of the concentration matrix (referred to below as model size) can be specified flexibly. The priors have normalizing constants for each model size, rather than for each model, giving a tractable number of normalizing constants that need to be estimated. The article shows how to estimate the normalizing constants using Markov chain Monte Carlo simulation and supersedes the method of Wong et al. (2003) [24] because it is more accurate and more general. The method is applied to two examp...
The combination of graphical models and reference analysis represents a powerful tool for Bayesian ...
This paper deals with Bayesian inference of a mixture of Gaussian dis-tributions. A novel formulatio...
In this paper we propose a method to calculate the posterior probability of a nondecomposable graphi...
A method for constructing priors is proposed that allows the off-diagonal elements of the concentrat...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...
A centred Gaussian model that is Markov with respect to an undirected graph G is characterised by th...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
This article is motivated by the difficulty of applying standard simulation techniques when identifi...
Gaussian graphical models (GGMs) are a popular tool to learn the dependence structure in the form of...
This thesis contributes to the field of Gaussian Graphical Models by exploring either numerically or...
This article is motivated by the difficulty of applying standard simulation techniques when iden-tif...
In this paper we introduce restricted concentration models (RCMs) as a class of graphical models for...
Priors are important for achieving proper posteriors with physically meaningful covariance structure...
This paper presents a default model-selection procedure for Gaussian graphical models that involves ...
The combination of graphical models and reference analysis represents a powerful tool for Bayesian ...
This paper deals with Bayesian inference of a mixture of Gaussian dis-tributions. A novel formulatio...
In this paper we propose a method to calculate the posterior probability of a nondecomposable graphi...
A method for constructing priors is proposed that allows the off-diagonal elements of the concentrat...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...
A centred Gaussian model that is Markov with respect to an undirected graph G is characterised by th...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
This article is motivated by the difficulty of applying standard simulation techniques when identifi...
Gaussian graphical models (GGMs) are a popular tool to learn the dependence structure in the form of...
This thesis contributes to the field of Gaussian Graphical Models by exploring either numerically or...
This article is motivated by the difficulty of applying standard simulation techniques when iden-tif...
In this paper we introduce restricted concentration models (RCMs) as a class of graphical models for...
Priors are important for achieving proper posteriors with physically meaningful covariance structure...
This paper presents a default model-selection procedure for Gaussian graphical models that involves ...
The combination of graphical models and reference analysis represents a powerful tool for Bayesian ...
This paper deals with Bayesian inference of a mixture of Gaussian dis-tributions. A novel formulatio...
In this paper we propose a method to calculate the posterior probability of a nondecomposable graphi...