Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Given n 2 2 numbers (a1,a2, . . . ,an) with no repetitions, a bootstrap sample is a se- quence (331,212, . . . ,

image text in transcribed
image text in transcribed
Given n 2 2 numbers (a1,a2, . . . ,an) with no repetitions, a bootstrap sample is a se- quence (331,212, . . . , run) formed from the aj's by sampling with replacement with equal probabilities. Bootstrap samples arise in a widely used statistical method known as the bootstrap. For example, if n = 2 and (a1,a2) = (3, 1), then the possible bootstrap samples are (3,3), (3, 1),(1,3), and (1,1). (a) How many possible bootstrap samples are there for (al, . . . , an)? (b) How many possible bootstrap samples are there for (al, . . . ,an), if order does not matter (in the sense that it only matters how many times each a,- was chosen, not the order in which they were chosen)? (c) One random bootstrap sample is chosen (by sampling from an, . . . , an with replace- ment, as described above). Show that not all unordered bootstrap samples (in the sense of (b)) are equally likely. Find an unordered bootstrap sample b1 that is as likely as possible, and an unordered bootstrap sample b2 that is as unlikely as possible. Let p1 be the probability of getting b1 and p2 be the probability of getting b2 (so p,- is the prob- ability of getting the specic unordered bootstrap sample be). What is p1 /p2? What is the ratio of the probability of getting an unordered bootstrap sample whose probability is p1 to the probability of getting an unordered sample whose probability is p2

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Logic For Computer Science Foundations Of Automatic Theorem Proving

Authors: Jean H Gallier

1st Edition

0486805085, 9780486805085

More Books

Students also viewed these Mathematics questions