preface to the second edition .
preface to the first edition
1 introduction
1.1 statistical models
1.2 likelihood methods
1.3 bayesian methods
1.4 deterministic numerical methods
1.4.1 optimization
1.4.2 integration
1.4.3 comparison
1.5 problems
1.6 notes
1.6.1 prior distributions
1.6.2 bootstrap methods
2 random variable generation
2.1 introduction
2.1.1 uniform simulation
2.1.2 the inverse transform
2.1.3 alternatives
2.1.4 optimal algorithms
.2.2 general transformation methods
2.3 accept reject methods
2.3.1 the fundamental theorem of simulation
2.3.2 the accept-reject algorithm.
2.4 envelope accept reject methods
2.4.1 the squeeze principle
2.4.2 log-concave densities
2.5 problems
2.6 notes
2.6.1 the kiss generator
2.6.2 quasi-monte carlo methods
2.6.3 mixture representations
3 monte carlo integration
3.1 introduction
3.2 classical monte carlo integration
3.3 importance sampling
3.3.1 principles
3.3.2 finite variance estimators
3.3.3 comparing importance sampling with accept-reject
3.4 laplace approximations
3.5 problems
3.6 notes
3.6.1 large deviations techniques
3.6.2 the saddlepoint approximation
4 controling monte carlo variance
4.1 monitoring variation with the clt
4.1.1 univariate monitoring
4.1.2 multivariate monitoring
4.2 rao-blackwellization
4.3 rieinann approximations
4.4 acceleration methods
4.4.1 antithetic variables
4.4.2 control variates
4.5 problems
4.6 notes
4.6.1 monitoring importance sampling convergence
4.6.2 accept reject with loose bounds
4.6.3 partitioning
5 monte carlo optimization
5.1 introduction
5.2 stochastic exploration
5.2.1 a basic solution
5.2.2 gradient methods
5.2.3. simulated annealing
5.2.4 prior feedback
5.3 stochastic approximation
5.3.1 missing data models and demarginalization
5.3.2 the em algorithm
5.3.3 monte carlo em
5.3.4 em standard errors
5.4 problems
5.5 notes
5.5.1 variations on em
5.5.2 neural networks
5.5.3 the robbins-monro procedure
5.5.4 monte carlo approximation
6 markov chains
6.1 essentials for mcmc
6.2 basic notions
6.3 irreducibility, atoms, and small sets
6.3.1 irreducibility
6.3.2 atoms and small sets
6.3.3 cycles and aperiodicity
6.4 transience and recurrence
6.4.1 classification of irreducible chains
6.4.2 criteria for recurrence
6.4.3 harris recurrence
6.5 invariant measures
6.5.1 stationary chains
6.5.2 kac's theorem
6.5.3 reversibility and the detailed balance condition
6.6 ergodicity and convergence
6.6.1 ergodicity
6.6.2 geometric convergence
6.6.3 uniform ergodicity
6.7 limit theorems
6.7.1 ergodic theorems
6.7.2 central limit theorems
6.8 problems
6.9 notes
6.9.1 drift conditions
6.9.2 eaton's admissibility condition
6.9.3 alternative convergence conditions
6.9.4 mixing conditions and central limit theorems
6.9.5 covariance in markov chains
7 the metropolis-hastings algorithm
7.1 the mcmc principle
7.2 monte carlo methods based on markov chains
7.3 the metropolis-hastings algorithm
7.3.1 definition
7.3.2 convergence properties
7.4 the independent metropolis-hastings algorithm
7.4.1 fixed proposals
7.4.2 a metropolis-hastings version of ars
7.5 random walks
7.6 optimization and control
7.6.1 optimizing the acceptance rate
7.6.2 conditioning and accelerations
7.6.3 adaptive schemes
7.7 problems
7.8 notes
7.8.1 background of the metropolis algorithm
7.8.2 geometric convergence of metropolis-hastings algorithms
7.8.3 a reinterpretation of simulated annealing
7.8.4 reference acceptance rates
7.8.5 langevin algorithms
8 the slice sampler ..
8.1 another look at the fundamental theorem
8.2 the general slice sampler
8.3 convergence properties of the slice sampler
8.4 problems
8.5 notes
8.5.1 dealing with difficult slices
9 the two-stage gibbs sampler
9.1 a general class of two-stage algorithms
9.1.1 from slice sampling to gibbs sampling
9.1.2 definition
9.1.3 back to the slice sampler
9.1.4 the hammersley-clifford theorem
9.2 fundamental properties
9.2.1 probabilistic structures
9.2.2 reversible and interleaving chains
9.2.3 the duality principle
9.3 monotone covariance and rao-blackwellization
9.4 the em-gibbs connection
9.5 transition
9.6 problems
9.7 notes
9.7.1 inference for mixtures
9.7.2 arch models
10 the multi-stage gibbs sampler
10.1 basic derivations
10.1.1 definition
10.1.2 completion
10.1.3 the general hammersley-clifford theorem
10.2 theoretical justifications
10.2.1 markov properties of the gibbs sampler
10.2.2 gibbs sampling as metropolis-hastings
10.2.3 hierarchical structures
10.3 hybrid gibbs samplers
10.3.1 comparison with metropolis-hastings algorithms
10.3.2 mixtures and cycles
10.3.3 metropolizing the gibbs sampler
10.4 statistical considerations
10.4.1 reparameterization
10.4.2 rao-blackwellization
10.4.3 improper priors
10.5 problems
10.6 notes
10.6.1 a bit of background
10.6.2 the bugs software
10.6.3 nonparametric mixtures
10.6.4 graphical models
11 variable dimension models and reversible jump algorithms
11.1 variable dimension models
11.1.1 bayesian model choice
11.1.2 difficulties in model choice
11.2 reversible jump algorithms
11.2.1 green's algorithm
11.2.2 a fixed dimension reassessment
11.2.3 the practice of reversible jump mcmc
11.3 alternatives to reversible jump mcmc
11.3,1 saturation
11.3.2 continuous-time jump processes
11.4 problems
11.5 notes
11.5.1 occam's razor
12 diagnosing convergence
12.1 stopping the chain
12.1.1 convergence criteria
12.1.2 multiple chains
12.1.3 monitoring reconsidered
12.2 monitoring convergence to the stationary distribution
12.2.1 a first illustration
12.2.2 nonparametric tests of stationarity
12.2.3 renewal methods
12.2.4 missing mass
12.2.5 distance evaluations
12.3 monitoring convergence of averages
12.3.1 a first illustration
12.3.2 multiple estimates
12.3.3 renewal theory
12.3.4 within and between variances
12.3.5 effective sample size
12.4 simultaneous monitoring
12.4.1 binary control
12.4.2 valid discretization
12.5 problems
12.6 notes
12.6.1 spectral analysis
12.6.2 the coda software
13 perfect sampling
13.1 introduction
13.2 coupling from the past
13.2.1 random mappings and coupling
13.2.2 propp and wilson's algorithm
13.2.3 monotonicity and envelopes
13.2.4 continuous states spaces
13.2.5 perfect slice sampling
13.2.6 perfect sampling via automatic coupling
13.3 forward coupling
13.4 perfect sampling in practice
13.5 problems
13.6 notes
13.6.1 history
13.6.2 perfect sampling and tempering
14 iterated and sequential importance sampling
14.1 introduction
14.2 generalized importance sampling
14.3 particle systems
14.3.1 sequential monte carlo
14.3.2 hidden markov models
14.3.3 weight degeneracy
14.3.4 particle filters
14.3.5 sampling strategies
14.3.6 fighting the degeneracy
14.3.7 convergence of particle systems
14.4 population monte carlo
14.4.1 sample simulation
14.4.2 general iterative importance sampling.
14.4.3 population monte carlo
14.4.4 an illustration for the mixture model
14.4.5 adaptativity in sequential algorithms
14.5 problems
14.6 notes
14.6.1 a brief history of particle systems
14.6.2 dynamic importance sampling
14.6.3 hidden markov models
a probability distributions
b notation
b.1 mathematical
b.2 probability
b.3 distributions
b.4 markov chains
b.5 statistics
b.6 algorithms
references
index of names
index of subjects ...
点击看大图
加载中...
