Muutke küpsiste eelistusi

Introducing Monte Carlo Methods with R 2010 ed. [Pehme köide]

  • Formaat: Paperback / softback, 284 pages, kõrgus x laius: 234x156 mm, kaal: 950 g, XX, 284 p., 1 Paperback / softback
  • Sari: Use R!
  • Ilmumisaeg: 10-Dec-2009
  • Kirjastus: Springer-Verlag New York Inc.
  • ISBN-10: 1441915753
  • ISBN-13: 9781441915757
  • Pehme köide
  • Hind: 67,23 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 79,09 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 284 pages, kõrgus x laius: 234x156 mm, kaal: 950 g, XX, 284 p., 1 Paperback / softback
  • Sari: Use R!
  • Ilmumisaeg: 10-Dec-2009
  • Kirjastus: Springer-Verlag New York Inc.
  • ISBN-10: 1441915753
  • ISBN-13: 9781441915757
Computational techniques based on simulation have now become an essential part of the statistician's toolbox. It is thus crucial to provide statisticians with a practical understanding of those methods, and there is no better way to develop intuition and skills for simulation than to use simulation to solve statistical problems. Introducing Monte Carlo Methods with R covers the main tools used in statistical simulation from a programmer's point of view, explaining the R implementation of each simulation technique and providing the output for better understanding and comparison. While this book constitutes a comprehensive treatment of simulation methods, the theoretical justification of those methods has been considerably reduced, compared with Robert and Casella (2004). Similarly, the more exploratory and less stable solutions are not covered here.This book does not require a preliminary exposure to the R programming language or to Monte Carlo methods, nor an advanced mathematical background. While many examples are set within a Bayesian framework, advanced expertise in Bayesian statistics is not required. The book covers basic random generation algorithms, Monte Carlo techniques for integration and optimization, convergence diagnoses, Markov chain Monte Carlo methods, including Metropolis {Hastings and Gibbs algorithms, and adaptive algorithms. All chapters include exercises and all R programs are available as an R package called mcsm. The book appeals to anyone with a practical interest in simulation methods but no previous exposure. It is meant to be useful for students and practitioners in areas such as statistics, signal processing, communications engineering, control theory, econometrics, finance and more. The programming parts are introduced progressively to be accessible to any reader.

This book covers the main tools used in statistical simulation from a programmer's point of view, explaining the R implementation of each simulation technique and providing the output for better understanding and comparison.

Arvustused

From the reviews:

Robert and Casellas new book uses the programming language R, a favorite amongst (Bayesian) statisticians to introduce in eight chapters both basic and advanced Monte Carlo techniques . The book could be used as the basic textbook for a semester long course on computational statistics with emphasis on Monte Carlo tools . useful for (and should be next to the computer of) a large body of hands on graduate students, researchers, instructors and practitioners . (Hedibert Freitas Lopes, Journal of the American Statistical Association, Vol. 106 (493), March, 2011)

Chapters focuses on MCMC methods the MetropolisHastings algorithm, Gibbs sampling, and monitoring and adaptation for MCMC algorithms. There are exercises within and at the end of all chapters . Overall, the level of the book makes it suitable for graduate students and researchers. Others who wish to implement Monte Carlo methods, particularly MCMC methods for Bayesian analysis will also find it useful. (David Scott, International Statistical Review, Vol. 78 (3), 2010)

The primary audience is graduate students in statistics, biostatistics, engineering, etc. who need to know how to utilize Monte Carlo simulation methods to analyze their experiments and/or datasets. this text does an effective job of including a selection of Monte Carlo methods and their application to a broad array of simulation problems. Anyone who is an avid R user and has need to integrate and/or optimize complex functions will find this text to be a necessary addition to his or her personal library. (Dean V. Neubauer, Technometrics, Vol. 53 (2), May, 2011)

Preface vii
List of Figures
xiii
List of Examples
xvii
Basic R Programming
1(40)
Introduction
2(1)
Getting started
3(2)
R objects
5(9)
The vector class
6(3)
The matrix, array, and factor classes
9(3)
The list and data. frame classes
12(2)
Probability distributions in R
14(1)
Basic and not-so-basic statistics
14(12)
Graphical facilities
26(5)
Writing new R functions
31(4)
Input and output in R
35(1)
Administration of R objects
36(1)
The mcsm package
36(1)
Additional exercises
37(4)
Random Variable Generation
41(20)
Introduction
42(4)
Uniform simulation
42(2)
The inverse transform
44(2)
General transformation methods
46(5)
A normal generator
47(1)
Discrete distributions
48(2)
Mixture representations
50(1)
Accept-reject methods
51(6)
Additional exercises
57(4)
Monte Carlo Integration
61(28)
Introduction
62(3)
Classical Monte Carlo integration
65(4)
Importance sampling
69(17)
An arbitrary change of reference measure
69(6)
Sampling importance resampling
75(3)
Selection of the importance function
78(8)
Additional exercises
86(3)
Controlling and Accelerating Convergence
89(36)
Introduction
90(1)
Monitoring variation
91(1)
Asymptotic variance of importance sampling estimators
92(6)
Effective sample size and perplexity
98(2)
Simultaneous monitoring
100(7)
Rao-Blackwellization and deconditioning
107(4)
Acceleration methods
111(11)
Correlated simulations
111(2)
Antithetic variables
113(3)
Control variates
116(6)
Additional exercises
122(3)
Monte Carlo Optimization
125(42)
Introduction
126(1)
Numerical Optimization methods
127(3)
Stochastic search
130(16)
A basic solution
130(6)
Stochastic gradient methods
136(4)
Simulated annealing
140(6)
Stochastic approximation
146(17)
Optimizing Monte Carlo approximations
146(4)
Missing-data models and demarginalization
150(2)
The EM algorithm
152(5)
Monte Carlo EM
157(6)
Additional exercises
163(4)
Metropolis-Hastings Algorithms
167(32)
Introduction
168(1)
A peek at Markov chain theory
168(2)
Basic Metropolis-Hastings algorithms
170(12)
A generic Markov chain Monte Carlo algorithm
171(4)
The independent Metropolis-Hastings algorithm
175(7)
A selection of candidates
182(10)
Random walks
182(3)
Alternative candidates
185(7)
Acceptance rates
192(3)
Additional exercises
195(4)
Gibbs Samplers
199(38)
Introduction
200(1)
The two-stage Gibbs sampler
200(6)
The multistage Gibbs sampler
206(3)
Missing data and latent variables
209(12)
Hierarchical structures
221(3)
Other considerations
224(10)
Reparameterization
224(3)
Rao-Blackwellization
227(3)
Metropolis within Gibbs and hybrid strategies
230(2)
Improper priors
232(2)
Additional exercises
234(3)
Monitoring and Adaptation for MCMC Algorithms
237(32)
Introduction
238(1)
Monitoring what and why
238(4)
Convergence to the stationary distribution
238(2)
Convergence of averages
240(1)
Approximating iid sampling
240(1)
The coda package
241(1)
Monitoring convergence to stationarity
242(8)
Graphical diagnoses
242(1)
Nonparametric tests of stationarity
243(4)
Spectral analysis
247(3)
Monitoring convergence of averages
250(8)
Graphical diagnoses
250(3)
Within and between variances
253(2)
Effective sample size
255(2)
Fixed-width batch means
257(1)
Adaptive MCMC
258(9)
Cautions about adaptation
258(6)
The amcmc package
264(3)
Additional exercises
267(2)
References 269(6)
Index of R Terms 275(4)
Index of Subjects 279