Atchad�, Yves F. - Department of Statistics, University of Michigan

Advanced Search

Atchad�, Yves F. - Department of Statistics, University of Michigan

LIMIT THEOREMS FOR SOME ADAPTIVE MCMC ALGORITHMS WITH SUBGEOMETRIC KERNELS: PART II
Adaptive Markov Chain Monte Carlo: Theory and Methods Yves Atchade 1
A computational framework for empirical Bayes Yves F. Atchade
On Adaptive Markov Chain Monte Carlo Algorithms Yves F. Atchad1 and Jerey S. Rosenthal2
On the Geometric Ergodicity of Metropolis-Hastings Yves F. Atchad1 and Franois Perron2
A cautionary tale on the efficiency of some adaptive Monte Carlo Schemes
A strong law of large numbers for martingale arrays Yves F. Atchade
Randomized Evaluation of Institutions: Theory with Applications to Voting and Deliberation Experiments
Iterated Filtering Edward L. Ionides13
Submitted to the Annals of Statistics arXiv: math.PR/0911.1164
Bayesian computation for statistical models with intractable normalizing constants
Does Ethnic Solidarity Facilitate Electoral Support for Nation-Building Policies?: Evidence from a
On the eciency of adaptive MCMC algorithms Christophe Andrieu1 and Yves F. Atchad2
Resampling from the past to improve on MCMC Yves F. Atchade
TOWARDS OPTIMAL SCALING OF METROPOLIS-COUPLED MARKOV CHAIN MONTE CARLO
Submitted to the Annals of Statistics arXiv: math.PR/0911.1164
LIMIT THEOREMS FOR SOME ADAPTIVE MCMC ALGORITHMS WITH SUBGEOMETRIC KERNELS
Discussion of the paper by Kou, Zhou and Wong Yves F. ATCHADE1 and Jun S. LIU2
An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
The Wang-Landau algorithm in general state spaces: Applications and convergence analysis
NONCOMPLIANCE BIAS CORRECTION BASED ON COVARIATES IN RANDOMIZED EXPERIMENTS
arXiv:submit/0299230[math.ST]14Aug2011 ESTIMATION OF NETWORK STRUCTURES FROM PARTIALLY
LIMIT THEOREMS FOR QUADRATIC FORMS OF MARKOV CHAINS YVES F. ATCHADE AND MATIAS D. CATTANEO