A First Course in Monte Carlo Simulation
Home > Mathematics and Science Textbooks > Mathematics > Probability and statistics > A First Course in Monte Carlo Simulation
A First Course in Monte Carlo Simulation

A First Course in Monte Carlo Simulation


     0     
5
4
3
2
1



Available


X
About the Book

A COURSE IN MONTE CARLO is a concise explanation of the Monte Carlo (MC) method. In addition to providing guidance for generating samples from diverse distributions, it describes how to design, perform, and analyze the results of MC experiments based on independent replications, Markov chain MC, and MC optimization. The text gives considerable emphasis to the variance-reducing techniques of importance sampling, stratified sampling, Rao-Blackwellization, control variates, antithetic variates, and quasi-random numbers. For solving optimization problems it describes several MC techniques, including simulated annealing, simulated tempering, swapping, stochastic tunneling, and genetic algorithms. Examples from many areas show how these techniques perform in practice. Hands-on exercises enable student to experience challenges encountered when solving real problems. An answer key to selected problems is included.

Table of Contents:
1. INTRODUCTION. About this Book. Integration and Summation. Improving Efficiency. Minimizing a Function. Improving Efficiency. Reading Plans. Exercises. Software. Notations. References. 2. INDEPENDENT MONTE CARLO. Independent Monte Carlo (IMC). Why Monte Carlo?. Generating Samples. Choosing a Monte Carlo Sampling Plan. Importance Sampling. Estimating Volume. Interpreting Relative Error. Product and Non-Product Spaces. Bootstrap Method. Regression Analysis. Lessons Learned. Hands-On Exercises. References. 3. SAMPLING GENERATION. Selecting a Sampling Algorithm. Independent and Dependent Variates. Inverse-Transform Method. Restricted Sampling. Discrete Distributions. Sampling from a Table. Restricted Sampling. Composition Method. Acceptance-Rejection Method. Squeeze Method. Adaptive Method. Ratio-of-Uniforms Method. Lessons Learned. Exercises. References. 4. PSEUDORANDOM NUMBER GENERATION. Linear Congruential Generators. Prime Modulus. Evaluating PNG"s. Theoretical Evaluation. Empirical Testing. Collision Test. Birthday Spacings Test. LCG"s with Modulus 2(Beta).M = 2(superscript)32.M = 2(superscript)48. Mixed Linear Congruential Generators. Combined Generators. AWC and SWB Generators. Twisted GFSR Generators. Mersenne Twisted GFSRs. Lessons Learned. References. 5. VARIANCE REDUCTION. Stratified Sampling. Unequal Sample Sizes. Rao-Blackwellization. Exceedance Probabilities for Rare Events. Control Variates. Antithetic Variates. Quasirandom Numbers. Exercises. Lessons Learned. Hands-On Exercises. References. 6. MARKOV CHAIN MONTE CARLO. Hastings-Metropolis Method. Reversibility. Coordinate Updating. Single-Coordinate Updating. Bayesian MCMC. Joint and Full Conditional Distributions. Gibbs Sampling. Convergence for Xj. Non-connected State Spaces and Mixtures. Convergence for (Lambda)t. Local and Global Moves. Problem Size. Variance of Estimate. Choosing a Nominating Kernel. Independence Hastings-Metropolis Sampling. Random-Walk Nominating Kernels. Chains Favoring Smaller (Sigma)(infinity)squared. General-State Spaces. Polynomial Convergence. Discrete-Event Systems. First-Passage Times. Absorbing States. Lessons Learned. Appendix: Modified Acceptance-Rejection Sampling. Appendix: Modified Acceptance-Rejection Sampling. Exercises. Hands-On Exercises. References. 7. MCMC SAMPLE-PATH ANALYSIS. Multiple Independent Replications. Single Sample Path. Estimating the Warm-Up Interval. Batch-Means Method. FNB Rule. SQRT Rule. ABATCH Rule. Testing for Independence. Appendix: LABATCH.2. Lessons Learned. Hands-On Exercises. References. 8. OPTIMIZATION VIA MCMC. Searching for the Global Optimum. Nominating Kernels. Cooling. Initial Temperature. Temperature Gradient. Stage Length. Stopping Rule. Local Minima. Accelerating Convergence. Simulated Tempering. Swapping. Stochastic Tunneling. Genetic Algorithms. Searching for More Than the Minimum. Lessons Learned. Hands-On Exercises. References. 9. ADVANCED CONCEPTS IN MCMC. Exploiting Reversibility. Rapid Mixing. Markov Random Fields. Gibbs Distribution. Potts Model. Random Cluster Model. Problem Size. More General Models. Slice Sampling. Product Slice Sampling. Partial Decoupling. Coupling from the Past. Monotone Markov Chains. Reusing Randomness. Total Number of Steps. Saving Space. Independent Hastings-Metropolis Sampling. Lessons Learned. Exercises. References.

About the Author :
George Fishman has regularly contributed to the literature on the Monte Carlo method and discrete-event simulation over the last 40 years. His earlier book, MONTE CARLO: CONCEPTS, ALGORITHMS, AND APPLICATIONS (Springer-Verlag, 1996) won the 1996 Lancaster award for best publication of the Institute for Operations Research and Management Sciences (INFORMS) and the 1997 outstanding publication award of the INFORMS College on Simulation.

Review :
1. INTRODUCTION. About this Book. Integration and Summation. Improving Efficiency. Minimizing a Function. Improving Efficiency. Reading Plans. Exercises. Software. Notations. References. 2. INDEPENDENT MONTE CARLO. Independent Monte Carlo (IMC). Why Monte Carlo?. Generating Samples. Choosing a Monte Carlo Sampling Plan. Importance Sampling. Estimating Volume. Interpreting Relative Error. Product and Non-Product Spaces. Bootstrap Method. Regression Analysis. Lessons Learned. Hands-On Exercises. References. 3. SAMPLING GENERATION. Selecting a Sampling Algorithm. Independent and Dependent Variates. Inverse-Transform Method. Restricted Sampling. Discrete Distributions. Sampling from a Table. Restricted Sampling. Composition Method. Acceptance-Rejection Method. Squeeze Method. Adaptive Method. Ratio-of-Uniforms Method. Lessons Learned. Exercises. References. 4. PSEUDORANDOM NUMBER GENERATION. Linear Congruential Generators. Prime Modulus. Evaluating PNG's. Theoretical Evaluation. Empirical Testing. Collision Test. Birthday Spacings Test. LCG's with Modulus 2(Beta).M = 2(superscript)32.M = 2(superscript)48. Mixed Linear Congruential Generators. Combined Generators. AWC and SWB Generators. Twisted GFSR Generators. Mersenne Twisted GFSRs. Lessons Learned. References. 5. VARIANCE REDUCTION. Stratified Sampling. Unequal Sample Sizes. Rao-Blackwellization. Exceedance Probabilities for Rare Events. Control Variates. Antithetic Variates. Quasirandom Numbers. Exercises. Lessons Learned. Hands-On Exercises. References. 6. MARKOV CHAIN MONTE CARLO. Hastings-Metropolis Method. Reversibility. Coordinate Updating. Single-Coordinate Updating. Bayesian MCMC. Joint and Full Conditional Distributions. Gibbs Sampling. Convergence for Xj. Non-connected State Spaces and Mixtures. Convergence for (Lambda)t. Local and Global Moves. Problem Size. Variance of Estimate. Choosing a Nominating Kernel. Independence Hastings-Metropolis Sampling. Random-Walk Nominating Kernels. Chains Favoring Smaller (Sigma)(infinity)squared. General-State Spaces. Polynomial Convergence. Discrete-Event Systems. First-Passage Times. Absorbing States. Lessons Learned. Appendix: Modified Acceptance-Rejection Sampling. Appendix: Modified Acceptance-Rejection Sampling. Exercises. Hands-On Exercises. References. 7. MCMC SAMPLE-PATH ANALYSIS. Multiple Independent Replications. Single Sample Path. Estimating the Warm-Up Interval. Batch-Means Method. FNB Rule. SQRT Rule. ABATCH Rule. Testing for Independence. Appendix: LABATCH.2. Lessons Learned. Hands-On Exercises. References. 8. OPTIMIZATION VIA MCMC. Searching for the Global Optimum. Nominating Kernels. Cooling. Initial Temperature. Temperature Gradient. Stage Length. Stopping Rule. Local Minima. Accelerating Convergence. Simulated Tempering. Swapping. Stochastic Tunneling. Genetic Algorithms. Searching for More Than the Minimum. Lessons Learned. Hands-On Exercises. References. 9. ADVANCED CONCEPTS IN MCMC. Exploiting Reversibility. Rapid Mixing. Markov Random Fields. Gibbs Distribution. Potts Model. Random Cluster Model. Problem Size. More General Models. Slice Sampling. Product Slice Sampling. Partial Decoupling. Coupling from the Past. Monotone Markov Chains. Reusing Randomness. Total Number of Steps. Saving Space. Independent Hastings-Metropolis Sampling. Lessons Learned. Exercises. References.


Best Sellers


Product Details
  • ISBN-13: 9780495018780
  • Publisher: Cengage Learning, Inc
  • Publisher Imprint: Brooks/Cole
  • Height: 228 mm
  • Spine Width: 17 mm
  • Width: 185 mm
  • ISBN-10: 0495018783
  • Publisher Date: 01 Oct 2005
  • Binding: Paperback
  • Language: English
  • Weight: 636 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
A First Course in Monte Carlo Simulation
Cengage Learning, Inc -
A First Course in Monte Carlo Simulation
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

A First Course in Monte Carlo Simulation

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!