Monte Carlo method
Builds on Random variableExpected valueIndependent and identically distributed random variables
Definition
Let be a real number to be computed. A (plain) Monte Carlo method for consists of the following data:
- a random variable with and expected value ;
- a procedure that produces independent and identically distributed random variables with the distribution of ;
- for each sample size , the estimate
More generally, a Monte Carlo method is any algorithm whose output is a random variable used to approximate a deterministic quantity.
Remarks
Example: is the probability that a point uniform on satisfies . So if and otherwise satisfies clause 1, since is bounded and , and independent uniform points give clause 2. Non-example: with uniform on has , so clause 1 fails and the averages tend to almost surely. The estimate is unbiased, , and if its standard deviation is . In practice clause 2 is realised with a pseudorandom number generator, so the samples are only imitations of independent random variables. Methods based on Markov chains, such as Markov chain Monte Carlo, fit the general sense but not the plain one, since their samples are dependent.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Expected value concept
- Independent and identically distributed random variables concept
- Random variable concept
- Monte Carlo method definition
Further reading
About this page
| Tag | W4MT7K2QTF |
|---|---|
| URI | m2://W4MT7K2QTF |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65C05, 11K45 |
| Defines | Monte Carlo method |
| Uses | Random variable, Expected value, Independent and identically distributed random variables |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.