Perfect Simulation

Regular price €107.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Mark L. Huber
advanced probability theory
Age Group_Uncategorized
Age Group_Uncategorized
algorithm
Author_Mark L. Huber
automatic-update
Auxiliary Variable Method
Bayesian inference techniques
Bounding Chain
Brownian Bridge
Category1=Non-Fiction
Category=PBT
chain
computational statistics
COP=United States
Delivery_Pre-order
density
eq_isMigrated=2
eq_nobargain
exact sampling algorithms for Markov chains
Frozen Nodes
Geometric Random Variable
Gibbs Chain
Gibbs Sampler
high-dimensional data analysis
ising
Ising Model
Jackson Network
Language_English
Lebesgue Measure
markov
Markov Chain
Markov Random Field
model
PA=Temporarily unavailable
Perfect Simulation
Perfect Simulation Algorithm
Poisson Point Process
Polynomial Time
Price_€50 to €100
PS=Active
random
Running Time
SDE
softlaunch
Spatial Point Processes
Standard Brownian Motion
stationary
statistical simulation methods
stochastic modeling
Strauss Process
Swap Chain
Target Distribution
unnormalized
Unnormalized Density
Update Function
variables

Product details

  • ISBN 9781482232448
  • Weight: 498g
  • Dimensions: 156 x 234mm
  • Publication Date: 19 Nov 2015
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

Exact sampling, specifically coupling from the past (CFTP), allows users to sample exactly from the stationary distribution of a Markov chain. During its nearly 20 years of existence, exact sampling has evolved into perfect simulation, which enables high-dimensional simulation from interacting distributions.

Perfect Simulation illustrates the application of perfect simulation ideas and algorithms to a wide range of problems. The book is one of the first to bring together research on simulation from statistics, physics, finance, computer science, and other areas into a unified framework. You will discover the mechanisms behind creating perfect simulation algorithms for solving an array of problems.

The author describes numerous protocol methodologies for designing algorithms for specific problems. He first examines the commonly used acceptance/rejection (AR) protocol for creating perfect simulation algorithms. He then covers other major protocols, including CFTP; the Fill, Machida, Murdoch, and Rosenthal (FMMR) method; the randomness recycler; retrospective sampling; and partially recursive AR, along with multiple variants of these protocols. The book also shows how perfect simulation methods have been successfully applied to a variety of problems, such as Markov random fields, permutations, stochastic differential equations, spatial point processes, Bayesian posteriors, combinatorial objects, and Markov processes.

Mark L. Huber is the Fletcher Jones Associate Professor of Mathematics and Statistics and George R. Roberts Fellow at Claremont McKenna College. Dr. Huber works in the area of computational probability, designing Monte Carlo methods for applications in statistics and computer science. His research interests include applied mathematics, calculus, computers, probability, and statistics. He earned a PhD from Cornell University.

More from this author