Christopher K. Carter
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christopher K. Carter has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Robert Kohn
University of New South Wales
3 shared publicationsFrederick Wong
Department of Statistics, Macquarie University, Sydney NSW 2109, Australia
2 shared publications- David Gunawan
School of Mathematics and Applied Statistics, University of Wollongong, Wollongong 2522, Australia
1 shared publication - Eduardo Fonseca Mendes
Getulio Vargas Foundation, FGV/EAESP, Sao Paulo, Brazil
1 shared publication G. K. Eagleson
University of New South Wales , Sydney , Australia
1 shared publicationHelen Armstrong
University of New South Wales
1 shared publication
Latest Publications
- 14 January 2020
- Published by Springer Nature in Statistics and Computing
- Vol. 30 (4) , 783-798
A flexible particle Markov chain Monte Carlo method
- 14 January 2020
- Published by Springer Nature in Statistics and Computing
- Vol. 30 (4) , 783-798
A flexible particle Markov chain Monte Carlo method
- 1 May 2011
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 102 (5) , 871-883
Constructing priors based on model size for nondecomposable Gaussian graphical models: A simulation based approach
- 1 May 2011
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 102 (5) , 871-883
Constructing priors based on model size for nondecomposable Gaussian graphical models: A simulation based approach
- 11 September 2008
- Published by Springer Nature in Statistics and Computing
- Vol. 19 (3) , 303-316
Bayesian covariance matrix estimation using a mixture of decomposable graphical models
- 11 September 2008
- Published by Springer Nature in Statistics and Computing
- Vol. 19 (3) , 303-316
Bayesian covariance matrix estimation using a mixture of decomposable graphical models
- Open Access
- 1 December 2003
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 90 (4) , 809-830
Efficient estimation of covariance selection models
A Bayesian method is proposed for estimating an inverse covariance matrix from Gaussian data. The method is based on a prior that allows the off‐diagonal elements of the inverse covariance matrix to be zero, and in many applications results in a parsimonious parameterisation of the covariance matrix. No assumption is made about the structure of the corresponding graphical model, so the method applies to both nondecomposable and decomposable graphs. All the parameters are estimated by model averaging using an efficient Metropolis–Hastings sampling scheme. A simulation study demonstrates that the method produces statistically efficient estimators of the covariance matrix, when the inverse covariance matrix is sparse. The methodology is illustrated by applying it to three examples that are high‐dimensional relative to the sample size.
- 1 December 2003
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 90 (4) , 809-830
Open AccessEfficient estimation of covariance selection models
A Bayesian method is proposed for estimating an inverse covariance matrix from Gaussian data. The method is based on a prior that allows the off‐diagonal elements of the inverse covariance matrix to be zero, and in many applications results in a parsimonious parameterisation of the covariance matrix. No assumption is made about the structure of the corresponding graphical model, so the method applies to both nondecomposable and decomposable graphs. All the parameters are estimated by model averaging using an efficient Metropolis–Hastings sampling scheme. A simulation study demonstrates that the method produces statistically efficient estimators of the covariance matrix, when the inverse covariance matrix is sparse. The methodology is illustrated by applying it to three examples that are high‐dimensional relative to the sample size.
- 1 January 1997
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 59 (1) , 255-268
Semiparametric Bayesian Inference for Time Series with Mixed Spectra
Summary: A Bayesian analysis is presented of a time series which is the sum of a stationary component with a smooth spectral density and a deterministic component consisting of a linear combination of a trend and periodic terms. The periodic terms may have known or unknown frequencies. The advantage of our approach is that different features of the data—such as the regression parameters, the spectral density, unknown frequencies and missing observations—are combined in a hierarchical Bayesian framework and estimated simultaneously. A Bayesian test to detect deterministic components in the data is also constructed. By using an asymptotic approximation to the likelihood, the computation is carried out efficiently using the Markov chain Monte Carlo method in O(Mn) operations, where nis the sample size and Mis the number of iterations. We show empirically that our approach works well on real and simulated samples.
- 1 January 1997
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 59 (1) , 255-268
Semiparametric Bayesian Inference for Time Series with Mixed Spectra
Summary: A Bayesian analysis is presented of a time series which is the sum of a stationary component with a smooth spectral density and a deterministic component consisting of a linear combination of a trend and periodic terms. The periodic terms may have known or unknown frequencies. The advantage of our approach is that different features of the data—such as the regression parameters, the spectral density, unknown frequencies and missing observations—are combined in a hierarchical Bayesian framework and estimated simultaneously. A Bayesian test to detect deterministic components in the data is also constructed. By using an asymptotic approximation to the likelihood, the computation is carried out efficiently using the Markov chain Monte Carlo method in O(Mn) operations, where nis the sample size and Mis the number of iterations. We show empirically that our approach works well on real and simulated samples.
- 1 September 1996
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 83 (3) , 589-601
Markov chain Monte Carlo in conditionally Gaussian state space models
A Bayesian analysis is given for a state space model with errors that are finite mixtures of normals and with coefficients that can assume a finite number of different values. A sequence of indicator variables determines which components the errors belong to and the values of the coefficients. The computation is carried out using Markov chain Monte Carlo, with the indicator variables generated without conditioning on the states. Previous approaches use the Gibbs sampler to generate the indicator variables conditional on the states. In many problems, however, there is a strong dependence between the indicator variables and the states causing the Gibbs sampler to converge unacceptably slowly, or even not to converge at all. The new sampler is implemented in O(n) operations, where n is the sample size, permitting an exact Bayesian analysis of problems that previously had no computationally tractable solution. We show empirically that the new sampler can be much more efficient than previous approaches, and illustrate its applicability to robust nonparametric regression with discontinuities and to a time series change point problem.
- 1 September 1996
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 83 (3) , 589-601
Markov chain Monte Carlo in conditionally Gaussian state space models
A Bayesian analysis is given for a state space model with errors that are finite mixtures of normals and with coefficients that can assume a finite number of different values. A sequence of indicator variables determines which components the errors belong to and the values of the coefficients. The computation is carried out using Markov chain Monte Carlo, with the indicator variables generated without conditioning on the states. Previous approaches use the Gibbs sampler to generate the indicator variables conditional on the states. In many problems, however, there is a strong dependence between the indicator variables and the states causing the Gibbs sampler to converge unacceptably slowly, or even not to converge at all. The new sampler is implemented in O(n) operations, where n is the sample size, permitting an exact Bayesian analysis of problems that previously had no computationally tractable solution. We show empirically that the new sampler can be much more efficient than previous approaches, and illustrate its applicability to robust nonparametric regression with discontinuities and to a time series change point problem.
- 1 July 1992
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 54 (3) , 773-780
A Comparison of Variance Estimators in Nonparametric Regression
- 1 July 1992
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 54 (3) , 773-780
A Comparison of Variance Estimators in Nonparametric Regression