30 lines
862 B
Markdown
30 lines
862 B
Markdown
---
|
|
id:
|
|
aliases: []
|
|
tags:
|
|
- destiny/permanent
|
|
- status/draft
|
|
- topic/math
|
|
- topic/risk
|
|
- type/encyclopedia
|
|
title: Monte Carlo Methods
|
|
---
|
|
# Monte Carlo Methods
|
|
|
|
> [!quote] [Monte Carlo methods](https://en.wikipedia.org/wiki/Monte_Carlo_method)
|
|
> Monte Carlo methods or Monte Carlo experiments,
|
|
> are a broad class of computational algorithms
|
|
> that rely on repeated random sampling to obtain numerical results.
|
|
> The underlying concept is to use randomness to solve problems
|
|
> that might be deterministic in principle.
|
|
|
|
Popular examples of Monte Carlo methods include
|
|
estimating the area of an irregular shape
|
|
by randomly sampling points in a known area,
|
|
and estimating the value of pi
|
|
by tossing toothpicks onto a ruled surface.
|
|
|
|
[Professor Art Owen](https://artowen.su.domains/)
|
|
at Stanford University
|
|
has several excellent resources on the subject.
|