Monte Carlo Club: Difference between revisions
Jump to navigation
Jump to search
imported>Weigang |
imported>Weigang mNo edit summary |
||
Line 1: | Line 1: | ||
==Feb 10, 2017 "Dating" (Valentine's Day Special; Due 2/17/2017)== | ==Feb 10, 2017 "Dating" (Valentine's Day Special; Due 2/17/2017)== | ||
* Source: Paul Nahin (2008), "Digital Dice". Problem #20: "An Optimal Stopping Problem" | * Source: Paul Nahin (2008), "Digital Dice". Problem #20: "An Optimal Stopping Problem" | ||
Line 21: | Line 10: | ||
# Plot barplot of probability versus sample size N. | # Plot barplot of probability versus sample size N. | ||
# Expected answer: N=4 | # Expected answer: N=4 | ||
==Feb 3, 2017 "US Presidents" (Due 2/10/2017)== | |||
* Download [[File:Presidents.txt|thumbnail]]: 1st column is the order, 2nd column is the name, the 3rd column is the year of inauguration; tab-separated | |||
* Your job is to create an R, Perl, or Python script called “us-presidents”, which will | |||
# Read the table | |||
# Store the original/correct order | |||
# Shuffle/permute the rows and record the new order | |||
# Count the number of matching orders | |||
# Repeat Steps 3-4 for a 1000 times | |||
# Plot histogram or barplot (better) to show distribution of matching counts | |||
# Hint: For R, use the sample() function. For Perl, use the rand() function. | |||
==Feb 17, 2017 "Birthdays" (Due 2/24/2017)== | ==Feb 17, 2017 "Birthdays" (Due 2/24/2017)== |
Revision as of 13:37, 11 February 2017
Feb 10, 2017 "Dating" (Valentine's Day Special; Due 2/17/2017)
- Source: Paul Nahin (2008), "Digital Dice". Problem #20: "An Optimal Stopping Problem"
- Problem: What is the optimal time point when one should stop dating more people and settle on a mate choice (and live with the decision)
- Your best strategy is to date an initial sample of N individuals, rejecting all, and marry the next one ranked higher than any of your N individuals. The question is what is the optimal number for N.
- The problem could be investigated by simulating a pool of 100 individuals, ranked from 1-100 (most desirable being 1) and then take a sample of N
- You may only date one individual at a time
- You cannot go back to reach previously rejected candidates
- Simulate N from 0 to 10 (zero means marrying the first date, a sample size of zero)
- For each N, obtain the probability of finding the perfect mate (i.e., ranked 1st) by running simulation 1000 times
- Plot barplot of probability versus sample size N.
- Expected answer: N=4
Feb 3, 2017 "US Presidents" (Due 2/10/2017)
- Download : 1st column is the order, 2nd column is the name, the 3rd column is the year of inauguration; tab-separated
- Your job is to create an R, Perl, or Python script called “us-presidents”, which will
- Read the table
- Store the original/correct order
- Shuffle/permute the rows and record the new order
- Count the number of matching orders
- Repeat Steps 3-4 for a 1000 times
- Plot histogram or barplot (better) to show distribution of matching counts
- Hint: For R, use the sample() function. For Perl, use the rand() function.
Feb 17, 2017 "Birthdays" (Due 2/24/2017)
- Randomly select N individuals and record their B-days
- Count the B-days shared by two or more individuals
- Repeat (for each N) 100 times
- Vary N from 10 to 100, increment by 10
- Plot matching counts (Y-axis) versus N (x-axis), with either a stripchart or boxplot, or both