Using a discrete Monte-Carlo technique in a multi-variable model

Click For Summary
SUMMARY

The discussion focuses on employing a discrete Monte-Carlo technique for averaging outcomes in a multi-variable model with three discrete variables (a, b, c) ranging from 0 to 9. The participant questions whether to discard previously used combinations of inputs to enhance accuracy in the results. It is concluded that while discarding used combinations may reduce the standard deviation of the estimated average, it compromises the randomness of the sampling process. The probability of avoiding repeats in sampling is approximately exp(-k²/2n), highlighting the trade-off between randomness and accuracy.

PREREQUISITES
  • Understanding of Monte-Carlo simulation techniques
  • Familiarity with discrete probability distributions
  • Knowledge of standard deviation and its significance in statistical analysis
  • Basic concepts of combinatorial mathematics
NEXT STEPS
  • Explore advanced Monte-Carlo methods for multi-variable models
  • Research techniques for reducing variance in Monte-Carlo simulations
  • Learn about the implications of sampling without replacement
  • Investigate combinatorial optimization strategies in statistical sampling
USEFUL FOR

Data scientists, statisticians, and researchers involved in computational modeling and simulation who seek to optimize sampling techniques in multi-variable analyses.

snowjoke
Messages
15
Reaction score
0
If I have a large amount of data I can sample, with a several discrete variables, and I need to get an average of some function of that data, but it's too computationally intensive to do exhaustively...

I want to do some sampling of the possible outcomes. I guess random sampling (Monte-Carlo technique) is the way forward, but my question is, theoretically, when selecting random numbers for the inputs, should I discard combinations that have already been used?

For large samples it probably won't in practice make any difference, but say I had I have 3 variables a, b and c, each of which can be (0,1,2,3,4,5,6,7,8,9), and I want to compute 100 outputs. Say I've already used {a = 1, b = 8, c = 4}, in theory should I check whether I've used this combination already?

Intuitively it seems like I'll get a more accurate result if I discard already-used inputs, but then the inputs won't be random.
 
Physics news on Phys.org
Discarding already used combinations will lead to a better (smaller) standard deviation for the estimated average.
 
Interestingly, the chance of having no repeats in sampling k from n is approximately exp(-k^2/2n). I wonder if there is a simple expression for the expected number of unique samples.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K