1701 (number): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
infobox
en>Arthur Rubin
Reverted 1 edit by 186.74.29.59 (talk): Rvv. (TW)
 
Line 1: Line 1:
[[File:StratifiedPoints.gif|thumbnail|right|The variance of randomly generated points within a unit square can be reduced through a stratification process.<ref>{{cite web|last=Ramsey|first=Caitlin Jo|title=stratifiedPoints.gif|publisher=Wikimedia Commons}}</ref>]]
Hello and welcome. My name is Numbers Wunder. He used to be unemployed but now he is a meter reader. One of the issues she loves most is to do aerobics and now she is attempting to make money with it. Puerto Rico is where he and his spouse reside.<br><br>Feel free to surf to my homepage ... [http://wmazowiecku.pl/stay-yeast-infection-free-using-these-helpful-suggestions/ wmazowiecku.pl]
In [[mathematics]], more specifically in the theory of [[Monte Carlo method]]s, '''variance reduction''' is a procedure used to increase the precision of the estimates that can be obtained for a given number of iterations.  Every output random variable from the simulation is associated with a [[variance]] which limits the precision of the simulation results. In order to make a simulation statistically efficient, i.e., to obtain a greater precision and smaller [[confidence interval]]s for the output random variable of interest, variance reduction techniques can be used. The main ones are: Common random numbers, [[antithetic variates]], [[control variate]]s, [[importance sampling]] and [[stratified sampling]]. Under these headings are a variety of specialized techniques; for example, particle transport simulations make extensive use of "weight windows" and "splitting/Russian roulette" techniques, which are a form of importance sampling.
 
==Common Random Numbers (CRN)==
 
The common random numbers variance reduction technique is a popular and useful variance reduction technique which applies when we are comparing two or more alternative configurations (of a system) instead of investigating a single configuration. CRN has also been called ''Correlated sampling'', ''Matched streams'' or ''Matched pairs''.
 
CRN requires synchronization of the random number streams, which ensures that in addition to using the same random numbers to simulate all configurations, a specific random number used for a specific purpose in one configuration is used for exactly the same purpose in all other configurations. For example, in queueing theory, if we are comparing two different configurations of tellers in a bank, we would want the (random) time of arrival of the ''N''th customer to be generated using the same draw from a random number stream for both configurations.
 
==Underlying principle of the CRN technique==
 
Suppose <math>X_{1j}</math> and <math>X_{2j}</math> are the observations from the first and second configurations on the ''j''th independent replication.
 
We want to estimate
:<math>\xi= E(X_{1j})-E(X_{2j})=\mu_1-\mu_2. \, </math>
 
If we perform ''n'' replications of each configuration and let
:<math>Z_j=X_{1j}-X_{2j} \quad\mbox{for } j=1,2,\ldots, n,</math>
then <math>E(Z_j)=\xi</math> and <math>Z(n) = \frac{\sum_{j=1,\ldots,n} Z_j}{n}</math> is an unbiased estimator of <math>\xi</math>.
 
And since the <math>Z_j</math>'s are independent identically distributed random variables,
:<math>\operatorname{Var}[Z(n)] = \frac{\operatorname{Var}(Z_j)}{n}. </math>
 
In case of independent sampling, i.e., no common random numbers used then Cov(''X''<sub>1''j''</sub>, ''X''<sub>2''j''</sub>) = 0. But if we succeed to induce an element of positive correlation between ''X''<sub>1</sub> and ''X''<sub>2</sub> such that Cov(''X''<sub>1''j''</sub>, ''X''<sub>2''j''</sub>) > 0, it can be seen from the equation above that the variance is reduced.
 
It can also be observed that if the CRN induces a negative correlation, i.e., Cov(''X''<sub>1''j''</sub>, ''X''<sub>2''j''</sub>) < 0, this technique can actually backfire, where the variance is increased and not decreased (as intended).
 
==See also==
:*[[importance sampling]]
 
==References==
 
<references />
 
:*Hammersley, J.M., Handscomb, D.C. (1964) Monte Carlo Methods. Methuen, London (Halsted, NY), ISBN 0-416-52340-4.
:*Kahn, H., Marshall, A.W. (1953) ''Methods of reducing sample size in Monte Carlo computations'', J.Oper.Res.Soc.Amer. 1, 263&ndash;271.
:*MCNP — A General Monte Carlo N-Particle Transport Code, Version 5  Los Alamos Report LA-UR-03-1987
 
[[Category:Monte Carlo methods]]
[[Category:Variance reduction]]

Latest revision as of 08:35, 12 January 2015

Hello and welcome. My name is Numbers Wunder. He used to be unemployed but now he is a meter reader. One of the issues she loves most is to do aerobics and now she is attempting to make money with it. Puerto Rico is where he and his spouse reside.

Feel free to surf to my homepage ... wmazowiecku.pl