Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Scaling analysis of MCMC algorithms

Tools
- Tools
+ Tools

Thiéry, Alexandre H. (2013) Scaling analysis of MCMC algorithms. PhD thesis, University of Warwick.

[img]
Preview
Text
WRAP_THESIS_Thiery_2013.pdf - Submitted Version

Download (1282Kb) | Preview
Official URL: http://webcat.warwick.ac.uk/record=b2689014~S1

Request Changes to record.

Abstract

Markov Chain Monte Carlo (MCMC) methods have become a workhorse
for modern scientific computations. Practitioners utilize MCMC in many different
areas of applied science yet very few rigorous results are available for justifying
the use of these methods. The purpose of this dissertation is to analyse random
walk type MCMC algorithms in several limiting regimes that frequently occur in
applications. Scaling limits arguments are used as a unifying method for studying
the asymptotic complexity of these MCMC algorithms. Two distinct strands of
research are developed: (a) We analyse and prove diffusion limit results for MCMC
algorithms in high or infinite dimensional state spaces. Contrarily to previous results
in the literature, the target distributions that we consider do not have a product
structure; this leads to Stochastic Partial Differential Equation (SPDE) limits. This
proves among other things that optimal proposals results already known for product
form target distributions extend to much more general settings. We then show
how to use these MCMC algorithms in an infinite dimensional Hilbert space in
order to imitate a gradient descent without computing any derivative. (b) We
analyse the behaviour of the Random Walk Metropolis (RWM) algorithm when
used to explore target distributions concentrating on the neighbourhood of a low
dimensional manifold of Rn. We prove that the algorithm behaves, after being
suitably rescaled, as a diffusion process evolving on a manifold.

Item Type: Thesis or Dissertation (PhD)
Subjects: Q Science > QA Mathematics
Library of Congress Subject Headings (LCSH): Monte Carlo method, Markov processes, Algorithms
Official Date: February 2013
Dates:
DateEvent
February 2013Submitted
Institution: University of Warwick
Theses Department: Department of Statistics
Thesis Type: PhD
Publication Status: Unpublished
Supervisor(s)/Advisor: Roberts, Gareth; Stuart, A. M.
Extent: vii, 135 leaves.
Language: eng

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us