Approximate Bayesian estimation in large coloured graphical Gaussian models
From MaRDI portal
Abstract: Distributed estimation methods have recently been used to compute the maximum likelihood estimate of the precision matrix for large graphical Gaussian models. Our aim, in this paper, is to give a Bayesian estimate of the precision matrix for large graphical Gaussian models with, additionally, symmetry constraints imposed by an underlying graph which is coloured. We take the sample posterior mean of the precision matrix as our estimate. We study its asymptotic behaviour under the regular asymptotic regime when the number of variables p is fixed and under the double asymptotic regime when both p and n grow to infinity. We show in particular, that when the number of parameters of the local models is uniformly bounded, the standard convergence rate we obtain for the asymptotic consistency, in the Frobenius norm, of our estimate of the precision matrix compares well with the rates in the current literature for the maximum likelihood estimate.
Recommendations
- Quasi-Bayesian estimation of large Gaussian graphical models
- Posterior convergence rates for estimating large precision matrices using graphical models
- Bayesian structure learning in graphical models
- Bayesian estimation of large precision matrix based on Cholesky decomposition
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
Cited in
(3)
This page was built for publication: Approximate Bayesian estimation in large coloured graphical Gaussian models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960913)
